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 201–300 of 8,640
Ajagekar, A., Humble, T., & You, F. (2020) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.106630 · Cited by 191
“QC’s major applications can be perceived in areas of optimization, machine learning, cryptography, and quantum chemistry [16].”
BackgroundEfficient quantum measurement of Pauli operators in the presence of finite sampling error
Crawford, O., Straaten, B. V., Wang, D., Parks, T., Campbell, E., & Brierley, S. (2021) · Quantum · doi:10.22331/q-2021-01-20-385 · Cited by 188
Maciejewski, F., Zimborás, Z., & Oszmaniec, M. (2020) · Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) · Cited by 184
Open source software in quantum computing
Fingerhuth, M., Babej, T., & Wittek, P. (2018) · PLOS ONE · doi:10.1371/journal.pone.0208561 · Cited by 185
Solving nonlinear differential equations with differentiable quantum circuits
Kyriienko, O., Paine, A. E., & Elfving, V. E. (2021) · Physical Review A · doi:10.1103/physreva.103.052416 · Cited by 185
Symmetry-resolved entanglement detection using partial transpose moments
Neven, A., Carrasco, J., Vitale, V., Kokail, C., Elben, A., Dalmonte, M., Calabrese, P., Zoller, P., Vermersch, B., Kueng, R., et al. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00487-y · Cited by 195
Optimal metrology with programmable quantum sensors
Marciniak, C. D., Feldker, T., Pogorelov, I., Kaubruegger, R., Vasilyev, D. V., van Bijnen, R., Schindler, P., Zoller, P., Blatt, R., & Monz, T. (2022) · Nature · doi:10.1038/s41586-022-04435-4 · Cited by 185
“at advantage’ in computation and simulation on near-term hardware [15].”
BackgroundMethodQuantum circuit architecture search for variational quantum algorithms
Du, Y., Huang, T., You, S., Hsieh, M.-H., & Tao, D. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00570-y · Cited by 184
Solving nonlinear differential equations with differentiable quantum circuits
Kyriienko, O., Paine, A. E., & Elfving, V. E. (2020) · arXiv · doi:10.48550/arxiv.2011.10395 · Cited by 185
QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation
Li, A., Stein, S., Krishnamoorthy, S., & Ang, J. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3550488 · Cited by 183
A Multireference Quantum Krylov Algorithm for Strongly Correlated Electrons
Stair, N. H., Huang, R., & Evangelista, F. A. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b01125 · Cited by 183
Review on novel methods for lattice gauge theories
Carmen Bañuls, M., & Cichy, K. (2020) · Reports on Progress in Physics · doi:10.1088/1361-6633/ab6311 · Cited by 181
Quantum2FA: Efficient Quantum-Resistant Two-Factor Authentication Scheme for Mobile Devices
Wang, Q., Wang, D., Cheng, C., & He, D. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2021.3129512 · Cited by 178
Strategies for solving the Fermi-Hubbard model on near-term quantum computers
Cade, C., Mineh, L., Montanaro, A., & Stanisic, S. (2020) · Physical Review B · doi:10.1103/physrevb.102.235122 · Cited by 178
Yen, T.-C., Verteletskyi, V., & Izmaylov, A. F. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00008 · Cited by 178
Scaling and networking a modular photonic quantum computer
Aghaee Rad, H., Ainsworth, T., Alexander, R. N., Altieri, B., Askarani, M. F., Baby, R., Banchi, L., Baragiola, B. Q., Bourassa, J. E., Chadwick, R. S., et al. (2025) · Nature · doi:10.1038/s41586-024-08406-9 · Cited by 178
Pathways to cellular supremacy in biocomputing
Grozinger, L., Amos, M., Gorochowski, T. E., Carbonell, P., Oyarzún, D. A., Stoof, R., Fellermann, H., Zuliani, P., Tas, H., & Goñi-Moreno, A. (2019) · Nature Communications · doi:10.1038/s41467-019-13232-z · Cited by 176
Semiconductor quantum computation
Zhang, X., Li, H.-O., Cao, G., Xiao, M., Guo, G.-C., & Guo, G.-P. (2019) · National Science Review · doi:10.1093/nsr/nwy153 · Cited by 176
Quantum phase estimation of multiple eigenvalues for small-scale (noisy) experiments
O’Brien, T. E., Tarasinski, B., & Terhal, B. M. (2019) · New Journal of Physics · doi:10.1088/1367-2630/aafb8e · Cited by 174
Measurement-induced entanglement and teleportation on a noisy quantum processor
Collaborators, G. Q. A. A., Hoke, J. C., Ippoliti, M., Rosenberg, E., Abanin, D., Acharya, R., Andersen, T. I., Ansmann, M., Arute, F., Arya, K., et al. (2023) · Nature · doi:10.1038/s41586-023-06505-7 · Cited by 175
Efficient Estimation of Pauli Observables by Derandomization
Huang, H.-Y., Kueng, R., & Preskill, J. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.030503 · Cited by 175
Self-citationEmerging quantum computing algorithms for quantum chemistry
Motta, M., & Rice, J. E. (2022) · WIREs Computational Molecular Science · doi:10.1002/wcms.1580 · Cited by 173
Theory of overparametrization in quantum neural networks
Larocca, M., Ju, N., García-Martín, D., Coles, P. J., & Cerezo, M. (2023) · Nature Computational Science · doi:10.1038/s43588-023-00467-6 · Cited by 176
NISQ computing: where are we and where do we go?
Lau, J. W. Z., Lim, K. H., Shrotriya, H., & Kwek, L. C. (2022) · AAPPS Bulletin · doi:10.1007/s43673-022-00058-z · Cited by 173
Iterative Qubit Coupled Cluster Approach with Efficient Screening of Generators
Ryabinkin, I. G., Lang, R. A., Genin, S. N., & Izmaylov, A. F. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b01084 · Cited by 170
Understanding Polaritonic Chemistry from Ab Initio Quantum Electrodynamics
Ruggenthaler, M., Sidler, D., & Rubio, A. (2023) · Chemical Reviews · doi:10.1021/acs.chemrev.2c00788 · Cited by 170
Elben, A., Vermersch, B., Roos, C. F., & Zoller, P. (2019) · Physical Review A · doi:10.1103/physreva.99.052323 · Cited by 168
Digitization of scalar fields for quantum computing
Klco, N., & Savage, M. J. (2019) · Physical Review A · doi:10.1103/physreva.99.052335 · Cited by 167
Standard model physics and the digital quantum revolution: thoughts about the interface
Klco, N., Roggero, A., & Savage, M. J. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac58a4 · Cited by 166
Learning a Local Hamiltonian from Local Measurements
Bairey, E., Arad, I., & Lindner, N. H. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.020504 · Cited by 166
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.-L., et al. (2019) · Science Advances · doi:10.1126/sciadv.aav2761 · Cited by 167
A divide-and-conquer algorithm for quantum state preparation
Araujo, I. F., Park, D. K., Petruccione, F., & da Silva, A. J. (2021) · Scientific Reports · doi:10.1038/s41598-021-85474-1 · Cited by 166
Exploiting Symmetry in Variational Quantum Machine Learning
Meyer, J. J., Mularski, M., Gil-Fuster, E., Mele, A. A., Arzani, F., Wilms, A., & Eisert, J. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010328 · Cited by 169
Variational quantum eigensolver with fewer qubits
Liu, J.-G., Zhang, Y.-H., Wan, Y., & Wang, L. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.023025 · Cited by 166
Noise resilience of variational quantum compiling
Sharma, K., Khatri, S., Cerezo, M., & Coles, P. J. (2020) · Civil War Book Review · Cited by 184
Quantum State Tomography with Conditional Generative Adversarial Networks
Ahmed, S., Sánchez Muñoz, C., Nori, F., & Kockum, A. F. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.140502 · Cited by 164
“Our reconstruction method is versatile, general, and ready to be applied for QST of intermediate-scale quantum systems, which are widely explored in current experiments [4].”
MethodQuantum convolutional neural networks for high energy physics data analysis
Chen, S. Y.-C., Wei, T.-C., Zhang, C., Yu, H., & Yoo, S. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013231 · Cited by 167
A Tutorial on Quantum Convolutional Neural Networks (QCNN)
Oh, S., Choi, J., & Kim, J. (2020) · 2020 International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc49870.2020.9289439 · Cited by 166
Quantum Computing and Communications: An Engineering Approach
Imre, S., & Balázs, F. (2004) · Wiley eBooks · doi:10.1002/9780470869048 · Cited by 163
Artificial intelligence and machine learning for quantum technologies
Krenn, M., Landgraf, J., Foesel, T., & Marquardt, F. (2023) · Physical Review A · doi:10.1103/physreva.107.010101 · Cited by 162
“The fields of machine learning [1–3] and quantum technologies [4–7] have a lot in common: Both started out with an amazing vision of applications (in the 1950s and 1980s, respectively), went through a series of challenges, and are currently extremely hot research topics.”
Mitigating Depolarizing Noise on Quantum Computers with Noise-Estimation Circuits
Urbanek, M., Nachman, B., Pascuzzi, V. R., He, A., Bauer, C. W., & de Jong, W. A. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.270502 · Cited by 163
Differentiable quantum architecture search
Zhang, S.-X., Hsieh, C.-Y., Zhang, S., & Yao, H. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac87cd · Cited by 158
Fundamental limits of quantum error mitigation
Takagi, R., Endo, S., Minagawa, S., & Gu, M. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00618-z · Cited by 160
Trainability of Dissipative Perceptron-Based Quantum Neural Networks
Sharma, K., Cerezo, M., Cincio, L., & Coles, P. J. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.180505 · Cited by 159
Villalonga, B., Boixo, S., Nelson, B., Henze, C., Rieffel, E., Biswas, R., & Mandrà, S. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0196-1 · Cited by 156
CutQC: using small Quantum computers for large Quantum circuit evaluations
Tang, W., Tomesh, T., Suchara, M., Larson, J., & Martonosi, M. (2021) · Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3445814.3446758 · Cited by 159
Application-Oriented Performance Benchmarks for Quantum Computing
Lubinski, T., Johri, S., Varosy, P., Coleman, J., Zhao, L., Necaise, J., Baldwin, C. H., Mayer, K., & Proctor, T. (2021) · arXiv · doi:10.48550/arxiv.2110.03137 · Cited by 159
Is the Trotterized UCCSD Ansatz Chemically Well-Defined?
Grimsley, H. R., Claudino, D., Economou, S. E., Barnes, E., & Mayhall, N. J. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b01083 · Cited by 157
Quantum noise protects quantum classifiers against adversaries
Du, Y., Hsieh, M.-H., Liu, T., Tao, D., & Liu, N. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023153 · Cited by 156
Interferometric single-shot parity measurement in InAs–Al hybrid devices
Quantum, M. A., Aghaee, M., Ramirez, A. A., Alam, Z., Ali, R., Andrzejczuk, M., Antipov, A. E., Astafev, M. A., Barzegar, A., Bauer, B., et al. (2025) · Nature · doi:10.1038/s41586-024-08445-2 · Cited by 287
The Born supremacy: quantum advantage and training of an Ising Born machine
Coyle, B., Mills, D., Danos, V., & Kashefi, E. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00288-9 · Cited by 155
“The circuit is kept as shallow as possible so as to be suitable for NISQ devices.”
BackgroundInfluentialQuantum gate teleportation between separated qubits in a trapped-ion processor
Wan, Y., Kienzler, D., Erickson, S. D., Mayer, K. H., Tan, T. R., Wu, J. J., Vasconcelos, H. M., Glancy, S., Knill, E., Wineland, D. J., et al. (2019) · Science · doi:10.1126/science.aaw9415 · Cited by 155
Quantum Conference Key Agreement: A Review
Murta, G., Grasselli, F., Kampermann, H., & Bruß, D. (2020) · Advanced Quantum Technologies · doi:10.1002/qute.202000025 · Cited by 208
Machine learning in the quantum realm: The state-of-the-art, challenges, and future vision
Houssein, E. H., Abohashima, Z., Elhoseny, M., & Mohamed, W. M. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.116512 · Cited by 184
Advances in the quantum internet
Gyöngyösi, L., & Imre, S. (2022) · Communications of the ACM · doi:10.1145/3524455 · Cited by 170
Application-Oriented Performance Benchmarks for Quantum Computing
Lubinski, T., Johri, S., Varosy, P., Coleman, J., Zhao, L., Necaise, J., Baldwin, C. H., Mayer, K., & Proctor, T. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3253761 · Cited by 154
Quantum Criticality Under Decoherence or Weak Measurement
Lee, J. Y., Jian, C., & Xu, C. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.030317 · Cited by 303
Quantum many-body simulations on digital quantum computers: State-of-the-art and future challenges
Fauseweh, B. (2024) · Nature Communications · doi:10.1038/s41467-024-46402-9 · Cited by 152
“Asthehardwareplatformscontinuetoadvance,animportantquestion that arises is whether we can still bene fi t from DQS on current Noisy Intermediate-Scale Quantum (NISQ) devices 53 , notwithstanding their noise limitations.”
Robust Encoding of a Qubit in a Molecule
Albert, V. V., Covey, J. P., & Preskill, J. P. (2020) · Physical Review X · doi:10.1103/physrevx.10.031050 · Cited by 205
Self-citationError correction of a logical grid state qubit by dissipative pumping
de Neeve, B., Nguyen, T.-L., Behrle, T., & Home, J. P. (2022) · Nature Physics · doi:10.1038/s41567-021-01487-7 · Cited by 152
“c, Infidelity of stabilizer (orange), logical (blue) measurements and preservation infidelities (green) predicted by equations (1) and (2) as a function of κ.”
BackgroundMethodInfluentialCross-Platform Verification of Intermediate Scale Quantum Devices
Elben, A., Vermersch, B., van Bijnen, R., Kokail, C., Brydges, T., Maier, C., Joshi, M. K., Blatt, R., Roos, C. F., & Zoller, P. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.010504 · Cited by 151
Zero-noise extrapolation for quantum-gate error mitigation with identity insertions
He, A., Nachman, B., de Jong, W. A., & Bauer, C. W. (2020) · Physical Review A · doi:10.1103/physreva.102.012426 · Cited by 150
Quantum information processing with bosonic qubits in circuit QED
Joshi, A., Noh, K., & Gao, Y. Y. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abe989 · Cited by 152
Quantum machine learning for chemistry and physics
Sajjan, M., Li, J., Selvarajan, R., Sureshbabu, S. H., Kale, S. S., Gupta, R., Singh, V., & Kais, S. (2022) · Chemical Society Reviews · doi:10.1039/d2cs00203e · Cited by 216
Dynamical decoupling for superconducting qubits: A performance survey
Ezzell, N., Pokharel, B., Tewala, L., Quiroz, G., & Lidar, D. A. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.064027 · Cited by 289
IBM quantum computers: evolution, performance, and future directions
AbuGhanem, M. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07047-7 · Cited by 340
Gebhart, V., Santagati, R., Gentile, A. A., Gauger, E. M., Craig, D., Ares, N., Banchi, L., Marquardt, F., Pezzè, L., & Bonato, C. (2023) · Nature Reviews Physics · doi:10.1038/s42254-022-00552-1 · Cited by 281
Solving Vehicle Routing Problem Using Quantum Approximate Optimization Algorithm
Azad, U., Behera, B. K., Ahmed, E. A., Panigrahi, P. K., & Farouk, A. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3172241 · Cited by 149
“Hence, they are only able to run algorithms with limited circuit depth [14].”
BackgroundIBM’s Qiskit Tool Chain: Working with and Developing for Real Quantum Computers
Wille, R., Meter, R. V., & Naveh, Y. (2019) · Design, Automation, and Test in Europe · doi:10.23919/date.2019.8715261 · Cited by 234
Entanglement devised barren plateau mitigation
Patti, T. L., Najafi, K., Gao, X., & Yelin, S. F. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033090 · Cited by 148
Quantum annealing initialization of the quantum approximate optimization algorithm
Sack, S. H., & Serbyn, M. (2021) · Quantum · doi:10.22331/q-2021-07-01-491 · Cited by 146
Measuring the capabilities of quantum computers
Proctor, T., Rudinger, K., Young, K., Nielsen, E., & Blume-Kohout, R. (2022) · Nature Physics · doi:10.1038/s41567-021-01409-7 · Cited by 146
“A quantum processor has now executed programs believed to defy classical simulation [1], and many hybrid quantum/classical algorithms have appeared that offer the possibility of near-term computational advantage [2].”
BackgroundAjagekar, A., & You, F. (2022) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2022.112493 · Cited by 186
Iterative qubit-excitation based variational quantum eigensolver
Yordanov, Y., Armaos, V., Barnes, C., & Arvidsson-Shukur, D. (2021) · doi:10.21203/rs.3.rs-404173/v1 · Cited by 145
King, A. D., Raymond, J., Lanting, T., Isakov, S. V., Mohseni, M., Poulin-Lamarre, G., Ejtemaee, S., Bernoudy, W., Ozfidan, I., Smirnov, A. Y., et al. (2021) · Nature Communications · doi:10.1038/s41467-021-20901-5 · Cited by 141
Fermionic Partial Tomography via Classical Shadows
Zhao, A., Rubin, N. C., & Miyake, A. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.110504 · Cited by 144
Dong, Y., Lin, L., & Tong, Y. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040305 · Cited by 304
Integrating Neural Networks with a Quantum Simulator for State Reconstruction
Torlai, G., Timar, B., van Nieuwenburg, E. P. L., Levine, H., Omran, A., Keesling, A., Bernien, H., Greiner, M., Vuletić, V., Lukin, M. D., et al. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.230504 · Cited by 143
Quantum adversarial machine learning
Lu, S., Duan, L.-M., & Deng, D.-L. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033212 · Cited by 144
Erasure conversion in a high-fidelity Rydberg quantum simulator
Scholl, P., Shaw, A. L., Tsai, R. B.-S., Finkelstein, R., Choi, J., & Endres, M. (2023) · Nature · doi:10.1038/s41586-023-06516-4 · Cited by 141
SupermarQ: A Scalable Quantum Benchmark Suite
Tomesh, T., Gokhale, P., Omole, V., Ravi, G. S., Smith, K. N., Viszlai, J., Wu, X.-C., Hardavellas, N., Martonosi, M. R., & Chong, F. T. (2022) · arXiv · doi:10.48550/arxiv.2202.11045 · Cited by 143
Verifying multipartite entangled Greenberger-Horne-Zeilinger states via multiple quantum coherences
Wei, K. X., Lauer, I., Srinivasan, S., Sundaresan, N., McClure, D. T., Toyli, D., McKay, D. C., Gambetta, J. M., & Sheldon, S. (2020) · Physical Review A · doi:10.1103/physreva.101.032343 · Cited by 140
Entanglement and Charge-Sharpening Transitions in U(1) Symmetric Monitored Quantum Circuits
Agrawal, U., Zabalo, A., Chen, K., Wilson, J. H., Potter, A. C., Pixley, J. H., Gopalakrishnan, S., & Vasseur, R. (2022) · Physical Review X · doi:10.1103/physrevx.12.041002 · Cited by 215
Shuttling-based trapped-ion quantum information processing
Kaushal, V., Lekitsch, B., Stahl, A., Hilder, J., Pijn, D., Schmiegelow, C., Bermudez, A., Müller, M., Schmidt-Kaler, F., & Poschinger, U. (2020) · AVS Quantum Science · doi:10.1116/1.5126186 · Cited by 141
Tang, E. (2018) · arXiv · doi:10.48550/arxiv.1811.00414 · Cited by 141
Exponential Error Suppression for Near-Term Quantum Devices
Koczor, B. (2021) · Physical Review X · doi:10.1103/physrevx.11.031057 · Cited by 147
“However, this powerful solution is prohibitive in the current era of noisy, intermediate-scale quantum (NISQ) devices for the following reasons [8].”
InfluentialTang, E. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.060503 · Cited by 140
Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
Callison, A., & Chancellor, N. (2022) · Physical Review A · doi:10.1103/physreva.106.010101 · Cited by 206
Methodology for replacing indirect measurements with direct measurements
Mitarai, K., & Fujii, K. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.013006 · Cited by 139
Quantum Computers as Universal Quantum Simulators: State‐of‐the‐Art and Perspectives
Tacchino, F., Chiesa, A., Carretta, S., & Gerace, D. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201900052 · Cited by 202
Application of Quantum Annealing to Nurse Scheduling Problem
Ikeda, K., Nakamura, Y., & Humble, T. S. (2019) · Scientific Reports · doi:10.1038/s41598-019-49172-3 · Cited by 139
Theory of Quantum System Certification
Kliesch, M., & Roth, I. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010201 · Cited by 139
Quantum circuit optimizations for NISQ architectures
Nash, B., Gheorghiu, V., & Mosca, M. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab79b1 · Cited by 139
“Since qubits in NISQ devices only have nearest-neighbor connectivity, their connectivity is very sparse.”
BackgroundEfficient variational simulation of non-trivial quantum states
Ho, W. W., & Hsieh, T. H. (2019) · SciPost Physics · doi:10.21468/scipostphys.6.3.029 · Cited by 139
Post-Quantum Cryptosystems for Internet-of-Things: A Survey on Lattice-Based Algorithms
Asif, R. (2021) · IoT · doi:10.3390/iot2010005 · Cited by 193
Equivalence of quantum barren plateaus to cost concentration and narrow gorges
Arrasmith, A., Holmes, Z., Cerezo, M., & Coles, P. J. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac7d06 · Cited by 137
Phase transition in Random Circuit Sampling
Morvan, A., Villalonga, B., Mi, X., Mandrà, S., Bengtsson, A., Klimov, P. V., Chen, Z., Hong, S., Erickson, C., Drozdov, I. K., et al. (2023) · arXiv · doi:10.48550/arxiv.2304.11119 · Cited by 138
Qubit-excitation-based adaptive variational quantum eigensolver
(2021) · doi:10.1038/s42005-021-00730-0 · Cited by 145
Universal Fast-Flux Control of a Coherent, Low-Frequency Qubit
Zhang, H., Chakram, S., Roy, T., Earnest, N., Lu, Y., Huang, Z., Weiss, D. K., Koch, J., & Schuster, D. (2021) · Physical Review X · doi:10.1103/physrevx.11.011010 · Cited by 203
Variational quantum state eigensolver
Cerezo, M., Sharma, K., Arrasmith, A., & Coles, P. J. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00611-6 · Cited by 136
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.