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 7,001–7,100 of 8,640
Synthesis of energy-conserving quantum circuits with XY interaction
Bai, G., & Marvian, I. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad53fa · Cited by 4
Interpreting variational quantum models with active paths in parameterized quantum circuits
Lee, K., Jeon, H., Lee, D., Kim, B., Bang, J., & Kim, T. (2024) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ad5412
Automated quantum circuit generation for computing inverse hash functions
Henderson, E. R., Henderson, J. M., Oxford, W. V., et al. (2024) · doi:10.1117/12.3012744
Ishak, N. I., & Muniandy, S. V. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad5798
Floating-Point Arithmetic with Consistent Rounding on a Quantum Computer
Steijl, R. (2024) · IntechOpen eBooks · doi:10.5772/intechopen.1005546 · Cited by 2
Many-Body Thermal States on a Quantum Computer: A Variational Approach
Consiglio, M., & Apollaro, T. J. G. (2024) · Advances in atom and single molecule machines · doi:10.1007/978-3-031-57904-2_4 · Cited by 3
Oracle Quantum Algorithms: An OverviewPreprint
da Silva, R. P. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4862127 · Cited by 1
Hybrid Classical-Quantum Simulation of MaxCut using QAOA-in-QAOA
Esposito, A., & Danzig, T. (2024) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw63119.2024.00180 · Cited by 11
Pqkelp: Projected Quantum Kernel Embedding Based Link Prediction in Dynamic NetworksPreprint
Kumar, M., SINGH, N., & Biswas, B. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4881694
Quantum Algorithm for Classical Multidimensional Scaling
Liu, X., Zhou, R., Guo, W., You, X., & Luo, J. (2024) · International Journal of Theoretical Physics · doi:10.1007/s10773-024-05680-1
Zero-error communication under discrete-time Markovian dynamics
Singh, S., Rahaman, M., & Datta, N. (2025) · Quantum · doi:10.22331/q-2025-11-14-1910 · Cited by 12
Simon's Algorithm in the NISQ CloudPreprint
Robertson, R., Doucet, E., Spicer, E., & Deffner, S. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4880353
Wang, S., Li, G., Wang, Z., Chen, Z., Wang, P., Gu, Y., Wu, Y.-C., & Guo, G. (2026) · Physical Review A · doi:10.1103/2p4m-5mt8 · Cited by 3
The Hyper-Torus Universe Model—A New Paradigm for Understanding RealityPreprint
McCammon, C. R. (2024) · Preprints.org · doi:10.20944/preprints202406.0674.v4
The serial and/or parallel execution of Grover's algorithmPreprint
Creemers, S. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4889509
Universal Gravitational Bounds on Information, Computation, and ComplexityPreprint
Nye, L. (2024) · OSF Preprints (OSF Preprints) · doi:10.31219/osf.io/xahc7
The Hyper-Torus Universe Model - A New Paradigm for Understanding RealityPreprint
McCammon, C. R. (2024) · OSF Preprints (OSF Preprints) · doi:10.31219/osf.io/xspd6
Data-driven characterization of latent dynamics on quantum testbeds
Reddy, S. R., Günther, S., & Cho, Y. (2024) · AVS Quantum Science · doi:10.1116/5.0204409 · Cited by 6
Quantum Software Engineering: Practical Challenges
Piattini, M. G., Hevia, J. L., & Peterssen, G. (2024) · International Journal of Software Engineering and Knowledge Engineering · doi:10.1142/s021819402441002x
The Hyper-Torus Universe Model—A New Paradigm for Understanding RealityPreprint
McCammon, C. R. (2024) · Preprints.org · doi:10.20944/preprints202406.0674.v5
Quantum-Classical Synergy: Enhancing De Novo Genome Assembly with Hybridized QUBO OptimizationPreprint
Mukherjee, A., & Mallik, B. B. (2024) · Research Square · doi:10.21203/rs.3.rs-4653117/v1
Optimization Techniques of Quantum Neural Network for Image Classification
Karkera, P., & Srivaramangai, R. (2024) · Lecture notes in networks and systems · doi:10.1007/978-3-031-64836-6_41
The Hyper-Torus Universe Model—A New Paradigm for Understanding RealityPreprint
McCammon, C. R. (2024) · Preprints.org · doi:10.20944/preprints202406.0674.v6
Optimal Task Scheduling in 6G Networks: A Variational Quantum Computing Approach
Khalid, U., Rehman, J. U., Farooq, A., Zaman, F., & Shin, H. (2024) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-031-67357-3_5 · Cited by 3
Zimno... zimniej... kwantowo! – ultrazimne mieszaniny jonu z atomami
Wojciechowska, A., Walewski, M. Z., & Tomza, M. (2023) · Postępy Fizyki · doi:10.61947/uw.pf.2023.74.2.19-23
Variatsionnaya kvantovaya optimizatsiya otkrytogo kar'era
Paradezhenko, G. V., Pervishko, A. A., & Yudin, D. (2024) · Письма в Журнал экспериментальной и теоретической физики · doi:10.31857/s1234567824060090
Quantum Benchmark Suite for IBM's Backend Based on SupermarQ
Yooyuen, C., Bavontaweepanya, R., Prechaprapranwong, P., & Sarochawikasit, R. (2024) · International Joint Conference on Computer Science and Software Engineering · doi:10.1109/jcsse61278.2024.10613716
Optimizing Molecular Structures Quantum Computing in Chemical Simulation
Rao, D. J., Krishna, R. V. V., Kumar, N. V. S., & Pandey, A. P. (2024) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3693-4001-1.ch011
Quantum Algorithms for Accelerated Simulation in Materials Chemistry
Arya, A., Banjare, R. K., Yashan, N., & Joshi, H. C. (2024) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3693-4001-1.ch013
Improving Quantum Genetic Algorithms through Recursive Search Space Exploration
Acampora, G., & Vitiello, A. (2024) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec60901.2024.10612000
Maximum expectation of observables with restricted purity states
Siddhu, V., & Smolin, J. A. (2024) · Quantum · doi:10.22331/q-2024-08-13-1437
Spin and magnon transport in domains of strained antiferromagnetic SrMnO3 films
van Rijn, J. J. L. (2024) · doi:10.33612/diss.1072233649
Yetış, H., & Karaköse, M. (2023) · International Conference on Data Analytics for Business and Industry (ICDABI) · doi:10.1109/icdabi60145.2023.10629340
A Simulation Framework to Understand the Error Generation and Propagation of Quantum Algorithms
Zaman, A. (2024) · San José State University ScholarWorks (San Jose State University) · doi:10.31979/etd.2xh9-54cf · Cited by 2
Fast super robust nonadiabatic geometric quantum computation
Zhang, Y., & Ma, L. (2024) · Physics Letters A · doi:10.1016/j.physleta.2024.129794
An Overview of Quantum Latin Squares in Quantum Information Theory
Fatah, A., McLoughlin, I., Ghafoor, S., & Anton, I. (2024) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc62729.2024.00018
Probing quantum causality with geometric asymmetry in spatial-temporal correlations
Meng, Y., Liu, Z., Zhao, Z., Yin, P., Wang, Y.-T., Liu, W., Li, Z., Yang, Y.-Z., Wang, Z., Xu, J., et al. (2024) · Science China Information Sciences · doi:10.1007/s11432-024-4007-y
Drinko, A., Correr, G. I., Medina, I., Azado, P. C., Canabarro, A., & Soares-Pinto, D. O. (2024) · Research Square · doi:10.21203/rs.3.rs-4803120/v1 · Cited by 1
ugli, A. I. B. (2024) · Ижтимоий-гуманитар фанларнинг долзарб муаммолари / Актуальные проблемы социально-гуманитарных наук / Actual Problems of Humanities and Social Sciences · doi:10.47390/spr1342v4i8y2024n55
The Technological and Societal Landscape
van Daalen, O. (2024) · Information technology and law series/Information technology & law series · doi:10.1007/978-94-6265-635-2_2 · Cited by 1
Universal Control of Symmetric States Using Spin Squeezing
Gutman, N., Gorlach, A. A., Tziperman, O., Ruimy, R., & Kaminer, I. E. (2024) · Quantum 2.0 Conference and Exhibition · doi:10.1364/quantum.2024.qw3a.30
Complex-valued in-medium potential between heavy impurities in ultracold atoms
Akamatsu, Y., Endo, S., Fujii, K., & Hongo, M. (2024) · Physical Review A · doi:10.1103/physreva.110.033304 · Cited by 5
Portfolio Optimization using Accelerated Quantum Simulation
Belekar, G., Modani, M., & Banerjee, A. (2024) · International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT) · doi:10.1109/tqcebt59414.2024.10545076
Universal Control of Symmetric States Using Spin Squeezing
Gutman, N., Gorlach, A. A., Tziperman, O., Ruimy, R., & Kaminer, I. E. (2024) · doi:10.1364/cleo_fs.2024.ff1h.3
Model-Based Testing of Quantum Computations
Lochau, M., & Schaefer, I. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-72044-4_7
Schwenzow, T., Wintersperger, K., Safi, H., von Sicard, O., Niedermeier, C. A., Liebrecht, C., Franke, J. E., & Reitelshoefer, S. (2024) · Research Square · doi:10.21203/rs.3.rs-4907806/v1
Numerical Investigation of the Quantum Inverse Algorithm on Small Molecules
Cainelli, M., Baba, R., & Kurashige, Y. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00483 · Cited by 1
Towards High Performance QNNs via Distribution-Based CNOT Gate Reduction
Sistla, M., Liu, Y., & Fu, X. (2024) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3695872 · Cited by 1
Efficacious Qubit Mappings for Quantum Simulations of the12C Rotational Band
Mumma, D. C., Sun, Z. H., Mercenne, A., Launey, K. D., Rethinasamy, S., & Sauls, J. A. (2024) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi61997.2024.00119 · Cited by 1
Kole, A., Datta, K., & Drechsler, R. (2024) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi61997.2024.00114 · Cited by 2
Gauthier, B., Rosenberg, P., Foley, A., & Charlebois, M. (2024) · Physical Review A · doi:10.1103/physreva.110.032624
FUFQ: A Heterogeneous-based Full-Amplitude Quantum Simulator
Li, S. (2024) · International Conference on Intelligent Computing and Wireless Optical Communications (ICWOC) · doi:10.1109/icwoc62055.2024.10684917
Optimal quantum controls robust against detuning error
Kukita, S., Kiya, H., & Kondo, Y. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad8281 · Cited by 1
Sanders, B. C. (2024) · Elsevier eBooks · doi:10.1016/b978-0-323-95703-8.00259-7 · Cited by 3
Supporting Computing-centred Intuitions for Quantum Computing through Play
Beardow, C. (2024) · Annual Symposium on Computer-Human Interaction in Play · doi:10.1145/3665463.3678850 · Cited by 1
Maximum Entropy Methods for Quantum State Compatibility Problems
Hou, S., Wu, Z., Zeng, J., Cao, N., Cao, C., Li, Y., & Zeng, B. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400172 · Cited by 3
A Study on Qubit Information Masking
Zhang, S., Li, J., Wang, M., & Zhou, B. (2024) · International Journal of Theoretical Physics · doi:10.1007/s10773-024-05802-9
Shang, T. (2024) · Springer eBooks · doi:10.1007/978-981-97-6722-9_1
Shang, T. (2024) · Springer eBooks · doi:10.1007/978-981-97-6722-9_8
Optimal box contraction for solving linear systems via simulated and quantum annealing
Suresh, S., & Suresh, K. (2024) · Engineering Optimization · doi:10.1080/0305215x.2024.2408686 · Cited by 4
Exploring the Cost Landscape of Variational Quantum Algorithms
Stiliadou, L., Barzen, J., Leymann, F., Mandl, A., & Weder, B. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-72578-4_7 · Cited by 2
Luo, M. (2024) · Springer eBooks · doi:10.1007/978-981-97-6226-2_2 · Cited by 1
Gys, B., Burgelman, L., Greve, K. D., Gielen, G. E., & Catthoor, F. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3486546
All-microwave Lamb shift engineering for a fixed frequency multi-level superconducting qubit
Ann, B.-M., & Steele, G. A. (2024) · Communications Physics · doi:10.1038/s42005-024-01841-0
Prepare Linear Distributions with Quantum Arithmetic Units
Li, J. (2024) · Entropy · doi:10.3390/e26110912
The Emergence of Time from Quantum Information Dynamics
Nye, L. (2024) · Journal of High Energy Physics Gravitation and Cosmology · doi:10.4236/jhepgc.2024.104109 · Cited by 5
Native multi-qubit gates in transmon qubits via synchronous driving
Pratapsi, S. S., Cruz, D., & André, P. S. D. B. (2024) · Scientific Reports · doi:10.1038/s41598-024-76396-9 · Cited by 2
Decoherence Cancellation through Noise Interference
D’Auria, G., Morigi, G., Anselmi, F., & Benatti, F. (2026) · Physical Review Letters · doi:10.1103/251j-cnbp · Cited by 2
Evolving Hybrid Quantum-Classical GRU Architectures for Multivariate Time Series
Falco, F. D., Lavagna, L., Ceschini, A., Rosato, A., & Panella, M. (2024) · Machine learning for signal processing ... · doi:10.1109/mlsp58920.2024.10734792 · Cited by 1
The Awe-Inspiring Power of Quantum Computers
Green, J., & Wang, J. (2024) · Frontiers for Young Minds · doi:10.3389/frym.2024.1335355
Quantum Computing: From Weakest Preconditions to Voltage Pulses
Noll, T., Gehnen, C., & Hermanns, R. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-75783-9_9
Investigating the Applications of Deep Learning in Drug Discovery and Pharmaceutical Research
Desai, K., Goyal, M. K., & Nachappa, M. N. (2024) · IEEE International Conference on Advances in Computing Research on Science Engineering and Technology (ACROSET) · doi:10.1109/acroset62108.2024.10743819 · Cited by 2
A quantum neural network for multi-classifications by using FRQI with extra measurement
Jian-Jun, H., Yun-Jiang, W., Cheng, C., Wang, Z., & Sha, S. (2024) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma-2024-0373
Yao, S. (2024) · Research Square · doi:10.21203/rs.3.rs-5051284/v1 · Cited by 1
Etikai megfontolások az innováció biztonságpolitikára gyakorolt hatásaival kapcsolatban
Szilágyi, T. (2024) · Scientia et Securitas · doi:10.1556/112.2024.00199
Quantum Gates with Different Robust Merits
Sun, C., Wang, Y., Wang, G., & Wu, C. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400301
Towards Quantum Simulation of Lower-Dimensional Supersymmetric Lattice ModelsPreprint
Mendicelli, E., & Schaich, D. (2024) · Qeios · doi:10.32388/iesa19 · Cited by 1
qFD: Coherent and Depolarizing Fault Diagnosis for Quantum Processors
Li, Y.-W., Hsieh, C.-Y., Wu, M. L., & Li, J. C.-M. (2024) · IEEE International Test Conference (ITC) · doi:10.1109/itc51657.2024.00038
Li, Y., Zhang, Y., Deng, H., Chen, M., & Li, Z. (2024) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2024.3509794 · Cited by 6
Ding, X., & Clark, B. K. (2024) · Physical Review A · doi:10.1103/physreva.110.062403
Demonstration of continuous-variable quantum machine learning using optical circuits
Ikehara, S., Anai, K., Yano, Y., et al. (2024) · Frontiers in Optics + Laser Science (FiO, LS) · doi:10.1364/fio.2024.fw6c.3
Ptychographic estimation of pure multiqubit states in a quantum device
Alves, W. M. S., & Neves, L. (2024) · APL Quantum · doi:10.1063/5.0236968
Marmorini, G., Fukuhara, T., & Yamamoto, D. (2026) · PRX Quantum · doi:10.1103/1xzz-njyy · Cited by 1
Engineering qubit dynamics in open systems with photonic synthetic lattices
Colandrea, F. D., Jaouni, T., Grace, J., Paneru, D., Arienzo, M., D’Errico, A., & Karimi, E. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.023236 · Cited by 2
Generator and training technique in quantum generative adversarial networks
Ma, Q., Hao, C., Liu, Y., Si, N., Zhang, J., Chen, G., & Qu, D. (2024) · International Conference on Image Processing, Machine Learning and Pattern Recognition (IPMLPR) · doi:10.1145/3700906.3701003
Robustness and classical proxy of entanglement in variants of quantum walks
Mastandrea, C., & Chien, C.-C. (2024) · Physical review. E · doi:10.1103/physreve.110.064124 · Cited by 2
Shadow tomography of quantum states with prediction
Jiang, J., Wan, Z., Li, T., Shao, M., & Zhang, J. (2024) · Frontiers of Computer Science · doi:10.1007/s11704-024-40414-w
Quantum Circuit Learning Enhanced by Dynamic Circuit
Sato, Y., & Kawahara, T. (2024) · International Joint Symposium on Artificial Intelligence and Natural Language Processing (iSAI-NLP) · doi:10.1109/isai-nlp64410.2024.10799377
Multisite gates for state preparation in quantum simulation of the Bose-Hubbard model
Praneel, P., Kiely, T. G., Mueller, E. J., & Petukhov, A. G. (2024) · Physical Review A · doi:10.1103/physreva.110.062615
Quantum Annealing as a Chemical Kinetics Solver for Pollutant Transport Models
Garrido, J. D. D. R., Pérez, A. P., Fernández, E. I., & Jara, A. J. (2024) · Lecture notes in networks and systems · doi:10.1007/978-3-031-77571-0_74
Errors of quantum gates in superconducting quantum circuits
Song, Z., Kai, L., Xiang, L., JiangYu, C., Guo, Q., & ManHong, Y. (2025) · Zhongguo kexue. Wulixue Lixue Tianwenxue · doi:10.1360/sspma-2024-0531
Devendrababu, S., Ganguly, S., Jain, P., Mustafa, H., & Bertel, L. G. A. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-73477-9_11
Efficient quantum circuit contraction using tensor decision diagrams
López-Oliva, V., Badía, J. M., & Castillo, M. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-024-06836-w · Cited by 3
A Variational Quantum Soft Actor-Critic Algorithm for Continuous Control Tasks
Policicchio, A., Acuto, A., Barillà, P., Bozzolo, L., & Conterno, M. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-81247-7_13 · Cited by 1
Murayama, K., Moriyama, Y., Iimura, I., et al. (2024) · Journal of Signal Processing · doi:10.2299/jsp.29.1
Evaluation of QAOA for black-box serializability problem
Ohara, S., Saito, K., & Kawashima, H. (2024) · International Symposium on Computing and Networking Workshops (CANDARW) · doi:10.1109/candarw64572.2024.00038
Feed-Forward Probabilistic Error Cancellation with Noisy Recovery Gates
Kurosawa, L., Saito, Y., Lee, X., Yan, X., Xie, N., Cai, D., Shin, J., & Asai, N. (2024) · IEEE International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC) · doi:10.1109/mcsoc64144.2024.00081 · Cited by 1
Ancilla-entangling Floquet kicks for accelerating quantum algorithms
Wang, C.-C. J., Lotshaw, P. C., Morris, T., Leyton‐Ortega, V., Claudino, D., & Humble, T. S. (2025) · Physical Review A · doi:10.1103/physreva.111.l010401
Compression of Quantum Shallow-Circuit States
Yang, Y. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.010603 · Cited by 5
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.