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 1,101–1,200 of 8,640
Validating quantum-classical programming models with tensor network simulations
McCaskey, A., Dumitrescu, E., Chen, M., Lyakh, D. I., & Humble, T. S. (2018) · PLoS ONE · doi:10.1371/journal.pone.0206704 · Cited by 63
Floquet-Engineered Enhancement of Coherence Times in a Driven Fluxonium Qubit
Mundada, P., Gyenis, A., Huang, Z., Koch, J., & Houck, A. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.054033 · Cited by 54
Variational quantum simulations of stochastic differential equations
Kubo, K., Nakagawa, Y. O., Endo, S., & Nagayama, S. (2021) · Physical Review A · doi:10.1103/physreva.103.052425 · Cited by 68
Faster State Preparation across Quantum Phase Transition Assisted by Reinforcement Learning
Guo, S.-F., Chen, F., Liu, Q., Xue, M., Chen, J., Cao, J., Mao, T.-W., Tey, M. K., & You, L. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.060401 · Cited by 65
Implementation of efficient quantum search algorithms on NISQ computers
Zhang, K., Rao, P., Yu, K., Lim, H., & Korepin, V. E. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03165-2 · Cited by 61
Two-dimensional quantum walks of correlated photons
Jiao, Z.-Q., Gao, J., Zhou, W.-H., Wang, X.-W., Ren, R.-J., Xu, X.-Y., Qiao, L.-F., Wang, Y., & Jin, X.-M. (2021) · Optica · doi:10.1364/optica.425879 · Cited by 43
Configurable sublinear circuits for quantum state preparation
Araujo, I. F., Park, D. K., Ludermir, T. B., de Oliveira, W. R., Petruccione, F., & da Silva, A. J. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03869-7 · Cited by 66
Equation-of-Motion Theory to Calculate Accurate Band Structures with a Quantum Computer
Fan, Y., Liu, J., Li, Z., & Yang, J. (2021) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.1c02153 · Cited by 47
Classical Simulation of Boson Sampling Based on Graph Structure
Oh, C., Lim, Y., Fefferman, B., & Jiang, L. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.190501 · Cited by 58
Style-based quantum generative adversarial networks for Monte Carlo events
Bravo-Prieto, C., Baglio, J., Cè, M., Francis, A. S., Grabowska, D. M., & Carrazza, S. (2022) · Quantum · doi:10.22331/q-2022-08-17-777 · Cited by 72
Toward the institutionalization of quantum computing in pharmaceutical research
Zinner, M., Dahlhausen, F., Boehme, P., Ehlers, J., Bieske, L., & Fehring, L. (2022) · Drug Discovery Today · doi:10.1016/j.drudis.2021.10.006 · Cited by 43
Physical Implementability of Linear Maps and Its Application in Error Mitigation
Jiang, J., Wang, K., & Wang, X. (2021) · Quantum · doi:10.22331/q-2021-12-07-600 · Cited by 77
Moussa, C., Wang, H., Bäck, T., & Dunjko, V. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00131-4 · Cited by 62
From quantum speed limits to energy-efficient quantum gates
Aifer, M., & Deffner, S. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac6821 · Cited by 58
Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry
Dalton, K., Long, C. K., Yordanov, Y. S., Smith, C. G., Barnes, C. H. W., Mertig, N., & Arvidsson-Shukur, D. R. M. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00808-x · Cited by 43
Quantum Computer Architecture: Towards Full-Stack Quantum Accelerators
Bertels, K., Sarkar, A., Hubregtsen, T., Serrao, M., Mouedenne, A. A., Yadav, A., Krol, A. M., & Ashraf, I. (2020) · Design, Automation, and Test in Europe · doi:10.23919/date48585.2020.9116502 · Cited by 61
Expressivity of quantum neural networks
Wu, Y., Yao, J., Zhang, P., & Zhai, H. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.l032049 · Cited by 74
Coherence requirements for quantum communication from hybrid circuit dynamics
Kelly, S. P., Poschinger, U., Schmidt‐Kaler, F., Fisher, M. P. A., & Marino, J. (2023) · SciPost Physics · doi:10.21468/scipostphys.15.6.250 · Cited by 60
Quantum heat engine with long-range advantages
Solfanelli, A., Giachetti, G., Campisi, M., Ruffo, S., & Defenu, N. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acc04e · Cited by 55
Discrete Time Crystal Enabled by Stark Many-Body Localization
Liu, S., Zhang, S., Hsieh, C., Zhang, S., & Yao, H. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.120403 · Cited by 43
Synthesizing Quantum-Circuit Optimizers
Xu, A., Molavi, A., Pick, L., Tannu, S., & Albarghouthi, A. (2023) · Proceedings of the ACM on Programming Languages · doi:10.1145/3591254 · Cited by 85
Tate, R., Moondra, J., Gard, B., Mohler, G., & Gupta, S. (2023) · Quantum · doi:10.22331/q-2023-09-26-1121 · Cited by 92
Majorana Loop Models for Measurement-Only Quantum Circuits
Klocke, K., & Buchhold, M. (2023) · Physical Review X · doi:10.1103/physrevx.13.041028 · Cited by 58
Quantum Computing and AI: The Synergy of Two Revolutionary Technologies
Ahmadi, A. A. (2023) · Asian Journal of Electrical Sciences · doi:10.51983/ajes-2023.12.2.4118 · Cited by 64
Application of Quantum Recurrent Neural Network in Low-Resource Language Text Classification
Yu, W., Yin, L., Zhang, C., Chen, Y., & Liu, A. X. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3373903 · Cited by 54
Molecular docking via quantum approximate optimization algorithm
Ding, Q.-M., Huang, Y., & Yuan, X. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.034036 · Cited by 63
Quantum computing and chemistry
Weidman, J. D., Sajjan, M., Mikolas, C. A., Stewart, Z. J., Pollanen, J., Kais, S., & Wilson, A. K. (2024) · Cell Reports Physical Science · doi:10.1016/j.xcrp.2024.102105 · Cited by 71
Realization of High-Fidelity CZ Gate Based on a Double-Transmon Coupler
Li, R., Kubo, K., Ho, Y., Yan, Z., Nakamura, Y., & Goto, H. (2024) · Physical Review X · doi:10.1103/physrevx.14.041050 · Cited by 113
A Comprehensive Review of Quantum Circuit Optimization: Current Trends and Future Directions
Karuppasamy, K., Puram, V., Johnson, S., & Thomas, J. P. (2025) · Quantum Reports · doi:10.3390/quantum7010002 · Cited by 76
Physical-Layer Supervised Learning Assisted by an Entangled Sensor Network
Zhuang, Q., & Zhang, Z. (2019) · Physical Review X · doi:10.1103/physrevx.9.041023 · Cited by 81
QuESTlink—Mathematica embiggened by a hardware-optimised quantum emulator*
Jones, T., & Benjamin, S. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8506 · Cited by 42
Experimental characterization of the energetics of quantum logic gates
Cimini, V., Gherardini, S., Barbieri, M., Gianani, I., Sbroscia, M., Buffoni, L., Paternostro, M., & Caruso, F. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00325-7 · Cited by 50
Greene‐Diniz, G., & Ramo, D. M. (2020) · International Journal of Quantum Chemistry · doi:10.1002/qua.26352 · Cited by 58
Spectral-density estimation with the Gaussian integral transform
Roggero, A. (2020) · Physical Review A · doi:10.1103/physreva.102.022409 · Cited by 46
Tangpanitanon, J., Thanasilp, S., Dangniam, N., Lemonde, M.-A., & Angelakis, D. G. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043364 · Cited by 62
Quantum Speedup for Aeroscience and Engineering
Givi, P., Daley, A. J., Mavriplis, D. J., & Malik, M. R. (2020) · AIAA Journal · doi:10.2514/1.j059183 · Cited by 56
Quantum autoencoders with enhanced data encoding
Bravo-Prieto, C. (2021) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ac0616 · Cited by 90
Branching quantum convolutional neural networks
MacCormack, I., Delaney, C. P., Galda, A., Aggarwal, N., & Narang, P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013117 · Cited by 73
Maciejewski, F. B., Baccari, F., Zimborás, Z., & Oszmaniec, M. (2021) · Quantum · doi:10.22331/q-2021-06-01-464 · Cited by 66
Holman, N., Rosenberg, D., Yost, D., Yoder, J., Das, R. N., Oliver, W. D., McDermott, R., & Eriksson, M. A. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00469-0 · Cited by 46
Towards quantum advantage via topological data analysis
Gyurik, C., Cade, C., & Dunjko, V. (2022) · Quantum · doi:10.22331/q-2022-11-10-855 · Cited by 101
A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding
Fingerhuth, M., Babej, T., & Ing, C. E. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.13411 · Cited by 41
Multi-car paint shop optimization with quantum annealing
Yarkoni, S., Alekseyenko, A., Streif, M., Dollen, D. V., Neukart, F., & Bäck, T. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00019 · Cited by 60
Detecting Entanglement in Quantum Many-Body Systems via Permutation Moments
Liu, Z., Tang, Y., Dai, H., Liu, P., Chen, S., & Ma, X. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.260501 · Cited by 66
Network attack detection scheme based on variational quantum neural network
Gong, C., Guan, W., Gani, A., & Qi, H. (2022) · The Journal of Supercomputing · doi:10.1007/s11227-022-04542-z · Cited by 50
Ab initio quantum simulation of strongly correlated materials with quantum embedding
Cao, C., Sun, J., Yuan, X., Hu, H., Pham, H. Q., & Lv, D. (2023) · npj Computational Materials · doi:10.1038/s41524-023-01045-0 · Cited by 57
Quantum healthcare computing using precision based granular approach
Aggarwal, L., Sachdeva, S., & Goswami, P. (2023) · Applied Soft Computing · doi:10.1016/j.asoc.2023.110458 · Cited by 50
Unlocking the Potential of Quantum Machine Learning to Advance Drug Discovery
Avramouli, M., Savvas, I. Κ., Vasilaki, A., & Garani, G. (2023) · Electronics · doi:10.3390/electronics12112402 · Cited by 62
Akahoshi, Y., Maruyama, K., Oshima, H., Sato, S., & Fujii, K. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010337 · Cited by 121
Dissipation as a resource for Quantum Reservoir Computing
Sannia, A., Martínez‐Peña, R., Soriano, M. C., Giorgi, G. L., & Zambrini, R. (2024) · Quantum · doi:10.22331/q-2024-03-20-1291 · Cited by 126
Quantum Deep Reinforcement Learning for Robot Navigation Tasks
Hohenfeld, H., Heimann, D., Wiebe, F., & Kirchner, F. (2024) · IEEE Access · doi:10.1109/access.2024.3417808 · Cited by 91
Trainability barriers and opportunities in quantum generative modeling
Rudolph, M. S., Lerch, S., Thanasilp, S., Kiss, O., Shaya, O., Vallecorsa, S., Grossi, M., & Holmes, Z. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00902-0 · Cited by 120
Potential quantum advantage for simulation of fluid dynamics
Li, X., Yin, X., Wiebe, N., Chun, J., Schenter, G. K., Cheung, M. S., & Mülmenstädt, J. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013036 · Cited by 104
Variational quantum algorithms for dimensionality reduction and classification
Liang, J., Shen, S., Li, M., & Li, L. (2020) · Physical Review A · doi:10.1103/physreva.101.032323 · Cited by 48
Gyöngyösi, L., & Imre, S. (2020) · Scientific Reports · doi:10.1038/s41598-019-56689-0 · Cited by 51
Gutzwiller hybrid quantum-classical computing approach for correlated materials
Yao, Y., Zhang, F., Wang, C.-Z., Ho, K.-M., & Orth, P. P. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013184 · Cited by 56
Diffusion and operator entanglement spreading
Alba, V. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.104.094410 · Cited by 57
Hybrid Quantum-Classical Neural Network for Calculating Ground State Energies of Molecules
Xia, R., & Kais, S. (2020) · Entropy · doi:10.3390/e22080828 · Cited by 55
Quantum-Enhanced Grid of the Future: A Primer
Eskandarpour, R., Ghosh, K., Khodaei, A., Paaso, E. A., & Zhang, L. (2020) · IEEE Access · doi:10.1109/access.2020.3031595 · Cited by 57
Natural evolutionary strategies for variational quantum computation
Anand, A., Degroote, M., & Aspuru-Guzik, A. (2021) · Machine Learning: Science and Technology · doi:10.1088/2632-2153/abf3ac · Cited by 40
Quantum Machine-Learning for Eigenstate Filtration in Two-Dimensional Materials
Sajjan, M., Sureshbabu, S. H., & Kais, S. (2021) · Journal of the American Chemical Society · doi:10.1021/jacs.1c06246 · Cited by 51
Quantum Monte Carlo Integration: The Full Advantage in Minimal Circuit Depth
Herbert, S. (2022) · Quantum · doi:10.22331/q-2022-09-29-823 · Cited by 82
A Survey and Tutorial on Security and Resilience of Quantum Computing
Saki, A. A., Alam, M., Phalak, K., Suresh, A., Topaloglu, R. O., & Ghosh, S. (2021) · IEEE European Test Symposium (ETS) · doi:10.1109/ets50041.2021.9465397 · Cited by 60
A proposal for using molecular spin qudits as quantum simulators of light–matter interactions
Tacchino, F., Chiesa, A., Sessoli, R., Tavernelli, I., & Carretta, S. (2021) · Journal of Materials Chemistry C · doi:10.1039/d1tc00851j · Cited by 50
Quantum Information Processing Algorithms with Emphasis on Machine Learning
Uehara, G. S., Spanias, A., & Clark, W. (2021) · International Conference on Information, Intelligence, Systems & Applications (IISA) · doi:10.1109/iisa52424.2021.9555570 · Cited by 49
Jakob, A. M., Robson, S. G., Schmitt, V., Mourik, V., Posselt, M., Spemann, D., Johnson, B. C., Firgau, H. R., Mayes, E. L. H., McCallum, J. C., et al. (2021) · Advanced Materials · doi:10.1002/adma.202103235 · Cited by 57
Multi-class quantum classifiers with tensor network circuits for quantum phase recognition
Lazzarin, M., Galli, D. E., & Prati, E. (2022) · Physics Letters A · doi:10.1016/j.physleta.2022.128056 · Cited by 47
QDataSet, quantum datasets for machine learning
Perrier, E., Youssry, A., & Ferrie, C. (2022) · Scientific Data · doi:10.1038/s41597-022-01639-1 · Cited by 77
Optimal provable robustness of quantum classification via quantum hypothesis testing
Weber, M., Liu, N., Li, B., Zhang, C., & Zhao, Z. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00410-5 · Cited by 71
Quantum Architecture Search with Meta‐Learning
He, Z., Chen, C., Li, L., Zheng, S., & Situ, H. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202100134 · Cited by 51
Entanglement-Optimal Trajectories of Many-Body Quantum Markov Processes
Vovk, T., & Pichler, H. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.243601 · Cited by 59
Randomizing multi-product formulas for Hamiltonian simulation
Faehrmann, P. K., Steudtner, M., Kueng, R., Kieferová, M., & Eisert, J. (2022) · Quantum · doi:10.22331/q-2022-09-19-806 · Cited by 84
The learnability of Pauli noise
Chen, S., Liu, Y., Otten, M., Seif, A., Fefferman, B., & Jiang, L. (2023) · Nature Communications · doi:10.1038/s41467-022-35759-4 · Cited by 107
Li, B.-W., Wu, Y., Mei, Q.-X., Yao, R., Lian, W., Cai, M.-L., Wang, Y., Qi, B., Yao, L., He, L., et al. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010302 · Cited by 60
NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
Au-Yeung, R., Chancellor, N., & Halffmann, P. (2023) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2023.1128576 · Cited by 74
Quantum machine-learning phase prediction of high-entropy alloys
Brown, P., & Zhuang, H. L. (2023) · Materials Today · doi:10.1016/j.mattod.2023.02.014 · Cited by 44
Data-driven quantum approximate optimization algorithm for power systems
Jing, H., Wang, Y., & Li, Y. (2023) · Communications Engineering · doi:10.1038/s44172-023-00061-8 · Cited by 73
Temporal information processing induced by quantum noise
Kubota, T., Suzuki, Y., Kobayashi, S., Tran, Q. H., Yamamoto, N., & Nakajima, K. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023057 · Cited by 69
Robust and Efficient Hamiltonian Learning
Yu, W., Sun, J., Han, Z., & Yuan, X. (2023) · Quantum · doi:10.22331/q-2023-06-29-1045 · Cited by 115
Robust control and optimal Rydberg states for neutral atom two-qubit gates
Mohan, M., de Keijzer, R., & Kokkelmans, S. J. J. M. F. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033052 · Cited by 53
Garg, H., Mahmood, T., Rehman, U. U., & Nguyen, G. N. (2023) · Alexandria Engineering Journal · doi:10.1016/j.aej.2023.09.073 · Cited by 48
The Quantum-Medical Nexus: Understanding the Impact of Quantum Technologies on Healthcare
Shams, M., Choudhari, J., Reyes, K., Prentzas, S., Gapizov, A., Shehryar, A., Affaf, M., Grezenko, H., Gasim, R. W., Mohsin, S. N., et al. (2023) · Cureus · doi:10.7759/cureus.48077 · Cited by 66
Hibat-Allah, M., Mauri, M., Carrasquilla, J., & Perdomo‐Ortiz, A. (2024) · Communications Physics · doi:10.1038/s42005-024-01552-6 · Cited by 73
Federated Quantum Machine Learning with Differential Privacy
Rofougaran, R., Yoo, S., Tseng, H.-H., & Chen, S. Y.-C. (2024) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp48485.2024.10447155 · Cited by 65
Efficient quantum amplitude encoding of polynomial functions
Gonzalez-Conde, J., Watts, T. W., Rodriguez-Grasa, P., & Sanz, M. (2024) · Quantum · doi:10.22331/q-2024-03-21-1297 · Cited by 100
Enhancing combinatorial optimization with classical and quantum generative models
Alcazar, J. A., Vakili, M. G., Kalaycı, C. B., & Perdomo‐Ortiz, A. (2024) · Nature Communications · doi:10.1038/s41467-024-46959-5 · Cited by 71
Absence of Barren Plateaus in Finite Local-Depth Circuits with Long-Range Entanglement
Zhang, H.-K., Liu, S., & Zhang, S. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.150603 · Cited by 67
Spatially correlated classical and quantum noise in driven qubits
Zou, J., Bosco, S., & Loss, D. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00842-9 · Cited by 67
Applying quantum approximate optimization to the heterogeneous vehicle routing problem
Fitzek, D., Ghandriz, T., Laine, L., Granath, M., & Kockum, A. F. (2024) · Scientific Reports · doi:10.1038/s41598-024-76967-w · Cited by 80
Kumar, R., Shringi, A. K., Wood, H. J., Asuo, I. M., Oturak, S., Sanchez, D. E., Sharma, T. S. K., Chaurasiya, R., Mishra, A., Choi, W. M., et al. (2025) · Materials Science and Engineering R Reports · doi:10.1016/j.mser.2025.100946 · Cited by 45
Beyond NISQ: The Megaquop Machine
Preskill, J. P. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3723153 · Cited by 151
Self-citationSimulating all quantum measurements using only projective measurements and postselection
Oszmaniec, M., Maciejewski, F. B., & Puchała, Z. (2019) · Physical Review A · doi:10.1103/physreva.100.012351 · Cited by 50
Resource-Efficient Quantum Computing by Breaking Abstractions
Shi, Y., Gokhale, P., Murali, P., Baker, J. M., Duckering, C., Ding, Y., Brown, N. C., Chamberland, C., Javadi-Abhari, A., Cross, A. W., et al. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2020.2994765 · Cited by 66
A Grover-search based quantum learning scheme for classification
Du, Y., Hsieh, M.-H., Liu, T., & Tao, D. (2021) · New Journal of Physics · doi:10.1088/1367-2630/abdefa · Cited by 64
Hamiltonian-driven shadow tomography of quantum states
Hu, H.-Y., & You, Y. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013054 · Cited by 47
Stabilizing multiple topological fermions on a quantum computer
Koh, J. M., Tai, T., Phee, Y. H., Ng, W. E., & Lee, C. H. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00527-1 · Cited by 51
Room-temperature plexcitonic strong coupling: Ultrafast dynamics for quantum applications
Xiong, X., Kongsuwan, N., Lai, Y., Png, C. E., Wu, L., & Hess, O. G. (2021) · Applied Physics Letters · doi:10.1063/5.0032013 · Cited by 42
Linear embedding of nonlinear dynamical systems and prospects for efficient quantum algorithms
Engel, A., Smith, G., & Parker, S. (2021) · Physics of Plasmas · doi:10.1063/5.0040313 · Cited by 68
Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection
Cui, J., Xiong, Y., Ng, S. X., & Hanzo, L. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3185287 · Cited by 56
Engineering the Quantum Scientific Computing Open User Testbed
Clark, S., Lobser, D., Revelle, M., Yale, C. G., Bossert, D., Burch, A. D., Chow, M. N. H., Hogle, C., Ivory, M., Pehr, J., et al. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3096480 · Cited by 65
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.