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 601–700 of 8,640
Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
Zhao, C., & Gao, X.-S. (2021) · Quantum · doi:10.22331/q-2021-06-04-466 · Cited by 130
Quantum error correction using squeezed Schrödinger cat states
Schlegel, D. S., Minganti, F., & Savona, V. (2022) · Physical Review A · doi:10.1103/physreva.106.022431 · Cited by 108
Gokhale, P., Angiuli, O., Ding, Y., Gui, K., Tomesh, T., Suchara, M., Martonosi, M., & Chong, F. T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.13623 · Cited by 76
Optimizing quantum heuristics with meta-learning
Wilson, M., Stromswold, S., Wudarski, F., Hadfield, S., Tubman, N. M., & Rieffel, E. (2019) · arXiv · doi:10.48550/arxiv.1908.03185 · Cited by 77
Variational Quantum Algorithm for Estimating the Quantum Fisher Information
Beckey, J. L., Cerezo, M., Sone, A., & Coles, P. J. (2020) · arXiv · doi:10.48550/arxiv.2010.10488 · Cited by 77
Efficient quantum state tomography with convolutional neural networks
Schmale, T., Reh, M., & Gärttner, M. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00621-4 · Cited by 76
Cai, Z. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00404-3 · Cited by 76
“[2] John Preskill, “Quantum Computing in the NISQ era and beyond,” Quantum 2, 79 (2018).”
BackgroundMethodDemonstration of a parametrically activated entangling gate protected from flux noise
Hong, S. S., Papageorge, A. T., Sivarajah, P., Crossman, G., Didier, N., Polloreno, A. M., Sete, E. A., Turkowski, S. W., da Silva, M. P., & Johnson, B. R. (2020) · Physical Review A · doi:10.1103/physreva.101.012302 · Cited by 76
Universal Gate Set for Continuous-Variable Quantum Computation with Microwave Circuits
Hillmann, T., Quijandría, F., Johansson, G., Ferraro, A., Gasparinetti, S., & Ferrini, G. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.160501 · Cited by 111
Yalouz, S., Senjean, B., Günther, J., Buda, F., O’Brien, T. E., & Visscher, L. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abd334 · Cited by 76
Hardware-Efficient Microwave-Activated Tunable Coupling between Superconducting Qubits
Mitchell, B. K., Naik, R., Morvan, A., Hashim, A., Kreikebaum, J. M., Marinelli, B., Lavrijsen, W., Nowrouzi, K., Santiago, D., & Siddiqi, I. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.200502 · Cited by 114
Generalized Quantum Subspace Expansion
Yoshioka, N., Hakoshima, H., Matsuzaki, Y., Tokunaga, Y., Suzuki, Y., & Endo, S. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.020502 · Cited by 122
Efficient parallelization of tensor network contraction for simulating quantum computation
Huang, C., Zhang, F., Newman, M., Ni, X., Ding, D., Cai, J., Gao, X., Wang, T., Wu, F., Zhang, G., et al. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00119-7 · Cited by 74
Holter, C. T., Inglesant, P., & Jirotka, M. D. (2021) · Technology Analysis and Strategic Management · doi:10.1080/09537325.2021.1988070 · Cited by 101
Low-Overhead Fault-Tolerant Quantum Error Correction with the Surface-GKP Code
Noh, K., Chamberland, C., & Brandão, F. G. S. L. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010315 · Cited by 75
Shortest Route to Non-Abelian Topological Order on a Quantum Processor
Tantivasadakarn, N., Verresen, R., & Vishwanath, A. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.060405 · Cited by 128
An elementary review on basic principles and developments of qubits for quantum computing
Chae, E., Choi, J., & Kim, J. (2024) · Nano Convergence · doi:10.1186/s40580-024-00418-5 · Cited by 119
Prospects of quantum computing for molecular sciences
Liu, H., Low, G. H., Steiger, D. S., Häner, T., Reiher, M., & Troyer, M. (2022) · Materials Theory · doi:10.1186/s41313-021-00039-z · Cited by 73
Quantum Circuit Transformation Based on Simulated Annealing and Heuristic Search
Zhou, X., Li, S., & Feng, Y. (2020) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2020.2969647 · Cited by 95
Adiabatic quantum linear regression
Date, P., & Potok, T. E. (2021) · Scientific Reports · doi:10.1038/s41598-021-01445-6 · Cited by 107
Improving Hamiltonian encodings with the Gray code
Matteo, O. D., McCoy, A. E., Gysbers, P., Miyagi, T., Woloshyn, R. M., & Navrátil, P. (2021) · Physical Review A · doi:10.1103/physreva.103.042405 · Cited by 96
Tensor lattice field theory for renormalization and quantum computing
Meurice, Y., Sakai, R., & Unmuth-Yockey, J. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.025005 · Cited by 90
QAOA-in-QAOA: Solving Large-Scale MaxCut Problems on Small Quantum Machines
Zhou, Z.-F., Du, Y., Tian, X., & Tao, D. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.024027 · Cited by 130
eQASM: An Executable Quantum Instruction Set Architecture
Fu, X., Riesebos, L., Rol, M. A., van Straten, J., van Someren, J., Khammassi, N., Ashraf, I., Vermeulen, R. F. L., Newsum, V., Loh, K. K. L., et al. (2019) · 2019 IEEE International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2019.00040 · Cited by 78
Simulating quantum field theory with a quantum computer
Preskill, J. P. (2019) · International Symposium on Lattice Field Theory (LATTICE) · doi:10.22323/1.334.0024 · Cited by 94
Self-citationBifluxon: Fluxon-Parity-Protected Superconducting Qubit
Kalashnikov, K., Hsieh, W. T., Zhang, W., Lu, W.-S., Kamenov, P., Paolo, A. D., Blais, A., Gershenson, M. E., & Bell, M. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.010307 · Cited by 107
Qutrit-Inspired Fully Self-Supervised Shallow Quantum Learning Network for Brain Tumor Segmentation
Konar, D., Bhattacharyya, S., Panigrahi, B. K., & Behrman, E. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3077188 · Cited by 95
Low-depth quantum state preparation
Zhang, X., Yung, M., & Yuan, X. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.043200 · Cited by 98
Quantum Volume in Practice: What Users Can Expect From NISQ Devices
Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3184764 · Cited by 75
Variational quantum eigensolver with reduced circuit complexity
Zhang, Y., Cincio, Ł., Negre, C. F. A., Czarnik, P., Coles, P. J., Anisimov, P. M., Mniszewski, S. M., Tretiak, S., & Dub, P. A. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00599-z · Cited by 112
Mitigating algorithmic errors in a Hamiltonian simulation
Endo, S., Zhao, Q., Li, Y., Benjamin, S., & Yuan, X. (2019) · Physical Review A · doi:10.1103/physreva.99.012334 · Cited by 72
QURE: Qubit Re-allocation in Noisy Intermediate-Scale Quantum Computers
Ash-Saki, A., Alam, M., & Ghosh, S. (2019) · Proceedings of the 56th Annual Design Automation Conference 2019 · doi:10.1145/3316781.3317888 · Cited by 73
Concepts of work in autonomous quantum heat engines
Niedenzu, W., Huber, M., & Boukobza, E. (2019) · Quantum · doi:10.22331/q-2019-10-14-195 · Cited by 106
Quantum implementation of an artificial feed-forward neural network
Tacchino, F., Barkoutsos, P., Macchiavello, C., Tavernelli, I., Gerace, D., & Bajoni, D. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abb8e4 · Cited by 73
Cervera-Lierta, A., Kottmann, J. S., & Aspuru‐Guzik, A. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020329 · Cited by 108
Error Mitigation via Verified Phase Estimation
O’Brien, T. E., Polla, S., Rubin, N. C., Huggins, W. J., McArdle, S., Boixo, S., McClean, J. R., & Babbush, R. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020317 · Cited by 113
Bharti, K., & Haug, T. (2021) · Physical Review A · doi:10.1103/physreva.104.042418 · Cited by 73
Simulation of collective neutrino oscillations on a quantum computer
Hall, B., Roggero, A., Baroni, A., & Carlson, J. (2021) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.104.063009 · Cited by 94
Synergistic pretraining of parametrized quantum circuits via tensor networks
Rudolph, M. S., Miller, J., Motlagh, D., Chen, J., Acharya, A., & Perdomo‐Ortiz, A. (2023) · Nature Communications · doi:10.1038/s41467-023-43908-6 · Cited by 174
Saha, S., Hota, A., Chattopadhyay, A. K., Nag, A., & Nandi, S. (2024) · Artificial Intelligence Review · doi:10.1007/s10462-024-10766-7 · Cited by 111
NISQ Computers: A Path to Quantum Supremacy
AbuGhanem, M., & Eleuch, H. (2024) · IEEE Access · doi:10.1109/access.2024.3432330 · Cited by 116
Fast High-Fidelity Quantum Nondemolition Qubit Readout via a Nonperturbative Cross-Kerr Coupling
Dassonneville, R., Ramos, T., Milchakov, V., Planat, L., Dumur, É., Foroughi, F., Puertas, J., Leger, S., Bharadwaj, K. S., Delaforce, J., et al. (2020) · Physical Review X · doi:10.1103/physrevx.10.011045 · Cited by 118
Single-step implementation of high-fidelity n -bit Toffoli gates
Rasmussen, S. E., Groenland, K., Gerritsma, R., Schoutens, K., & Zinner, N. T. (2020) · Physical Review A · doi:10.1103/physreva.101.022308 · Cited by 86
Theory versus practice in annealing-based quantum computing
McGeoch, C. C. (2020) · Theoretical Computer Science · doi:10.1016/j.tcs.2020.01.024 · Cited by 83
Time-sliced quantum circuit partitioning for modular architectures
Baker, J. M., Duckering, C., Hoover, A., & Chong, F. T. (2020) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/3387902.3392617 · Cited by 130
Microwave Package Design for Superconducting Quantum Processors
Huang, S., Lienhard, B., Calusine, G., Vepsäläinen, A. P., Braumüller, J., Kim, D. K., Melville, A. J., Niedzielski, B. M., Yoder, J., Kannan, B., et al. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020306 · Cited by 99
Low depth algorithms for quantum amplitude estimation
Giurgică-Tiron, T., Kerenidis, I., Labib, F., Prakash, A., & Zeng, W. J. (2022) · Quantum · doi:10.22331/q-2022-06-27-745 · Cited by 124
Optimal Entanglement Certification from Moments of the Partial Transpose
Yu, X., Imai, S., & Gühne, O. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.060504 · Cited by 110
Polaritonic Unitary Coupled Cluster for Quantum Computations
Pavošević, F., & Flick, J. (2021) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.1c02659 · Cited by 86
Annealing-Based Quantum Computing for Combinatorial Optimal Power Flow
Morstyn, T. (2022) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2022.3200590 · Cited by 87
Supply chain logistics with quantum and classical annealing algorithms
Weinberg, S. J., Sanches, F., Ide, T., Kamiya, K., & Correll, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-31765-8 · Cited by 134
Out-of-distribution generalization for learning quantum dynamics
Caro, M. C., Huang, H.-Y., Ezzell, N., Gibbs, J., Sornborger, A. T., Cincio, Ł., Coles, P. J., & Holmes, Z. (2023) · Nature Communications · doi:10.1038/s41467-023-39381-w · Cited by 157
Best practices for portfolio optimization by quantum computing, experimented on real quantum devices
Buonaiuto, G., Gargiulo, F., Pietro, G. D., Esposito, M., & Pota, M. (2023) · Scientific Reports · doi:10.1038/s41598-023-45392-w · Cited by 120
High-rate intercity quantum key distribution with a semiconductor single-photon source
Yang, J., Jiang, Z., Benthin, F., Hanel, J., Fandrich, T., Joos, R., Bauer, S., Kolatschek, S., Hreibi, A., Rugeramigabo, E. P., et al. (2024) · Light Science & Applications · doi:10.1038/s41377-024-01488-0 · Cited by 106
Timing and Resource-Aware Mapping of Quantum Circuits to Superconducting Processors
Lao, L., van Someren, H., Ashraf, I., & Almudever, C. G. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2021.3057583 · Cited by 72
Characterizing the loss landscape of variational quantum circuits
Huembeli, P., & Dauphin, A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abdbc9 · Cited by 71
Analog errors in quantum annealing: doom and hope
Pearson, A., Mishra, A., Hen, I., & Lidar, D. A. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0210-7 · Cited by 71
Supervised learning with a quantum classifier using multi-level systems
Adhikary, S., Dangwal, S., & Bhowmik, D. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-2587-9 · Cited by 79
Development of Quantum Interconnects (QuICs) for Next-Generation Information Technologies
Awschalom, D., Berggren, K. K., Bernien, H., Bhave, S. A., Carr, L. D., Davids, P., Economou, S. E., Englund, D., Faraon, A., Fejer, M. M., et al. (2021) · DSpace@MIT (Massachusetts Institute of Technology) · doi:10.6082/33e5f-d1j97 · Cited by 70
Subtleties in the trainability of quantum machine learning models
Thanasilp, S., Wang, S., Nghiem, N. A., Coles, P. J., & Cerezo, M. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00103-6 · Cited by 142
Wagner, R., Schwartzman-Nowik, Z., Paiva, I. L., Te’eni, A., Ruiz-Molero, A., Barbosa, R. S., Cohen, E., & Galvão, E. F. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad124c · Cited by 112
Superconducting circuit quantum computing with nanomechanical resonators as storage
Pechal, M., Arrangoiz-Arriola, P., & Safavi-Naeini, A. H. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aadc6c · Cited by 71
staq —A full-stack quantum processing toolkit
Amy, M., & Gheorghiu, V. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab9359 · Cited by 109
Variational Quantum Singular Value Decomposition
Wang, X., Song, Z., & Wang, Y. (2021) · Quantum · doi:10.22331/q-2021-06-29-483 · Cited by 106
Confinement and entanglement dynamics on a digital quantum computer
Vovrosh, J., & Knolle, J. (2021) · Scientific Reports · doi:10.1038/s41598-021-90849-5 · Cited by 106
Quantum Error Mitigation With Artificial Neural Network
Kim, C., Park, D. K., & Rhee, J. K. (2020) · IEEE Access · doi:10.1109/access.2020.3031607 · Cited by 102
Xu, Y., Huang, G., Balewski, J. T., Naik, R., Morvan, A., Mitchell, B., Nowrouzi, K., Santiago, D., & Siddiqi, I. A. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3116540 · Cited by 111
A hybrid classical-quantum approach for multi-class classification
Chalumuri, A., Kune, R., & Manoj, B. S. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03029-9 · Cited by 89
Barren plateaus in quantum tensor network optimization
Cervero-Martín, E., Plekhanov, K., & Lubasch, M. (2023) · Quantum · doi:10.22331/q-2023-04-13-974 · Cited by 106
Dual-rail encoding with superconducting cavities
Teoh, J. D., Winkel, P., Babla, H. K., Chapman, B. J., Claes, J., de Graaf, S. J., Garmon, J. W. O., Kalfus, W. D., Lu, Y., Maiti, A., et al. (2023) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2221736120 · Cited by 69
Universality in driven open quantum matter
Sieberer, L. M., Buchhold, M., Marino, J., & Diehl, S. (2025) · Reviews of Modern Physics · doi:10.1103/revmodphys.97.025004 · Cited by 186
A Hybrid Approach for Solving Optimization Problems on Small Quantum Computers
Shaydulin, R., Ushijima-Mwesigwa, H., Negre, C. F. A., Safro, I., Mniszewski, S. M., & Alexeev, Y. (2019) · Computer · doi:10.1109/mc.2019.2908942 · Cited by 68
Efficient evaluation of quantum observables using entangled measurements
Hamamura, I., & Imamichi, T. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0284-2 · Cited by 69
Xia, R., & Kais, S. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abbc74 · Cited by 70
Hilbert space fragmentation and exact scars of generalized Fredkin spin chains
Langlett, C. M., & Xu, S. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.103.l220304 · Cited by 91
Quantum Ranging with Gaussian Entanglement
Zhuang, Q. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.240501 · Cited by 87
Chemical data intelligence for sustainable chemistry
Weber, J. M., Guo, Z., Zhang, C., Schweidtmann, A. M., & Lapkin, A. A. (2021) · Chemical Society Reviews · doi:10.1039/d1cs00477h · Cited by 87
Quantum computing of the Li6 nucleus via ordered unitary coupled clusters
Kiss, O., Grossi, M., Lougovski, P., Sánchez, F. A., Vallecorsa, S., & Papenbrock, T. (2022) · Physical Review C · doi:10.1103/physrevc.106.034325 · Cited by 84
Perceval: A Software Platform for Discrete Variable Photonic Quantum Computing
Heurtel, N., Fyrillas, A., de Gliniasty, G., Bihan, R. L., Malherbe, S., Pailhas, M., Bertasi, E., Bourdoncle, B., Emeriau, P.-E., Mezher, R., et al. (2023) · Quantum · doi:10.22331/q-2023-02-21-931 · Cited by 141
Langrock, V., Krzywda, J. A., Focke, N., Seidler, I., Schreiber, L. R., & Cywiński, Ł. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020305 · Cited by 97
Hamiltonian variational ansatz without barren plateaus
Park, C.-Y., & Killoran, N. (2024) · Quantum · doi:10.22331/q-2024-02-01-1239 · Cited by 141
Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
Wang, S., Czarnik, P., Arrasmith, A., Cerezo, M., Cincio, Ł., & Coles, P. J. (2024) · Quantum · doi:10.22331/q-2024-03-14-1287 · Cited by 132
QuGAN: A Quantum State Fidelity based Generative Adversarial Network
Stein, S. A., Baheri, B., Chen, D., Mao, Y., Guan, Q., Li, A., Fang, B., & Xu, S. (2021) · 2021 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00023 · Cited by 69
“This single qubit being used to measure fidelity has its benefits within the quantum setting, as near term devices can be rather noisy [34, 35] and hence using lower qubit counts requiring measurement can reduce the number of samples needed to attain a confident reading from the quantum computer.”
MethodQuantum enhancements for deep reinforcement learning in large spaces
Jerbi, S., Trenkwalder, L. M., Nautrup, H. P., Briegel, H. J., & Dunjko, V. (2019) · arXiv · doi:10.48550/arxiv.1910.12760 · Cited by 69
Quantum generative adversarial learning in a superconducting quantum circuit
Hu, L., Wu, S.-H., Cai, W., Ma, Y., Mu, X., Xu, Y., Wang, H., Song, Y., Deng, D.-L., Zou, C., et al. (2019) · Bulletin of the American Physical Society · Cited by 71
TEQUILA: a platform for rapid development of quantum algorithms
Kottmann, J. S., Alperin-Lea, S., Tamayo-Mendoza, T., Cervera-Lierta, A., Lavigne, C., Yen, T.-C., Verteletskyi, V., Schleich, P., Anand, A., Degroote, M., et al. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abe567 · Cited by 117
Near-term quantum algorithms for linear systems of equations with regression loss functions
Huang, H.-Y., Bharti, K., & Rebentrost, P. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac325f · Cited by 213
Classical-to-quantum convolutional neural network transfer learning
Kim, J., Huh, J., & Park, D. K. (2023) · Neurocomputing · doi:10.1016/j.neucom.2023.126643 · Cited by 99
Minimally entangled state preparation of localized wave functions on quantum computers
Klco, N., & Savage, M. J. (2020) · Physical Review A · doi:10.1103/physreva.102.012612 · Cited by 89
Quantum algorithms for jet clustering
Wei, A. Y., Naik, P., Harrow, A. W., & Thaler, J. (2020) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.101.094015 · Cited by 75
A Survey on Quantum Key Distribution
Gyöngyösi, L., Bacsárdi, L., & Imre, S. (2019) · Híradástechnika/Infocommunications journal · doi:10.36244/icj.2019.2.2 · Cited by 88
Classification with Quantum Machine Learning: A Survey
Abohashima, Z., Elhosen, M., Houssein, E. H., & Mohamed, W. M. (2020) · arXiv · doi:10.48550/arxiv.2006.12270 · Cited by 68
Systematic Crosstalk Mitigation for Superconducting Qubits via Frequency-Aware Compilation
Ding, Y., Gokhale, P., Lin, S. F., Rines, R., Propson, T., & Chong, F. T. (2020) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro50266.2020.00028 · Cited by 139
Gill, S. S. (2024) · Internet Technology Letters · doi:10.1002/itl2.275 · Cited by 67
Clinical data classification with noisy intermediate scale quantum computers
Moradi, S., Brandner, C., Spielvogel, C. P., Krajnc, D., Hillmich, S., Wille, R., Drexler, W., & Papp, L. (2022) · Scientific Reports · doi:10.1038/s41598-022-05971-9 · Cited by 82
High-speed thin-film lithium niobate quantum processor driven by a solid-state quantum emitter
Sund, P. I., Lomonte, E., Paesani, S., Wang, Y., Carolan, J., Bart, N., Wieck, A. D., Ludwig, A., Midolo, L., Pernice, W. H. P., et al. (2023) · Science Advances · doi:10.1126/sciadv.adg7268 · Cited by 92
Quantum computing for fluids: Where do we stand?
Succi, S., Itani, W., Sreenivasan, K. R., & Steijl, R. (2023) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/acfdc7 · Cited by 102
Benchmarking quantum computers
Proctor, T., Young, K., Baczewski, A. D., & Blume-Kohout, R. (2025) · Nature Reviews Physics · doi:10.1038/s42254-024-00796-z · Cited by 67
Intrinsic Mixed-State Topological Order
Wang, Z., Wu, Z., & Wang, Z. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010314 · Cited by 155
Designing Peptides on a Quantum Computer
Mulligan, V. K., Melo, H., Merritt, H. I., Slocum, S., Weitzner, B. D., Watkins, A. M., Renfrew, P. D., Pelissier, C., Arora, P. S., & Bonneau, R. (2019) · doi:10.1101/752485 · Cited by 67
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.