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 2,101–2,200 of 8,640
Cryogenic Electronics and Quantum Information Processing
Holmes, D. S. (2021) · doi:10.1109/irds54852.2021.00012 · Cited by 31
Natural parametrized quantum circuit
Haug, T., & Kim, M. S. (2022) · Physical Review A · doi:10.1103/physreva.106.052611 · Cited by 30
Quantum Approximate Optimization Algorithm (QAOA)
Fakhimi, R., & Validi, H. (2023) · Springer eBooks · doi:10.1007/978-3-030-54621-2_854-1 · Cited by 38
Error mitigation on a near-term quantum photonic device
Su, D., Israel, R., Sharma, K., Qi, H., Dhand, I., & Brádler, K. (2021) · Quantum · doi:10.22331/q-2021-05-04-452 · Cited by 19
Sun, Q., Zhou, S., Chen, R., Feng, G., Cheung, K. T., Li, J., Hou, S., & Zeng, B. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00271-9 · Cited by 35
Mitigating noise in digital and digital–analog quantum computation
García-Molina, P., Martin, A., de Andoin, M. G., & Sanz, M. (2024) · Communications Physics · doi:10.1038/s42005-024-01812-5 · Cited by 34
Role of coherence in many-body Quantum Reservoir Computing
Palacios, A., Martínez‐Peña, R., Soriano, M. C., Giorgi, G. L., & Zambrini, R. (2024) · Communications Physics · doi:10.1038/s42005-024-01859-4 · Cited by 32
Modeling Heterogeneous Catalysis Using Quantum Computers: An Academic and Industry Perspective
Hariharan, S., Kinge, S., & Visscher, L. (2024) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.4c01212 · Cited by 31
Vendrell, R. C., Ajagekar, A., Bergman, M. T., Hall, C. K., & You, F. (2024) · Science Advances · doi:10.1126/sciadv.adq8492 · Cited by 24
Enhanced Entanglement in the Measurement-Altered Quantum Ising Chain
Paviglianiti, A., Turkeshi, X., Schirò, M., & Silva, A. (2024) · Quantum · doi:10.22331/q-2024-12-23-1576 · Cited by 35
Practical Quantum Advantage on Partially Fault-Tolerant Quantum Computer
Toshio, R., Akahoshi, Y., Fujisaki, J., Oshima, H., Sato, S., & Fujii, K. (2025) · Physical Review X · doi:10.1103/physrevx.15.021057 · Cited by 76
Quantum Algorithms for Quantum Molecular Systems: A Survey
Zhang, Y., Zhang, X., Sun, J., Lin, H., Huang, Y., Lv, D., & Yuan, X. (2025) · Wiley Interdisciplinary Reviews Computational Molecular Science · doi:10.1002/wcms.70020 · Cited by 38
Quantum neural networks with data re-uploading for urban traffic time series forecasting
Schetakis, N. A., Bonfini, P., Alisoltani, N., Blazakis, K. V., Tsintzos, S. I., Askitopoulos, A., Aghamalyan, D., Fafoutellis, P., & Vlahogianni, E. I. (2025) · Scientific Reports · doi:10.1038/s41598-025-04546-8 · Cited by 43
Knowledge mapping of quantum computing for climate change research and sustainable innovation
Yadav, M., & Rawat, K. S. (2025) · Quality & Quantity · doi:10.1007/s11135-025-02413-2 · Cited by 24
Optimal working point in digitized quantum annealing
Mbeng, G. B., Arceci, L., & Santoro, G. E. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.224201 · Cited by 28
Calculating nonadiabatic couplings and Berry's phase by variational quantum eigensolvers
Tamiya, S., Koh, S., & Nakagawa, Y. O. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023244 · Cited by 31
Wild, K., Breitenbücher, U., Harzenetter, L., Leymann, F., Vietz, D., & Zimmermann, M. (2020) · IEEE International Enterprise Distributed Object Computing Conference (EDOC) · doi:10.1109/edoc49727.2020.00024 · Cited by 33
Versatile Configuration and Control Framework for Real-Time Data Acquisition Systems
Karcher, N., Gebauer, R., Bauknecht, R., Illichmann, R., & Sander, O. (2021) · IEEE Transactions on Nuclear Science · doi:10.1109/tns.2021.3084355 · Cited by 23
Efficient 2D Tensor Network Simulation of Quantum Systems
Pang, Y., Hao, T., Dugad, A., Zhou, Y., & Solomonik, E. (2020) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41405.2020.00018 · Cited by 35
NISQ Algorithm for Hamiltonian simulation via truncated Taylor series
Lau, J. W. Z., Haug, T., Kwek, L. C., & Bharti, K. (2022) · SciPost Physics · doi:10.21468/scipostphys.12.4.122 · Cited by 35
Superconducting circuit architecture for digital-analog quantum computing
Yu, J., Retamal, J. C., Sanz, M., Solano, E., & Albarrán-Arriagada, F. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00129-y · Cited by 27
The effect of quantum noise on algorithmic perfect quantum state transfer on NISQ processors
Валерьевич, Б. Д., & Pogosov, W. V. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03346-z · Cited by 20
Resource analysis of quantum computing with noisy qubits for Shor’s factoring algorithms
Ha, J., Lee, J., & Heo, J. (2022) · Quantum Information Processing · doi:10.1007/s11128-021-03398-1 · Cited by 28
Quantum Verification and Estimation with Few Copies
Morris, J., Saggio, V., Gočanin, A., & Dakić, B. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202100118 · Cited by 24
Spatial, spin, and charge symmetry projections for a Fermi-Hubbard model on a quantum computer
Seki, K., & Yunoki, S. (2022) · Physical Review A · doi:10.1103/physreva.105.032419 · Cited by 29
Zhang, J. H., & Iyengar, S. S. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c01303 · Cited by 21
Qubit regularized O(N) nonlinear sigma models
Singh, H. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.105.114509 · Cited by 40
Compact quantum kernel-based binary classifier
Blank, C., da Silva, A. J., de Albuquerque, L. P., Petruccione, F., & Park, D. K. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac7ba3 · Cited by 24
Symmetry Breaking Slows Convergence of the ADAPT Variational Quantum Eigensolver
Bertels, L. W., Grimsley, H. R., Economou, S. E., Barnes, E., & Mayhall, N. J. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00709 · Cited by 38
Zhao, P., Zhang, Y., Xue, G., Jin, Y., & Yu, H. (2022) · Applied Physics Letters · doi:10.1063/5.0097521 · Cited by 23
Entangling Transmons with Low-Frequency Protected Superconducting Qubits
Maiani, A., Kjærgaard, M., & Schrade, C. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030329 · Cited by 23
Quantum search on noisy intermediate-scale quantum devices
Zhang, K., Yu, K., & Korepin, V. E. (2022) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/ac90e6 · Cited by 36
Variational quantum extreme learning machine
Wang, Y., Lin, K.-Y., Cheng, S., & Li, L. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.09.068 · Cited by 20
Evaluation of Parameterized Quantum Circuits With Cross-Resonance Pulse-Driven Entanglers
Ibrahim, M. M. A., Mohammadbagherpoor, H., Rios, C., Bronn, N. T., & Byrd, G. T. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3231124 · Cited by 32
Multi-mode architectures for noise-resilient superconducting qubits
Calzona, A., & Carrega, M. (2022) · Superconductor Science and Technology · doi:10.1088/1361-6668/acaa64 · Cited by 21
Augmenting QAOA Ansatz with Multiparameter Problem-Independent Layer
Chalupnik, M., Melo, H., Alexeev, Y., & Galda, A. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00028 · Cited by 41
A Tool For Debugging Quantum Circuits
Metwalli, S. A., & Meter, R. V. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00085 · Cited by 35
Circuit optimization of Grover quantum search algorithm
Wu, X., Li, Q., Li, Z., Yang, D., Yang, H., Pan, W., Perkowski, M. A., & Xiaoyu Song, B. (2023) · Quantum Information Processing · doi:10.1007/s11128-022-03727-y · Cited by 19
Quantum Tic-Tac-Toe - learning the concepts of quantum mechanics in a playful way
Weingärtner, M., & Weingärtner, T. (2023) · Computers and Education Open · doi:10.1016/j.caeo.2023.100125 · Cited by 30
Entanglement dynamics of noisy random circuits
Li, Z., Sang, S., & Hsieh, T. H. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.014307 · Cited by 28
Haidar, M., Rančić, M. J., Ayral, T., Maday, Y., & Piquemal, J. (2023) · Wiley Interdisciplinary Reviews Computational Molecular Science · doi:10.1002/wcms.1664 · Cited by 35
Latency considerations for stochastic optimizers in variational quantum algorithms
Menickelly, M., Ha, Y., & Otten, M. (2023) · Quantum · doi:10.22331/q-2023-03-16-949 · Cited by 29
Rančić, M. J. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.l012021 · Cited by 28
Conditional quantum circuit Born machine based on a hybrid quantum–classical framework
Zeng, Q.-W., Ge, H.-Y., Gong, C., & Zhou, N. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.128693 · Cited by 26
Quantum computing: a new paradigm for ecology
Woolnough, A. P., Hollenberg, L. C. L., Cassey, P., & Prowse, T. A. A. (2023) · Trends in Ecology & Evolution · doi:10.1016/j.tree.2023.04.001 · Cited by 26
Marcantonio, F. D., Incudini, M., Tezza, D., & Grossi, M. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00107-2 · Cited by 29
Certified Randomness from Quantum Supremacy
Aaronson, S., & Hung, S.-H. (2023) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3564246.3585145 · Cited by 62
Choi, S., & Izmaylov, A. F. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00218 · Cited by 24
Computing the Many-Body Green’s Function with Adaptive Variational Quantum Dynamics
Gomes, N., Williams‐Young, D. B., & de Jong, W. A. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00150 · Cited by 29
Depth analysis of variational quantum algorithms for the heat equation
Guseynov, N., Zhukov, A. A., Pogosov, W. V., & Lebedev, A. V. (2023) · Physical Review A · doi:10.1103/physreva.107.052422 · Cited by 26
Pavošević, F., Tavernelli, I., & Rubio, Á. (2023) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.3c01935 · Cited by 21
Hybrid Gate-Pulse Model for Variational Quantum Algorithms
Liang, Z., Song, Z., Cheng, J., He, Z., Liu, J., Wang, H., Qin, R., Wang, Y., Han, S., Qian, X., et al. (2023) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac56929.2023.10247923 · Cited by 44
Thermodynamics of Quantum Trajectories on a Quantum Computer
Cech, M., Lesanovsky, I., & Carollo, F. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.120401 · Cited by 29
Fractal nature of high-order time crystal phases
Giachetti, G., Solfanelli, A., Correale, L., & Defenu, N. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.l140102 · Cited by 28
Innan, N., Khan, M. A.-Z., & Bennai, M. (2023) · Materials Today Communications · doi:10.1016/j.mtcomm.2023.107760 · Cited by 36
A General Approach to Dropout in Quantum Neural Networks
Scala, F., Ceschini, A., Panella, M., & Gerace, D. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300220 · Cited by 32
Quantum-probabilistic Hamiltonian learning for generative modeling and anomaly detection
Araz, J. Y., & Spannowsky, M. (2023) · Physical Review A · doi:10.1103/physreva.108.062422 · Cited by 25
Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs
Bae, E., & Lee, S. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04286-0 · Cited by 40
Orbital-Selective Mott Transition Effects and Nontrivial Topology of Iron Chalcogenide
Kim, M., Choi, S., Brito, W. H., & Kotliar, G. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.136504 · Cited by 29
Solving optimization problems with local light-shift encoding on Rydberg quantum annealers
Goswami, K., Mukherjee, R., Ott, H., & Schmelcher, P. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023031 · Cited by 30
Elivagar: Efficient Quantum Circuit Search for Classification
Anagolum, S., Alavisamani, N., Das, P., Qureshi, M. K., & Shi, Y. (2024) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3620665.3640354 · Cited by 44
Leonidas, I. D., Dukakis, A., Tan, B. Y. L., & Angelakis, D. G. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300309 · Cited by 40
Transition role of entangled data in quantum machine learning
Wang, X., Du, Y., Tu, Z., Luo, Y., Yuan, X., & Tao, D. (2024) · Nature Communications · doi:10.1038/s41467-024-47983-1 · Cited by 46
Combining matrix product states and noisy quantum computers for quantum simulation
Martin, B. A., Ayral, T., Jamet, F., Rančić, M. J., & Simon, P. (2024) · Physical Review A · doi:10.1103/physreva.109.062437 · Cited by 39
Predominant Aspects on Security for Quantum Machine Learning: Literature Review
Franco, N., Sakhnenko, A., Stolpmann, L., Thuerck, D., Petsch, F., Rüll, A., & Lorenz, J. M. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00173 · Cited by 34
Quantum Computing for Advanced Driver Assistance Systems and Autonomous Vehicles: A Review
Rattan, A., Pal, A. R., & Gurusamy, M. (2025) · IEEE Access · doi:10.1109/access.2025.3532958 · Cited by 36
Short-depth circuits for efficient expectation-value estimation
Roggero, A., & Baroni, A. (2020) · Physical Review A · doi:10.1103/physreva.101.022328 · Cited by 20
Geometric Quantum Computation with Shortcuts to Adiabaticity
Du, Y.-X., Liang, Z.-T., Yan, H., & Zhu, S.-L. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201900013 · Cited by 20
Evidence of the entanglement constraint on wave-particle duality using the IBM Q quantum computer
Schwaller, N., Dupertuis, M. ‐., & Javerzac‐Galy, C. (2021) · Physical Review A · doi:10.1103/physreva.103.022409 · Cited by 20
Optimizing the optimizer: decomposition techniques for quantum annealing
Bass, G., Henderson, M., Heath, J., & Dulny, J. S. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00039-9 · Cited by 30
Classical simulation of noncontextual Pauli Hamiltonians
Kirby, W. M., & Love, P. J. (2020) · Physical Review A · doi:10.1103/physreva.102.032418 · Cited by 21
Testing a Quantum Annealer as a Quantum Thermal Sampler
Izquierdo, Z. G., Hen, I., & Albash, T. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3464456 · Cited by 28
Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices
de Griend, A. M.-V., & Duncan, R. (2023) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.394.8 · Cited by 65
Superconducting quantum many-body circuits for quantum simulation and computing
Wilkinson, S. A., & Hartmann, M. J. (2020) · Applied Physics Letters · doi:10.1063/5.0008202 · Cited by 25
Materials science for quantum information science and technology
Richardson, C. J. K., Lordi, V., Misra, S., & Shabani, J. (2020) · MRS Bulletin · doi:10.1557/mrs.2020.147 · Cited by 21
Cryogenic Current Steering DAC With Mitigated Variability
Zurita, M., Guevel, L. L., Billiot, G., et al. (2020) · IEEE Solid-State Circuits Letters · doi:10.1109/lssc.2020.3013443 · Cited by 19
Das, S., Rahman, M. S., & Majumdar, M. A. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03189-8 · Cited by 23
Implementation of measurement reduction for the variational quantum eigensolver
Ralli, A., Love, P. J., Tranter, A., & Coveney, P. V. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033195 · Cited by 27
Reduction of the molecular hamiltonian matrix using quantum community detection
Mniszewski, S. M., Dub, P. A., Tretiak, S., Anisimov, P. M., Zhang, Y., & Negre, C. F. A. (2021) · Scientific Reports · doi:10.1038/s41598-021-83561-x · Cited by 20
Implementation of quantum measurements using classical resources and only a single ancillary qubit
Singal, T., Maciejewski, F. B., & Oszmaniec, M. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00589-1 · Cited by 27
Quantum contracts between Schrödinger and a cat
Ikeda, K. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03252-4 · Cited by 19
Comparative study of adaptive variational quantum eigensolvers for multi-orbital impurity models
Mukherjee, A., Berthusen, N., Getelina, J. C., Orth, P. P., & Yao, Y. (2023) · Communications Physics · doi:10.1038/s42005-022-01089-6 · Cited by 31
Reoptimization of Quantum Circuits via Hierarchical Synthesis
Wu, X.-C., Davis, M. G., Chong, F. T., & Iancu, C. (2021) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc53822.2021.00016 · Cited by 28
McGinley, M., Leontica, S., Garratt, S. J., Jovanović, J., & Simon, S. H. (2022) · Physical Review A · doi:10.1103/physreva.106.012441 · Cited by 28
Superconducting qubits beyond the dispersive regime
Ansari, M. H. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.024509 · Cited by 23
Quantum circuits synthesis using Householder transformations
de Brugière, T. G., Baboulin, M., Valiron, B., & Allouche, C. (2019) · Computer Physics Communications · doi:10.1016/j.cpc.2019.107001 · Cited by 25
Gonthier, J. F., Radin, M. D., Buda, C., Doskocil, E. J., Abuan, C. M., & Romero, J. (2020) · arXiv (Cornell University) · Cited by 20
Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs
Barak, B., & Marwaha, K. (2022) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.itcs.2022.14 · Cited by 19
Classical algorithms and quantum limitations for maximum cut on high-girth graphs
Barak, B., & Marwaha, K. (2021) · arXiv · doi:10.48550/arxiv.2106.05900 · Cited by 19
A Verified Optimizer for Quantum Circuits
Hietala, K., Rand, R., Li, L., Hung, S.-H., Wu, X., & Hicks, M. (2023) · ACM Transactions on Programming Languages and Systems · doi:10.1145/3604630 · Cited by 30
Scalable parameterized quantum circuits classifier
Ding, X., Song, Z., Xu, J., Hou, Y., Yang, T., & Shan, Z. (2024) · Scientific Reports · doi:10.1038/s41598-024-66394-2 · Cited by 35
Direct entanglement detection of quantum systems using machine learning
Huang, Y., Che, L., Wei, C., Xu, F., Nie, X., Li, J., Lu, D., & Xin, T. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00970-w · Cited by 28
Classical-quantum approach to image classification: Autoencoders and quantum SVMs
Slabbert, D., & Petruccione, F. (2025) · AVS Quantum Science · doi:10.1116/5.0261885 · Cited by 25
Controlled Quantum Semantic Communication for Industrial CPS Networks
Rizvi, S. M. A., Khalid, U., Chatzinotas, S., Duong, T. Q., & Shin, H. (2025) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2025.3589296 · Cited by 22
Next-Generation Quantum Neural Networks: Enhancing Efficiency, Security, and Privacy
Innan, N., Kashif, M., Marchisio, A., Bennai, M., & Shafique, M. (2025) · IEEE International On-Line Testing Symposium (IOLTS) · doi:10.1109/iolts65288.2025.11116981 · Cited by 36
Computational Advantage in Hybrid Quantum Neural Networks: Myth or Reality?
Kashif, M., Marchisio, A., & Shafique, M. (2025) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac63849.2025.11132906 · Cited by 42
Quantum complexity fluctuations from nuclear and hypernuclear forces
Robin, C., & Savage, M. J. (2025) · Physical Review C · doi:10.1103/r8rq-y9tb · Cited by 46
A Perspective on Quantum Computing Applications in Quantum Chemistry Using 25–100 Logical Qubits
Alexeev, Y., Batista, V. S., Bauman, N. P., Bertels, L. W., Claudino, D., Dutta, R., Gagliardi, L., Godwin, S., Govind, N., Head‐Gordon, M., et al. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c01038 · Cited by 53
Gupta, R. S., Govia, L. C. G., & Biercuk, M. J. (2020) · Physical Review A · doi:10.1103/physreva.102.042611 · Cited by 20
Imperfect Distributed Quantum Phase Estimation
Neumann, N. M. P., van Houte, R., & Attema, T. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-50433-5_46 · Cited by 21
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.