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 401–500 of 8,640
Theory for Equivariant Quantum Neural Networks
Nguyen, Q. T., Schatzki, L., Braccia, P., Ragone, M., Coles, P. J., Sauvage, F., Larocca, M., & Cerezo, M. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020328 · Cited by 233
Efficient Long-Range Entanglement Using Dynamic Circuits
Bäumer, E., Tripathi, V., Wang, D. S., Rall, P., Chen, E. H., Majumder, S., Seif, A., & Minev, Z. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030339 · Cited by 191
Multistart Methods for Quantum Approximate optimization
Shaydulin, R., Safro, I., & Larson, J. (2019) · 2019 IEEE High Performance Extreme Computing Conference (HPEC) · doi:10.1109/hpec.2019.8916288 · Cited by 110
Aydeniz, K. Y., Pooser, R. C., & Siopsis, G. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00290-1 · Cited by 150
A Tutorial on Quantum Approximate Optimization Algorithm (QAOA): Fundamentals and Applications
Choi, J., & Kim, J. (2019) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc46691.2019.8939749 · Cited by 178
Advanced Equivalence Checking for Quantum Circuits
Burgholzer, L., & Wille, R. (2020) · Springer eBooks · doi:10.1007/978-3-032-06770-8_14 · Cited by 141
Prospect of Spin-Orbitronic Devices and Their Applications
Cao, Y. H., Xing, G., Lin, H., Zhang, N., Zheng, H., & Wang, K. (2020) · iScience · doi:10.1016/j.isci.2020.101614 · Cited by 119
Digitized-counterdiabatic quantum approximate optimization algorithm
Chandarana, P., Hegade, N. N., Paul, K., Albarrán-Arriagada, F., Solano, E., del Campo, A., & Chen, X. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013141 · Cited by 159
Semantic Communication: A Survey on Research Landscape, Challenges, and Future Directions
Getu, T. M., Kaddoum, G., & Bennis, M. (2024) · Proceedings of the IEEE · doi:10.1109/jproc.2024.3520707 · Cited by 110
Automated distribution of quantum circuits via hypergraph partitioning
Andrés-Martínez, P., & Heunen, C. (2019) · Physical Review A · doi:10.1103/physreva.100.032308 · Cited by 167
Negîrneac, V., Ali, H., Muthusubramanian, N., Battistel, F., Sagastizabal, R., Moreira, M. S., Marques, J. F., Vlothuizen, W. J., Beekman, M., Zachariadis, C., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.220502 · Cited by 110
Benchmarking the quantum approximate optimization algorithm
Willsch, M., Willsch, D., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2020) · RWTH Publications (RWTH Aachen) · Cited by 109
Theory of Quantum System Certification
Kliesch, M., & Roth, I. (2021) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-32392 · Cited by 109
Quantum Krylov subspace algorithms for ground- and excited-state energy estimation
Cortes, C. L., & Gray, S. K. (2022) · Physical Review A · doi:10.1103/physreva.105.022417 · Cited by 175
Quantum Neural Networks: Concepts, Applications, and Challenges
Kwak, Y., Yun, W. J., Jung, S., & Kim, J. (2021) · International Conference on Ubiquitous and Future Networks · doi:10.1109/icufn49451.2021.9528698 · Cited by 162
Low-loss interconnects for modular superconducting quantum processors
Niu, J., Zhang, L., Liu, Y., Qiu, J., Huang, W., Huang, J., Jia, H., Liu, J., Tao, Z., Wei, W., et al. (2023) · Nature Electronics · doi:10.1038/s41928-023-00925-z · Cited by 172
Ball, H., Biercuk, M. J., Carvalho, A. R. R., Chen, J., Hush, M., de Castro, L. A., Li, L., Liebermann, P., Slatyer, H. J., Edmunds, C., et al. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abdca6 · Cited by 156
Temporal Information Processing on Noisy Quantum Computers
Chen, J., Nurdin, H. I., & Yamamoto, N. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.024065 · Cited by 168
Efficient quantum circuits for quantum computational chemistry
Yordanov, Y. S., Arvidsson-Shukur, D. R. M., & Barnes, C. H. W. (2020) · Physical Review A · doi:10.1103/physreva.102.062612 · Cited by 107
One decade of quantum optimal control in the chopped random basis
Müller, M. M., Said, R. S., Jelezko, F., Calarco, T., & Montangero, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac723c · Cited by 181
Herrmann, J., Masot-Llima, S., Remm, A., Zapletal, P., McMahon, N. A., Scarato, C., Swiadek, F., Andersen, C. K., Hellings, C., Krinner, S., et al. (2022) · Nature Communications · doi:10.1038/s41467-022-31679-5 · Cited by 171
Hybrid Quantum–Classical Generative Adversarial Network for High-Resolution Image Generation
Tsang, S. L., West, M. T., Erfani, S., & Usman, M. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3319319 · Cited by 148
Expressibility of the alternating layered ansatz for quantum computation
Nakaji, K., & Yamamoto, N. (2021) · Quantum · doi:10.22331/q-2021-04-19-434 · Cited by 119
Nanomaterials for Quantum Information Science and Engineering
Alfieri, A., Anantharaman, S. B., Zhang, H., & Jariwala, D. (2022) · Advanced Materials · doi:10.1002/adma.202109621 · Cited by 121
Measuring magic on a quantum processor
Oliviero, S. F. E., Leone, L., Hamma, A., & Lloyd, S. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00666-5 · Cited by 186
Recent Advances for Quantum Neural Networks in Generative Learning
Tian, J., Sun, X., Du, Y., Zhao, S., Liu, Q., Zhang, K., Yi, W., Huang, W., Wang, C., Wu, X., et al. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2023.3272029 · Cited by 111
Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule
Banchi, L., & Crooks, G. E. (2020) · arXiv · doi:10.48550/arxiv.2005.10299 · Cited by 107
Quantum machine learning in high energy physics
Guan, W., Perdue, G., Pesah, A. C., Schuld, M., Terashi, K., Vallecorsa, S., & Vlimant, J.-R. (2021) · Machine Learning Science and Technology · doi:10.1088/2632-2153/abc17d · Cited by 191
Anomaly detection in high-energy physics using a quantum autoencoder
Ngairangbam, V. S., Spannowsky, M., & Takeuchi, M. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.105.095004 · Cited by 136
Quantum Computing Review: A Decade of Research
Sood, S. K., & Pooja (2023) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2023.3284689 · Cited by 154
Mitigating Realistic Noise in Practical Noisy Intermediate-Scale Quantum Devices
Sun, J., Yuan, X., Tsunoda, T., Vedral, V., Benjamin, S. C., & Endo, S. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.034026 · Cited by 105
Universal Fast-Flux Control of a Coherent, Low-Frequency Qubit
Zhang, H., Chakram, S., Roy, T., Earnest, N., Lu, Y., Huang, Z., Weiss, D., Koch, J., & Schuster, D. (2021) · University of Chicago · doi:10.6082/1j995-c5a34 · Cited by 117
High-fidelity spin qubit operation and algorithmic initialization above 1 K
Huang, J. Y., Su, R. Y., Lim, W. H., Feng, M., van Straaten, B., Severin, B., Gilbert, W., Stuyck, N. D., Tanttu, T., Serrano, S., et al. (2024) · Nature · doi:10.1038/s41586-024-07160-2 · Cited by 193
Decoding quantum errors with subspace expansions
McClean, J. R., Zhang, J., Rubin, N. C., Babbush, R., & Neven, H. (2020) · RePEc: Research Papers in Economics · Cited by 105
Scalable Measures of Magic Resource for Quantum Computers
Haug, T., & Kim, M. S. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010301 · Cited by 104
“Rapid progress has been made in experimental demonstrations of noisy intermediate-scale quantum computers [30, 31] and fault-tolerant quantum computers [32– 35].”
$O(N^3)$ Measurement Cost for Variational Quantum Eigensolver on Molecular Hamiltonians
Gokhale, P., Angiuli, O., Ding, Y., Gui, K., Tomesh, T., Suchara, M., Martonosi, M., & Chong, F. T. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3035814 · Cited by 104
“The present Noisy Intermediate-Scale Quantum (NISQ) era [1] is distinguished by the advent of quantum computers comprising tens of qubits, with hundreds of qubits expected in the next five years.”
BackgroundDigital-analog quantum computation
Parra-Rodriguez, A., Lougovski, P., Lamata, L., Solano, E., & Sanz, M. (2020) · Physical Review A · doi:10.1103/physreva.101.022305 · Cited by 104
“In this context, the ability of quantum systems to solve problems beyond the reach of any current classical computer is known as quantum supremacy [13, 14].”
BackgroundError-mitigated quantum gates exceeding physical fidelities in a trapped-ion system
Zhang, S., Lu, Y., Zhang, K., Chen, W., Li, Y., Zhang, J.-N., & Kim, K. (2020) · Nature Communications · doi:10.1038/s41467-020-14376-z · Cited by 104
Quantum adversarial machine learning
Lu, S., Duan, L., & Deng, D. (2020) · MPG.PuRe (Max Planck Society) · Cited by 105
Counterdiabaticity and the quantum approximate optimization algorithm
Wurtz, J., & Love, P. J. (2022) · Quantum · doi:10.22331/q-2022-01-27-635 · Cited by 165
Adaptive Variational Quantum Dynamics Simulations
Yao, Y., Gomes, N., Zhang, F., Wang, C., Ho, K., Iadecola, T., & Orth, P. P. (2021) · Iowa State University Digital Repository (Iowa State University) · Cited by 104
Variational quantum reinforcement learning via evolutionary optimization
Chen, S. Y.-C., Huang, C.-M., Hsing, C.-W., Goan, H., & Kao, Y.-J. (2022) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ac4559 · Cited by 151
$O(N^3)$ Measurement Cost for Variational Quantum Eigensolver on Molecular Hamiltonians
Gokhale, P., & Chong, F. T. (2019) · arXiv · doi:10.48550/arxiv.1908.11857 · Cited by 104
Benchmarking a trapped-ion quantum computer with 30 qubits
Chen, J.-S., Nielsen, E., Ebert, M., Inlek, V., Wright, K., Chaplin, V., Maksymov, A., Páez, E., Poudel, A., Maunz, P., et al. (2024) · Quantum · doi:10.22331/q-2024-11-07-1516 · Cited by 103
“Currently, state-of-the-art systems transit the noisy intermediate-scale quantum (NISQ) [10] regime, where contemporary quantum processing units (QPUs) have dozens or hundreds, rather than a handful, of qubits.”
BackgroundMachine-Learning Quantum States in the NISQ Era
Torlai, G., & Melko, R. G. (2020) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031119-050651 · Cited by 103
Stark Many-Body Localization on a Superconducting Quantum Processor
Guo, Q., Cheng, C., Li, H., Xu, S., Zhang, P., Wang, Z., Song, C., Liu, W., Ren, W., Dong, H., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.240502 · Cited by 152
MaxCut quantum approximate optimization algorithm performance guarantees for p>1
Wurtz, J., & Love, P. (2021) · Physical Review A · doi:10.1103/physreva.103.042612 · Cited by 103
A comparison of various classical optimizers for a variational quantum linear solver
Pellow-Jarman, A., Sinayskiy, I., Pillay, A. W., & Petruccione, F. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03140-x · Cited by 147
Performance comparison of optimization methods on variational quantum algorithms
Bonet-Monroig, X., Wang, H., Vermetten, D., Senjean, B., Moussa, C., Bäck, T., Dunjko, V., & O'Brien, T. E. (2023) · Physical Review A · doi:10.1103/physreva.107.032407 · Cited by 107
Forging the Future: Strategic Approaches to Quantum AI Integration for Industry Transformation
How, M.-L., & Cheah, S.-M. (2024) · AI · doi:10.3390/ai5010015 · Cited by 155
A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
Niu, S., Suau, A., Staffelbach, G., & Todri-Sanial, A. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3026544 · Cited by 103
“The aforementioned quantum hardware can already be qualified as noisy intermediate-scale quantum (NISQ) hardware [12].”
BackgroundEarly Fault-Tolerant Quantum Computing
Katabarwa, A., Gratsea, K., Caesura, A., & Johnson, P. D. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020101 · Cited by 103
“This way of using a QPU is what is characteristic of the so called NISQ era [40].”
BackgroundMethodInfluentialUniversal variational quantum computation
Biamonte, J. (2021) · Physical Review A · doi:10.1103/physreva.103.l030401 · Cited by 102
Beyond quantum supremacy: the hunt for useful quantum computers
Brooks, M. (2019) · Nature · doi:10.1038/d41586-019-02936-3 · Cited by 146
Implementation of XY entangling gates with a single calibrated pulse
Abrams, D. M., Didier, N., Johnson, B. R., Silva, M. P. D., & Ryan, C. A. (2020) · Nature Electronics · doi:10.1038/s41928-020-00498-1 · Cited by 156
Parity-Protected Superconductor-Semiconductor Qubit
Larsen, T. W., Gershenson, M. E., Casparis, L., Kringhøj, A., Pearson, N., McNeil, R. P. G., Kuemmeth, F., Krogstrup, P., Petersson, K. D., & Marcus, C. M. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.056801 · Cited by 102
Dual-Element, Two-Dimensional Atom Array with Continuous-Mode Operation
Singh, K., Anand, S., Pocklington, A., Kemp, J. T., & Bernien, H. (2022) · Physical Review X · doi:10.1103/physrevx.12.011040 · Cited by 105
Quantum Algorithms for Deep Convolutional Neural Networks
Kerenidis, I., Landman, J., & Prakash, A. (2019) · arXiv · doi:10.48550/arxiv.1911.01117 · Cited by 102
“These approaches are interesting in the context of NISQ (Noisy Intermediate Scale Quantum) devices [21], however more work is needed in order to provide evidence that such techniques can outperform classical neural networks.”
BackgroundOptimized Entanglement Purification
Krastanov, S., Albert, V. V., & Jiang, L. (2019) · Quantum · doi:10.22331/q-2019-02-18-123 · Cited by 137
$$ T\overline{T} $$ and EE, with implications for (A)dS subregion encodings
Lewkowycz, A., Liu, J., Silverstein, E., & Torroba, G. (2020) · Journal of High Energy Physics · doi:10.1007/jhep04(2020)152 · Cited by 100
Efficient classical simulation of noisy random quantum circuits in one dimension
Noh, K., Jiang, L., & Fefferman, B. (2020) · Quantum · doi:10.22331/q-2020-09-11-318 · Cited by 174
Chia, N.-H., Gilyén, A., Li, T., Lin, H.-H., Tang, E., & Wang, C. (2020) · Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3357713.3384314 · Cited by 99
Quantum simulation of nonequilibrium dynamics and thermalization in the Schwinger model
de Jong, W. A., Lee, K., Mulligan, J. D., Ploskon, M. A., Ringer, F., & Yao, X. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.106.054508 · Cited by 154
Theory of Free Fermions under Random Projective Measurements
Poboiko, I., Pöpperl, P., Gornyi, I. V., & Mirlin, A. D. (2023) · Physical Review X · doi:10.1103/physrevx.13.041046 · Cited by 161
Quantum computing for near-term applications in generative chemistry and drug discovery.
Pyrkov, A., Aliper, A., Bezrukov, D., Lin, Y.-C., Polykovskiy, D., Kamya, P., Ren, F., & Zhavoronkov, A. (2023) · Drug Discovery Today · doi:10.1016/j.drudis.2023.103675 · Cited by 100
Tannu, S. S., & Qureshi, M. (2019) · Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3352460.3358257 · Cited by 100
Compiling SU(4) quantum circuits to IBM QX architectures
Zulehner, A., & Wille, R. (2019) · Proceedings of the 24th Asia and South Pacific Design Automation Conference · doi:10.1145/3287624.3287704 · Cited by 100
Quantum optimization with a novel Gibbs objective function and ansatz architecture search
Li, L., Fan, M., Coram, M., Riley, P., & Leichenauer, S. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023074 · Cited by 98
“The QAOA and related algorithms offer a promising avenue for near-term applications of quantum computers [6], though it is not yet clear if a quantum advantage is achievable in a practical use case.”
BackgroundMany-Body Physics in the NISQ Era: Quantum Programming a Discrete Time Crystal
Ippoliti, M., Kechedzhi, K., Moessner, R., Sondhi, S. L., & Khemani, V. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030346 · Cited by 132
Quantum Power Method by a Superposition of Time-Evolved States
Seki, K., & Yunoki, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010333 · Cited by 144
Quantum Federated Learning with Quantum Data
Chehimi, M. M., & Saad, W. (2022) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp43922.2022.9746622 · Cited by 164
Encoding patterns for quantum algorithms
Weigold, M., Barzen, J., Leymann, F., & Salm, M. (2021) · IET Quantum Communication · doi:10.1049/qtc2.12032 · Cited by 133
Disentangling Scrambling and Decoherence via Quantum Teleportation
Yoshida, B., & Yao, N. Y. (2019) · Physical Review X · doi:10.1103/physrevx.9.011006 · Cited by 187
A quantum-classical cloud platform optimized for variational hybrid algorithms
Karalekas, P. J., Tezak, N. A., Peterson, E. C., Ryan, C. A., da Silva, M. P., & Smith, R. S. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab7559 · Cited by 99
Genetic algorithms as classical optimizer for the Quantum Approximate Optimization Algorithm
Acampora, G., Chiatto, A., & Vitiello, A. (2023) · Applied Soft Computing · doi:10.1016/j.asoc.2023.110296 · Cited by 116
Calculating energy derivatives for quantum chemistry on a quantum computer
O’Brien, T. E., Senjean, B., Sagastizabal, R., Bonet-Monroig, X., Dutkiewicz, A., Buda, F., DiCarlo, L., & Visscher, L. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0213-4 · Cited by 82
Quantum machine learning: from physics to software engineering
Melnikov, A. A., Kordzanganeh, M., Alodjants, A. P., & Lee, R. (2023) · Advances in Physics X · doi:10.1080/23746149.2023.2165452 · Cited by 180
Defining the quantum workforce landscape: a review of global quantum education initiatives
Kaur, M., & Venegas-Gomez, A. (2022) · Optical Engineering · doi:10.1117/1.oe.61.8.081806 · Cited by 98
Jastrow-type Decomposition in Quantum Chemistry for Low-Depth Quantum Circuits
Matsuzawa, Y., & Kurashige, Y. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b00963 · Cited by 97
Koh, D. E., & Grewal, S. (2022) · Quantum · doi:10.22331/q-2022-08-16-776 · Cited by 97
Huang, H.-L., Xu, X., Guo, C., Tian, G., Wei, S.-J., Sun, X., Bao, W., & Long, G. (2023) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-022-2057-y · Cited by 143
Landauer Versus Nernst: What is the True Cost of Cooling a Quantum System?
Taranto, P., Bakhshinezhad, P., Blühm, A., Silva, R., Friis, N., Lock, M. P. E., Vitagliano, G., Binder, F. C., Debarba, T., Schwarzhans, E., et al. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010332 · Cited by 144
Generation of High-Resolution Handwritten Digits with an Ion-Trap Quantum Computer
Rudolph, M. S., Toussaint, N. B., Katabarwa, A., Johri, S., Peropadre, B., & Perdomo-Ortiz, A. (2020) · arXiv · doi:10.48550/arxiv.2012.03924 · Cited by 97
Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule
Banchi, L., & Crooks, G. E. (2021) · Quantum · doi:10.22331/q-2021-01-25-386 · Cited by 96
Qubit-excitation-based adaptive variational quantum eigensolver
Yordanov, Y. S., Armaos, V., Barnes, C. H., & Arvidsson-Shukur, D. R. M. (2021) · Apollo (University of Cambridge) · doi:10.17863/cam.75907 · Cited by 95
High-fidelity three-qubit iToffoli gate for fixed-frequency superconducting qubits
Kim, Y., Morvan, A., Nguyen, L. B., Naik, R., Jünger, C., Chen, L., Kreikebaum, J. M., Santiago, D., & Siddiqi, I. A. (2022) · Nature Physics · doi:10.1038/s41567-022-01590-3 · Cited by 146
Chen, S., Cotler, J. S., Huang, H.-Y., & Li, J. Z. (2023) · Nature Communications · doi:10.1038/s41467-023-41217-6 · Cited by 215
Simple Mitigation of Global Depolarizing Errors in Quantum Simulations
Vovrosh, J., Khosla, K. E., Greenaway, S., Self, C., Kim, M., & Knolle, J. (2021) · arXiv · doi:10.48550/arxiv.2101.01690 · Cited by 96
Effects of Quantum Noise on Quantum Approximate Optimization Algorithm
Xue, C., Chen, Z.-Y., Wu, Y.-C., & Guo, G.-P. (2019) · arXiv · doi:10.48550/arxiv.1909.02196 · Cited by 96
A survey on HHL algorithm: From theory to application in quantum machine learning
Duan, B., Yuan, J., Yu, C., Huang, J., & Hsieh, C. (2020) · Physics Letters A · doi:10.1016/j.physleta.2020.126595 · Cited by 120
Quantum Computing: An Introduction for Microwave Engineers
Bardin, J. C., Sank, D., Naaman, O., & Jeffrey, E. R. (2020) · IEEE Microwave Magazine · doi:10.1109/mmm.2020.2993475 · Cited by 111
Cybersecurity Challenges Associated With the Internet of Things in a Post-Quantum World
Althobaiti, O. S., & Döhler, M. (2020) · IEEE Access · doi:10.1109/access.2020.3019345 · Cited by 122
García-Pérez, G., Rossi, M. A. C., Sokolov, B., Tacchino, F., Barkoutsos, P. K., Mazzola, G., Tavernelli, I., & Maniscalco, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040342 · Cited by 137
Preparations for quantum simulations of quantum chromodynamics in 1+1 dimensions. I. Axial gauge
Farrell, R. C., Chernyshev, I. A., Powell, S. J. M., Zemlevskiy, N. A., Illa, M., & Savage, M. J. (2023) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.107.054512 · Cited by 178
Non-Gaussian noise spectroscopy with a superconducting qubit sensor
Sung, Y., Beaudoin, F., Norris, L., Yan, F., Kim, D. K., Qiu, J. Y., von Lüpke, U., Yoder, J., Orlando, T. P., Gustavsson, S., et al. (2019) · Nature Communications · doi:10.1038/s41467-019-11699-4 · Cited by 140
Optimal Remote Entanglement Distribution
Dai, W., Peng, T., & Win, M. Z. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.2969005 · Cited by 116
Topological Quantum Compiling with Reinforcement Learning
Zhang, Y., Zheng, P.-L., Zhang, Y., & Deng, D.-L. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.170501 · Cited by 136
Simple mitigation of global depolarizing errors in quantum simulations
Vovrosh, J., Khosla, K. E., Greenaway, S., Self, C., Kim, M. S., & Knolle, J. (2021) · Physical Review E · doi:10.1103/physreve.104.035309 · Cited by 94
A perspective on scaling up quantum computation with molecular spins
Carretta, S., Zueco, D., Chiesa, A., Gómez-León, Á., & Luis, F. (2021) · Applied Physics Letters · doi:10.1063/5.0053378 · Cited by 102
Recent advances for quantum classifiers
Li, W., & Deng, D.-L. (2021) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-021-1793-6 · Cited by 137
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.