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].”
BackgroundThe theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227 · cited 1×
“y states of many-particle quantum systems (large molecules, for example). When applied to quantum problems this hybrid quantum-classical procedure goes by the name Variation Quantum Eigensolver (VQE) [23]. Will NISQ technology running QAOA or VQE be able to outperform classical algorithms that find approximate solution…”
MethodA Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789 · cited 1×
“from which the approximate solution can be extracted. When applied to classical combinatorial optimization problems, this procedure goes by the name Quantum Approximate Optimization Algorithm (QAOA) [22]. But it can also be applied to quantum problems, like finding low-energy states of many-particle quantum systems (la…”
MethodSuperconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470 · cited 1×
“oblem. For such hard combinatorial search problems we probably can’t do much better than exhaustively searching for a solution. Quantum computers can speed up exhaustive search [6], but only modestly [7], so NP-hard problems are likely to be quantumly hard as well as classically hard. For a physicist seeking problems…”
BackgroundMajorana zero modes and topological quantum computation
Sarma, S. D., Freedman, M., & Nayak, C. (2015) · npj Quantum Information · doi:10.1038/npjqi.2015.1 · Cited by 1,180 · cited 1×
“current program [57], focused on advancing topological quantum computing, is founded on the notion that much lower gate error rates will pay off handsomely sometime in the”
BackgroundCharacterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175 · cited 1×
“In particular, the resources needed in a classical simulation depend on the depth (number of time steps) of the quantum circuit, as well as on the number of qubits [11, 12, 13].”
BackgroundObservation of a many-body dynamical phase transition with a 53-qubit quantum simulator
Zhang, J., Pagano, G., Hess, P. W., Kyprianidis, A., Becker, P., Kaplan, H., Gorshkov, A. V., Gong, Z.-X., & Monroe, C. (2017) · Nature · doi:10.1038/nature24654 · Cited by 1,079 · 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].”
BackgroundQuantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071 · cited 1×
“And it is a compelling challenge to understand better what problems are classically hard but quantumly easy [4, 5].”
BackgroundSmoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Spielman, D. A., & Teng, S.-H. (2004) · Journal of the ACM · doi:10.1145/990308.990310 · Cited by 825
High-Fidelity Quantum Logic Gates Using Trapped-Ion Hyperfine Qubits
Ballance, C. J., Harty, T. P., Linke, N. M., Sepiol, M. A., & Lucas, D. M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.060504 · Cited by 777 · cited 1×
“With the best hardware we have now for controlling trapped ions [14] or superconducting circuits [15], the error rate per gate for two-qubit gates is above the .”
Background(2009) · Springer eBooks · doi:10.1007/978-3-540-88702-7 · Cited by 760
Elucidating reaction mechanisms on quantum computers
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., & Troyer, M. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619152114 · Cited by 745 · cited 1×
“In the long term, quantum simulation using quantum computers has great potential to wield a broad influence on the world [48, 49, 50].”
BackgroundLaughlin, R. B., & Pines, D. (2000) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.97.1.28 · Cited by 737 · cited 7×
“As two great physicists, Bob Laughlin and David Pines, put it some years ago [8], we have a “the-ory of everything that is relevant to ordinary life.””
BackgroundInfluentialSimulating Physics with Computers
Feynman, R. P. (2018) · Feynman and Computation · doi:10.1201/9780429500459-11 · Cited by 731
Quantum computational supremacy
Harrow, A. W., & Montanaro, A. (2017) · Nature · doi:10.1038/nature23458 · Cited by 702 · cited 1×
“The theoretical computer scientists have provided arguments, based on complexity theory, showing (under reasonable assumptions) that quantum states which are easy to prepare with a quantum computer have superclassical properties; specifically, if we measure all the qubits in such a state we are sampling from a correla…”
BackgroundDefining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601 · cited 1×
“But 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].”
BackgroundRoads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Aaronson, S. (2015) · Nature Physics · doi:10.1038/nphys3272 · Cited by 567 · 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.”
BackgroundNoise tailoring for scalable quantum computation via randomized compiling
Wallman, J. J., & Emerson, J. (2016) · Physical Review A · doi:10.1103/physreva.94.052325 · Cited by 535 · cited 1×
“time. Further near-term experiments exploring quantum error correction are bound to advance our understanding of noise in quantum devices, and to suggest more effective techniques for noise mitigation [47, 48] and device validation [49]. Nevertheless, solving really hard problems (like factoring numbers which are thous…”
BackgroundOptimal architectures for long distance quantum communication
Muralidharan, S., Li, L., Kim, J., Lütkenhaus, N., Lukin, M. D., & Jiang, L. (2016) · Scientific Reports · doi:10.1038/srep20463 · Cited by 440
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2008) · SIAM Review · doi:10.1137/080734479 · Cited by 395
An introduction to quantum error correction and fault-tolerant quantum computation
Gottesman, D. (2010) · Proceedings of Symposia in Applied Mathematics · doi:10.1090/psapm/068/2762145 · Cited by 370 · cited 1×
“materials and control and fabrication to get where we are now. Eventually we expect to be able to protect quantum systems and scale up quantum computers using the principle of quantum errorcorrection [10]. The essential idea of quantum error correction is that if we want to protect a quantum system from damage then we…”
BackgroundA quantum-inspired classical algorithm for recommendation systems
Tang, E. (2019) · Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3313276.3316310 · Cited by 360
Observation of topological phenomena in a programmable lattice of 1,800 qubits
King, A. D., Carrasquilla, J., Raymond, J., Ozfidan, I., Andriyash, E., Berkley, A., Reis, M., Lanting, T., Harris, R., Altomare, F., et al. (2018) · Nature · doi:10.1038/s41586-018-0410-x · Cited by 323 · cited 1×
“In particular, aside from the applications of quantum annealers to classical optimization problems, applications to quantum simulation problems should also be explored [34].”
BackgroundQuantum computing and the entanglement frontier
Preskill, J. (2012) · arXiv · doi:10.48550/arxiv.1203.5813 · Cited by 308 · cited 1×
“ving target, as both classical hardware and classical algorithms continually improve. A few years ago I spoke enthusiastically about quantum supremacy as an impending milestone for human civilization [20]. I suggested this term as a way to characterize computational tasks performable by quantum devices, where one coul…”
BackgroundSelf-citationPreconditioned Quantum Linear System Algorithm
Clader, B. D., Jacobs, B. C., & Sprouse, C. R. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.250504 · Cited by 288 · cited 1×
“stanceofthismatrix inversionproblem. Andanumberofpotentiallyusefulapplicationshavebeensuggested. Forexample,wecanusethismatrixinversionalgorithmtofindapproximatesolutionsto classicallinearfieldequations[41,42,43](afterdiscretizingthefieldonaspatiallattice, and applying a suitable preconditioner). This procedure could be…”
MethodSolving strongly correlated electron models on a quantum computer
Wecker, D., Hastings, M. B., Wiebe, N., Clark, B. K., Nayak, C., & Troyer, M. (2015) · Physical Review A · doi:10.1103/physreva.92.062318 · Cited by 285 · cited 1×
“ena where quantum computers seem to have a clear advantage over classical ones. In the long term, quantum simulation using quantum computers has great potential to wield a broad influence on the world [42, 43, 44]. Advances in quantum chemistry, facilitated by quantum computing, might precipitate the design of new phar…”
BackgroundQuantum Recommendation Systems
Kerenidis, I., & Prakash, A. (2016) · arXiv · doi:10.48550/arxiv.1603.08675 · Cited by 270 · cited 1×
“thm is probably just too expensive to be executed successfully by a quantum computer which doesn’t use error correction. 6.7 Quantum recommendation systems Another recently proposed quantum algorithm [39] provides an exponential speedup over the best currently known classical algorithm for a useful task: making high-v…”
BackgroundInfluentialQuantum Recommendation Systems
Kerenidis, I., & Prakash, A. (2016) · DR-NTU (Nanyang Technological University) · doi:10.4230/lipics.itcs.2017.49 · Cited by 250 · cited 1×
“thm is probably just too expensive to be executed successfully by a quantum computer which doesn’t use error correction. 6.7 Quantum recommendation systems Another recently proposed quantum algorithm [39] provides an exponential speedup over the best currently known classical algorithm for a useful task: making high-v…”
BackgroundInfluentialComplexity-Theoretic Foundations of Quantum Supremacy Experiments
Aaronson, S., & Chen, L. (2016) · arXiv · doi:10.48550/arxiv.1612.05903 · Cited by 218
Using quantum key distribution for cryptographic purposes: A survey
Alléaume, R., Branciard, C., Bouda, J., Debuisschert, T., Dianati, M., Gisin, N., Godfrey, M., Grangier, P., Länger, T., Lütkenhaus, N., et al. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.09.018 · Cited by 217
Adiabatic Quantum Computation is Equivalent to Standard Quantum ComputationPreprint
Aharonov, D., van Dam, W., Kempe, J., Landau, Z. A., Lloyd, S., & Regev, O. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0405098 · Cited by 195
Quantum algorithms and the finite element method
Montanaro, A., & Pallister, S. (2016) · Physical Review A · doi:10.1103/physreva.93.032324 · Cited by 192 · cited 1×
“For example, we can use this matrix inversion algorithm to find approximate solutions to classical linear field equations [41, 42, 43] (after discretizing the field on a spatial lattice, and applying a suitable preconditioner).”
MethodExperimentally generated randomness certified by the impossibility of superluminal signals
Bierhorst, P., Knill, E. H., Glancy, S., Zhang, Y., Mink, A., Jordan, S. P., Rommal, A., Liu, Y.-K., Christensen, B., Nam, S. W., et al. (2018) · RePEc: Research Papers in Economics · Cited by 190
Quantum sampling problems, BosonSampling and quantum supremacy
Lund, A. P., Bremner, M. J., & Ralph, T. C. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0018-2 · Cited by 183
Experimentally generated randomness certified by the impossibility of superluminal signals
Bierhorst, P., Knill, E., Glancy, S., Zhang, Y., Mink, A., Jordan, S., Rommal, A., Liu, Y.-K., Christensen, B., Nam, S. W., et al. (2018) · Nature · doi:10.1038/s41586-018-0019-0 · Cited by 181
Quantum algorithm for simulating the wave equation
Costa, P. C. S., Jordan, S., & Ostrander, A. (2019) · Physical Review A · doi:10.1103/physreva.99.012323 · Cited by 160 · cited 1×
“For example, we can use this matrix inversion algorithm to find approximate solutions to classical linear field equations [41, 42, 43] (after discretizing the field on a spatial lattice, and applying a suitable preconditioner).”
MethodQuantum Algorithm for Simulating the Wave Equation
Costa, P. C. S., Jordan, S., & Ostrander, A. (2017) · arXiv · doi:10.48550/arxiv.1711.05394 · Cited by 160
Quantum Speed-Ups for Solving Semidefinite Programs
Brandao, F. G. S. L., & Svore, K. M. (2017) · 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs.2017.45 · Cited by 142
The complexity of stoquastic local Hamiltonian problems
Bravyi, S. B., Divincenzo, D. P., Oliveira, R. I., & Terhal, B. M. (2008) · CERN Document Server (European Organization for Nuclear Research) · doi:10.5555/2011772.2011773 · Cited by 135
An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
Gottesman, D. (2009) · arXiv · doi:10.48550/arxiv.0904.2557 · Cited by 129 · cited 1×
“materials and control and fabrication to get where we are now. Eventually we expect to be able to protect quantum systems and scale up quantum computers using the principle of quantum errorcorrection [10]. The essential idea of quantum error correction is that if we want to protect a quantum system from damage then we…”
BackgroundA Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
Brakerski, Z., Christiano, P. F., Mahadev, U., Vazirani, U. V., & Vidick, T. (2021) · Journal of the ACM · doi:10.1145/3441309 · Cited by 118
Breaking the 49-Qubit Barrier in the Simulation of Quantum Circuits
Pednault, E., Gunnels, J. A., Nannicini, G., Horesh, L., Magerlein, T., Solomonik, E., & Wisnieff, R. (2018) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · Cited by 104
The complexity of stoquastic local Hamiltonian problems
Bravyi, S., DiVincenzo, D. P., Oliveira, R., & Terhal, B. M. (2008) · Quantum Information and Computation · doi:10.26421/qic8.5-1 · Cited by 80 · cited 1×
“So far quantum annealers have been applied mostly to cases where the annealing is stoquastic — that means it is relatively easy for a classical computer to simulate what the quantum annealer is doing [30]. What’s coming soon are non-stoquastic quantum annealers, which may have greater potential for achieving speedups…”
BackgroundComplexity-Theoretic Foundations of Quantum Supremacy Experiments
Aaronson, S., & Chen, L. (2016) · arXiv (Cornell University) · doi:10.14288/1.0343134 · Cited by 54
Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
Pednault, E., Gunnels, J. A., Nannicini, G., Horesh, L., Magerlein, T., Solomonik, E., Draeger, E. W., Holland, E. T., & Wisnieff, R. (2017) · arXiv · doi:10.48550/arxiv.1710.05867 · Cited by 48 · cited 1×
“y a bit fuzzy, in several respects. In particular, the resources needed in a classical simulation depend on the depth (number of time steps) of the quantum circuit, as well as on the number of qubits [11, 12, 13]. 5 more powerful quantum technologies we’ll develop in the future. I do think that quantum computers will…”
BackgroundAdiabatic optimization versus diffusion Monte Carlo methods
Jarret, M., Jordan, S. P., & Lackey, B. (2016) · Physical Review A · doi:10.1103/physreva.94.042318 · Cited by 36 · cited 1×
“So far quantum annealers have been applied mostly to cases where the annealing is stoquastic — that means it might be relatively easy for a classical computer to simulate what the quantum annealer is doing [32, 33].”
BackgroundThe pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again)
Mandrà, S., Katzgraber, H. G., & Thomas, C. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa7877 · Cited by 35 · cited 1×
“But 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].”
BackgroundNoise-resilient preparation of quantum many-body ground statesPreprint
Kim, I. H. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.00032 · Cited by 31 · cited 1×
“s away by a later time. Such noise resilience ischaracteristic ofsome tensor network constructions which canbe invoked for solving quantum optimization problems using Variational Quantum Eigensolvers [32, 33]. There is a substantial opportunity for experimentalists and theorists, working together over the next few yea…”
BackgroundRobust entanglement renormalization on a noisy quantum computer
Kim, I. H., & Swingle, B. (2017) · arXiv · doi:10.48550/arxiv.1711.07500 · Cited by 29 · cited 1×
“s away by a later time. Such noise resilience ischaracteristic ofsome tensor network constructions which canbe invoked for solving quantum optimization problems using Variational Quantum Eigensolvers [32, 33]. There is a substantial opportunity for experimentalists and theorists, working together over the next few yea…”
BackgroundQuantum Speed-ups for Semidefinite Programming
Brandão, F. G. S. L., & Svore, K. M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.05537 · Cited by 21 · cited 1×
“A recently discovered quantum algorithm [46, 47] finds an approximate solution to the problem in time polylog(N), an exponential speedup.”
BackgroundLogical Randomized Benchmarking
Combes, J., Granade, C., Ferrie, C., & Flammia, S. T. (2017) · arXiv · doi:10.48550/arxiv.1702.03688 · Cited by 20
An efficient quantum algorithm for generative machine learningPreprint
Gao, X., Zhang, Z., & Duan, L. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1711.02038 · Cited by 18 · cited 1×
“First, though, I’ll comment on the potential of quantum deep learning [39].”
BackgroundExponential Quantum Speed-ups for Semidefinite Programming with Applications to Quantum LearningPreprint
Brandão, F. G. S. L., Kalev, A., Li, T., Lin, C. Y.-Y., Svore, K. M., & Wu, X. (2017) · arXiv (Cornell University) · Cited by 15
Gonzalez, T. F. (2007) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420010749-23 · Cited by 15
Quantum Information and Computation for Chemistry
Olson, J., Cao, Y., Romero, J., Johnson, P., Dallaire-Demers, P.-L., Sawaya, N., Narang, P., Kivlichan, I., Wasielewski, M., & Aspuru-Guzik, A. (2017) · arXiv · doi:10.48550/arxiv.1706.05413 · Cited by 15 · cited 1×
“In the long term, quantum simulation using quantum computers has great potential to wield a broad influence on the world [48, 49, 50].”
BackgroundThe Complexity of Stoquastic Local Hamiltonian Problems
Bravyi, S., DiVincenzo, D. P., Oliveira, R. I., & Terhal, B. M. (2006) · arXiv · doi:10.48550/arxiv.quant-ph/0606140 · Cited by 15
Vazirani, V. V. (2003) · Springer eBooks · doi:10.1007/978-3-662-04565-7_29 · Cited by 8 · cited 1×
“mation ratio k0/kisameasureofthequalityofourapproximatesolution. For some optimization problems, even finding an approximation solution is NP-hard if the approximation ratio is sufficiently close to one [23], and in those cases we don’t expect a quantum computer to be able to find the approximate solution efficiently for ha…”
Background(2016) · arXiv (Cornell University) · Cited by 8
Using quantum key distribution for cryptographic purposes: a surveyPreprint
Alléaume, R., Branciard, C., Bouda, J., et al. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0701168 · Cited by 7
Certifiable Randomness from a Single Quantum Device.Preprint
Brakerski, Z., Christiano, P. F., Mahadev, U., Vazirani, U. V., & Vidick, T. (2018) · arXiv (Cornell University) · Cited by 5
A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
Brakerski, Z., Christiano, P., Mahadev, U., et al. (2018) · arXiv · doi:10.48550/arxiv.1804.00640
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2016) · arXiv · doi:10.48550/arxiv.1612.07330
Observation of topological phenomena in a programmable lattice of 1,800 qubits
King, A. D., Carrasquilla, J., Ozfidan, I., et al. (2018) · arXiv · doi:10.48550/arxiv.1803.02047
Cited by
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Variational quantum algorithms
Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00348-9 · Cited by 3,385
“But excitement grew as to what could be done with these new devices, which have been called Noisy Intermediate-Scale Quantum (NISQ) computers [7].”
BackgroundSupervised learning with quantum-enhanced feature spaces
Havlíček, V., Córcoles, A. D., Temme, K., Harrow, A. W., Kandala, A., Chow, J. M., & Gambetta, J. M. (2019) · Nature · doi:10.1038/s41586-019-0980-2 · Cited by 2,572
Barren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329
Circuit quantum electrodynamics
Blais, A., Grimsmo, A. L., Girvin, S. M., & Wallraff, A. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.025005 · Cited by 1,931
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.