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 701–800 of 8,640
Scaling of variational quantum circuit depth for condensed matter systems
Bravo-Prieto, C., Lumbreras-Zarapico, J., Tagliacozzo, L., & Latorre, J. I. (2020) · Quantum · doi:10.22331/q-2020-05-28-272 · Cited by 66
Integrable Many-Body Quantum Floquet-Thouless Pumps
Friedman, A. J., Gopalakrishnan, S., & Vasseur, R. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.170603 · Cited by 75
Many-Body Chern Number from Statistical Correlations of Randomized Measurements
Cian, Z.-P., Dehghani, H., Elben, A., Vermersch, B., Zhu, G., Barkeshli, M., Zoller, P., & Hafezi, M. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.050501 · Cited by 87
Circuit Compilation Methodologies for Quantum Approximate Optimization Algorithm
Alam, M., Saki, A. A., & Ghosh, S. (2020) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro50266.2020.00029 · Cited by 104
Hu, Z., Head-Marsden, K., Mazziotti, D. A., Narang, P., & Kais, S. (2022) · Quantum · doi:10.22331/q-2022-05-30-726 · Cited by 88
Quantum technologies in the telecommunications industry
Martin, V., Brito, J. P., Escribano, C., Menchetti, M., White, C., Lord, A., Wissel, F., Gunkel, M., Gavignet, P., Genay, N., et al. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00108-9 · Cited by 85
A Theory of Quantum Subspace Diagonalization
Epperly, E. N., Lin, L., & Nakatsukasa, Y. (2022) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/21m145954x · Cited by 154
Measuring nonstabilizerness via multifractal flatness
Turkeshi, X., Schirò, M., & Sierant, P. (2023) · Physical Review A · doi:10.1103/physreva.108.042408 · Cited by 99
Machine learning for anomaly detection in particle physics
Belis, V., Odagiu, P., & Aarrestad, T. K. (2024) · Reviews in Physics · doi:10.1016/j.revip.2024.100091 · Cited by 138
Quantum support vector machines for classification and regression on a trapped-ion quantum computer
Suzuki, T., Hasebe, T., & Miyazaki, T. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00165-0 · Cited by 105
Using models to improve optimizers for variational quantum algorithms
Sung, K. J., Yao, J., Harrigan, M. P., Rubin, N. C., Jiang, Z., Lin, L., Babbush, R., & McClean, J. R. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abb6d9 · Cited by 66
Fujii, K., Mizuta, K., Ueda, H., Mitarai, K., Mizukami, W., & Nakagawa, Y. O. (2020) · arXiv · doi:10.48550/arxiv.2007.10917 · Cited by 66
Adaptive pruning-based optimization of parameterized quantum circuits
Sim, S., Romero, J., Gonthier, J. F., & Kunitsa, A. A. (2020) · arXiv · doi:10.48550/arxiv.2010.00629 · Cited by 66
Variational consistent histories as a hybrid algorithm for quantum foundations
Arrasmith, A., Cincio, L., Sornborger, A. T., Zurek, W. H., & Coles, P. J. (2019) · Nature Communications · doi:10.1038/s41467-019-11417-0 · Cited by 66
Simulating the dynamics of time-dependent Hamiltonians with a truncated Dyson series
Kieferová, M., Scherer, A., & Berry, D. W. (2019) · Physical Review A · doi:10.1103/physreva.99.042314 · Cited by 65
Single-particle digitization strategy for quantum computation of a ϕ4 scalar field theory
Barata, J., Mueller, N., Tarasov, A., & Venugopalan, R. (2021) · Physical Review A · doi:10.1103/physreva.103.042410 · Cited by 89
Unconstrained binary models of the travelling salesman problem variants for quantum optimization
Salehi, Ö., Glos, A., & Miszczak, J. A. (2022) · Quantum Information Processing · doi:10.1007/s11128-021-03405-5 · Cited by 96
Variational quantum algorithm based on the minimum potential energy for solving the Poisson equation
Sato, Y., Kondo, R., Koide, S., Takamatsu, H., & Imoto, N. (2021) · Physical Review A · doi:10.1103/physreva.104.052409 · Cited by 95
Hybrid quantum-classical reservoir computing of thermal convection flow
Pfeffer, P., Heyder, F., & Schumacher, J. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033176 · Cited by 99
Financial fraud detection: A comparative study of quantum machine learning models
Innan, N., Khan, M. A.-Z., & Bennai, M. (2023) · International Journal of Quantum Information · doi:10.1142/s0219749923500442 · Cited by 104
Unitary and Nonunitary Quantum Cellular Automata with Rydberg Arrays
Wintermantel, T. M., Wang, Y., Lochead, G., Shevate, S., Brennen, G. K., & Whitlock, S. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.070503 · Cited by 83
Benchmarking highly entangled states on a 60-atom analogue quantum simulator
Shaw, A. L., Chen, Z., Choi, J., Mark, D. K., Scholl, P., Finkelstein, R., Elben, A., Choi, S., & Endres, M. (2024) · Nature · doi:10.1038/s41586-024-07173-x · Cited by 64
Quantum singular value decomposer
Bravo-Prieto, C., García-Martín, D., & Latorre, J. I. (2020) · Physical Review A · doi:10.1103/physreva.101.062310 · Cited by 64
Choi, H., Pant, M., Guha, S., & Englund, D. R. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0215-2 · Cited by 81
Anomaly detection with variational quantum generative adversarial networks
Herr, D., Obert, B., & Rosenkranz, M. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac0d4d · Cited by 105
Simulating the dynamics of braiding of Majorana zero modes using an IBM quantum computer
Stenger, J., Bronn, N. T., Egger, D. J., & Pekker, D. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033171 · Cited by 85
TEQUILA: a platform for rapid development of quantum algorithms
Kottmann, J. S., Alperin-Lea, S., Chaney, S., Kesibi, M., Curnow, N. G., Solo, B., Tsilimigkounakis, G., Zendejas-Morales, C., Izmaylov, A. F., Aspuru‐Guzik, A., et al. (2021) · RWTH Publications (RWTH Aachen) · Cited by 68
Quantum Metrology for Non-Markovian Processes
Altherr, A., & Yang, Y. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.060501 · Cited by 102
ADAPT: Mitigating Idling Errors in Qubits via Adaptive Dynamical Decoupling
Das, P., Tannu, S., Dangwal, S., & Qureshi, M. (2021) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3466752.3480059 · Cited by 109
Entanglement generation in (1+1)D QED scattering processes
Rigobello, M., Notarnicola, S., Magnifico, G., & Montangero, S. (2021) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.104.114501 · Cited by 105
Quantum embedding theories to simulate condensed systems on quantum computers
Vorwerk, C., Sheng, N., Govoni, M., Huang, B., & Galli, G. (2022) · Nature Computational Science · doi:10.1038/s43588-022-00279-0 · Cited by 90
Pauli spectrum and nonstabilizerness of typical quantum many-body states
Turkeshi, X., Dymarsky, A. Y., & Sierant, P. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.054301 · Cited by 147
Information Scrambling in Quantum Neural Networks
Shen, H., Zhang, P., You, Y., & Zhai, H. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.200504 · Cited by 89
Bertrand, C., Florens, S., Parcollet, O., & Waintal, X. (2019) · Physical Review X · doi:10.1103/physrevx.9.041008 · Cited by 84
Toward pricing financial derivatives with an IBM quantum computer
Martin, A., Candelas, B., Rodríguez-Rozas, Á., Martín-Guerrero, J. D., Chen, X., Lamata, L., Orús, R., Solano, E., & Sanz, M. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013167 · Cited by 100
Nita, L., Smith, L. M., Chancellor, N., & Cramman, H. (2021) · Research in Science & Technological Education · doi:10.1080/02635143.2021.1920905 · Cited by 97
Using Reinforcement Learning to Perform Qubit Routing in Quantum Compilers
Pozzi, M. G., Herbert, S. J., Sengupta, A., & Mullins, R. D. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3520434 · Cited by 70
Penalty methods for a variational quantum eigensolver
Kuroiwa, K., & Nakagawa, Y. O. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013197 · Cited by 84
Kawashima, Y., Lloyd, E., Coons, M. P., Nam, Y., Matsuura, S., Garza, A. J., Johri, S., Huntington, L. M. J., Senicourt, V., Maksymov, A., et al. (2021) · Communications Physics · doi:10.1038/s42005-021-00751-9 · Cited by 84
Is quantum computing green? An estimate for an energy-efficiency quantum advantage
Jaschke, D., & Montangero, S. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acae3e · Cited by 94
Quantum-classical convolutional neural networks in radiological image classification
Matic, A., Monnet, M., Lorenz, J. M., Schachtner, B. M., & Messerer, T. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00024 · Cited by 97
Quantum machine learning of large datasets using randomized measurements
Haug, T., Self, C. N., & Kim, M. S. (2023) · Machine Learning Science and Technology · doi:10.1088/2632-2153/acb0b4 · Cited by 117
Controlling Entanglement at Absorbing State Phase Transitions in Random Circuits
Sierant, P., & Turkeshi, X. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.120402 · Cited by 83
Quantum Crosstalk Robust Quantum Control
Zhou, Z., Sitler, R., Oda, Y., Schultz, K., & Quiroz, G. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.210802 · Cited by 99
Computational Investigations of the Lithium Superoxide Dimer Rearrangement on Noisy Quantum Devices
Gao, Q., Nakamura, H., Gujarati, T. P., Jones, G. O., Rice, J. E., Wood, S. P., Pistoia, M., Garcia, J. M., & Yamamoto, N. (2021) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.0c09530 · Cited by 60
Balanced k-means clustering on an adiabatic quantum computer
Arthur, D., & Date, P. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03240-8 · Cited by 69
Hamiltonian simulation algorithms for near-term quantum hardware
Clinton, L., Bausch, J., & Cubitt, T. S. (2021) · Nature Communications · doi:10.1038/s41467-021-25196-0 · Cited by 123
Towards practical applications in quantum computational biology
Fedorov, A. K., & Gelfand, M. S. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00024-z · Cited by 62
Pulser: An open-source package for the design of pulse sequences in programmable neutral-atom arrays
Silvério, H., Grijalva, S., Dalyac, C., Leclerc, L., Karalekas, P. J., Shammah, N., Beji, M., Henry, L.-P., & Henriet, L. (2022) · Quantum · doi:10.22331/q-2022-01-24-629 · Cited by 121
QDNN: deep neural networks with quantum layers
Zhao, C., & Gao, X.-S. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00046-w · Cited by 100
Extending quantum probabilistic error cancellation by noise scaling
Mari, A., Shammah, N., & Zeng, W. J. (2021) · Physical Review A · doi:10.1103/physreva.104.052607 · Cited by 63
Engineering Reflective Metasurfaces With Ising Hamiltonian and Quantum Annealing
Ross, C., Gradoni, G., Lim, Q. J., & Peng, Z. (2021) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2021.3137424 · Cited by 71
Mutation Testing of Quantum Programs: A Case Study With Qiskit
Fortunato, D., Campos, J., & Abreu, R. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3195061 · Cited by 94
Strong–laser–field physics, non–classical light states and quantum information science
Bhattacharya, U., Lamprou, T., Maxwell, A., Ordóñez-Lasso, A. F., Pisanty, E., Rivera-Dean, J., Stammer, P., Ciappina, M. F., Lewenstein, M., & Tzallas, P. (2023) · Reports on Progress in Physics · doi:10.1088/1361-6633/acea31 · Cited by 88
Baseri, Y., Chouhan, V., & Hafid, A. S. (2024) · Computers & Security · doi:10.1016/j.cose.2024.103883 · Cited by 110
Devadas, R. M., & Sowmya, T. (2025) · MethodsX · doi:10.1016/j.mex.2025.103318 · Cited by 93
Digitizing gauge fields: Lattice Monte Carlo results for future quantum computers
Hackett, D. C., Howe, K., Hughes, C., Jay, W. I., Neil, E. T., & Simone, J. N. (2019) · Physical Review A · doi:10.1103/physreva.99.062341 · Cited by 87
Hamiltonian learning for quantum error correction
Valenti, A., van Nieuwenburg, E., Huber, S. D., & Greplová, E. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.033092 · Cited by 81
Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels
Cai, Z., & Benjamin, S. C. (2019) · Scientific Reports · doi:10.1038/s41598-019-46722-7 · Cited by 124
Optimal resource cost for error mitigation
Takagi, R. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033178 · Cited by 93
Fujii, K., Mizuta, K., Ueda, H., Mitarai, K., Mizukami, W., & Nakagawa, Y. O. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010346 · Cited by 111
Many-Body Quantum Teleportation via Operator Spreading in the Traversable Wormhole Protocol
Schuster, T., Kobrin, B., Gao, P., Cong, I., Khabiboulline, E. T., Linke, N. M., Lukin, M. D., Monroe, C. R., Yoshida, B., & Yao, N. Y. (2022) · Physical Review X · doi:10.1103/physrevx.12.031013 · Cited by 117
Fixed Depth Hamiltonian Simulation via Cartan Decomposition
Kökcü, E., Steckmann, T., Wang, Y., Freericks, J. K., Dumitrescu, E., & Kemper, A. F. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.070501 · Cited by 117
Materials for Silicon Quantum Dots and their Impact on Electron Spin Qubits
Saraiva, A., Lim, W. H., Yang, C. H., Escott, C. C., Laucht, A., & Dzurak, A. S. (2021) · Advanced Functional Materials · doi:10.1002/adfm.202105488 · Cited by 70
Chakraborty, B., Honda, M., Izubuchi, T., Kikuchi, Y., & Tomiya, A. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.105.094503 · Cited by 130
Quantum simulation of the Lindblad equation using a unitary decomposition of operators
Schlimgen, A. W., Head-Marsden, K., Sager-Smith, L. M., Narang, P., & Mazziotti, D. A. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023216 · Cited by 60
Li, W., Huang, Z., Cao, C., Huang, Y., Shuai, Z., Sun, X., Sun, J., Yuan, X., & Lv, D. (2022) · Chemical Science · doi:10.1039/d2sc01492k · Cited by 60
Yen, T.-C., Ganeshram, A., & Izmaylov, A. F. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00683-y · Cited by 116
Application of quantum approximate optimization algorithm to job shop scheduling problem
Kurowski, K., Pecyna, T., Slysz, M., Różycki, R., Waligóra, G., & Węglarz, J. (2023) · European Journal of Operational Research · doi:10.1016/j.ejor.2023.03.013 · Cited by 98
Critical Schrödinger Cat Qubit
Gravina, L., Minganti, F., & Savona, V. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020337 · Cited by 75
Antenna systems for IoT applications: a review
Khan, S., Mazhar, T., Shahzad, T., et al. (2024) · Discover Sustainability · doi:10.1007/s43621-024-00638-z · Cited by 61
Scalar quantum field theories as a benchmark for near-term quantum computers
Aydeniz, K. Y., Dumitrescu, E., McCaskey, A., Bennink, R. S., Pooser, R. C., & Siopsis, G. (2019) · Physical Review A · doi:10.1103/physreva.99.032306 · Cited by 74
Bridging Classical and Quantum with SDP initialized warm-starts for QAOA
Tate, R., Farhadi, M., Herold, C., Mohler, G., & Gupta, S. (2020) · arXiv · doi:10.48550/arxiv.2010.14021 · Cited by 61
Quantum Natural Language Processing on Near-Term Quantum Computers
Meichanetzidis, K., Gogioso, S., de Felice, G., Chiappori, N., Toumi, A., & Coecke, B. (2021) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.340.11 · Cited by 143
Circuit Depth Reduction for Gate-Model Quantum Computers
Gyöngyösi, L., & Imre, S. (2020) · Scientific Reports · doi:10.1038/s41598-020-67014-5 · Cited by 73
Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
Lacroix, N., Hellings, C., Andersen, C. K., Paolo, A. D., Remm, A., Lazar, S., Krinner, S., Norris, G. J., Gabureac, M. S., Heinsoo, J., et al. (2020) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000464528 · Cited by 59
QuCloud: A New Qubit Mapping Mechanism for Multi-programming Quantum Computing in Cloud Environment
Liu, L., & Dou, X. (2021) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca51647.2021.00024 · Cited by 113
Asthana, A., Kumar, A., Abraham, V., Grimsley, H. R., Zhang, Y., Cincio, Ł., Tretiak, S., Dub, P. A., Economou, S. E., Barnes, E., et al. (2023) · Chemical Science · doi:10.1039/d2sc05371c · Cited by 89
Colloquium : Advances in automation of quantum dot devices control
Zwolak, J. P., & Taylor, J. M. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.011006 · Cited by 87
Quantum recurrent neural networks for sequential learning
Li, Y., Wang, Z., Han, R., Shi, S., Li, J., Shang, R., Zheng, H., Zhong, G., & Gu, Y. (2023) · Neural Networks · doi:10.1016/j.neunet.2023.07.003 · Cited by 112
Quantum computing and industrial information integration: A review
Lu, Y., Sigov, A., Ratkin, L., Ivanov, L. A., & Zuo, M. (2023) · Journal of Industrial Information Integration · doi:10.1016/j.jii.2023.100511 · Cited by 102
Quantum codes for quantum simulation of fermions on a square lattice of qubits
Steudtner, M., & Wehner, S. (2019) · Physical Review A · doi:10.1103/physreva.99.022308 · Cited by 59
Simulating Many-Body Systems with a Projective Quantum Eigensolver
Stair, N. H., & Evangelista, F. A. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030301 · Cited by 60
"Quantum Supremacy" and the Complexity of Random Circuit Sampling
Bouland, A., Fefferman, B., Nirkhe, C., & Vazirani, U. V. (2018) · arXiv (Cornell University) · doi:10.4230/lipics.itcs.2019.15 · Cited by 57
Decoding algorithms for surface codes
deMarti iOlius, A., Fuentes, P., Orús, R., Crespo, P. M., & Etxezarreta Martinez, J. (2024) · Quantum · doi:10.22331/q-2024-10-10-1498 · Cited by 60
“Many of the errors arise due to similar limits in the equipment being used for preparing , controlling or measuring such quantum mechanical systems, and it may seem that dealing with errors suffered by qubits is an engineering problem (Fowler et al., 2012; Preskill, 2018).”
BackgroundSimulation of qubit quantum circuits via Pauli propagation
Rall, P., Liang, D., Cook, J., & Kretschmer, W. (2019) · Physical Review A · doi:10.1103/physreva.99.062337 · Cited by 135
The emerging role of computational design in peptide macrocycle drug discovery
Mulligan, V. K. (2020) · Expert Opinion on Drug Discovery · doi:10.1080/17460441.2020.1751117 · Cited by 58
Quantum Image Processing: Opportunities and Challenges
Ruan, Y., Xue, X., & Shen, Y. (2021) · Mathematical Problems in Engineering · doi:10.1155/2021/6671613 · Cited by 78
Deep-Neural-Network Discrimination of Multiplexed Superconducting-Qubit States
Lienhard, B., Vepsäläinen, A. P., Govia, L. C. G., Hoffer, C. R., Qiu, J. Y., Ristè, D., Ware, M., Kim, D. K., Winik, R., Melville, A. J., et al. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.014024 · Cited by 85
Expanding Data Encoding Patterns For Quantum Algorithms
Weigold, M., Barzen, J., Leymann, F., & Salm, M. (2021) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c52384.2021.00025 · Cited by 90
Quantum Computing Opportunities in Renewable Energy
Giani, A., & Eldredge, Z. (2021) · SN Computer Science · doi:10.1007/s42979-021-00786-3 · Cited by 82
Teaching Quantum Computing to High-School-Aged Youth: A Hands-On Approach
Angara, P. P., Stege, U., MacLean, A., Müller, H. A., & Markham, T. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3127503 · Cited by 83
Solving Graph Problems Using Gaussian Boson Sampling
Deng, Y., Gong, S.-Q., Gu, Y.-C., Zhang, Z.-J., Liu, H.-L., Su, H., Tang, H., Xu, J.-M., Jia, M.-H., Chen, M.-C., et al. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.190601 · Cited by 90
Real-time decoding for fault-tolerant quantum computing: progress, challenges and outlook
Battistel, F., Chamberland, C., Johar, K., Overwater, R. W. J., Sebastiano, F., Skorić, L., Ueno, Y., & Usman, M. (2023) · Nano Futures · doi:10.1088/2399-1984/aceba6 · Cited by 166
Mueller, N., Carolan, J., Connelly, A., Davoudi, Z., Dumitrescu, E., & Aydeniz, K. Y. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.030323 · Cited by 99
Universal Sampling Lower Bounds for Quantum Error Mitigation
Takagi, R., Tajima, H., & Gu, M. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.210602 · Cited by 140
Towards near-term quantum simulation of materials
Clinton, L., Cubitt, T. S., Flynn, B., Gambetta, F. M., Klassen, J., Montanaro, A., Piddock, S., Santos, R. A., & Sheridan, E. (2024) · Nature Communications · doi:10.1038/s41467-023-43479-6 · Cited by 118
Challenges in Scaling-up the Control Interface of a Quantum Computer
Reilly, D. J. (2019) · Technical digest - International Electron Devices Meeting/Technical digest · doi:10.1109/iedm19573.2019.8993497 · Cited by 98
Measurement error mitigation in quantum computers through classical bit-flip correction
Funcke, L., Hartung, T., Jansen, K., Kühn, S., Stornati, P., & Wang, X. (2022) · Physical Review A · doi:10.1103/physreva.105.062404 · Cited by 111
The Quantum software lifecycle
Weder, B., Barzen, J., Leymann, F., Salm, M., & Vietz, D. (2020) · doi:10.1145/3412451.3428497 · Cited by 85
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.