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,001–1,100 of 8,641
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
Quantum unary approach to option pricing
Ramos-Calderer, S., Pérez-Salinas, A., García-Martín, D., Bravo-Prieto, C., Cortada, J., Planagumà, J., & Latorre, J. I. (2021) · Physical Review A · doi:10.1103/physreva.103.032414 · Cited by 69
Simulating quantum chemistry in the seniority-zero space on qubit-based quantum computers
Elfving, V. E., Millaruelo, M., Gámez, J. A., & Gogolin, C. (2021) · Physical Review A · doi:10.1103/physreva.103.032605 · Cited by 65
Integrating Quantum Computing into Workflow Modeling and Execution
Weder, B., Breitenbücher, U., Leymann, F., & Wild, K. (2020) · IEEE/ACM International Conference on Utility and Cloud Computing (UCC) · doi:10.1109/ucc48980.2020.00046 · Cited by 78
The dominant eigenvector of a noisy quantum state
Koczor, B. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac37ae · Cited by 74
Deep neural networks for quantum circuit mapping
Acampora, G., & Schiattarella, R. (2021) · Neural Computing and Applications · doi:10.1007/s00521-021-06009-3 · Cited by 66
Reinforcement learning for optimization of variational quantum circuit architecturesPreprint
Ostaszewski, M., Trenkwalder, L. M., Masarczyk, W., Scerri, E., & Dunjko, V. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.16089 · Cited by 215
Fundamental limitations on distillation of quantum channel resources
Regula, B., & Takagi, R. (2021) · RePEc: Research Papers in Economics · Cited by 48
Quantum computation: Algorithms and Applications
Cho, C., Chen, C.-Y., Chen, K.-C., Huang, T., Hsu, M.-C., Cao, N., Zeng, B., Tan, S.-G., & Chang, C. (2021) · Chinese Journal of Physics · doi:10.1016/j.cjph.2021.05.001 · Cited by 63
Towards the simulation of large scale protein–ligand interactions on NISQ-era quantum computers
Malone, F. D., Parrish, R. M., Welden, A. R., Fox, T., Degroote, M., Kyoseva, E., Moll, N., Santagati, R., & Streif, M. (2022) · Chemical Science · doi:10.1039/d1sc05691c · Cited by 48
SV-sim: scalable PGAS-based state vector simulation of quantum circuits
Li, A., Fang, B., Granade, C., Prawiroatmodjo, G., Heim, B., Roetteler, M., & Krishnamoorthy, S. (2021) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3458817.3476169 · Cited by 76
Quantum computing algorithms: getting closer to critical problems in computational biology
Marchetti, L., Nifosì, R., Martelli, P. L., Da Pozzo, E., Cappello, V., Banterle, F., Trincavelli, M. L., Martini, C., & D’Elia, M. (2022) · Briefings in Bioinformatics · doi:10.1093/bib/bbac437 · Cited by 47
“The near term perspective is Noisy Intermediate-Scale Quantum (NISQ) computing [55]: the quantum hardware is used only to run short depth circuits as part of more complex algorithms involving also classical hardware, i.”
MethodQuantum phase detection generalization from marginal quantum neural network models
Monaco, S., Kiss, O., Mandarino, A., Vallecorsa, S., & Grossi, M. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.l081105 · Cited by 61
Probing quantum correlations in many-body systems: a review of scalable methods
Frérot, I., Fadel, M., & Lewenstein, M. (2023) · Reports on Progress in Physics · doi:10.1088/1361-6633/acf8d7 · Cited by 74
Speeding Up Learning Quantum States Through Group Equivariant Convolutional Quantum Ansätze
Zheng, H., Li, Z., Liu, J., Strelchuk, S., & Kondor, R. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020327 · Cited by 91
Ready to Leap (by Co-Design)? Join Order Optimisation on Quantum Hardware
Schönberger, M., Scherzinger, S., & Mauerer, W. (2023) · Proceedings of the ACM on Management of Data · doi:10.1145/3588946 · Cited by 69
Critical phase and spin sharpening in SU(2)-symmetric monitored quantum circuits
Majidy, S., Agrawal, U., Gopalakrishnan, S., Potter, A. C., Vasseur, R., & Halpern, N. Y. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.054307 · Cited by 51
Entanglement in a one-dimensional critical state after measurements
Yang, Z., Mao, D., & Jian, C. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.165120 · Cited by 77
Artificial intelligence discovery of a charging protocol in a micromaser quantum battery
Rodríguez, C., Rosa, D., & Ollé, J. (2023) · Physical Review A · doi:10.1103/physreva.108.042618 · Cited by 59
Building spatial symmetries into parameterized quantum circuits for faster training
Sauvage, F., Larocca, M., Coles, P. J., & Cerezo, M. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad152e · Cited by 77
Observation of the non-Hermitian skin effect and Fermi skin on a digital quantum computer
Shen, R., Chen, T., Yang, B., & Lee, C. H. (2025) · Nature Communications · doi:10.1038/s41467-025-55953-4 · Cited by 122
Framework for simulating gauge theories with dipolar spin systems
Luo, D., Shen, J., Highman, M., Clark, B. K., DeMarco, B., El-Khadra, A. X., & Gadway, B. (2020) · Physical Review A · doi:10.1103/physreva.102.032617 · Cited by 58
Accelerating Quantum Approximate Optimization Algorithm using Machine Learning
Alam, M., Ash-Saki, A., & Ghosh, S. (2020) · 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE) · doi:10.23919/date48585.2020.9116348 · Cited by 46
Quantum variational optimization: The role of entanglement and problem hardness
Díez-Valle, P., Porras, D., & García-Ripoll, J. J. (2021) · Physical Review A · doi:10.1103/physreva.104.062426 · Cited by 47
“In the last years, quantum variational optimization [1,2] has emerged as a framework that exploits the computational power of near-term intermediate scale quantum circuits [3].”
BackgroundSimulating Hydrodynamics on Noisy Intermediate-Scale Quantum Devices with Random Circuits
Richter, J., & Pal, A. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.230501 · Cited by 47
Suppression of Static Z Z Interaction in an All-Transmon Quantum Processor
Zhao, P., Lan, D., Xu, P., Xue, G., Blank, M., Tan, X., Yu, H., & Yu, Y. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.024037 · Cited by 57
Towards large-scale quantum optimization solvers with few qubits
Sciorilli, M., Borges, L., Patti, T. L., García-Martín, D., Camilo, G., Anandkumar, A., & Aolita, L. (2025) · Nature Communications · doi:10.1038/s41467-024-55346-z · Cited by 47
“Current implementations are restricted to noisy intermediate-scale quantum devices [16], with variational quantum algorithms [17, 18] as a promising alternative.”
Noise-resilient variational hybrid quantum-classical optimization
Gentini, L., Cuccoli, A., Pirandola, S., Verrucchi, P., & Banchi, L. (2020) · Physical Review A · doi:10.1103/physreva.102.052414 · Cited by 46
Robust in practice: Adversarial attacks on quantum machine learning
Liao, H., Convy, I., Huggins, W. J., & Whaley, K. B. (2021) · Physical Review A · doi:10.1103/physreva.103.042427 · Cited by 74
Dalyac, C., Henriet, L., Jeandel, E., Lechner, W., Perdrix, S., Porcheron, M., & Veshchezerova, M. (2021) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-021-00100-3 · Cited by 46
Experimental Simulation of Open Quantum System Dynamics via Trotterization
Han, J., Cai, W., Hu, L., Mu, X. D., Ma, Y., Xu, Y., Wang, W., Wang, H., Song, Y., Zou, C., et al. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.020504 · Cited by 78
Perspectives of quantum computing for chemical engineering
Bernal, D. E., Ajagekar, A., Harwood, S. M., Stober, S. T., Trenev, D., & You, F. (2022) · AIChE Journal · doi:10.1002/aic.17651 · Cited by 58
Hybrid classical-quantum autoencoder for anomaly detection
Sakhnenko, A., O'Meara, C., Ghosh, K., Mendl, C., Cortiana, G., & Bernabé-Moreno, J. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00075-z · Cited by 64
Quantum state preparation and nonunitary evolution with diagonal operators
Schlimgen, A. W., Head-Marsden, K., Sager-Smith, L. M., Narang, P., & Mazziotti, D. A. (2022) · Physical Review A · doi:10.1103/physreva.106.022414 · Cited by 67
Advancing hybrid quantum–classical computation with real-time execution
Lubinski, T., Granade, C., Anderson, A., Geller, A., Roetteler, M., Petrenko, A., & Heim, B. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.940293 · Cited by 74
Error Propagation in NISQ Devices for Solving Classical Optimization Problems
González-García, G., Trivedi, R., & Cirac, J. I. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040326 · Cited by 76
Tight Bounds on the Convergence of Noisy Random Circuits to the Uniform Distribution
Deshpande, A., Niroula, P., Shtanko, O., Gorshkov, A. V., Fefferman, B., & Gullans, M. J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040329 · Cited by 89
Optimal and Variational Multiparameter Quantum Metrology and Vector-Field Sensing
Kaubruegger, R., Shankar, A., Vasilyev, D. V., & Zoller, P. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020333 · Cited by 74
Self-correcting quantum many-body control using reinforcement learning with tensor networks
Metz, F., & Bukov, M. (2023) · Nature Machine Intelligence · doi:10.1038/s42256-023-00687-5 · Cited by 84
Nuclear shell-model simulation in digital quantum computers
Pérez-Obiol, A., Romero, A. M., Menéndez, J., Rios, A., García-Sáez, A., & Juliá-Díaz, B. (2023) · Scientific Reports · doi:10.1038/s41598-023-39263-7 · Cited by 67
Jiang, J., & Chu, C.-W. (2023) · IEEE Access · doi:10.1109/access.2023.3318206 · Cited by 66
QuCardio: Application of Quantum Machine Learning for Detection of Cardiovascular Diseases
Prabhu, S., Gupta, S. K., Prabhu, G. M., Dhanuka, A. V., & Vivekananda Bhat, K. (2023) · IEEE Access · doi:10.1109/access.2023.3338145 · Cited by 65
AI Advancements: Comparison of Innovative Techniques
Taherdoost, H., & Madanchian, M. (2023) · AI · doi:10.3390/ai5010003 · Cited by 76
Integration of Quantum Technologies into Metaverse: Applications, Potentials, and Challenges
Tuli, E. A., Lee, J., & Kim, D. (2024) · IEEE Access · doi:10.1109/access.2024.3366527 · Cited by 54
Computational Speedups Using Small Quantum Devices
Dunjko, V., Ge, Y., & Cirac, J. I. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.250501 · Cited by 58
Entangling an arbitrary pair of qubits in a long ion crystal
Leung, P. H., & Brown, K. R. (2018) · Physical Review A · doi:10.1103/physreva.98.032318 · Cited by 45
Universal and operational benchmarking of quantum memories
Yuan, X., Liu, Y., Zhao, Q., Regula, B., Thompson, J. E., & Gu, M. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00444-9 · Cited by 68
Quantum simulation of gauge theory via orbifold lattice
Buser, A. J., Gharibyan, H., Hanada, M., Honda, M., & Liu, J. (2021) · Journal of High Energy Physics · doi:10.1007/jhep09(2021)034 · Cited by 81
Nonlinear quantum neuron: A fundamental building block for quantum neural networks
Yan, S., Qi, H., & Cui, W. (2020) · Physical Review A · doi:10.1103/physreva.102.052421 · Cited by 47
Classical simulation of lossy boson sampling using matrix product operators
Oh, C., Noh, K., Fefferman, B., & Jiang, L. (2021) · Physical Review A · doi:10.1103/physreva.104.022407 · Cited by 73
Variational quantum tensor networks classifiers
Huang, R., Tan, X., & Xu, Q. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.04.074 · Cited by 52
Algebraic compression of quantum circuits for Hamiltonian evolution
Kökcü, E., Camps, D., Oftelie, L. B., Freericks, J. K., de Jong, W. A., Beeumen, R. V., & Kemper, A. F. (2022) · Physical Review A · doi:10.1103/physreva.105.032420 · Cited by 71
A Case for Variability-Aware Policies for NISQ-Era Quantum Computers
Tannu, S., & Qureshi, M. K. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.10224 · Cited by 45
Asleep at the wheel? Responsible Innovation in quantum computing
Inglesant, P., Holter, C. T., Jirotka, M. D., & Williams, R. (2021) · Technology Analysis and Strategic Management · doi:10.1080/09537325.2021.1988557 · Cited by 65
Zeng, Y., Wang, H., He, J., Huang, Q., & Chang, S. (2022) · Entropy · doi:10.3390/e24030394 · Cited by 45
Hybrid superconducting photonic-phononic chip for quantum information processing
Xu, X., Wang, W., Sun, L., & Zou, C. (2022) · Chip · doi:10.1016/j.chip.2022.100016 · Cited by 54
Hybrid approach for solving real-world bin packing problem instances using quantum annealers
Romero, S. V., Osaba, E., Villar-Rodríguez, E., Oregi, I., & Ban, Y. (2023) · Scientific Reports · doi:10.1038/s41598-023-39013-9 · Cited by 61
Quantum Simulation of Topological Zero Modes on a 41-Qubit Superconducting Processor
Shi, Y., Liu, Y., Zhang, Y.-R., Xiang, Z., Huang, K., Liu, T., Wang, Y., Zhang, J., Deng, C.-L., Liang, G.-H., et al. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.080401 · Cited by 67
Local Readout and Control of Current and Kinetic Energy Operators in Optical Lattices
Impertro, A., Karch, S., Wienand, J. F., Huh, S., Schweizer, C., Bloch, I., & Aidelsburger, M. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.063401 · Cited by 61
Programmable Superconducting Processor with Native Three-Qubit Gates
Roy, T., Hazra, S., Kundu, S., Chand, M., Patankar, M. P., & Vijay, R. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.014072 · Cited by 64
Contextuality Test of the Nonclassicality of Variational Quantum Eigensolvers
Kirby, W. M., & Love, P. J. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.200501 · Cited by 45
Autonomous Tuning and Charge-State Detection of Gate-Defined Quantum Dots
Darulová, J., Pauka, S., Wiebe, N., Chan, K. W., Gardener, G. C., Manfra, M. J., Cassidy, M. C., & Troyer, M. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.13.054005 · Cited by 63
Local classical MAX-CUT algorithm outperforms p=2 QAOA on high-girth regular graphs
Marwaha, K. (2021) · Quantum · doi:10.22331/q-2021-04-20-437 · Cited by 79
Variational quantum compiling with double Q-learning
He, Z., Li, L., Zheng, S., Li, Y., & Situ, H. (2021) · New Journal of Physics · doi:10.1088/1367-2630/abe0ae · Cited by 70
Berthusen, N., Trevisan, T. V., Iadecola, T., & Orth, P. P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023097 · Cited by 61
Dynamical mean field theory algorithm and experiment on quantum computers
Rungger, I., Fitzpatrick, N., Chen, H., Alderete, C. H., Apel, H., Cowtan, A., Patterson, A., Ramo, D. M., Zhu, Y., Nguyen, N. H., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.04735 · Cited by 45
Quantum Hamiltonian-Based Models and the Variational Quantum Thermalizer Algorithm
Verdon, G., Marks, J., Nanda, S., Leichenauer, S., & Hidary, J. (2019) · arXiv · doi:10.48550/arxiv.1910.02071 · Cited by 45
Quantum Computing: Vision and Challenges
Gill, S. S., Cetinkaya, O., Marrone, S., Claudino, D., Haunschild, D., Schlote, L., Wu, H., Ottaviani, C., Liu, X., Machupalli, S. P., et al. (2025) · Quantum Computing · doi:10.1016/b978-0-443-29096-1.00008-8 · Cited by 44
Detecting and quantifying entanglement on near-term quantum devices
Wang, K., Song, Z., Zhao, X., Wang, Z., & Wang, X. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00556-w · Cited by 58
Quantum Approximation for Wireless Scheduling
Choi, J., Oh, S., & Kim, J. (2020) · Applied Sciences · doi:10.3390/app10207116 · Cited by 44
“In the noisy intermediate-scale quantum (NISQ) era, research on hybrid quantum-classical algorithms such as QAOS is essential [6].”
BackgroundQuantum imaginary-time evolution algorithm for quantum field theories with continuous variables
Aydeniz, K. Y., Moschandreou, E., & Siopsis, G. (2022) · Physical Review A · doi:10.1103/physreva.105.012412 · Cited by 54
Formal Verification of Quantum Programs: Theory, Tools, and Challenges
Lewis, M., Soudjani, S., & Zuliani, P. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3624483 · Cited by 85
Learning to Learn Variational Quantum Algorithm
Huang, R., Tan, X., & Xu, Q. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3151127 · Cited by 53
On the Implementation of Fuzzy Inference Engines on Quantum Computers
Acampora, G., Schiattarella, R., & Vitiello, A. (2022) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2022.3202348 · Cited by 49
Dynamical simulation via quantum machine learning with provable generalization
Gibbs, J., Holmes, Z., Caro, M. C., Ezzell, N., Huang, H.-Y., Cincio, Ł., Sornborger, A. T., & Coles, P. J. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013241 · Cited by 67
Artificial intelligence for quantum computing
Alexeev, Y., Farag, M. H., Patti, T. L., Wolf, M. E., Ares, N., Aspuru‐Guzik, A., Benjamin, S. C., Cai, Z., Cao, S., Chamberland, C., et al. (2025) · Nature Communications · doi:10.1038/s41467-025-65836-3 · Cited by 139
Quantum generative adversarial network based on the quantum Born machine
Ding, Y., Li, Z., & Zhou, N. (2025) · Advanced Engineering Informatics · doi:10.1016/j.aei.2025.103622 · Cited by 50
Status and future perspectives for lattice gauge theory calculations to the exascale and beyond
Joó, B., Jung, C., Christ, N. H., Detmold, W., Edwards, R. G., Savage, M., & Shanahan, P. E. (2019) · The European Physical Journal A · doi:10.1140/epja/i2019-12919-7 · Cited by 95
To quantum or not to quantum: towards algorithm selection in near-term quantum optimization
Moussa, C., Calandra, H., & Dunjko, V. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abb8e5 · Cited by 61
A Dynamic Look-Ahead Heuristic for the Qubit Mapping Problem of NISQ Computers
Zhu, P., Guan, Z., & Cheng, X. (2020) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2020.2970594 · Cited by 50
Minimum hardware requirements for hybrid quantum–classical DMFT
Jaderberg, B., Agarwal, A., Leonhardt, K., Kiffner, M., & Jaksch, D. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab972b · Cited by 57
Nakaji, K. (2020) · Quantum Information and Computation · doi:10.26421/qic20.13-14-2 · Cited by 90
Amplitude estimation via maximum likelihood on noisy quantum computer
Tanaka, T., Suzuki, Y., Uno, S., Raymond, R., Onodera, T., & Yamamoto, N. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03215-9 · Cited by 73
Exact and Practical Pattern Matching for Quantum Circuit Optimization
Iten, R., Moyard, R., Metger, T., Sutter, D., & Woerner, S. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3498325 · Cited by 65
Universal effectiveness of high-depth circuits in variational eigenproblems
Kim, J., Kim, J., & Rosa, D. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023203 · Cited by 56
Reliability Modeling of NISQ- Era Quantum Computers
Liu, J., & Zhou, H. (2020) · IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc50251.2020.00018 · Cited by 66
Liu, J., Li, Z., & Yang, J. (2021) · The Journal of Chemical Physics · doi:10.1063/5.0054822 · Cited by 60
Chabaud, U., Emeriau, P.-E., & Grosshans, F. (2021) · Quantum · doi:10.22331/q-2021-06-08-471 · Cited by 75
Qraft: reverse your Quantum circuit and know the correct program output
Patel, T., & Tiwari, D. (2021) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3445814.3446743 · Cited by 62
On the Expressibility and Overfitting of Quantum Circuit Learning
Chen, C.-C., Watabe, M., Shiba, K., Sogabe, M., Sakamoto, K., & Sogabe, T. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3466797 · Cited by 66
Resolving correlated states of benzyne with an error-mitigated contracted quantum eigensolver
Smart, S. E., Boyn, J.-N., & Mazziotti, D. A. (2022) · Physical Review A · doi:10.1103/physreva.105.022405 · Cited by 50
Nonunitary Operations for Ground-State Calculations in Near-Term Quantum Computers
Mazzola, G., Ollitrault, P. J., Barkoutsos, P. K., & Tavernelli, I. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.130501 · Cited by 43
“On the other hand, quantum computation is still at its infancy and state-of-the-art calculations are performed on so-called noisy intermediate quantum (NISQ) hardware, of 20-50 qubits[6].”
BackgroundWitnessing quantum memory in non-Markovian processes
Giarmatzi, C., & Costa, F. (2021) · Quantum · doi:10.22331/q-2021-04-26-440 · Cited by 93
Qubit-efficient encoding schemes for binary optimisation problems
Tan, B., Lemonde, M.-A., Thanasilp, S., Tangpanitanon, J., & Angelakis, D. G. (2021) · Quantum · doi:10.22331/q-2021-05-04-454 · Cited by 69
Machine Learning Optimization of Quantum Circuit Layouts
Paler, A., Sasu, L. M., Florea, A.-C., & Andonie, R. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3565271 · Cited by 76
Oszmaniec, M., Dangniam, N., Morales, M. E. S., & Zimborás, Z. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020328 · Cited by 114
QOC: quantum on-chip training with parameter shift and gradient pruning
Wang, H., Li, Z., Gu, J., Ding, Y., Pan, D. Z., & Han, S. (2022) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3489517.3530495 · Cited by 74
Purification timescales in monitored fermions
Lóio, H., Luca, A. D., Nardis, J. D., & Turkeshi, X. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.l020306 · Cited by 61
Topological Phases with Average Symmetries: The Decohered, the Disordered, and the Intrinsic
Ma, R., Zhang, J.-H., Bi, Z., Cheng, M., & Wang, C. (2025) · Physical Review X · doi:10.1103/physrevx.15.021062 · Cited by 179
Efficient decomposition methods for controlled-R n using a single ancillary qubit
Kim, T., & Choi, B.-S. (2018) · Scientific Reports · doi:10.1038/s41598-018-23764-x · Cited by 53
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.