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,301–1,400 of 8,640
Accrediting outputs of noisy intermediate-scale quantum computing devices
Ferracin, S., Kapourniotis, T., & Datta, A. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab4fd6 · Cited by 64
QFactory: Classically-Instructed Remote Secret Qubits Preparation
Cojocaru, A., Colisson, L., Kashefi, E., & Wallden, P. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34578-5_22 · Cited by 41
Systematically localizable operators for quantum simulations of quantum field theories
Klco, N., & Savage, M. J. (2020) · Physical Review A · doi:10.1103/physreva.102.012619 · Cited by 46
Non-Markovian Noise Characterization with the Transfer Tensor Method
Chen, Y., Ma, K., Zheng, Y.-C., Allcock, J., Zhang, S., & Hsieh, C. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.13.034045 · Cited by 42
Towards simulation of the dynamics of materials on quantum computers
Oftelie, L. B., Liu, K., Krishnamoorthy, A., Linker, T., Geng, Y., Shebib, D., Fukushima, S., Shimojo, F., Kalia, R. K., Nakano, A., et al. (2020) · Physical review. B./Physical review. B · doi:10.1103/physrevb.101.184305 · Cited by 39
Bibliometric Survey of Quantum Machine Learning
Pande, M. B., & Mulay, P. (2020) · Science & Technology Libraries · doi:10.1080/0194262x.2020.1776193 · Cited by 45
Digital quantum simulation of non-equilibrium quantum many-body systems
Fauseweh, B., & Zhu, J. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03079-z · Cited by 52
Gutzwiller hybrid quantum-classical computing approach for correlated materials
Yao, Y., Zhang, F., Wang, C., Ho, K., & Orth, P. P. (2021) · Iowa State University Digital Repository (Iowa State University) · Cited by 35
Sureshbabu, S. H., Sajjan, M., Oh, S., & Kais, S. (2021) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.1c00294 · Cited by 47
Variational quantum eigensolver for dynamic correlation functions
Chen, H., Nusspickel, M., Tilly, J., & Booth, G. H. (2021) · Physical Review A · doi:10.1103/physreva.104.032405 · Cited by 47
mRNA codon optimization with quantum computers
Fox, D. M., Branson, K. M., & Walker, R. C. (2021) · PLOS ONE · doi:10.1371/journal.pone.0259101 · Cited by 36
New frontiers of quantum computing in chemical engineering
Ajagekar, A., & You, F. (2022) · Korean Journal of Chemical Engineering · doi:10.1007/s11814-021-1027-6 · Cited by 44
Deterministic Search on Star Graphs via Quantum Walks
Qu, D., Marsh, S., Wang, K., Xiao, L., Wang, J., & Xue, P. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.050501 · Cited by 49
Qunity: A Unified Language for Quantum and Classical Computing
Voichick, F., Li, L., Rand, R., & Hicks, M. (2023) · Proceedings of the ACM on Programming Languages · doi:10.1145/3571225 · Cited by 71
Using quantum amplitude amplification in genetic algorithms
Acampora, G., Schiattarella, R., & Vitiello, A. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.118203 · Cited by 41
The reservoir learning power across quantum many-body localization transition
Xia, W., Zou, J., Qiu, X., & Li, X. (2022) · Frontiers of Physics · doi:10.1007/s11467-022-1158-1 · Cited by 48
Quantum Algorithms for Anomaly Detection Using Amplitude Estimation
Guo, M., Liu, H., Li, Y., Li, W., Gao, F., Qin, S., & Wen, Q. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.127936 · Cited by 54
Quantum Computing in Supply Chain Management State of the Art and Research Directions
Gachnang, P., Ehrenthal, J. C. F., Hanne, T., & Dornberger, R. (2022) · Asian Journal of Logistics Management · doi:10.14710/ajlm.2022.14325 · Cited by 49
Gocho, S., Nakamura, H., Kanno, S., Gao, Q., Kobayashi, T., Inagaki, T., & Hatanaka, M. (2023) · npj Computational Materials · doi:10.1038/s41524-023-00965-1 · Cited by 54
Variational quantum approximate support vector machine with inference transfer
Park, S., Park, D. K., & Rhee, J. K. (2023) · Scientific Reports · doi:10.1038/s41598-023-29495-y · Cited by 50
Quantum non-Markovianity: Overview and recent developments
Utagi, S., & Mandayam, P. (2023) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2023.1134583 · Cited by 64
Signatures of non-Markovianity of a superconducting qubit
Gulácsi, B., & Burkard, G. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.174511 · Cited by 44
Quantum approximate optimization algorithm for qudit systems
Deller, Y., Schmitt, S., Lewenstein, M., Lenk, S., Federer, M., Jendrzejewski, F., Hauke, P., & Kasper, V. (2023) · Physical Review A · doi:10.1103/physreva.107.062410 · Cited by 70
Lykov, D., Wurtz, J., Poole, C., Saffman, M. E., Noel, T., & Alexeev, Y. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00718-4 · Cited by 59
Bonsai Algorithm: Grow Your Own Fermion-to-Qubit Mappings
Miller, A., Zimborás, Z., Knecht, S., Maniscalco, S., & García-Pérez, G. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.030314 · Cited by 74
Asynchronous training of quantum reinforcement learning
Chen, S. Y.-C. (2023) · Procedia Computer Science · doi:10.1016/j.procs.2023.08.171 · Cited by 61
Quantum Transfer Learning for Real-World, Small, and High-Dimensional Remotely Sensed Datasets
Otgonbaatar, S., Schwarz, G., Datcu, M. P., & Kranzlmüller, D. A. (2023) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2023.3316306 · Cited by 50
Gottesman-Kitaev-Preskill qubit synthesizer for propagating light
Takase, K., Fukui, K., Kawasaki, A., Asavanant, W., Endo, M., Yoshikawa, J., van Loock, P., & Furusawa, A. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00772-y · Cited by 69
Quantum Machine Learning for Computational Methods in Engineering: A Systematic Review
Sood, S. K., & Agrewal, M. (2023) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-023-10027-w · Cited by 39
Enhancing quantum adversarial robustness by randomized encodings
Gong, W., Dong, Y., Li, W., & Deng, D.-L. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023020 · Cited by 65
Revisiting spatial optimization in the era of geospatial big data and GeoAI
Cao, K., Zhou, C., Church, R. L., Li, X., & Li, W. (2024) · International Journal of Applied Earth Observation and Geoinformation · doi:10.1016/j.jag.2024.103832 · Cited by 52
Universally Robust Quantum Control
Poggi, P. M., Chiara, G. D., Campbell, S., & Kiely, A. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.193801 · Cited by 66
Variational quantum algorithms: fundamental concepts, applications and challenges
Qi, H., Xiao, S., Liu, Z., Gong, C., & Gani, A. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04438-2 · Cited by 63
Symmetry-Enforced Many-Body Separability Transitions
Chen, Y.-H., & Grover, T. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030310 · Cited by 71
H-QNN: A Hybrid Quantum–Classical Neural Network for Improved Binary Image Classification
Hafeez, M. A., Munir, A., & Ullah, H. (2024) · AI · doi:10.3390/ai5030070 · Cited by 66
Pei, Z. (2024) · Cell Reports Physical Science · doi:10.1016/j.xcrp.2024.102334 · Cited by 54
Investigating and mitigating barren plateaus in variational quantum circuits: a survey
Cunningham, J., & Zhuang, J. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04665-1 · Cited by 69
Avkhadiev, A., Shanahan, P. E., & Young, R. D. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.080501 · Cited by 49
Modeling noisy quantum circuits using experimental characterization
Dahlhauser, M., & Humble, T. S. (2021) · Physical Review A · doi:10.1103/physreva.103.042603 · Cited by 49
Quantum Computer Architecture Toward Full-Stack Quantum Accelerators
Bertels, K., Sarkar, A., Hubregtsen, T., Serrao, M., Mouedenne, A. A., Yadav, A., Krol, A. M., Ashraf, I., & Almudéver, C. G. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.2981074 · Cited by 52
Ryabinkin, I. G., Izmaylov, A. F., & Genin, S. N. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abda8e · Cited by 47
VSQL: Variational Shadow Quantum Learning for Classification
Li, G., Song, Z., & Wang, X. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i9.17016 · Cited by 68
Preparing Bethe Ansatz Eigenstates on a Quantum Computer
Dyke, J. S. V., Barron, G. S., Mayhall, N. J., Barnes, E., & Economou, S. E. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040329 · Cited by 60
Unbounded entanglement production via a dissipative impurity
Alba, V. (2022) · SciPost Physics · doi:10.21468/scipostphys.12.1.011 · Cited by 47
Hamiltonian operator approximation for energy measurement and ground state preparation
(21925472), T. B., & Kyriienko, O. (2025) · Figshare · Cited by 39
Grover search revisited: Application to image pattern matching
Tezuka, H., Nakaji, K., Satoh, T., & Yamamoto, N. (2022) · Physical Review A · doi:10.1103/physreva.105.032440 · Cited by 45
Embedding classical dynamics in a quantum computer
Giannakis, D., Ourmazd, A., Pfeffer, P., Schumacher, J., & Sławińska, J. (2022) · Physical Review A · doi:10.1103/physreva.105.052404 · Cited by 45
Arbitrary entangled state transfer via a topological qubit chain
Wang, C., Li, L., Gong, J., & Liu, Y.-X. (2022) · Physical Review A · doi:10.1103/physreva.106.052411 · Cited by 40
Adaptive job and resource management for the growing quantum cloud
Ravi, G. S., Smith, K. N., Murali, P., & Chong, F. T. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00047 · Cited by 78
Quantum readout error mitigation via deep learning
Kim, J., Oh, B., Chong, Y., Hwang, E. H., & Park, D. K. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac7b3d · Cited by 49
Variational quantum evolution equation solver
Leong, F. Y., Ewe, W.-B., & Koh, D. E. (2022) · Scientific Reports · doi:10.1038/s41598-022-14906-3 · Cited by 54
Quantum computing for fusion energy science applications
Joseph, I., Shi, Y., Porter, M. D., Castelli, A. R., Geyko, V., Graziani, F. R., Libby, S. B., & DuBois, J. L. (2023) · Physics of Plasmas · doi:10.1063/5.0123765 · Cited by 55
Transport and entanglement growth in long-range random Clifford circuits
Richter, J., Lunt, O., & Pal, A. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.l012031 · Cited by 46
Analog Photonics Computing for Information Processing, Inference, and Optimization
Stroev, N., & Berloff, N. G. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300055 · Cited by 59
Ground-state energy estimation of the water molecule on a trapped ion quantum computerPreprint
Nam, Y., Chen, J.-S., Pisenti, N. C., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.10171 · Cited by 35
The Capacity of Quantum Neural Networks
Wright, L. G., & McMahon, P. L. (2019) · arXiv · doi:10.48550/arxiv.1908.01364 · Cited by 35
Quantum Computing for High-School Students An Experience Report
Angara, P. P., Stege, U., & MacLean, A. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00047 · Cited by 48
Quantum-enhanced deep neural network architecture for image scene classification
Chalumuri, A., Kune, R., Kannan, S., & Manoj, B. S. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03314-7 · Cited by 40
Reversing Lindblad Dynamics via Continuous Petz Recovery Map
Kwon, H., Mukherjee, R., & Kim, M. S. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.020403 · Cited by 55
On physics-informed neural networks for quantum computers
Markidis, S. (2022) · Frontiers in Applied Mathematics and Statistics · doi:10.3389/fams.2022.1036711 · Cited by 61
Sushmit, M. M., & Mahbubul, I. M. (2023) · Energy Conversion and Management · doi:10.1016/j.enconman.2023.117555 · Cited by 42
Paving the way to hybrid quantum–classical scientific workflows
Cranganore, S. S., Maio, V. D., Brandić, I., & Deelman, E. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.04.030 · Cited by 55
Quantum computing: Impact on energy efficiency and sustainability
Sood, V., & Chauhan, R. P. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.124401 · Cited by 42
Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers
Chakraborty, S. (2024) · Quantum · doi:10.22331/q-2024-10-10-1496 · Cited by 116
Sukulthanasorn, N., Xiao, J., Wagatsuma, K., Nomura, R., Moriguchi, S., & Terada, K. (2025) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2025.117746 · Cited by 36
Optical readout of a superconducting qubit using a piezo-optomechanical transducer
van Thiel, T. C., Weaver, M. J., Berto, F., Duivestein, P., Lemang, M., Schuurman, K. L., Žemlička, M., Hijazi, F., Bernasconi, A. C., Ferrer, C., et al. (2025) · Nature Physics · doi:10.1038/s41567-024-02742-3 · Cited by 71
Error detection on quantum computers improving the accuracy of chemical calculations
Urbanek, M., Nachman, B., & de Jong, W. A. (2020) · Physical Review A · doi:10.1103/physreva.102.022427 · Cited by 34
Simulating and Mitigating Crosstalk
Winick, A., Wallman, J. J., & Emerson, J. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.230502 · Cited by 50
Predicting toxicity by quantum machine learning
Suzuki, T., & Katouda, M. (2020) · Journal of Physics Communications · doi:10.1088/2399-6528/abd3d8 · Cited by 52
Scrambling ability of quantum neural network architectures
Wu, Y., Zhang, P., & Zhai, H. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.l032057 · Cited by 40
Evaluation of QAOA based on the approximation ratio of individual samples
Larkin, J. M., Jonsson, M., Justice, D., & Guerreschi, G. G. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac6973 · Cited by 54
Modeling Quantum programs: challenges, initial results, and research directions
Ali, S., & Yue, T. (2020) · doi:10.1145/3412451.3428499 · Cited by 42
Tilly, J., Jones, G. A., Chen, H., Wossnig, L., & Grant, E. (2020) · Physical Review A · doi:10.1103/physreva.102.062425 · Cited by 48
Relative Entropy of Random States and Black Holes
Kudler-Flam, J. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.171603 · Cited by 38
VERITAS: Accurately Estimating the Correct Output on Noisy Intermediate-Scale Quantum Computers
Patel, T., & Tiwari, D. (2020) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41405.2020.00019 · Cited by 44
Quantum Electromagnetic Transients Program
Zhou, Y., Feng, F., & Zhang, P. (2021) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2021.3067207 · Cited by 34
Unqomp: synthesizing uncomputation in Quantum circuits
Paradis, A., Bichsel, B., Steffen, S., & Vechev, M. (2021) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3453483.3454040 · Cited by 58
Cryo-CMOS for Quantum System On-Chip Integration: Quantum Computing as the Development Driver
Staszewski, R. B., Bashir, I., Blokhina, E., & Leipold, D. R. (2021) · IEEE Solid-State Circuits Magazine · doi:10.1109/mssc.2021.3072807 · Cited by 37
Unitary Selective Coupled-Cluster Method
Fedorov, D. A., Alexeev, Y., Gray, S. K., & Otten, M. (2022) · Quantum · doi:10.22331/q-2022-05-02-703 · Cited by 53
A Heuristic Remote Entanglement Distribution Algorithm on Memory-Limited Quantum Paths
Chen, L., Xue, K., Li, J., Yu, N., Li, R., Liu, J., Sun, Q., & Lu, J. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3205683 · Cited by 37
Shadow Tomography from Emergent State Designs in Analog Quantum Simulators
McGinley, M., & Fava, M. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.160601 · Cited by 59
Shkolnikov, V. O., Mayhall, N. J., Economou, S. E., & Barnes, E. (2023) · Quantum · doi:10.22331/q-2023-06-12-1040 · Cited by 81
High-fidelity realization of the AKLT state on a NISQ-era quantum processor
Chen, T., Shen, R., Lee, C. H., & Yang, B. (2023) · SciPost Physics · doi:10.21468/scipostphys.15.4.170 · Cited by 57
A distributed simulation framework for quantum networks and channelsPreprint
Bartlett, B. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.07047 · Cited by 83
Full-Stack, Real-System Quantum Computer Studies: Architectural Comparisons and Design InsightsPreprint
Murali, P., Linke, N. M., Martonosi, M., Javadi-Abhari, A., Nguyen, N. H., & Alderete, C. H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.11349 · Cited by 45
Pirhooshyaran, M., & Terlaky, T. (2020) · arXiv · doi:10.48550/arxiv.2012.04046 · Cited by 34
Universal Adversarial Examples and Perturbations for Quantum Classifiers
Gong, W., & Deng, D.-L. (2021) · National Science Review · doi:10.1093/nsr/nwab130 · Cited by 58
Evolutionary quantum architecture search for parametrized quantum circuits
Ding, L., & Spector, L. C. (2022) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3520304.3534012 · Cited by 51
A Comprehensive Survey on Quantum Machine Learning and Possible Applications
Umer, M. J., & Sharif, M. I. (2022) · International Journal of E-Health and Medical Communications · doi:10.4018/ijehmc.315730 · Cited by 52
Clemente, G., Crippa, A., & Jansen, K. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.106.114511 · Cited by 50
Hybrid Quantum-Classical Recurrent Neural Networks for Time Series Prediction
Ceschini, A., Rosato, A., & Panella, M. (2022) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn55064.2022.9892441 · Cited by 40
Choi, S., Loaiza, I., & Izmaylov, A. F. (2023) · Quantum · doi:10.22331/q-2023-01-03-889 · Cited by 51
Exponential data encoding for quantum supervised learning
Shin, S., Teo, Y. S., & Jeong, H. (2023) · Physical Review A · doi:10.1103/physreva.107.012422 · Cited by 76
Error statistics and scalability of quantum error mitigation formulas
Qin, D., Chen, Y., & Li, Y. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00707-7 · Cited by 51
Quantum Science and the Search for Axion Dark Matter
Sushkov, A. O. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020101 · Cited by 41
Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices
Bechtold, M., Barzen, J., Leymann, F., Mandl, A., Obst, J., Truger, F., & Weder, B. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acf59c · Cited by 60
Liu, L., & Dou, X. (2024) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3631525 · Cited by 53
Ajagekar, A., & You, F. (2024) · Applied Energy · doi:10.1016/j.apenergy.2024.123244 · Cited by 49
Efficiently improving the performance of noisy quantum computers
Ferracin, S., Hashim, A., Ville, J.-L., Naik, R., Carignan-Dugas, A., Qassim, H., Morvan, A., Santiago, D., Siddiqi, I. A., & Wallman, J. J. (2024) · Quantum · doi:10.22331/q-2024-07-15-1410 · Cited by 85
Two quantum algorithms for solving the one-dimensional advection–diffusion equation
Ingelmann, J., Bharadwaj, S. S., Pfeffer, P., Sreenivasan, K. R., & Schumacher, J. (2024) · Computers & Fluids · doi:10.1016/j.compfluid.2024.106369 · 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.