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 5,501–5,600 of 8,640
Quantum simulation of the one-dimensional Fermi-Hubbard model as a Z2 lattice-gauge theory
Khodaeva, U. E., Kovrizhin, D. L., & Knolle, J. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013032 · Cited by 9
Experimental simulation of quantum superchannels
Li, H., Wang, K., Wei, S., Yang, F., Chen, X., Sanders, B. C., Wang, D., & Long, G. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad1c91 · Cited by 2
Quiroga, D., & Kyrillidis, A. (2023) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc60800.2023.10386455 · Cited by 7
Use Cases of Quantum Networks for Industry and Science
Pande, M. B. (2023) · International Conference on Computing Communication Control and automation · doi:10.1109/iccubea58933.2023.10392063 · Cited by 2
Christopoulou, G., Paola, C. D., Elzinga, F., Jallat, A., Ramo, D. M., & Krompiec, M. (2024) · Physical Chemistry Chemical Physics · doi:10.1039/d3cp05167f · Cited by 3
Advanced Encryption Standard on a Quantum System
Dhanapal, A. D., Ramanujan, S. A., & Jeyalakshmi, V. (2023) · International Conference on Integrated Intelligence and Communication Systems (ICIICS) · doi:10.1109/iciics59993.2023.10421474 · Cited by 2
Variational approach to unique determinedness in pure-state tomography
Zhang, C., Zhu, X., & Zeng, B. (2024) · Physical Review A · doi:10.1103/physreva.109.022425 · Cited by 2
Variational quantum eigensolver for closed-shell molecules with non-bosonic corrections
Kim, K., Lim, S., Shin, K., Lee, G., Jung, Y., Kyoung, W., Rhee, J. K., & Rhee, Y. M. (2024) · Physical Chemistry Chemical Physics · doi:10.1039/d3cp05570a · Cited by 11
Escaping local minima with quantum circuit coherent cooling
Feng, J.-J., & Wu, B. (2024) · Physical Review A · doi:10.1103/physreva.109.032405 · Cited by 4
Design of a novel hybrid quantum deep neural network in INEQR images classification
Wang, S., Wang, K.-H., 程, T. 涛. C., Zhao, R.-S., Ma, H., & Guo, S. (2024) · Chinese Physics B · doi:10.1088/1674-1056/ad342e · Cited by 6
Liu, Z., Maranò, S., & Win, M. Z. (2024) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp48485.2024.10446728 · Cited by 2
Exploiting A Quantum Multiple Kernel Learning Approach For Low-Resource Spoken Command Recognition
Fu, X., Zhang, X.-L., Yang, C.-H. H., & Qi, J. (2024) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp48485.2024.10448120 · Cited by 2
Harnessing Quantum Power: Innovations in Optimization Algorithms
Chauhan, A. S., Singh, A., Thakur, R., & Singh, V. K. (2024) · International Journal of Innovative Science and Research Technology (IJISRT) · doi:10.38124/ijisrt/ijisrt24mar1704 · Cited by 2
Parent Hamiltonian Reconstruction via Inverse Quantum Annealing
Rattacaso, D., Passarelli, G., Russomanno, A., Lucignano, P., Santoro, G. E., & Fazio, R. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.160401 · Cited by 8
Emerging Technologies and Future Directions
Singh, M., Bhutani, S., & Chaudhary, P. (2024) · Advances in bioinformatics and biomedical engineering book series · doi:10.4018/979-8-3693-4439-2.ch016 · Cited by 2
Singh, S. K., Sharma, D., Srinivasan, P., et al. (2024) · IEEE Electron Devices Technology & Manufacturing Conference (EDTM) · doi:10.1109/edtm58488.2024.10511467 · Cited by 2
Proposed Model for QCNN-Based Sentimental Short Sentences Classification
Ouamane, N. E. H., & Belhadef, H. (2024) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-031-59707-7_19 · Cited by 2
Variational quantum recurrent neural networks for multi-feature forecasting
Huang, R., Yi, H., & Li, P. H. (2024) · International Journal of Quantum Information · doi:10.1142/s0219749924500291 · Cited by 3
Exploring Quantum Computing Paradigm: From Conceptualisation, Initial Adoption to Development
Tripathi, M., Cherukuri, A. K., Bhasin, A., & Jammalamadaka, S. (2024) · Journal of Information & Knowledge Management · doi:10.1142/s0219649224500291 · Cited by 2
Quantum Computing Mathematical Foundations and Practical Implications
Padamwar, B. V., & Rao, P. H. (2020) · Türk bilgisayar ve matematik eğitimi dergisi · doi:10.61841/turcomat.v11i3.14659 · Cited by 3
Efficient Quantum Circuit Encoding of Object Information in 2D Ray Casting
Lee, S., Jeong, S., & Seo, J. (2024) · International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC) · doi:10.1109/itc-cscc62988.2024.10628280 · Cited by 3
Carbon Emissions of Quantum Circuit Simulation: More than You Would Think
Li, J., Guan, Q., Tao, D., & Jiang, W. (2023) · International Green and Sustainable Computing Conference · doi:10.1145/3634769.3634800 · Cited by 5
Ding, X., Xu, J., Song, Z., Hou, Y., & Shan, Z. (2024) · Chinese Journal of Physics · doi:10.1016/j.cjph.2024.05.044 · Cited by 3
Observability for Quantum Workflows in Heterogeneous Multi-cloud Environments
Beisel, M., Barzen, J., Leymann, F., Stiliadou, L., & Weder, B. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-61057-8_36 · Cited by 3
Minimizing Coherence Errors via Dynamic Decoupling
Khadirsharbiyani, S., Sadeghi, M., Zarch, M. E., & Kandemir, M. (2024) · International Conference on Supercomputing · doi:10.1145/3650200.3656617 · Cited by 3
Monte-Carlo Simulations and Applications in Machine Learning, Option Pricing, and Quantum Processes
Liu, R. (2024) · Highlights in Science Engineering and Technology · doi:10.54097/5yrtzt20 · Cited by 2
Fidelity of the Kitaev honeycomb model under a quench
Roberts, W., Vogl, M. R., & Fiete, G. A. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.l220406 · Cited by 8
Hybrid GRU-CNN bilinear parameters initialization for quantum approximate optimization algorithm
Xu, Z., Cai, P., Shen, K., Yang, T., Hu, Y., Gong, M., Zhu, Y., Wu, Z., Dai, Y., & Yang, F. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad5a50 · Cited by 3
Wojciechowski, K., Kurowski, K., & Mazurek, C. (2024) · Postępy Biochemii · doi:10.18388/pb.2021_536 · Cited by 2
Defining Quantum Advantage for Building a Sustainable MVP to Deliver Quantum Computing Services
Raheman, F. (2024) · Open Journal of Applied Sciences · doi:10.4236/ojapps.2024.146102 · Cited by 5
Multimode physics of the unimon circuit
Tuohino, S., Vadimov, V., Teixeira, W. S., Malmelin, T., Silveri, M., & Möttönen, M. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033001 · Cited by 3
Huang, X., Niu, L., Chen, J., Li, L., Hayat, K., & Liu, W. (2024) · Critical Reviews in Environmental Science and Technology · doi:10.1080/10643389.2024.2365907 · Cited by 3
Tight quantum depth lower bound for solving systems of linear equations
Wang, Q., & Zhang, Z. (2024) · Physical Review A · doi:10.1103/physreva.110.012422 · Cited by 8
The Creation and Utilization of Transistors
Hamza, I. S. M. (2024) · International Journal of Innovative Science and Research Technology (IJISRT) · doi:10.38124/ijisrt/ijisrt24may2128 · Cited by 2
Reitzner, D., & Bouda, J. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04468-w · Cited by 3
Martínez, P. V., López, E., & Bermúdez, A. (2024) · Quantum · doi:10.22331/q-2024-07-15-1411 · Cited by 5
Mixed-State Quantum Spin Liquids and Dynamical Anyon Condensations in Kitaev Lindbladians
Hwang, K. (2024) · Quantum · doi:10.22331/q-2024-07-17-1412 · Cited by 12
D’Arrigo, A., Piccitto, G., Falci, G., & Paladino, E. (2024) · Scientific Reports · doi:10.1038/s41598-024-67503-x · Cited by 7
Full quantum eigensolvers based on variance
Li, R.-N., Tao, Y.-H., Liang, J., Wu, S., & Fei, S.-M. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad664c · Cited by 4
Du, X., Shen, Y., Wu, Z., Zeng, B., & Yang, S. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.014055 · Cited by 4
Quantum Algorithms for the Maximum K-Plex Problem
Li, X., Cong, G., & Zhou, R. H. (2024) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde60146.2024.00192 · Cited by 2
Distinguishing bounce and inflation via quantum signatures from cosmic microwave background
Chandran, S. M., & Shankaranarayanan, S. (2024) · International Journal of Modern Physics D · doi:10.1142/s0218271824410098 · Cited by 6
Variational Quantum Eigensolver for Optimizing Network Scheduling Using QUBO Formulation
Rizvi, S. M. A., Gondel, M. M. U., Paracha, U. I., & Shin, H. (2024) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-031-67357-3_4 · Cited by 2
Spontaneous breaking of time translation symmetry in a system without periodic external driving
Sergeev, T. T., Zyablovsky, A. A., Andrianov, E. S., & Lozovik, Y. E. (2024) · Optics Letters · doi:10.1364/ol.527514 · Cited by 2
Akdemir, Z., Menekşe, M., Carlson, E. W., Dang, N., Hosseini, M., & Li, D. (2024) · ASEE Annual Conference & Exposition · doi:10.18260/1-2--48039 · Cited by 2
Effect of Pure Dephasing Quantum Noise in the Quantum Search Algorithm Using Atos Quantum Assembly
da Silva, M. H. F., de Jesus, G. F., & Cruz, C. (2024) · Entropy · doi:10.3390/e26080668 · Cited by 2
Dynamics of symmetry-protected topological matter on a quantum computer
Mercado, M., Chen, K. J., Darekar, P. H., Nakano, A., Felice, R. D., & Haas, S. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.110.075116 · Cited by 4
Precision magnetometry exploiting excited state quantum phase transitions
Wang, Q., & Marzolino, U. (2024) · SciPost Physics · doi:10.21468/scipostphys.17.2.043 · Cited by 4
Ajagekar, A., & You, F. (2024) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2024.07.480 · Cited by 3
Quantum Gate Control with State Representation for Deep Reinforcement Learning
Zhang, Y., Shang, T., Zhang, C., & Guo, X. (2024) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc62729.2024.00028 · Cited by 2
Quantum Software Ecosystem Design
Basermann, A., Epping, M., Fauseweh, B., Felderer, M., Lobe, E., Röhrig-Zöllner, M., Schmiedinghoff, G., Schuhmacher, P. K., Setyawati, Y., & Weinert, A. (2024) · Springer eBooks · doi:10.1007/978-3-031-64136-7_7 · Cited by 9
Frisch, A., Erhard, A., Feldker, T., Girtler, F., Hettrich, M., Huss, W., Jacob, G., Maier, C., Mayramhof, G., Nigg, D., et al. (2024) · Springer eBooks · doi:10.1007/978-3-031-64136-7_10 · Cited by 8
Towards Application-Aware Quantum Circuit Compilation
Quetschlich, N., Kiwit, F. J., Wolf, M. A., Riofrío, C. A., Burgholzer, L., Luckow, A., & Wille, R. (2024) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw62656.2024.00028 · Cited by 7
Specification of paraconsistent transition systems, revisited
Cunha, J., Madeira, A., & Barbosa, L. S. (2024) · Science of Computer Programming · doi:10.1016/j.scico.2024.103196 · Cited by 2
Purity‐Assisted Zero‐Noise Extrapolation for Quantum Error Mitigation
Jin, T., Shi, Y., Wang, Z., Li, T., Xu, K., & Fan, H. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400150 · Cited by 5
Automatic generation of efficient oracles: The less-than case
Sanchez‐Rivero, J., Talaván, D., García-Alonso, J. M., Ruiz–Cortés, A., & Murillo, J. M. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112203 · Cited by 9
Tomography-assisted noisy quantum circuit simulator using matrix product density operators
Ma, W.-G., Shi, Y., Xu, K., & Fan, H. (2024) · Physical Review A · doi:10.1103/physreva.110.032604 · Cited by 5
Krylov spread complexity of quantum walks
Jeevanesan, B. (2024) · Physical Review A · doi:10.1103/physreva.110.032206 · Cited by 5
Quantum Revolution in Space: Enhancing Space Technology
Landers, V. S. (2024) · Space Law and Policy · doi:10.1007/978-3-031-64045-2_3 · Cited by 4
Shallow-depth variational quantum hypothesis testing
Subramanian, M., & Vinjanampathy, S. (2024) · Physical Review A · doi:10.1103/physreva.110.032424 · Cited by 7
Computing Classical Partition Functions: From Onsager and Kaufman to Quantum Algorithms
Gargiulo, R., Rizzi, M., & Zeier, R. (2024) · doi:10.1145/3665870.3665878 · Cited by 4
Robustness of optimal quantum annealing protocols
Funcke, N., & Berberich, J. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad7b6b · Cited by 6
Environment-mediated long-ranged correlations in many-body system
Xu, M., Stockburger, J. T., & Ankerhold, J. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0225375 · Cited by 5
Namdeo, S., Khurana, S., & Nene, M. J. (2024) · Information systems engineering and management · doi:10.1007/978-3-031-69201-7_20 · Cited by 2
Simulating adiabatic quantum computing with parameterized quantum circuits
Kolotouros, I., Petrongonas, I., Prokop, M., & Wallden, P. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad80c0 · Cited by 7
Hou, G., Zhu, C., & Sun, Y. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad81ba · Cited by 2
Trotterless Simulation of Open Quantum Systems for NISQ Quantum Devices
Burdine, C., & Blair, E. P. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400240 · Cited by 5
Dephasing dynamics of a central spin interacting with a classical Ising spin bath
Shayegani, F., Samani, K. A., Abdi, M., & AlMasri, M. W. (2024) · Physics Letters A · doi:10.1016/j.physleta.2024.129966 · Cited by 4
Yavuz, B. (2024) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3693-5533-6.ch004 · Cited by 2
Chen, J., Wen, Z., Li, Z., Lu, J., Lu, H., Ren, Y., & Chen, W. (2024) · Graphical Models · doi:10.1016/j.gmod.2024.101237 · Cited by 4
A variational quantum algorithm for the Poisson equation based on the banded Toeplitz systems
Liu, X., Qu, Y.-D., Li, M., & Shen, S. (2025) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ad8bae · Cited by 3
Kocharovsky, V. V. (2024) · Entropy · doi:10.3390/e26110926 · Cited by 5
Quantum Extensions to the Einstein Field Equations
Nye, L. (2024) · Journal of High Energy Physics Gravitation and Cosmology · doi:10.4236/jhepgc.2024.104110 · Cited by 4
Jannapureddy, V. R., Yoo, S., & Tseng, H. (2024) · International Conference on Machine Learning and Applications · doi:10.1109/icmla61862.2024.00281 · Cited by 3
User-Authenticated Device-Independent Quantum Secure Direct Communication Protocol
Das, N., Basu, S., Paul, G., & Rao, V. S. (2024) · IEEE International System-on-Chip Conference (SOCC) · doi:10.1109/socc62300.2024.10737816 · Cited by 2
Performance and scaling analysis of variational quantum simulation
Ponce-Martinez, M., Cope, T., de Vega, I., & Leib, M. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad8eee · Cited by 3
Li, L., Zhou, Q., Li, Z., Deng, Y., & Bossé, É. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04581-w · Cited by 2
Reducing the measurement errors in nonadiabatic holonomic quantum computers
Xu, G. (2024) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-024-2515-9 · Cited by 2
A high-efficiency variational quantum classifier for high-dimensional data
Qi, H., Xiao, S., Liu, Z., Gong, C., & Gani, A. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-06676-8 · Cited by 5
Quantum state transfer in interacting multiple-excitation systems
Yue, A., Mondaini, R., Guo, Q., & Scalettar, R. T. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.110.195410 · Cited by 5
A quantum machine learning classifier to search for new physics
Yang, J.-C., Zhang, S., & Yue, C. X. (2026) · Journal of High Energy Physics · doi:10.1007/jhep01(2026)023 · Cited by 7
Sudden death of quantum advantage in correlation generations
Sun, W., Wei, F., Shao, Y., & Wei, Z. (2024) · Science Advances · doi:10.1126/sciadv.adr5002 · Cited by 8
Counting collisions in random circuit sampling for benchmarking quantum computers
Mari, A. (2024) · APL Quantum · doi:10.1063/5.0219266 · Cited by 2
“Validating and benchmarking the quality of quantum computers is an important task [1–4], especially in the present technological era of small-scale and noisy quantum processors [5, 6].”
Enhanced localization in the prethermal regime of continuously measured many-body localized systems
Patrick, K., Yang, Q., & Liu, D. E. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.110.184211 · Cited by 4
Hybrid quantum neural network based on weight remapping and its applications
Dong, Y., & Wu, S. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad9ae1 · Cited by 4
Quantum Algorithm for a Stochastic Multicloud Model
Ueno, K., & Miura, H. (2024) · SOLA · doi:10.2151/sola.2025-006 · Cited by 6
Determination of Molecular Ground State via Short Square Pulses on Superconducting Qubits
Entin, N., Roses, M. M., Cohen, R., Katz, N. Y., & Makmal, A. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.246002 · Cited by 3
Engineering single-atom angular momentum eigenstates in an optical tweezer
Lunt, P., Hill, P., Reiter, J., Preiss, P. M., Gałka, M., & Jochim, S. (2024) · Physical Review A · doi:10.1103/physreva.110.063315 · Cited by 3
Public Key Security for Quantum Key Distribution
Mamatha, G. S., ANEESH, A. S., & Chaithanya, G. K. (2024) · International Conference on Computation System and Information Technology for Sustainable Solutions (CSITSS) · doi:10.1109/csitss64042.2024.10817048 · Cited by 2
Mixing Entanglement Swapping and Hop-by-Hop Transmission On Heterogeneous Quantum Networks
Pandey, A. K., Tamma, B. R., & Rao, M. V. P. (2025) · International Conference on Distributed Computing and Networking (ICDCN) · doi:10.1145/3700838.3700855 · Cited by 2
Mitra, A., Albash, T., Blocher, P. D., Takahashi, J., Miyake, A., Biedermann, G. W., & Deutsch, I. (2025) · New Journal of Physics · doi:10.1088/1367-2630/ada84f · Cited by 11
Validation of a noisy Gaussian boson sampler via graph theory
Stanev, D., Giordani, T., Spagnolo, N., & Sciarrino, F. (2025) · Advanced Photonics Nexus · doi:10.1117/1.apn.4.1.016011 · Cited by 5
Improving Qubit Routing by Using Entanglement Mediated Remote Gates
Padda, G., Tham, E., Brodutch, A., & Touchette, D. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00206 · Cited by 4
Narasimhan, S., Rangan, K. K., & Durand, H. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00142 · Cited by 2
Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization
Ibrahim, C., Tomesh, T., Saleem, Z. H., & Safro, I. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00070 · Cited by 6
Kasi, S., Sud, J., Jamieson, K., & Ravi, G. S. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00051 · Cited by 4
Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation
Aktar, S., Bärtschi, A., Oyen, D., Eidenbenz, S., & Badawy, A. A. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00181 · Cited by 11
Applications of Large-Scale Quantum Neural Networks Based on Distributed Quantum Computing
Kan, Y., He, J., & Xue, C. (2024) · International Conference on Wireless Communications and Signal Processing (WCSP) · doi:10.1109/wcsp62071.2024.10827521 · Cited by 2
Study of Attacks on the HHL Quantum Algorithm
Tan, Y., Kukina, H., & Szefer, J. M. (2024) · IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA) · doi:10.1109/tps-isa62245.2024.00064 · Cited by 2
Error mitigation in brainbox quantum autoencoders
Pazem, J., & Ansari, M. H. (2025) · Scientific Reports · doi:10.1038/s41598-024-84171-z · Cited by 15
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.