Quantum Computing in the NISQ era and beyond
Open accessThe DOI matches its Crossref record; 75 of the 82 references it cites were found in a registry or an index; 25 of the 40 sources its claims cite were checked for support.
Abstract
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away - we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing.
Overview
CoChat Summary
TL;DR
Preskill introduces the NISQ era—noisy intermediate-scale quantum devices with 50–100 qubits—as a near-term step toward quantum computing, useful for exploring many-body quantum physics but limited by noise and not expected to change the world by itself. He argues that fault-tolerant quantum computing remains distant and that near-term applications, especially hybrid quantum-classical algorithms, are promising but unproven.
Key findings
- NISQ devices will have 50 to a few hundred qubits; 50 qubits is a milestone because it is beyond brute-force simulation by the most powerful existing digital supercomputers. However, with two-qubit gate error rates above 0.1%, circuits with many more than about 1000 gates are not expected to be reliable.
- NISQ technology may be useful for exploring many-body quantum physics and quantum dynamics, and hybrid quantum-classical algorithms such as QAOA and VQE may find approximate solutions to optimization problems, but whether they outperform classical methods is an open question.
- Quantum algorithms offer speedups for problems such as factoring, matrix inversion (HHL runs in O(log N)), recommendation systems (O(poly(k)polylog(mn))), and semidefinite programming (polylog(N)), but many require error correction or QRAM and are probably not feasible in the NISQ era. A note added states that Tang’s quantum-inspired classical algorithm removes the exponential speedup claimed for quantum recommendation systems.
- Fault-tolerant quantum computing is still distant: running algorithms with thousands of protected qubits will require millions of physical qubits, so NISQ should be regarded as a step toward more powerful future quantum technologies.
Methods
- This is a conceptual review and keynote address, based on a Keynote Address at Quantum Computing for Business, 5 December 2017; it is not an empirical study.
- The paper assesses the current status and future potential of quantum computing, discussing hardware platforms, gate errors, qubit counts, quantum algorithms, and fault-tolerance requirements.
- The main analysis is a qualitative synthesis of theoretical arguments, experimental examples, and open questions; no dataset, sample, or statistical analysis is reported.
Limitations
- The paper states it is “the result of an uneasy compromise,” minimizes jargon and technical details for a broader audience, and does not attempt a comprehensive list of references.
- The paper states that NISQ devices have imperfect control and noise, that gate error rates are above 0.1% and may not be maintained in larger devices, that circuit size is limited to roughly 1000 gates, and that validating quantum outputs may be hard.
- Evident from the text: as a keynote-style review, it offers projections and opinions rather than new experimental data or a systematic review; several speedup claims are explicitly open questions, and the recommendation-systems speedup is later undercut by a quantum-inspired classical algorithm.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
14 Valid · 9 Not valid · 10 Not checked · 85 Own results and interpretations
Some cited sources support this claim and some don’t — read each source’s verdict below.
In the paper
“50 qubits is a significant milestone, because that's beyond what can be simulated by brute force using the most powerful existing digital supercomputers.”
What the sources say
- Supportedcites [11] [11] S. Boixo, S. V. Isakov, V. N. Smelyansky, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, Characterizing quantum supremacy in near-term devices, Nature Physics 14, 595-600 (2018), arXiv:1608.00263 (2016), https://doi.org/10.1038/s41567-018-0124-x. - source
The Introduction (p. 1) says that even modest-depth circuits acting on approximately fifty qubits cannot be directly simulated in practice. The Conclusion (p. 12) estimates that state-of-the-art supercomputers fail to simulate universal random circuits beyond approximately 48 qubits at a depth of about 40. The milestone claim is supported in that circuit context. (LLM, conf=0.90)
- Disputedcites [12] [12] S. Aaronson and L. Chen, Complexity-theoretic foundations of quantum supremacy experiments, arXiv:1612.05903 (2017). - sourceExperimental — accuracy not yet measured
Section 1.2 (p. 4) describes 40–50 qubits as a range where classical simulation is difficult but not impossible, contrary to the claim that 50 qubits is beyond brute-force simulation. Section 1.3 (p. 7) also describes a classical simulation method and says its 2^n time is reasonable for a planned setup with roughly 40 or 50 qubits. (LLM, conf=0.86)
Checked by a reasoning model — may be wrong.
- Supportedcites [13] [13] E. Pednault, J. A. Gunnels, G. Nannicini, L. Horesh, T. Magerlein, E. Solomonik, and R. Wisnieff, Breaking the 49-qubit barrier in the simulation of quantum circuits, arXiv:1710.05867 (2017). - source
The Abstract (p. 1) frames systems of more than 50 qubits as the coming regime and states that 'resource requirements for such calculations on classical computers grow exponentially', with the relevant calculations 'thought to be impossible due to resource requirements'. Section 2.1 (p. 3) gives the concrete brute-force bound: the full state of a 49-qubit system needs 2^49 complex numbers (8 PB in double precision), which 'eliminates the possibility of keeping the entire state in primary storage', and the Feynman-path alternative 'grows to intractable levels very quickly'. The Introduction (p. 2) reinforces this by noting that the state-of-the-art full-state techniques of the time would have required 8 PB (49 qubits) and 1 EB (56 qubits), far beyond the ~64 TB aggregate RAM of Vulcan/Sequoia-class machines. The citing sentence's 'brute force' qualifier matches the paper's own contrast with tensor-contraction-deferral methods, so the attribution holds; only the rhetorical label 'significant milestone' is the citing authors' framing. (LLM, conf=0.83)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“Eventually we expect to be able to protect quantum systems and scale up quantum computers using the principle of quantum error correction [10].”
What the sources say
- Supportedcites [10] [10] D. Gottesman, An introduction to quantum error correction and fault-tolerant quantum computation, Proceedings of Symposia in Applied Matthematics 68 (2010), arXiv:0904.2557. - source
The Background (p. 1) says quantum computers need protection from noise and identifies error correction as necessary. Fault-tolerant gates (p. 17) explains that, below an error-rate threshold, arbitrarily accurate quantum computation is possible with polylogarithmic overhead. This supports the expectation of protecting quantum systems and scaling up quantum computers, subject to that threshold. (LLM, conf=0.91)
hedgedstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“as of now we don't have a convincing theoretical argument or persuasive experimental evidence indicating that quantum annealers can really speed up the time to solution compared to the best classical hardware running the best algorithms for the same problems [28, 29].”
What the sources say
- Partly supportedcites [28] [28] T. F. Rønnow, Z. Wang, J. Job, S. Boixo, S. V. Isakov, D. Wecker, J. M. Martinis, D. A. Lidar, and M. Troyer, Defining and detecting quantum speedup, Science 345, 420-424 (2014), https://doi.org/10.1126/science.1252319. - sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
- Partly supportedcites [29] [29] S. Mandrà, H. G. Katzgraber, and C. Thomas, The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again), Quantum Sci. Technol. 2, 038501 (2017), arXiv:1703.00622, https://doi.org/10.1088/2058-9565/aa7877. - sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“In particular, the task of matrix inversion admits an exponential quantum speedup, which could have many applications.”
What the sources say
- Supportedcites [40] [40] A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009), arXiv:0811.3171, https://doi.org/10.1103/PhysRevLett.103.150502. - source
The paper’s Outline says its hardness results imply that the algorithm runs exponentially faster than any classical algorithm for the matrix-inversion task. The performance discussion qualifies this speedup: it is greatest when the condition number and inverse accuracy are polylogarithmic in matrix size, and the algorithm outputs a quantum representation rather than every component of the solution. (LLM, conf=0.92)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“As Laughlin and Pines [8] emphasized in the statement I quoted earlier, we think that simulating such 'strongly correlated' matter is a difficult computational problem, because many very good physicists have tried to solve it for decades and have not succeeded.”
What the sources say
- Supportedcites [8] [8] R. B. Laughlin and D. Pines, The theory of everything, PNAS 97, 28-31 (2000), https://doi.org/10.1073/pnas.97.1.28. - source
In the paper’s main text (page not supplied), Laughlin and Pines say accurate solutions become infeasible for more than about 10 particles because the computational requirements grow rapidly. They also describe notorious failures of approximate calculations for high-temperature superconductors, supporting the claim that simulating such matter is difficult. (LLM, conf=0.90)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
37 more claims · 4 with their cited sources checked
Create a free account to see all 118 claims and to verify the 5 references still open.
- It may state two separate claims as one. 26
- Probably not a substantial claim. 63
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source doesn’t support the claim as written.
In the citing paper
“so-called Noisy Intermediate-Scale Quantum (NISQ) computers already exist today”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [209]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Furthermore, they are challenging to make extensible as required to surpass noisy intermediate-scale quantum (NISQ)-era scales [221] and thereby enable practically relevant quantum computation.”
From 2022 Roadmap on integrated quantum photonics (2022) · cites this paper as [221]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Therefore, research on quantum algorithms splits, on the one hand, into algorithms for fault-tolerant quantum computers, which we may think of as a future perfect quantum computer, and, on the other hand, into algorithms for nearterm or noisy-intermediate stage quantum (NISQ) [120] devices of dozens to thousands of physical qubits, that are characterized by the absence of complete fault-tolerance.”
From Quantum Computing for Molecular Biology** (2023) · cites this paper as [120]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations within a limited coherence time.”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Preskill, 2018
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These hybrid quantum-classical algorithms are specifically designed to minimize the limitations of current quantum hardware, such as decoherence and gate errors, by delegating some computational tasks to classical processors. [8]”
From Limitations of Quantum Hardware for Molecular Energy Estimation Using VQE (2026) · cites this paper as [8]
Experimental — accuracy not yet measured
10 more claims about this paper
Create a free account to see every claim other papers make about this one.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 2 Opportunities at the entanglement frontier · p. 2
“We don't think that's not true for classical ( i.e. , nonquantum) digital computers”
§ 2 Opportunities at the entanglement frontier · p. 2
“which (as far as we know) can't simulate highly entangled quantum systems.”
Citations
Cites
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 1×
“to be hard for classical computers, but for which quantum algorithmshavebeendiscoveredthatcouldsolvetheseproblemseasily. Thebestknown exampleistheproblemoffindingtheprimefactorsofalargecompositeinteger[1]. Webelievefactoringishardbecausemanysmartpeoplehavetriedformanydecades to find better factoring algorithms and haven…”
BackgroundBiamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779 · cited 1×
“” Much of the literature on the subject builds on quantum algorithms that speed up linear algebra and related tasks [37, 38], and I’ll address such applications in the ensuing subsections.”
BackgroundA variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Degen, C. L., Reinhard, F., & Cappellaro, P. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.035002 · Cited by 4,045 · cited 1×
“antum sensing. Quantum technology has advantages for some kinds of sensing. Quantum systems can sense weak forces with better sensitivity and higher spatial resolution than other sensing technologies [19]; thus quantum sensing could have relatively near-term high-impact applications, to medicine for example. Quantum c…”
BackgroundPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 1×
“6.6 Quantummatrixinversion QRAMhasfurtherimplicationsforquantumalgorithms. Inparticular,thetaskofmatrix inversionadmitsanexponentialquantumspeedup,whichcouldhavemanyapplications. ThealgorithmwecallHHL[40](afterthethreeauthorswhofirstdiscusseditnineyears ago) takes as input a succinct representation of a very large N×N…”
BackgroundInfluentialSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“for a while, because of the large number of physical qubits needed. To run algorithms involving thousands of protected qubits we’ll need a number of physical qubits which is in the millions, or more [50]. That’s a very large leap from where we will be for the next few years, with of order a hundred qubits. Crossing th…”
BackgroundProbing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460 · cited 1×
“Analog quantum simulators have been getting notably more sophisticated, and are already being employed to study quantum dynamics in regimes which may be beyond the reach of classical simulators [51, 52].”
Background
Cited by
Items 5,101–5,200 of 8,640
On Estimating Time-Varying Pauli Noise
Rehman, J. U., Al-Hraishawi, H., Duong, T. Q., Chatzinotas, S., & Shin, H. (2023) · IEEE Transactions on Communications · doi:10.1109/tcomm.2023.3341886 · Cited by 6
The Min-Entropy of Classical-Quantum Combs for Measurement-Based Applications
Smith, I. D., Krumm, M., Fiderer, L. J., Nautrup, H. P., & Briegel, H. J. (2023) · Quantum · doi:10.22331/q-2023-12-12-1206 · Cited by 6
Roncallo, S., Maccone, L., & Macchiavello, C. (2023) · AVS Quantum Science · doi:10.1116/5.0177905 · Cited by 8
Prasad, V. K., Cheng, F., Fekl, U., & Jacobsen, H. (2024) · Physical Chemistry Chemical Physics · doi:10.1039/d3cp03523a · Cited by 5
Quantum computer-aided job scheduling for storage and retrieval systems
Windmann, S. (2024) · at - Automatisierungstechnik · doi:10.1515/auto-2023-0072 · Cited by 4
QAOA-based MRMR Algorithm for Feature Selection
Jiang, X., Chen, Z., Zhang, J., Yu, Z., Wang, L., & Mei, H. (2023) · International Conference on Advances in Artificial Intelligence and Applications (AAIA) · doi:10.1145/3603273.3631193 · Cited by 3
A Quantum-Inspired Predator–Prey Algorithm for Real-Parameter Optimization
Khan, A. A., Hussain, S., & Chandra, R. (2024) · Algorithms · doi:10.3390/a17010033 · Cited by 3
Crimmins, A., Alarcón, S. L., Klein, M., Krebs, M., & Kate, S. (2023) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc60800.2023.10386449 · Cited by 3
Experimental Realization of Nonunitary Multiqubit Operations
van Mourik, M. W., Zapusek, E., Hrmo, P., Gerster, L., Blatt, R., Monz, T., Schindler, P., & Reiter, F. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.040602 · Cited by 11
Minimizing the negativity of quantum circuits in overcomplete quasiprobability representations
Kulikov, D. A., Yashin, V. I., Fedorov, A. K., & Kiktenko, E. O. (2024) · Physical Review A · doi:10.1103/physreva.109.012219 · Cited by 6
Quantum Odyssey: Traversing the NISQ Era's Quantum Terrain
Arya, S., Ansar, S. A., & Aggarwal, S. (2023) · International Conference on Technological Advancements in Computational Sciences (ICTACS) · doi:10.1109/ictacs59847.2023.10390350 · Cited by 4
Almost optimal measurement scheduling of molecular Hamiltonian via finite projective plane
Inoue, W., Aoyama, K., Teranishi, Y., Kanno, K., Nakagawa, Y. O., & Mitarai, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013096 · Cited by 6
Okawa, H. (2024) · Communications in computer and information science · doi:10.1007/978-981-97-0065-3_21 · Cited by 8
Simulating Polaritonic Ground States on Noisy Quantum Devices
Hassan, M., Pavošević, F., Wang, D. S., & Flick, J. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.3c02875 · Cited by 5
Hamiltonian switching control of noisy bipartite qubit systems
Yang, Z., Kosut, R. L., & Whaley, K. B. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad25a6 · Cited by 4
Lee, S., Hour, L., Kim, Y., & Han, Y. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad2752 · Cited by 3
Quantum-Enhanced Resilient Reinforcement Learning Using Causal Inference
Sankar, N. G., Khandelwal, A., & Chandra, M. G. (2024) · International Conference on Communication Systems & Networks (COMSNETS) · doi:10.1109/comsnets59351.2024.10427302 · Cited by 3
Quantum shortcut to adiabaticity for state preparation in a finite-sized Jaynes-Cummings lattice
Cai, K., Parajuli, P., Govindarajan, A., & Tian, L. (2024) · Physical Review A · doi:10.1103/physreva.110.022621 · Cited by 9
Introduction to quantum federated machine learning
Chen, S. Y.-C., & Yoo, S. (2024) · Elsevier eBooks · doi:10.1016/b978-0-44-319037-7.00027-2 · Cited by 8
Estimating many properties of a quantum state via quantum reservoir processing
Li, Y., Ghosh, S., Shang, J., Xiong, Q., & Zhang, X. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013211 · Cited by 8
Variational quantum gate optimization at the pulse level
Greenaway, S., Petiziol, F., Zhao, H., & Mintert, F. (2024) · SciPost Physics · doi:10.21468/scipostphys.16.3.082 · Cited by 7
Exposing the Hidden Layers and Interplay in the Quantum Software Stack
Stirbu, V., de Griend, A. M.-V., & Muff, J. (2024) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c63560.2024.00010 · Cited by 3
Analysis of the Effects of Crosstalk Errors on Various Quantum Circuits
Bajpayee, S., & Mukherjee, I. (2024) · International Conference on VLSI Design · doi:10.1109/vlsid60093.2024.00074 · Cited by 9
An introduction to quantum computing for statisticians and data scientists
Lopatnikova, A., Tran, M., & Sisson, S. A. (2024) · Foundations of Data Science · doi:10.3934/fods.2024013 · Cited by 14
Simulating Quantum Field Theories on Gate-Based Quantum Computers
Vinod, G. M., & Shaji, A. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3385372 · Cited by 4
Quantum advantage in temporally flat measurement-based quantum computation
de Oliveira, M., Barbosa, L. S., & Galvão, E. F. (2024) · Quantum · doi:10.22331/q-2024-04-09-1312 · Cited by 9
A Copositive Framework for Analysis of Hybrid Ising-Classical Algorithms
Brown, R., Bernal, D. E., Venturelli, D., & Pavone, M. (2024) · SIAM Journal on Optimization · doi:10.1137/22m1514581 · Cited by 21
Simulation of a spin-boson model by iterative optimization of a parametrized quantum circuit
Nishi, T., & Yamanouchi, K. (2024) · AVS Quantum Science · doi:10.1116/5.0193981 · Cited by 3
Optimized Synthesis of Circuits for Diagonal Unitary Matrices with Reflection Symmetry
Huang, X., Kosugi, T., Nishi, H., & Matsushita, Y. (2024) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.93.054002 · Cited by 6
Cichy, S., Faehrmann, P. K., Khatri, S., & Eisert, J. (2024) · Physical Review A · doi:10.1103/physreva.109.052624 · Cited by 10
Zhang, H., Li, T., & Li, F. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04428-4 · Cited by 3
Entanglement criterion and strengthened Bell inequalities based on the Pearson correlation
Tserkis, S., Assad, S. M., Conti, A., & Win, M. Z. (2024) · Physics Letters A · doi:10.1016/j.physleta.2024.129635 · Cited by 3
Sequencing one-dimensional Majorana materials for topological quantum computing
Minissale, M., Bondavalli, P., Figueira, M. S., & LAY, G. L. (2024) · Journal of Physics Materials · doi:10.1088/2515-7639/ad5763 · Cited by 3
Local coherence by thermalized intra-system coupling
Kolář, M., & Filip, R. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad57e8 · Cited by 5
Variational data encoding and correlations in quantum-enhanced machine learning
王, M.-H. 明. W., & 吕, H. 桦. L. (2024) · Chinese Physics B · doi:10.1088/1674-1056/ad5c3b · Cited by 4
Sarkar, S., & Buča, B. (2024) · Quantum · doi:10.22331/q-2024-07-02-1392 · Cited by 8
Fighting Noise with Noise: A Stochastic Projective Quantum Eigensolver
Filip, M.-A. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00295 · Cited by 5
Spatio-Temporal Characterization of Qubit Routing in Connectivity-Constrained Quantum Processors
Rached, S. B., Almudéver, C. G., Alarcón, E., & Abadal, S. (2024) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas58744.2024.10558197 · Cited by 8
Varsamopoulos, S., Philip, E., Elfving, V. E., van Vlijmen, H., Menon, S., Vos, A. M., Dyubankova, N., Torfs, B., & Rowe, A. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00176-x · Cited by 14
Efficient verification of two-colorable graph states
Xu, Q., Tan, X., Ou, Y., Bao, D., & Huang, R. (2024) · Physical Review A · doi:10.1103/physreva.110.012606 · Cited by 4
Quantum word embedding for machine learning
Nguyen, P.-N. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad6299 · Cited by 8
Determination of optimal chain coupling made by embedding in D-wave quantum annealer
Park, H., & Lee, H. (2024) · AVS Quantum Science · doi:10.1116/5.0205511 · Cited by 4
Kibble-Zurek mechanism and errors of gapped quantum phases
Jamadagni, A., Kazemi, J., & Bhattacharyya, A. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.110.045140 · Cited by 4
Measurement-Based Quantum Approximate Optimization
Stollenwerk, T., & Hadfield, S. (2024) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw63119.2024.00183 · Cited by 10
Alfonso, D. R., Avramidis, B., Paudel, H. P., & Duan, Y. (2024) · Nanomaterials · doi:10.3390/nano14151267 · Cited by 6
Demonstration of teleportation across a quantum network code
Rall, H., & Tame, M. (2024) · Physical Review A · doi:10.1103/physreva.110.022602 · Cited by 4
Efficient quantum state estimation with low-rank matrix completion
Tariq, S., Farooq, A., Rehman, J. U., Duong, T. Q., & Shin, H. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00261-x · Cited by 3
Effect of the readout efficiency of quantum measurement on the system entanglement
Carisch, C., Zilberberg, O., & Romito, A. (2024) · Physical Review A · doi:10.1103/physreva.110.022214 · Cited by 6
PlanQK—Platform and Ecosystem for Quantum Applications
Falkenthal, M., Krieger, C., Paul, F., et al. (2024) · Künstliche Intell. · doi:10.1007/s13218-024-00865-6 · Cited by 3
Hybrid Quantum-Classical Computing via Dantzig-Wolfe Decomposition for Integer Linear Programming
Wei, X., Liu, J., Fan, L., Guo, Y., Han, Z., & Wang, Y. (2024) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn61486.2024.10637633 · Cited by 6
Citizen science games on the timeline of quantum games
Piispanen, L. J. (2024) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-024-05553-w · Cited by 4
Improving Probabilistic Error Cancellation in the Presence of Nonstationary Noise
Dasgupta, S., & Humble, T. S. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3435757 · Cited by 8
Kim, Y., Choi, J., Kim, B., Park, Y., Cha, J., Choi, J., & Han, S. H. (2024) · Scientific Reports · doi:10.1038/s41598-024-70394-7 · Cited by 4
Quantum natural gradient without monotonicity
Sasaki, T., & Miyahara, H. (2024) · Physical Review A · doi:10.1103/physreva.110.022439 · Cited by 4
Telling different unravelings apart via nonlinear quantum-trajectory averages
Piñol, E., Mavrogordatos, T. K., Keys, D., Veyron, R., Sierant, P., García-March, M. Á., Grandi, S., Mitchell, M. W., Wehr, J., & Lewenstein, M. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.l032057 · Cited by 6
Detecting and eliminating quantum noise of quantum measurements
Tang, S., Zheng, C., & Wang, K. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad7a2a · Cited by 6
Wang, Z., Wang, R., Zhao, P., Yang, Z., Shi, Y., Huang, K., Xu, K., Zhang, Y.-S., Fan, H., Zhao, S. P., et al. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.l032073 · Cited by 5
An open-source data storage and visualization platform for collaborative qubit control
Brahmbhatt, D., Xu, Y., Vora, N., Chen, L., Fruitwala, N., Huang, G., Ji, Q., & Nguyen, P. (2024) · Scientific Reports · doi:10.1038/s41598-024-72584-9 · Cited by 3
Geometric representations of braid and Yang–Baxter gates
Zhang, K., Hao, K., Yu, K., Korepin, V. E., & Yang, W. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad85b2 · Cited by 6
Quantum Network Applications in AI-Driven Risk Management
Tyagi, S., Pathak, S., Raj, V. H., et al. (2024) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3693-9336-9.ch019 · Cited by 3
On Exploring the Potential of Quantum Auto-Encoder for Learning Quantum Systems
Du, Y., & Tao, D. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3474793 · Cited by 34
Análise de Redes Neurais para CRISPR: Uma Abordagem com Computação Quântica
Gabrich, M. N., de Freitas, H. C., & Souza, M. A. (2024) · Simpósio em Sistemas Computacionais de Alto Desempenho (SSCAD) · doi:10.5753/sscad.2024.244778 · Cited by 3
Metaheuristic optimization scheme for quantum kernel classifiers using entanglement‐directed graphs
Tjandra, Y., & Sugiarto, H. S. (2024) · ETRI Journal · doi:10.4218/etrij.2024-0144 · Cited by 8
Hybrid Hamiltonian Simulation for Excitation Dynamics
Wan, L., Liu, J., Li, Z., & Yang, J. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.4c02624 · Cited by 6
Particle swarm optimization for a variational quantum eigensolver
Mei, H., Zhao, J., Li, Q.-S., Chen, Z., Zhang, J., Wang, Q., Wu, Y.-C., & Guo, G. (2024) · Physical Chemistry Chemical Physics · doi:10.1039/d4cp02021a · Cited by 6
Variational post-selection for ground states and thermal states simulation
Zhang, S., Miao, J., & Hsieh, C. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad8fca · Cited by 8
Comprehensive Analysis on Image Generation using Quantum Generative Adversarial Network
Solanki, A., Kang, S. S., & Singla, S. (2024) · International Conference on Technological Innovations and Advance Computing (TIACOMP) · doi:10.1109/tiacomp64125.2024.00057 · Cited by 6
Topological quantum compilation of two-qubit gates
Burke, P. C., Aravanis, C., Aspman, J., Mareček, J., & Vala, J. (2024) · Physical Review A · doi:10.1103/physreva.110.052616 · Cited by 8
Modeling and Simulating Rydberg Atom Quantum Computers for Hardware-Software Co-design with PachinQo
Ludmir, J., Huo, Y., DiBrita, N. S., & Patel, T. (2024) · Proceedings of the ACM on Measurement and Analysis of Computing Systems · doi:10.1145/3700421 · Cited by 7
Echo-evolution data generation for quantum error mitigation via neural networks
Валерьевич, Б. Д. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04603-7 · Cited by 6
State-Dependent Mobility Edge in Kinetically Constrained Models
Badbaria, M., Pancotti, N., Singh, R., Marino, J., & Valencia-Tortora, R. J. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040348 · Cited by 5
On the Efficacy of Surface Codes in Compensating for Radiation Events in Superconducting Devices
Vallero, M., Casagranda, G., Vella, F., & Rech, P. (2024) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41406.2024.00075 · Cited by 12
Near‐Deterministic Quantum Search Algorithm Without Phase Design
Wang, Z., Zhang, K., & Korepin, V. E. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202400557 · Cited by 6
Hybrid Quantum Approximate Algorithms for Solving Flow Shop Scheduling Problem
Bożejko, W., Idzikowski, R. M., Jagielski, D., Klempous, R., Trotskyi, S., Tykierko, M., Uchroński, M., & Wodecki, M. (2024) · IEEE International Symposium on Computational Intelligence and Informatics (CINTI) · doi:10.1109/cinti63048.2024.10830818 · Cited by 3
The success and failure of quantum computing start-ups
Sanders, B. C. (2025) · Nature Electronics · doi:10.1038/s41928-025-01337-x · Cited by 3
Expressivity of deterministic quantum computation with one qubit
Kim, Y., & Park, D. K. (2025) · Physical Review A · doi:10.1103/physreva.111.022429 · Cited by 10
QuaLITi: Quantum Machine Learning Hardware Selection for Inferencing with Top-Tier Performance
Phalak, K., & Ghosh, S. (2025) · International Conference on VLSI Design · doi:10.1109/vlsid64188.2025.00064 · Cited by 14
Gunn, D., Styliaris, G., Kraft, T., & Kraus, B. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.115110 · Cited by 11
Two-dimensional topological effect in a transmon qubit array with tunable couplings
Zhao, Y.-J., Wang, Y., Yang, X., Xu, X., Zhang, Y.-Y., Liu, W.-M., & Liu, Y.-X. (2025) · Physical Review A · doi:10.1103/physreva.111.032614 · Cited by 3
Hardware-optimal quantum algorithms
Muroya, S., Chatterjee, K., & Henzinger, T. A. (2025) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2419273122 · Cited by 6
Cloud Quantum Resource Allocation using Game Theoretic Quantum Based Dynamic Combinatorial Auction
Das, R., Pal, S., Panda, P., et al. (2024) · doi:10.1109/giest62955.2024.10959749 · Cited by 3
Phases of 2D massless QCD with qubit regularization
Liu, H., Tanmoy Bhattacharya, A., Shailesh Chandrasekharan, A., & Gupta, R. (2025) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.111.094511 · Cited by 3
Kuno, Y., Orito, T., & Ichinose, I. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.174110 · Cited by 6
Fermionic quantum simulation on Andreev bound state superlattices
Johannsen, P. D., & Schrade, C. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.023153 · Cited by 4
Optimizing Quantum Embedding using Genetic Algorithm for QML Applications
Phalak, K., Ghosh, A., & Ghosh, S. (2025) · International Symposium on Quality Electronic Design (ISQED) · doi:10.1109/isqed65160.2025.11014359 · Cited by 5
Cost of emulating a small quantum annealing problem in the circuit model
Gonzalez-Conde, J., Morrell, Z., Vuffray, M., Albash, T., & Coffrin, C. (2025) · Physical Review A · doi:10.1103/physreva.111.062606 · Cited by 6
qlbm – A quantum lattice Boltzmann software framework
Calin, G., Schalkers, M. A., & Möller, M. (2025) · Computer Physics Communications · doi:10.1016/j.cpc.2025.109699 · Cited by 13
Bridging the Quantum Divide: Aligning Academic and Industry Goals in Software Engineering
Zappin, J., Stalnaker, T., Chaparro, O., & Poshyvanyk, D. (2025) · IEEE/ACM International Workshop on Quantum Software Engineering (Q-SE) · doi:10.1109/q-se66736.2025.00013 · Cited by 5
Generalizing Reinforcement Learning-Based Quantum Circuit Synthesis across Multiple Topologies
Acampora, G., Cuzzocrea, A., Lapegna, M., Schiattarella, R., & Vitiello, A. (2025) · doi:10.1109/mcii64973.2025.11032620 · Cited by 5
Simon’s Algorithm in the NISQ Cloud
Robertson, R., Doucet, E., Spicer, E., & Deffner, S. (2025) · Entropy · doi:10.3390/e27070658 · Cited by 13
MPGP-QOC: Multi-programming and graph-partition-based QOC for QNN inference
Liu, Y. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107966 · Cited by 4
Mixed-State Topological Order under Coherent Noise
Lee, S., & Moon, E.-G. (2025) · PRX Quantum · doi:10.1103/hchr-rqq9 · Cited by 17
Fidelity decay and error accumulation in random quantum circuits
de Buruaga, N. S. S., Bistroń, R., Rudziński, M., Pereira, R. M. C., Życzkowski, K., & Ribeiro, P. (2025) · SciPost Physics · doi:10.21468/scipostphys.19.1.013 · Cited by 12
Eigenvalue analysis of stochastic structural systems: A quantum computing approach
Taliadouros, L., Mavromatis, I. G., & Kougioumtzoglou, I. A. (2025) · Probabilistic Engineering Mechanics · doi:10.1016/j.probengmech.2025.103814 · Cited by 5
Variational quantum simulation of the Fokker–Planck equation applied to quantum radiation reaction
Amaro, Ó., Gamiz, L. I. I., & Vranić, M. (2025) · Journal of Plasma Physics · doi:10.1017/s0022377825100652 · Cited by 6
Learning unitaries with quantum statistical queries
Angrisani, A. (2025) · Quantum · doi:10.22331/q-2025-07-30-1817 · Cited by 26
Chawla, P., Shetty, D., Tsemo, P. B., Sugisaki, K., Riu, J., Nogué, J., Mukherjee, D., & Prasannaa, V. S. (2025) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-025-06876-y · Cited by 8
Symmetry-based quantum algorithms for open-shop scheduling with hard constraints
Binkowski, L., Koßmann, G., Tutschku, C., & Schwonnek, R. (2025) · Academia quantum. · doi:10.20935/acadquant7900 · Cited by 12
Missing Puzzle Pieces in the Performance Landscape of the Quantum Approximate Optimization Algorithm
Wybo, E., & Leib, M. (2025) · Quantum · doi:10.22331/q-2025-10-22-1892 · Cited by 22
Prospects for Near-Term Quantum Machine Learning
Schuld, M., & Petruccione, F. (2018) · Quantum science and technology · doi:10.1007/978-3-319-96424-9_9 · Cited by 3
Metadata
- Authors
- Preskill, J.
- Affiliations
- California Institute of Technology (US)
- Corresponding author
- Preskill, John
- ORCID
- Preskill, John
- Venue
- Quantum
- Published
- 2018-08-06
- Volume
- 2
- Pages
- 79
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2781738013
- Cited by
- 8,830
- References
- 82
- Citations by year
- 2026: 1366 · 2025: 1674 · 2024: 1435 · 2023: 1263 · 2022: 1053 · 2021: 1014 · 2020: 638 · 2019: 322 · 2018: 59
- FWCI
- 286.68
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University) (cc-by)
- Bulletin of the American Physical Society
- Funders
- National Science Foundation
- U.S. Department of Energy
- Simons Foundation
- Intelligence Advanced Research Projects Activity
- Institute for Quantum Information and Matter, California Institute of Technology
- Kavli Institute for Theoretical Physics, University of California, Santa Barbara
- Army Research Office
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- NISQ devices, fault-tolerant quantum computing, quantum advantage, quantum computing hardware
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol and qwen3.8-omni-flash).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.