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 901–1,000 of 8,640
Quantum computation of magnon spectra
Francis, A., Freericks, J. K., & Kemper, A. F. (2020) · Physical review. B./Physical review. B · doi:10.1103/physrevb.101.014411 · Cited by 60
High-Fidelity Software-Defined Quantum Logic on a Superconducting Qudit
Wu, X., Tomarken, S., Petersson, N. A., Martinez, L. A., Rosen, Y. J., & DuBois, J. L. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.170502 · Cited by 64
Noise-Assisted Quantum Autoencoder
Cao, C., & Wang, X. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.054012 · Cited by 81
Quantum Computing: Towards Industry Reference Problems
Luckow, A., Klepsch, J., & Pichlmeier, J. (2021) · Digitale Welt · doi:10.1007/s42354-021-0335-7 · Cited by 66
Tilly, J., Sriluckshmy, P. V., Patel, A., Fontana, E., Rungger, I., Grant, E., Anderson, R., Tennyson, J., & Booth, G. H. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033230 · Cited by 56
Experimental quantum kernel trick with nuclear spins in a solid
Kusumoto, T., Mitarai, K., Fujii, K., Kitagawa, M., & Negoro, M. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00423-0 · Cited by 80
Robust quantum compilation and circuit optimisation via energy minimisation
Jones, T., & Benjamin, S. C. (2022) · Quantum · doi:10.22331/q-2022-01-24-628 · Cited by 121
Elfving, V. E., Broer, B. W., Webber, M., Gavartin, J. L., Halls, M. D., Lorton, K. P., & Bochevarov, A. D. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.12472 · Cited by 51
Data used in "Qubit Readout Error Mitigation with Bit-flip Averaging"
Smith, A. W. R., Self, C. N., Khosla, K. E., & Kim, M. S. (2021) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.5267396 · Cited by 78
Towards Quantum-Enhanced Machine Learning for Network Intrusion Detection
Gouveia, A., & Correia, M. (2020) · 2020 IEEE 19th International Symposium on Network Computing and Applications (NCA) · doi:10.1109/nca51143.2020.9306691 · Cited by 52
“QSVMs are an interesting application for NISQ computers [22], [23].”
BackgroundMethodMutual information-assisted adaptive variational quantum eigensolver
Zhang, Z.-J., Kyaw, T. H., Kottmann, J. S., Degroote, M., & Aspuru-Guzik, A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abdca4 · Cited by 52
“Despite recent progresses [4–6] in quantum computing hardware, we remain in the noisy intermediate-scale quantum (NISQ) era [7] where the number of qubits and the depth of quantum circuit are limited to a few tens of qubits and gates.”
Measurement Cost of Metric-Aware Variational Quantum Algorithms
van Straaten, B., & Koczor, B. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030324 · Cited by 55
Kim, C., Kim, H., & Park, J. (2021) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/ac2d5d · Cited by 63
A Leap among Quantum Computing and Quantum Neural Networks: A Survey
Massoli, F. V., Vadicamo, L., Amato, G. M., & Falchi, F. (2022) · ACM Computing Surveys · doi:10.1145/3529756 · Cited by 94
Simulation of Interaction-Induced Chiral Topological Dynamics on a Digital Quantum Computer
Koh, J. M., Tai, T., & Lee, C. H. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.140502 · Cited by 68
A Survey of Recent Advances in Quantum Generative Adversarial Networks
Ngo, T. A., Nguyen, T., & Thang, T. C. (2023) · Electronics · doi:10.3390/electronics12040856 · Cited by 74
Opportunities and Challenges of Quantum Computing for Engineering Optimization
Wang, Y., Kim, J. E., & Suresh, K. (2023) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4062969 · Cited by 65
Davoudi, Z., Shaw, A. F., & Stryker, J. R. (2023) · Quantum · doi:10.22331/q-2023-12-20-1213 · Cited by 105
Quantum circuit compilers using gate commutation rules
Itoko, T., Raymond, R., Imamichi, T., Matsuo, A., & Cross, A. W. (2019) · Proceedings of the 24th Asia and South Pacific Design Automation Conference · doi:10.1145/3287624.3287701 · Cited by 50
Quantum simulation of open quantum systems in heavy-ion collisions
de Jong, W. A., Metcalf, M., Mulligan, J. D., Ploskon, M. A., Ringer, F., & Yao, X. (2021) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.104.l051501 · Cited by 78
Simulating Periodic Systems on a Quantum Computer Using Molecular Orbitals
Liu, J., Wan, L., Li, Z., & Yang, J. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00881 · Cited by 60
Learning the dynamics of open quantum systems from their steady states
Bairey, E., Guo, C., Poletti, D., Lindner, N. H., & Arad, I. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab73cd · Cited by 98
Benchmarking Adaptive Variational Quantum Eigensolvers
Claudino, D., Wright, J., McCaskey, A. J., & Humble, T. S. (2020) · Frontiers in Chemistry · doi:10.3389/fchem.2020.606863 · Cited by 52
Scaling of variational quantum circuit depth for condensed matter systems
Bravo Prieto, C., Lumbreras Zarapico, J., Tagliacozzo, L., & Latorre, J. I. (2020) · Dipòsit Digital de la Universitat de Barcelona (Universitat de Barcelona) · Cited by 59
Enabling Multi-programming Mechanism for Quantum Computing in the NISQ Era
Niu, S., & Todri‐Sanial, A. (2023) · Quantum · doi:10.22331/q-2023-02-16-925 · Cited by 92
Models in quantum computing: a systematic review
Nimbe, P., Weyori, B. A., & Adekoya, A. F. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03021-3 · Cited by 65
Pulse-level noisy quantum circuits with QuTiP
Li, B., Ahmed, S., Saraogi, S., Lambert, N., Nori, F., Pitchford, A., & Shammah, N. (2022) · Quantum · doi:10.22331/q-2022-01-24-630 · Cited by 90
Implementing evolutionary optimization on actual quantum processors
Acampora, G., & Vitiello, A. (2021) · Information Sciences · doi:10.1016/j.ins.2021.06.049 · Cited by 54
Variational quantum eigensolver for the Heisenberg antiferromagnet on the kagome lattice
Kattemölle, J., & van Wezel, J. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.214429 · Cited by 84
LILLIPUT: a lightweight low-latency lookup-table decoder for near-term Quantum error correction
Das, P., Locharla, A., & Jones, C. (2022) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3503222.3507707 · Cited by 113
QUEST: systematically approximating Quantum circuits for higher output fidelity
Patel, T., Younis, E., Iancu, C., de Jong, W. A., & Tiwari, D. (2022) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3503222.3507739 · Cited by 82
Quantum Neural Network Classifiers: A Tutorial
Li, W., Lu, Z., & Deng, D.-L. (2022) · SciPost Physics Lecture Notes · doi:10.21468/scipostphyslectnotes.61 · Cited by 72
Quantum Approximate Optimization With Parallelizable Gates
Lechner, W. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3034798 · Cited by 57
“INTRODUCTION With the immense recent developments in quantum technology [1]–[12] the regime of computational quantum advantage is in reach [13]–[15].”
BackgroundBoundaries of quantum supremacy via random circuit sampling
Zlokapa, A., Villalonga, B., Boixo, S., & Lidar, D. A. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00703-x · Cited by 50
Quantum machine learning and quantum biomimetics: A perspective
Lamata, L. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ab9803 · Cited by 77
Quantum Optimization for the Graph Coloring Problem with Space-Efficient Embedding
Tabi, Z., El-Safty, K. H., Kallus, Z., Haga, P., Kozsik, T., Glos, A., & Zimborás, Z. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00018 · Cited by 111
Single-electron spin resonance in a nanoelectronic device using a global field
Vahapoglu, E., Slack-Smith, J. P., Leon, R. C. C., Lim, W. H., Hudson, F. E., Day, T., Tanttu, T., Yang, C. H., Laucht, A., Dzurak, A. S., et al. (2021) · Science Advances · doi:10.1126/sciadv.abg9158 · Cited by 64
Calculating transition amplitudes by variational quantum deflation
Ibe, Y., Nakagawa, Y. O., Earnest, N., Yamamoto, T., Mitarai, K., Gao, Q., & Kobayashi, T. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013173 · Cited by 67
Singh, H., Majumder, S., & Mishra, S. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0161057 · Cited by 51
Quantum Optimization via Four-Body Rydberg Gates
Dlaska, C., Ender, K., Mbeng, G. B., Kruckenhauser, A., Lechner, W., & van Bijnen, R. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.120503 · Cited by 51
“A key challenge for the field of quantum technology at this very moment is to find ways of putting the computational power of near-term quantum devices to good use [3, 4].”
BackgroundScaling and logic in the colour code on a superconducting quantum processor
Lacroix, N., Bourassa, A., Heras, F. J. H., Zhang, L. M., Bausch, J., Senior, A. W., Edlich, T., Shutty, N., Sivak, V., Bengtsson, A., et al. (2025) · Nature · doi:10.1038/s41586-025-09061-4 · Cited by 51
An Improved Implementation Approach for Quantum Phase Estimation on Quantum Computers
Mohammadbagherpoor, H., Oh, Y.-H., Dreher, P., Singh, A., Yu, X., & Rindos, A. (2019) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2019.8914702 · Cited by 71
MacCormack, I., Tan, M. T., Kudler-Flam, J., & Ryu, S. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.104.214202 · Cited by 59
Fast Multiqubit Gates through Simultaneous Two-Qubit Gates
Gu, X. Q., Fernández-Pendás, J., Vikstål, P., Abad, T., Warren, C., Bengtsson, A., Tancredi, G., Shumeiko, V. S., Bylander, J., Johansson, G., et al. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040348 · Cited by 63
Linear-depth quantum circuits for multiqubit controlled gates
da Silva, A. J., & Park, D. K. (2022) · Physical Review A · doi:10.1103/physreva.106.042602 · Cited by 51
Quantum natural gradient generalized to noisy and nonunitary circuits
Koczor, B., & Benjamin, S. C. (2022) · Physical Review A · doi:10.1103/physreva.106.062416 · Cited by 127
Optimal Strategies of Quantum Metrology with a Strict Hierarchy
Liu, Q., Hu, Z., Yuan, H., & Yang, Y. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.070803 · Cited by 96
Liu, P., Wang, R., Zhang, J.-N., Zhang, Y., Cai, X., Xu, H., Li, Z., Han, J., Li, X., Xue, G., et al. (2023) · Physical Review X · doi:10.1103/physrevx.13.021028 · Cited by 81
Evidence of Kardar-Parisi-Zhang scaling on a digital quantum simulator
Keenan, N., Robertson, N., Murphy, T., Zhuk, S. M., & Goold, J. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00742-4 · Cited by 82
Kleißler, F., Lazariev, A., & Arroyo-Camejo, S. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0098-7 · Cited by 59
A Pattern Recognition Algorithm for Quantum Annealers
Bapst, F., Bhimji, W., Calafiura, P., et al. (2019) · Computing and Software for Big Science · doi:10.1007/s41781-019-0032-5 · Cited by 49
Achieving One-Round Password-Based Authenticated Key Exchange over Lattices
Li, Z., & Wang, D. (2019) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2019.2939836 · Cited by 52
Tensor-network-based machine learning of non-Markovian quantum processes
Guo, C., Modi, K. K., & Poletti, D. (2020) · Physical Review A · doi:10.1103/physreva.102.062414 · Cited by 64
Quantum versus classical generative modelling in finance
Coyle, B., Henderson, M., Le, J. C. J., Kumar, N., Paini, M., & Kashefi, E. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abd3db · Cited by 88
Koczor, B., & Benjamin, S. C. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023017 · Cited by 50
Error-Robust Quantum Logic Optimization Using a Cloud Quantum Computer Interface
Carvalho, A. R. R., Ball, H., Biercuk, M. J., Hush, M., & Thomsen, F. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.064054 · Cited by 70
Experimental Characterization, Modeling, and Analysis of Crosstalk in a Quantum Computer
Saki, A. A., Alam, M., & Ghosh, S. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3023338 · Cited by 77
Determining the proton content with a quantum computer
Pérez-Salinas, A., Cruz-Martinez, J. M., Alhajri, A., & Carrazza, S. (2021) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.103.034027 · Cited by 66
Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm
Schiffer, B. F., Tura, J., & Cirac, J. I. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020347 · Cited by 69
Silicon photonic quantum computing with spin qubits
Yan, X., Gitt, S., Lin, B., Witt, D. M., Abdolahi, M., Afifi, A. E., Azem, A., Darcie, A., Wu, J., Awan, K. M., et al. (2021) · APL Photonics · doi:10.1063/5.0049372 · Cited by 56
Matrix-Model Simulations Using Quantum Computing, Deep Learning, and Lattice Monte Carlo
Rinaldi, E., Han, X., Hassan, M., Feng, Y., Nori, F., McGuigan, M., & Hanada, M. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010324 · Cited by 89
Multiplexed quantum transport using commercial off-the-shelf CMOS at sub-kelvin temperatures
Paquelet Wuetz, B., Bavdaz, P. L., Yeoh, L. A., Schouten, R., van der Does, H., Tiggelman, M., Sabbagh, D., Sammak, A., Almudever, C. G., Sebastiano, F., et al. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0274-4 · Cited by 49
Overhead for simulating a non-local channel with local channels by quasiprobability sampling
Mitarai, K., & Fujii, K. (2021) · Quantum · doi:10.22331/q-2021-01-28-388 · Cited by 85
Adaptive variational quantum eigensolvers for highly excited states
Zhang, F., Gomes, N., Yao, Y., Orth, P. P., & Iadecola, T. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.104.075159 · Cited by 64
Thermalization of Gauge Theories from their Entanglement Spectrum
Mueller, N., Zache, T. V., & Ott, R. J. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.011601 · Cited by 68
Random Quantum Circuits Transform Local Noise into Global White Noise
Dalzell, A. M., Hunter-Jones, N., & Brandão, F. G. S. L. (2024) · Communications in Mathematical Physics · doi:10.1007/s00220-024-04958-z · Cited by 141
Honda, M., Itou, E., Kikuchi, Y., Nagano, L., & Okuda, T. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.105.014504 · Cited by 74
Quantum activation functions for quantum neural networks
Maronese, M., Destri, C., & Prati, E. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03466-0 · Cited by 62
Robust resource-efficient quantum variational ansatz through an evolutionary algorithm
Huang, Y., Li, Q., Hou, X., Wu, R.-B., Yung, M., Bayat, A., & Wang, X. (2022) · Physical Review A · doi:10.1103/physreva.105.052414 · Cited by 66
Effects of Dynamical Decoupling and Pulse-Level Optimizations on IBM Quantum Computers
Niu, S., & Todri‐Sanial, A. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3203153 · Cited by 71
What Approaches to Thwart Bacterial Efflux Pumps-Mediated Resistance?
Seukep, A. J., Mbuntcha, H. G., Kuete, V., Chu, Y., Fan, E., & Guo, M. (2022) · Antibiotics · doi:10.3390/antibiotics11101287 · Cited by 63
Huang, K., Cai, X., Li, H., Ge, Z.-Y., Hou, R., Li, H., Liu, T., Shi, Y., Chen, C.-T., Zheng, D. N., et al. (2022) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.2c02381 · Cited by 64
Qubit Mapping and Routing via MaxSAT
Molavi, A., Xu, A., Diges, M., Pick, L., Tannu, S., & Albarghouthi, A. (2022) · 2022 55th IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro56248.2022.00077 · Cited by 54
“In the meantime, near-term quantum computers with several dozens of qubits are expected to operate in a noisy environment without any error correction using a model of computation called noisy intermediate-scale quantum (NISQ) computing [2].”
BackgroundMulticlass seismic damage detection of buildings using quantum convolutional neural network
Bhatta, S., & Dang, J. (2023) · Computer-Aided Civil and Infrastructure Engineering · doi:10.1111/mice.13084 · Cited by 57
Quantum clustering with k-Means: A hybrid approach
Poggiali, A., Berti, A., Bernasconi, A., Corso, G. M. D., & Guidotti, R. (2024) · Theoretical Computer Science · doi:10.1016/j.tcs.2024.114466 · Cited by 85
Piezoelectric actuation for integrated photonics
Tian, H., Liu, J., Attanasio, A., Siddharth, A., Blésin, T., Wang, R. N., Voloshin, A., Lihachev, G., Riemensberger, J., Kenning, S., et al. (2024) · Advances in Optics and Photonics · doi:10.1364/aop.529288 · Cited by 67
Quantum anomaly detection in the latent space of proton collision events at the LHC
Belis, V., Wozniak, K. A., Puljak, E., Barkoutsos, P. K., Dissertori, G., Grossi, M., Pierini, M., Reiter, F., Tavernelli, I., & Vallecorsa, S. (2024) · Communications Physics · doi:10.1038/s42005-024-01811-6 · Cited by 84
Protecting quantum resources via frequency modulation of qubits in leaky cavities
Mortezapour, A., & Franco, R. L. (2018) · Scientific Reports · doi:10.1038/s41598-018-32661-2 · Cited by 52
Towards a Pattern Language for Quantum Algorithms
Leymann, F. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-14082-3_19 · Cited by 66
The NISQ Analyzer: Automating the Selection of Quantum Computers for Quantum Algorithms
Salm, M., Barzen, J., Breitenbücher, U., Leymann, F., Weder, B., & Wild, K. (2020) · Communications in computer and information science · doi:10.1007/978-3-030-64846-6_5 · Cited by 83
Jin, F., Willsch, D., Willsch, M., Lagemann, H., Michielsen, K. F. L., & Raedt, H. A. D. (2020) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.90.012001 · Cited by 62
Kleißler, F., Lazariev, A., & Arroyo Camejo, S. (2018) · MPG.PuRe (Max Planck Society) · Cited by 49
Quantum algorithms for quantum dynamics: A performance study on the spin-boson model
Miessen, A., Ollitrault, P. J., & Tavernelli, I. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.043212 · Cited by 59
Quantum Computing: An Overview Across the System StackPreprint
Resch, S., & Karpuzcu, U. R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.07240 · Cited by 107
Status and future perspectives for lattice gauge theory calculations to the exascale and beyondPreprint
Joó, B., Jung, C., Christ, N. H., Detmold, W., Edwards, R. G., Savage, M. J., & Shanahan, P. E. (2019) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 58
Efficient Classical Simulation of Clifford Circuits with Nonstabilizer Input States
Bu, K., & Koh, D. E. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.170502 · Cited by 68
Quantum computation of molecular response properties
Cai, X., Fang, W., Fan, H., & Li, Z. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033324 · Cited by 53
An improved quantum-inspired algorithm for linear regression
Gilyén, A., Song, Z., & Tang, E. (2022) · Quantum · doi:10.22331/q-2022-06-30-754 · Cited by 97
Markovian Quantum Neuroevolution for Machine Learning
Lu, Z., Shen, P.-X., & Deng, D.-L. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.044039 · Cited by 54
Dual-state purification for practical quantum error mitigation
Huo, M., & Li, Y. (2022) · Physical Review A · doi:10.1103/physreva.105.022427 · Cited by 71
Qi, J., & Tejedor, J. (2022) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp43922.2022.9747636 · Cited by 69
Graph neural network initialisation of quantum approximate optimisation
Jain, N., Coyle, B., Kashefi, E., & Kumar, N. (2022) · Quantum · doi:10.22331/q-2022-11-17-861 · Cited by 78
Carollo, F., & Alba, V. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.l220304 · Cited by 63
Semiconductor Defect Detection by Hybrid Classical-Quantum Deep Learning
Yang, Y.-F., & Sun, M. (2022) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52688.2022.00236 · Cited by 75
Quantum Simulation of Dissipative Collective Effects on Noisy Quantum Computers
Cattaneo, M., Rossi, M. A. C., García-Pérez, G., Zambrini, R., & Maniscalco, S. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010324 · Cited by 69
Quantum computing with and for many-body physics
Ayral, T., Besserve, P., Lacroix, D., & Guzman, E. A. R. (2023) · The European Physical Journal A · doi:10.1140/epja/s10050-023-01141-1 · Cited by 84
Shortcuts to Adiabaticity in Krylov Space
Takahashi, K., & del Campo, A. (2024) · Physical Review X · doi:10.1103/physrevx.14.011032 · Cited by 91
Quantum computational infusion in extreme learning machines for early multi-cancer detection
Bilal, A., Shafiq, M., Obidallah, W. J., Alduraywish, Y. A., & Long, H. (2025) · Journal Of Big Data · doi:10.1186/s40537-024-01050-0 · Cited by 67
Harnessing Quantum Molecular Simulation for Accelerated Cancer Drug Screening
Atalor, S. I., Ijiga, O. M., & Enyejo, J. O. (2023) · International Journal of Scientific Research and Modern Technology. · doi:10.38124/ijsrmt.v2i1.502 · Cited by 105
Quantum-classical simulation of two-site dynamical mean-field theory on noisy quantum hardware
Keen, T., Maier, T., Johnston, S., & Lougovski, P. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab7d4c · Cited by 48
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.