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 3,401–3,500 of 8,640
Design of gender recognition system using quantum-based deep learning
Zaim, H. Ç., Yılmaz, M., & YOLAÇAN, E. (2023) · Neural Computing and Applications · doi:10.1007/s00521-023-09213-5 · Cited by 11
Unitary coupled-cluster for quantum computation of molecular properties in a strong magnetic field
Culpitt, T., Tellgren, E. I., & Pavošević, F. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0177417 · Cited by 10
Multinucleon structure and dynamics via quantum computing
Du, W., & Vary, J. P. (2023) · Physical Review A · doi:10.1103/physreva.108.052614 · Cited by 13
Parallelizing Quantum-Classical Workloads: Profiling the Impact of Splitting Techniques
Khare, T., Majumdar, R., Sangle, R., Ray, A., Seshadri, P. V., & Simmhan, Y. L. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00113 · Cited by 21
Hybrid Quantum Machine Learning Assisted Classification of COVID-19 from Computed Tomography Scans
Sünkel, L., Martyniuk, D., Reichwald, J., Morariu, A., Seggoju, R. H., Altmann, P. J., Roch, C., & Paschke, A. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00048 · Cited by 15
Inferring Quantum Network Topology Using Local Measurements
Chen, D. T., Doolittle, B., Larson, J. M., Saleem, Z. H., & Chitambar, E. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040347 · Cited by 14
A Fusion of Supervised Contrastive Learning and Variational Quantum Classifiers
Don, A. K. K., Khalil, I., & Atiquzzaman, M. (2024) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2024.3351649 · Cited by 23
Quantum discriminator for binary classification
Date, P., & Smith, W. (2024) · Scientific Reports · doi:10.1038/s41598-023-46469-2 · Cited by 16
Slow thermalization and subdiffusion in U(1) conserving Floquet random circuits
Jonay, C., Rodriguez-Nieva, J. F., & Khemani, V. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.024311 · Cited by 19
Analogue Quantum Simulation with Fixed-Frequency Transmon Qubits
Greenaway, S., Smith, A., Mintert, F., & Malz, D. (2024) · Quantum · doi:10.22331/q-2024-02-22-1263 · Cited by 11
Quantum annealing with error mitigation
Shingu, Y., Nikuni, T., Kawabata, S., & Matsuzaki, Y. (2024) · Physical Review A · doi:10.1103/physreva.109.042606 · Cited by 15
Establishing High-Fidelity Entanglement in Quantum Repeater Chains
Liu, Z., Maranò, S., & Win, M. Z. (2024) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2024.3380092 · Cited by 11
A Modified Depolarization Approach for Efficient Quantum Machine Learning
Khanal, B., & Rivas, P. (2024) · Mathematics · doi:10.3390/math12091385 · Cited by 15
Empirical Sample Complexity of Neural Network Mixed State Reconstruction
Zhao, H., Carleo, G., & Vicentini, F. (2024) · Quantum · doi:10.22331/q-2024-05-23-1358 · Cited by 14
Nykänen, A., Thiessen, L., Borrelli, E.-M., Krishna, V. B., Knecht, S., & Pavošević, F. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.4c01301 · Cited by 17
Adiabatic quantum trajectories in engineered reservoirs
King, E. C., Giannelli, L., Menu, R., Kriel, J. N., & Morigi, G. (2024) · Quantum · doi:10.22331/q-2024-07-30-1428 · Cited by 15
Phase-space negativity as a computational resource for quantum kernel methods
Chabaud, U., Ghobadi, R., Beigi, S., & Rahimi-Keshari, S. (2024) · Quantum · doi:10.22331/q-2024-11-07-1519 · Cited by 14
Eliminating the noise from quantum computing hardware
Li, K. (2019) · Quantum Engineering · doi:10.1002/que2.28 · Cited by 8
Thompson, N. L., Nguyen, N. H., Behrman, E., & Steck, J. E. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02877-1 · Cited by 14
Finding broken gates in quantum circuits: exploiting hybrid machine learning
LaBorde, M. L., Rogers, A. C., & Dowling, J. P. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02729-y · Cited by 10
Realistic simulation of quantum computation using unitary and measurement channels
Mouedenne, A. A., Khammassi, N., Bertels, K., & Almudéver, C. G. (2020) · Physical Review A · doi:10.1103/physreva.102.052608 · Cited by 11
IN ALGORITHMS WE TRUST: MAGICAL THINKING, SUPERINTELLIGENT AI AND QUANTUM COMPUTING
Schradle, N. (2020) · Zygon® · doi:10.1111/zygo.12637 · Cited by 9
Scheduling of Operations in Quantum Compiler
Itoko, T., & Imamichi, T. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00049 · Cited by 13
Application of Quantum Machine Learning to VLSI Placement
Turtletaub, I., Li, G., Ibrahim, M. M. A., & Franzon, P. D. (2020) · ACM/IEEE Workshop on Machine Learning for CAD (MLCAD) · doi:10.1145/3380446.3430644 · Cited by 17
Efficient entanglement generation and detection of generalized stabilizer states
Zhang, Y., Tang, Y., Zhou, Y., & Ma, X. (2021) · Physical Review A · doi:10.1103/physreva.103.052426 · Cited by 11
Driven-dissipative Ising model: Dynamical crossover at weak dissipation
Paz, D. A., & Maghrebi, M. F. (2021) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/ac33cb · Cited by 20
Robust quantum classifier with minimal overhead
Park, D. K., Blank, C., & Petruccione, F. (2021) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn52387.2021.9533403 · Cited by 13
Circuit Design for k-Coloring Problem and Its Implementation in Any Dimensional Quantum System
Saha, A., Saha, D., & Chakrabarti, A. (2021) · SN Computer Science · doi:10.1007/s42979-021-00813-3 · Cited by 10
Quantum computation for predicting electron and phonon properties of solids
Choudhary, K. K. (2021) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/ac1154 · Cited by 18
Quantum Computing Threat Modelling on a Generic CPS Setup
Lee, C. C., Tan, T. G., Sharma, V., & Zhou, J. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81645-2_11 · Cited by 20
Behavior of Analog Quantum Algorithms.
Brady, L. T., Kocia, L., Bienias, P., Bapat, A., & Gorshkov, A. V. (2021) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/1856736 · Cited by 33
Machine learning and quantum computing for reactive turbulence modeling and simulation
Givi, P. (2021) · Mechanics Research Communications · doi:10.1016/j.mechrescom.2021.103759 · Cited by 11
Computational Materials Insights Into Solid-State Multiqubit Systems
Philbin, J. P., & Narang, P. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030102 · Cited by 9
Decoding techniques applied to the compilation of CNOT circuits for NISQ architectures
de Brugière, T. G., Baboulin, M., Valiron, B., Martiel, S., & Allouche, C. (2021) · Science of Computer Programming · doi:10.1016/j.scico.2021.102726 · Cited by 14
Measurement Crosstalk Errors in Cloud-Based Quantum Computing
Seo, S., & Bae, J. (2021) · IEEE Internet Computing · doi:10.1109/mic.2021.3133437 · Cited by 16
Noise-tolerant object detection and ranging using quantum correlations
Kuniyil, H., Ozel, H., Yılmaz, H., & Durak, K. (2022) · Journal of Optics · doi:10.1088/2040-8986/ac899c · Cited by 14
Computational chemistry and the study and design of catalysts
Dell’Angelo, D. (2022) · Elsevier eBooks · doi:10.1016/b978-0-12-819879-7.00010-6 · Cited by 14
Entangled phase of simultaneous fermion and exciton condensations realized
Sager-Smith, L. M., & Mazziotti, D. A. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.l121105 · Cited by 9
Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms
Xiong, Y., Ng, S. X., Long, G., & Hanzo, L. (2022) · IEEE Signal Processing Letters · doi:10.1109/lsp.2022.3170005 · Cited by 15
Low-latency readout electronics for dynamic superconducting quantum computing
Guo, C., Lin, J., Han, L., Li, N., Sun, L.-H., Liang, F., Li, D., Li, Y.-H., Gong, M., Xu, Y., et al. (2022) · AIP Advances · doi:10.1063/5.0088879 · Cited by 14
Fingerprints of Qubit Noise in Transient Cavity Transmission
Mutter, P. M., & Burkard, G. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.236801 · Cited by 15
Bounding entanglement entropy using zeros of local correlation matrices
Yao, Z., Pan, L., Liu, S., & Zhang, P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.l042037 · Cited by 11
SWAP Gate between a Majorana Qubit and a Parity-Protected Superconducting Qubit
Chirolli, L., Yao, N. Y., & Moore, J. E. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.177701 · Cited by 13
OPTIC: A Practical Quantum Binary Classifier for Near-Term Quantum Computers
Patel, T., Silver, D., & Tiwari, D. (2022) · Design, Automation, and Test in Europe · doi:10.23919/date54114.2022.9774707 · Cited by 14
Modeling and Simulation of a Quantum Thermal Noise on the Qubit
Chapeau‐Blondeau, F. (2022) · Fluctuation and Noise Letters · doi:10.1142/s0219477522500602 · Cited by 14
Multiqudit interactions in molecular spins
Gómez-León, Á. (2022) · Physical Review A · doi:10.1103/physreva.106.022609 · Cited by 10
Experimental validation of the Kibble-Zurek mechanism on a digital quantum computer
Higuera-Quintero, S., Rodríguez, F. J., Quiroga, L., & Gómez-Ruiz, F. J. (2022) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2022.1026025 · Cited by 9
Yan, B., & Zurek, W. H. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac9fe8 · Cited by 11
Entanglement entropy scaling of noisy random quantum circuits in two dimensions
Zhang, M., Wang, C., Dong, S., Zhang, H., Han, Y., & He, L. (2022) · Physical Review A · doi:10.1103/physreva.106.052430 · Cited by 16
Quantum Machine Learning for Photovoltaic Topology Optimization
Uehara, G. S., Narayanaswamy, V., Tepedelenlioğlu, C., & Spanias, A. (2022) · International Conference on Information, Intelligence, Systems & Applications (IISA) · doi:10.1109/iisa56318.2022.9904368 · Cited by 10
Pauli String Partitioning Algorithm with the Ising Model for Simultaneous Measurements
Kurita, T., Morita, M., Oshima, H., & Sato, S. (2023) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.2c06453 · Cited by 18
Quantum Circuit Based on Grover Algorithm to Solve Hamiltonian Cycle Problem
Jiang, J. (2022) · IEEE Eurasia Conference on IOT, Communication and Engineering (ECICE) · doi:10.1109/ecice55674.2022.10042919 · Cited by 10
General framework for genuine multipartite entanglement detection
Xu, X.-Y., Zhou, Q. F., Zhao, S., Hu, S.-M., Li, L., Liu, N.-L., & Chen, K. (2023) · Physical Review A · doi:10.1103/physreva.107.052405 · Cited by 12
The Coming Decades of Quantum Simulation
Fraxanet, J., Salamon, T., & Lewenstein, M. (2023) · Lecture notes in physics · doi:10.1007/978-3-031-32469-7_4 · Cited by 38
Schuman, D., Sünkel, L., Altmann, P. J., Stein, J., Roch, C., Gabor, T., & Linnhoff–Popien, C. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10182 · Cited by 12
Multi-variable integration with a variational quantum circuit
Cruz-Martinez, J. M., Robbiati, M., & Carrazza, S. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad5866 · Cited by 24
Quantum Computing Applications for Flight Trajectory Optimization
Makhanov, H., Setia, K., Liu, J., Gonzalez, V. G., & Jenaro, G. (2024) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc62729.2024.00019 · Cited by 23
Classical Simulation of High Temperature Quantum Ising Models
Crosson, E., & Slezak, S. (2025) · Quantum · doi:10.22331/q-2025-07-09-1788 · Cited by 30
What determines the ultimate precision of a quantum computer
Waintal, X. (2019) · Physical Review A · doi:10.1103/physreva.99.042318 · Cited by 15
Efficient Circuits for Quantum Search over 2D Square Lattice Architecture
Hu, S., Maslov, D., Pistoia, M., & Gambetta, J. (2019) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3316781.3322464 · Cited by 9
Layout-Aware Embedding for Quantum Annealing Processors
Pinilla, J. P., & Wilton, S. J. E. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-20656-7_7 · Cited by 18
Keep quantum computing global and open
Biamonte, J., Dorozhkin, P. S., & Zacharov, I. (2019) · Nature · doi:10.1038/d41586-019-02675-5 · Cited by 9
Classical simulation of quantum circuits using fewer Gaussian eliminations
Kocia, L., & Sarovar, M. (2021) · Physical Review A · doi:10.1103/physreva.103.022603 · Cited by 9
Semi-device-dependent blind quantum tomography
Roth, I., Wilkens, J., Hangleiter, D., & Eisert, J. (2023) · Quantum · doi:10.22331/q-2023-07-11-1053 · Cited by 11
Ge, Y., & Dunjko, V. (2020) · MPG.PuRe (Max Planck Society) · Cited by 7
Cîrstoiu, C., Korzekwa, K., & Jennings, D. (2020) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 9
Quantum spin mixing in Dirac materials
Chen, Y., Hoffmann, M., Zimmermann, B. A., et al. (2021) · Communications Physics · doi:10.1038/s42005-021-00682-5 · Cited by 9
Efficient Online Quantum Generative Adversarial Learning Algorithms with ApplicationsPreprint
Du, Y., Hsieh, M.-H., & Tao, D. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.09602 · Cited by 16
A Generic Compilation Strategy for the Unitary Coupled Cluster AnsatzPreprint
Cowtan, A., Simmons, W., & Duncan, R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.10515 · Cited by 86
Optimizing parametrized quantum circuits via noise-induced breaking of symmetriesPreprint
Fontana, E., Cerezo, M., Arrasmith, A., Rungger, I., & Coles, P. J. (2020) · arXiv (Cornell University) · Cited by 15
GenQu: A Hybrid System for Learning Classical Data in Quantum StatesPreprint
Stein, S. A., Tischio, R. M., Baheri, B., Chen, Y.-W., Mao, Y., Guan, Q., Li, A., & Fang, B. (2021) · arXiv (Cornell University) · Cited by 10
Neuromorphic computing with a single quditPreprint
Kalfus, W. D., Ribeill, G. J., Rowlands, G. E., Krovi, H., Ohki, T., & Govia, L. C. G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.11729 · Cited by 9
mRNA codon optimization on quantum computersPreprint
Fox, D. M., Branson, K., & Walker, R. C. (2021) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2021.02.19.431999 · Cited by 9
Very low overhead fault-tolerant quantum error correction with the surface-GKP codePreprint
Noh, K., Chamberland, C., & Brandão, F. G. S. L. (2021) · arXiv (Cornell University) · Cited by 9
Accelerating Variational Quantum Algorithms Using Circuit ConcurrencyPreprint
Resch, S., Gutierrez, A., Huh, J. S., Bharadwaj, S., Eckert, Y., Loh, G. H., Oskin, M., & Tannu, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.01714 · Cited by 24
NISQ-HHL: Portfolio Optimization for Near-Term Quantum HardwarePreprint
Yalovetzky, R., Minssen, P., Herman, D., & Pistoia, M. (2021) · arXiv (Cornell University) · Cited by 11
Schetakis, N. A., Aghamalyan, D., Griffin, P., & Boguslavsky, M. (2022) · Research Square · doi:10.21203/rs.3.rs-1440760/v1 · Cited by 10
Quantum Simulation for High Energy PhysicsPreprint
Bauer, C., Davoudi, Z., Balantekin, A. B., et al. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2204.03381 · Cited by 9
Self-citationExploring Quantum Computing in Weather Forecasting
Zeema, J. L., Deepa, S., Kirubanand, V. B., Jose, T., & Kalpana, P. (2025) · Wiley eBooks · doi:10.1002/9781394242399.ch4 · Cited by 9
Tomesh, T., Allen, N., Dilley, D., & Saleem, Z. (2022) · arXiv · doi:10.48550/arxiv.2210.04378 · Cited by 9
Fault-tolerant quantum speedup from constant depth quantum circuits
Mezher, R., Ghalbouni, J., Dgheim, J., & Markham, D. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033444 · Cited by 8
Robust sparse IQP sampling in constant depth
Paletta, L., Leverrier, A., Sarlette, A., Mirrahimi, M., & Vuillot, C. (2024) · Quantum · doi:10.22331/q-2024-05-06-1337 · Cited by 8
“…strategy to address the issue of noise is to focus on problems for which it is possible to add some level of fault-tolerance, in an intermediate manner between Noisy Intermediate-Scale Quantum (NISQ) processors available in the near term [11] and universal fault-tolerant quantum computation.”
BackgroundStochastic optimal control formalism for an open quantum system
Lin, C., Sels, D., Ma, Y., & Wang, Y. (2020) · Physical Review A · doi:10.1103/physreva.102.052605 · Cited by 10
On the Probabilistic Quantum Error Correction
Kukulski, R., Pawela, Ł., & Puchała, Z. (2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.2023.3254054 · Cited by 15
Navigating the noise-depth tradeoff in adiabatic quantum circuits
Azses, D., Dupont, M., Evert, B., Reagor, M. J., & Torre, E. G. D. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.125127 · Cited by 13
The cross-sectional stock return predictions via quantum neural network and tensor network
Kobayashi, N., Suimon, Y., Miyamoto, K., & Mitarai, K. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00136-x · Cited by 11
Variational Quantum Eigensolver Boosted by Adiabatic Connection
Matoušek, M., Pernal, K., Pavošević, F., & Veis, L. (2024) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.3c07590 · Cited by 14
Efficient ground state preparation in variational quantum eigensolver with symmetry-breaking layers
Park, C.-Y. (2024) · APL Quantum · doi:10.1063/5.0186205 · Cited by 26
A Comparison between Invariant and Equivariant Classical and Quantum Graph Neural Networks
Forestano, R. T., Cara, M. C., Dahale, G. R., et al. (2024) · Axioms · doi:10.3390/axioms13030160 · Cited by 8
Expressive quantum supervised machine learning using Kerr-nonlinear parametric oscillators
Mori, Y., Nakaji, K., Matsuzaki, Y., & Kawabata, S. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00152-5 · Cited by 10
Iacovelli, G., Vista, F., Cordeschi, N., & Grieco, L. A. (2024) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2024.3380084 · Cited by 13
Universal imaginary-time critical dynamics on a quantum computer
Zhang, S., & Yin, S. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.134309 · Cited by 15
Beyond quantum annealing: optimal control solutions to maxcut problems
Pecci, G., Wang, R., Torta, P., Mbeng, G. B., & Santoro, G. E. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad60f2 · Cited by 16
Parity Quantum Computing as yz -Plane Measurement-Based Quantum Computing
Smith, I. D., Nautrup, H. P., & Briegel, H. J. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.220602 · Cited by 13
Liu, T., Ramachandran, G. S., & Jurdak, R. (2024) · IEEE/ACM International Conference on Internet-of-Things Design and Implementation (IoTDI) · doi:10.1109/iotdi61053.2024.00019 · Cited by 10
Benchmarking quantum computers: towards a standard performance evaluation approach
Acuaviva, A., Aguirre, D., Peña, R., & Sanz, M. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae4269 · Cited by 30
BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures
Paraskevopoulos, N., Almudéver, C. G., & Feld, S. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3429451 · Cited by 13
Continuous-variable quantum kernel method on a programmable photonic quantum processor
Anai, K., Ikehara, S., Yano, Y., Okuno, D., & Takeda, S. (2024) · Physical Review A · doi:10.1103/physreva.110.022404 · Cited by 14
Quantum reservoir complexity by the Krylov evolution approach
Domingo, L., Borondo, F., Scialchi, G. F., Roncaglia, A. J., Carlo, G. G., & Wisniacki, D. A. (2024) · Physical Review A · doi:10.1103/physreva.110.022446 · Cited by 17
Introducing quantum information and computation to a broader audience with MOOCs at OpenHPI
Hellstern, G., Hettel, J., & Just, B. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00270-w · Cited by 11
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.