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 4,801–4,900 of 8,640
Best-approximation error for parametric quantum circuits
Funcke, L., Hartung, T., Jansen, K., Kühn, S., Schneider, M., & Stornati, P. (2021) · IEEE International Conference on Web Services (ICWS) · doi:10.1109/icws53863.2021.00096 · Cited by 5
An Overview of Geometrical Optics Restricted Quantum Key Distribution
Pan, Z., & Djordjević, I. B. (2021) · Entropy · doi:10.3390/e23081003 · Cited by 5
Nontrivial damping of quantum many-body dynamics
Heitmann, T., Richter, J., Jochen Gemmer, B., & Steinigeweg, R. (2021) · Physical review. E · doi:10.1103/physreve.104.054145 · Cited by 5
Effect of quantum error correction on detection-induced coherent errors
Yang, Q., & Liu, D. E. (2022) · Physical Review A · doi:10.1103/physreva.105.022434 · Cited by 6
Effective Field Theory of Random Quantum Circuits
Liao, Y., & Galitski, V. M. (2022) · Entropy · doi:10.3390/e24060823 · Cited by 8
Quantum Machine Learning: Current State and Challenges
Avramouli, M., Savvas, I. Κ., Garani, G., & Vasilaki, A. (2021) · Panhellenic Conference on Informatics · doi:10.1145/3503823.3503896 · Cited by 16
On Quantum-Assisted LDPC Decoding Augmented with Classical Post-processing
Sarma, A. D., Majumder, U., Vaidya, V., Chandra, M. G., Kumar, A., & Pramanik, S. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-30445-3_13 · Cited by 8
Sized Types for Low-Level Quantum Metaprogramming
Amy, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-21500-2_6 · Cited by 8
Solitonic Fixed Point Attractors in the Complex Ginzburg–Landau Equation for Associative Memories
Pyrkov, A. N., Byrnes, T., & Cherny, V. V. (2019) · Symmetry · doi:10.3390/sym12010024 · Cited by 5
Introduction to Quantum Computation Reliability
Thornton, M. A. (2020) · IEEE International Test Conference (ITC) · doi:10.1109/itc44778.2020.9325277 · Cited by 4
Materials for quantum technologies: Computing, information, and sensing
Law, S., & Kokkelmans, S. J. J. M. F. (2021) · Journal of Applied Physics · doi:10.1063/5.0050140 · Cited by 4
Song, W., Wieśniak, M., Liu, N., Pawłowski, M., Lee, J., Kim, J., & Bang, J. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03217-7 · Cited by 8
Quantum advantage from energy measurements of many-body quantum systems
Novo, L., Bermejo-Vega, J., & García−Patrón, R. (2021) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-31445 · Cited by 4
Bayesian Quantum CircuitPreprint
Du, Y., Liu, T., & Tao, D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.11089 · Cited by 6
Quantum supremacy with analog quantum processors for material science and machine learningPreprint
Tangpanitanon, J., Thanasilp, S., Lemonde, M.-A., & Angelakis, D. G. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.03860 · Cited by 8
MUQUT: Multi-Constraint Quantum Circuit Mapping on Noisy Intermediate-Scale Quantum ComputersPreprint
Bhattacharjee, D., Saki, A. A., Alam, M., Chattopadhyay, A., & Ghosh, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.08559 · Cited by 6
Quantum-inspired annealers as Boltzmann generators for machine learning and statistical physicsPreprint
Ulanov, A. E., Tiunov, E., & Lvovsky, A. I. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.08480 · Cited by 4
Advanced quantum supremacy using a hybrid algorithm for linear systems of equationsPreprint
Perelshtein, M. R., Pakhomchik, A. I., Melnikov, A. A., Novikov, A., Glatz, A., Paraoanu, G. S., Vinokur, V. M., & Lesovik, G. B. (2020) · arXiv (Cornell University) · Cited by 5
Optimizing Quantum Annealing Schedules: From Monte Carlo Tree Search to QuantumZeroPreprint
Chen, Y., Chen, Y., Lee, C., Zhang, S., & Hsieh, C. (2020) · arXiv (Cornell University) · Cited by 4
Towards quantum advantage for topological data analysisPreprint
Gyurik, C., Cade, C., & Dunjko, V. (2020) · arXiv (Cornell University) · Cited by 4
Lowering the T-depth of Quantum Circuits By Reducing the Multiplicative Depth Of Logic NetworksPreprint
Häner, T., & Soeken, M. (2020) · arXiv.org · doi:10.48550/arxiv.2006.03845 · Cited by 11
Quantum-Inspired Sublinear Algorithm for Solving Low-Rank Semidefinite Programming
Chia, N.-H., Li, T., Lin, H. H., & Wang, C. (2019) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.mfcs.2020.23 · Cited by 36
Supercomputer-Simulationen von Transmon-Quantencomputern
Willsch, D. (2020) · RWTH Publications (RWTH Aachen) · doi:10.18154/rwth-2020-08027 · Cited by 14
Jakob, A. M., Robson, S. G., Schmitt, V., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.02892 · Cited by 4
Non-Differentiable Learning of Quantum Circuit Born Machine with Genetic AlgorithmPreprint
Kondratyev, A. (2020) · SSRN Electronic Journal · doi:10.2139/ssrn.3569226 · Cited by 4
Optimizing Noisy-Intermediate Scale Quantum Circuits: A Block-Based SynthesisPreprint
Wu, X.-C., Davis, M., Chong, F. T., & Iancu, C. (2020) · arXiv (Cornell University) · Cited by 3
Qubit-efficient exponential suppression of errorsPreprint
Czarnik, P., Arrasmith, A., Cincio, Ł., & Coles, P. J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.06056 · Cited by 44
Quantum Technologies: A Review of the Patent LandscapePreprint
Alex, M. E. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.04552 · Cited by 15
Electronic Structure in a Fixed Basis is QMA-completePreprint
O’Gorman, B., Irani, S., Whitfield, J. D., & Fefferman, B. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.08215 · Cited by 4
A systematic mapping on quantum software development in the context of software engineeringPreprint
Zanni, P. E., & de Camargo, V. V. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.00926 · Cited by 13
Probabilistic Graphical Models and Tensor Networks: A Hybrid FrameworkPreprint
Miller, J., Roeder, G., & Bradley, T.-D. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.15666 · Cited by 13
QFCNN: Quantum Fourier Convolutional Neural NetworkPreprint
Shen, F., & Liu, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.10421 · Cited by 5
Quantum Bayesian Neural NetworksPreprint
Berner, N., Fortuin, V., & Landman, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.09599 · Cited by 12
Noise in digital and digital-analog quantum computationPreprint
García-Molina, P., Martin, A., de Andoin, M. G., & Sanz, M. (2023) · Research Square · doi:10.21203/rs.3.rs-3096698/v1 · Cited by 4
Quantum Neural Networks: Concepts, Applications, and ChallengesPreprint
Kwak, Y., Yun, W. J., Jung, S., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.01468 · Cited by 4
Limitations of Local Quantum Algorithms on Random MAX-k-XOR and Beyond
Chou, C.-N., Love, P. J., Sandhu, J. S., & Jonathan Jingsheng, S. H. I. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.icalp.2022.41 · Cited by 49
Preparing Renormalization Group Fixed Points on NISQ HardwarePreprint
Sewell, T. J., & Jordan, S. P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.09787 · Cited by 13
A dataset for quantum circuit mapping
Acampora, G., Schiattarella, R., & Troiano, A. (2021) · Data in Brief · doi:10.1016/j.dib.2021.107526 · Cited by 7
Revolutionizing Computing: A Comprehensive Introduction to Quantum ComputingPreprint
Jerbi, D. (2023) · doi:10.36227/techrxiv.22710361.v1 · Cited by 5
Silicon Quantum Photonics ‐ Platform and Applications
Ekici, Ç., Semenova, E. S., Bacco, D., & Ding, Y. (2023) · Wiley eBooks · doi:10.1002/9783527837427.ch22 · Cited by 4
Quantum information processing with superconducting circuits: A perspective
Wendin, G. P. (2023) · Elsevier eBooks · doi:10.1016/b978-0-323-90800-9.00226-2 · Cited by 14
What Is It Like to Be an AI Bat?Preprint
Herzog, D. J., & Herzog, N. J. (2024) · Qeios · doi:10.32388/63eltc · Cited by 4
Introduction to quantum error correction with stabilizer codes
Bradshaw, Z. P., Dale, J. J., & Evans, E. N. (2026) · Annals of Physics · doi:10.1016/j.aop.2026.170353 · Cited by 4
SWAP-less Implementation of Quantum Algorithms
Klaver, B., Rombouts, S., Fellner, M., Messinger, A., Ender, K., Ludwig, K., & Lechner, W. (2024) · arXiv · doi:10.48550/arxiv.2408.10907 · Cited by 4
Limitations of Quantum Hardware for Molecular Energy Estimation Using VQE
Carreras, A., Orús, R., & Casanova, D. (2026) · Physical Chemistry Chemical Physics · doi:10.1039/d5cp03907j · Cited by 5
A #QuantumComputerArchitecture Tweetstorm
Van Meter, R. (2019) · Zenodo · doi:10.5281/zenodo.3496597 · Cited by 3
Accounting for errors in quantum algorithms via individual error reduction
Otten, M., & Gray, S. K. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0125-3 · Cited by 43
Unified framework for quantum classification
Nghiem, N. A., Chen, S. Y.-C., & Wei, T.-C. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033056 · Cited by 47
NISQ circuit compilation is the travelling salesman problem on a torus
Paler, A., Zulehner, A., & Wille, R. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abe665 · Cited by 42
Povm-Based Quantum Self-Attention Neural Network
Wei, J., He, Z., Chen, C., Deng, M., & Situ, H. (2023) · International Conference on Wavelet Analysis and Pattern Recognition · doi:10.1109/icwapr58546.2023.10337270 · Cited by 6
Deep Reinforcement Learning Strategies for Noise-Adaptive Qubit Routing
Pascoal, G. I. A. M., Fernandes, J. P., & Abreu, R. (2024) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw62656.2024.00030 · Cited by 8
Масленников, В. В., & Demidova, L. A. (2024) · Computational nanotechnology · doi:10.33693/2313-223x-2024-11-2-58-85 · Cited by 6
Benchmarking variational quantum algorithms for combinatorial optimization in practice
Schwägerl, T., Chai, Y., Hartung, T., Jansen, K., & Kühn, S. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00355-y · Cited by 13
Baral, B., & Roy, T. D. (2024) · International Conference on Sustainable Expert Systems (ICSES) · doi:10.1109/icses63445.2024.10763087 · Cited by 3
Efficient preparation of the AKLT State with Measurement-based Imaginary Time Evolution
Chen, T., & Byrnes, T. (2024) · Quantum · doi:10.22331/q-2024-12-10-1557 · Cited by 13
Simulating spin dynamics with quantum computers
Lancaster, J. L., & Allen, D. B. (2024) · American Journal of Physics · doi:10.1119/5.0112717 · Cited by 6
Quantum internal models for Solvency II and quantitative risk management
Amjad, M. A. (2025) · British Actuarial Journal · doi:10.1017/s135732172400031x · Cited by 3
Training Quantum Self-Attention Model in Near-Term Quantum Computer
He, J., Kan, Y., & Xue, C. (2024) · International Conference on Wireless Communications and Signal Processing (WCSP) · doi:10.1109/wcsp62071.2024.10827420 · Cited by 4
Retrieving maximum information of symmetric states from their corrupted copies
Zhou, Z.-Y., & Zhang, D.-J. (2025) · Physical Review A · doi:10.1103/physreva.111.022424 · Cited by 3
Reliability analysis of algorithms on a desk Quantum Computer
Carratù, M., Leo, G. D., Gallo, V., Laino, V., Liguori, C., Paciello, V., & Pietrosanto, A. (2025) · Measurement Sensors · doi:10.1016/j.measen.2025.101859 · Cited by 3
Dichotomy in the effect of chaos on ergotropy
Sreeram, P. G., Kannan, J. B., Tekur, S. H., & Santhanam, M. S. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.054314 · Cited by 3
Data-dependent generalization bounds for parameterized quantum models under noise
Khanal, B., & Rivas, P. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-06966-9 · Cited by 8
Hybrid Quantum‐Classical Inception Neural Network for Image Classification
Wang, L., Liu, Y., Ji, J., Meng, F., Zhang, Z., & Yu, X. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202400700 · Cited by 4
Kanezashi, T., Tsukayama, D., Shirakashi, J., Shibuya, T., & Imai, H. (2025) · Applied Physics Express · doi:10.35848/1882-0786/adc5da · Cited by 3
A comparative study of Q-Seg, quantum-inspired techniques, and U-Net for crack image segmentation
Srinivasan, A., Geng, A., Macaluso, A., Kiefer-Emmanouilidis, M., & Moghiseh, A. (2025) · tm - Technisches Messen · doi:10.1515/teme-2025-0017 · Cited by 3
Opportunities in Quantum Computing and Internet of Things (IoT)
Vashisht, P., Katti, A., & Mamodiya, U. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-2028-1.ch005 · Cited by 3
Nonlinear classification capability of quantum neural networks due to emergent quantum metastability
Boneberg, M., Carollo, F., & Lesanovsky, I. (2025) · Physical Review A · doi:10.1103/physreva.111.062405 · Cited by 8
Simulating quantum field theories on near-term quantum devices
Williams, S. (2025) · International Journal of Modern Physics A · doi:10.1142/s0217751x25300108 · Cited by 3
EDA-Q: Electronic Design Automation for Superconducting Quantum Chip
Zhao, B., Li, Z., Yu, X., Yuan, B., Zhang, C., Gao, Y., Wang, W., Mu, Q., Wang, S., Sun, H., et al. (2025) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2025.3580341 · Cited by 10
Meyer, A., & Іссаков, В. (2025) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas56072.2025.11044118 · Cited by 4
Xue, Y., Zhou, R., Jia, S., Li, Y., Yan, J., Long, Z., Guo, W., Xiong, F., & Xu, W. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.128865 · Cited by 13
Sampling Groups of Pauli Operators to Enhance Direct Fidelity Estimation
Barberà-Rodríguez, J., Navarro, M., & Zambrano, L. (2025) · Quantum · doi:10.22331/q-2025-07-03-1784 · Cited by 15
Alvarez‐Alvarado, M. S. (2025) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2025.3587512 · Cited by 6
Programming Optical-Lattice Fermi-Hubbard Quantum Simulators
Tabares, C., Kokail, C., Zoller, P., González-Cuadra, D., & González-Tudela, A. (2025) · PRX Quantum · doi:10.1103/3nx4-bnyy · Cited by 18
Wang, Q., D’Cunha, R., Mitra, A., Gray, S. K., Otten, M., & Gagliardi, L. (2025) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.5c03028 · Cited by 8
A repetitive amplitude encoding method for enhancing the mapping ability of quantum neural networks
Li, Z., Fu, X., Meng, L., & Du, R. (2025) · Scientific Reports · doi:10.1038/s41598-025-17651-5 · Cited by 8
Hybrid Quantum–Classical Framework for Urban Traffic State Classification
Yi, H. (2025) · IEEE Access · doi:10.1109/access.2025.3605175 · Cited by 3
On the Differential Topology of Expressivity of Parameterized Quantum Circuits
Barzen, J., & Leymann, F. (2025) · AppliedMath · doi:10.3390/appliedmath5030121 · Cited by 5
Sharma, A., Uehara, G. S., Wang, C., Larson, J. S., Barnard, W. M., & Spanias, A. (2025) · IEEE Transactions on Education · doi:10.1109/te.2025.3604319 · Cited by 3
Qudit-based quantum error-correcting codes from irreducible representations of SU( d )
Uy, R. F., & Gangloff, D. A. (2025) · Physical Review A · doi:10.1103/6z3t-96t9 · Cited by 11
The Evolving Quest for Chemical Understanding in the Quantum Age
Liu, S. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c01299 · Cited by 5
Quantum reservoir computing for realized volatility forecasting
Li, Q., Mukhopadhyay, C., Bayat, A., & Habibnia, A. (2026) · Physical Review Research · doi:10.1103/rbj7-4wnq · Cited by 21
Evaluating Variational Quantum Circuit Architectures for Distributed Quantum Computing
Sünkel, L., Stein, J., Nüßlein, J., Rohe, T., & Linnhoff–Popien, C. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00060 · Cited by 4
Small graph perturbations, QAOA, and the MaxCut problem
Lavagna, L., Piperno, S., Ceschini, A., & Panella, M. (2025) · AVS Quantum Science · doi:10.1116/5.0253160 · Cited by 3
Ohgoe, T., Iwakiri, H., Ichikawa, K., Koh, S., & Kohda, M. (2025) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.94.114002 · Cited by 10
QPCNet: A hybrid quantum positional encoding and channel attention network for image classification
Li, Y., Cheng, Z., Zhang, Y., & Xu, R. (2025) · Physica Scripta · doi:10.1088/1402-4896/ae176d · Cited by 4
From qubits to QCuries: a quantum computing framework for Tc-99m ultra-precise optimization
Yahweh, B., Ekanem, A. M., & George, N. J. (2025) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-025-06946-1 · Cited by 3
Password-Authenticated Key Exchange Protocols: A Survey
Wang, D., Li, G., & Jiang, J. (2025) · ACM Computing Surveys · doi:10.1145/3774642 · Cited by 7
Comparative Analysis of Quantum Encoding Techniques for Biomarker Classification
Eutamene, A., Djemmal, I., Belhadef, H., & Mutawa, A. M. (2025) · IEEE Access · doi:10.1109/access.2025.3628830 · Cited by 4
Jha, R. K., Kasabov, N. K., Bhattacharyya, S., Coyle, D., & Prasad, G. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00443-1 · Cited by 8
Decoherence and quantum threats in voice biometric authentication with post-quantum countermeasures
Sihare, S. R. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04980-7 · Cited by 3
Topology-enhanced superconducting qubit networks for in-sensor quantum information processing
Settino, J., Luciano, G. G., Bartolomeo, A. D., Silvestrini, P., Lisitskiy, M., Ruggiero, B., & Romeo, F. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ae2201 · Cited by 4
Method for Noise‐Induced Regularization in Quantum Neural Networks
Kuzmin, V., Somogyi, W., Pankovets, E., & Melnikov, A. A. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202400603 · Cited by 21
Toward scalable quantum computations of atomic nuclei
Gu, C., Heinz, M., Kiss, O., & Papenbrock, T. (2026) · Physical Review C · doi:10.1103/gqdy-dvps · Cited by 16
Mehrnia, M., & Elbaz, M. S. M. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00221 · Cited by 5
Solving Large-Scale Vehicle Routing Problems with Hybrid Quantum-Classical Decomposition
Maciejunes, A., Stenger, J., Gunlycke, D., & Chrisochoides, N. P. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00234 · Cited by 12
Quantum Reinforcement Learning by Adaptive Non-Local Observables
Lin, H.-Y., Chen, S. Y.-C., Tseng, H.-H., & Yoo, S. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10326 · Cited by 3
Neural Architecture Search for Quantum Autoencoders
Agha, H., Chen, S. Y.-C., Tseng, H.-H., & Yoo, S. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00192 · Cited by 4
Liu, Y.-K., Pan, Y., Lu, P.-F., Tsai, Y., & Chen, S. Y.-C. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10325 · Cited by 3
Rosa, E., Vaccaro, M., Placidi, E., D’Andrea, M. L., Liporace, F., Natali, G. L., Secinaro, A., & Napolitano, A. (2025) · Computers · doi:10.3390/computers14120529 · Cited by 8
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.