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 4,401–4,500 of 8,640
Chen, J., Nurdin, H. I., & Yamamoto, N. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029180 · Cited by 6
Gülbahar, B. (2020) · Scientific Reports · doi:10.1038/s41598-020-67364-0 · Cited by 7
Polarization selective Dove prism
Yasir, P. A. A., & Goyal, S. K. (2021) · Optics Express · doi:10.1364/oe.420891 · Cited by 6
Idler-free multi-channel discrimination via multipartite probe states
Harney, C., & Pirandola, S. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00488-x · Cited by 6
Simple Mitigation Strategy for a Systematic Gate Error in IBMQ
Bultrini, D., Gordon, M. H., López, E., & Sierra, G. (2021) · Journal of Applied Mathematics and Physics · doi:10.4236/jamp.2021.96083 · Cited by 11
A Hardware-Accelerated Qubit Control System for Quantum Information Processing
Messaoudi, N., Crocker, C., & Almendros, M. (2020) · doi:10.1109/dcis51330.2020.9268643 · Cited by 5
Universal Hash Functions from Quantum Procedures
Ablayev, F. M. (2020) · Učenye zapiski Kazanskogo gosudarstvennogo universiteta. Seriâ Fiziko-matematičeskie nauki/Učënye zapiski Kazanskogo universiteta. Seriâ Fiziko-matematičeskie nauki · doi:10.26907/2541-7746.2020.3.259-268 · Cited by 5
Recent progress in atomistic modelling and simulations of donor spin qubits in silicon
Usman, M. (2021) · Computational Materials Science · doi:10.1016/j.commatsci.2021.110280 · Cited by 5
Hybrid Exchange–Measurement-Based Qubit Operations in Semiconductor Double-Quantum-Dot Qubits
Brooks, M., & Tahan, C. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.064019 · Cited by 7
Quantum algorithm for the calculation of transition amplitudes in hybrid tensor networks
Kanno, S., Endo, S., Suzuki, Y., & Tokunaga, Y. (2021) · Physical Review A · doi:10.1103/physreva.104.042424 · Cited by 6
Harikrishnan, K. J., & Pal, A. K. (2022) · Physical Review A · doi:10.1103/physreva.105.052421 · Cited by 5
Reproducibility in Quantum Computing
Dasgupta, S., & Humble, T. S. (2021) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi51109.2021.00090 · Cited by 10
Embedding of particle tracking data using hybrid quantum-classical neural networks
Rieger, C., Tüysüz, C., Novotny, K., Vallecorsa, S., Demirkoz, B., Potamianos, K., Dobos, D., & Vlimant, J. (2021) · EPJ Web of Conferences · doi:10.1051/epjconf/202125103065 · Cited by 5
Blokhina, E., Sokolov, A., Giounanlis, P., Wu, X., Bashir, I., Leipold, D. R., Staszewski, R. B., Brambilla, A., & Bizzarri, F. (2021) · IEEE Open Journal of Circuits and Systems · doi:10.1109/ojcas.2021.3105005 · Cited by 6
Simulation of Multiple-Quantum NMR Dynamics of Spin Dimer on Quantum Computer
Doronin, S. I., Fel’dman, E. B., Kuznetsova, E. I., & Zenchuk, A. I. (2021) · Applied Magnetic Resonance · doi:10.1007/s00723-021-01435-x · Cited by 5
Las relaciones exteriores de España con el mundo árabe y musulmán durante el siglo XX
Martínez, M. H. D. L. (2014) · Awraq: Estudios sobre el mundo árabe e islámico contemporáneo · Cited by 5
Towards Higher-Level Abstractions for Quantum Computing
Cobb, A., Schneider, J.-G., & Lee, K. (2022) · Australasian Computer Science Week Multiconference (ACSW) · doi:10.1145/3511616.3513106 · Cited by 9
A Quantum-Inspired Sperm Motility Algorithm
Hezam, I. M., Abdul-Raof, O., Foul, A., & Aqlan, F. (2022) · AIMS Mathematics · doi:10.3934/math.2022504 · Cited by 5
Design of Superior Parameterized Quantum Circuits for Quantum Image Classification
Mishra, S., & Tsai, C. (2022) · International Conference on Computer and Automation Engineering · doi:10.1109/iccae55086.2022.9762420 · Cited by 7
The Threat of Quantum Computing to SMEs
Schindler, P., & Ruhland, J. (2022) · Lecture notes in networks and systems · doi:10.1007/978-3-031-10461-9_28 · Cited by 5
Fan, J., Li, J., Wang, Y., Li, Y., Hsieh, M.-H., & Du, J. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3201239 · Cited by 7
Gys, B., Acharya, R., Winckel, S. V., Greve, K. D., Gielen, G. E., & Catthoor, F. (2022) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2022.3201980 · Cited by 6
Iterative quantum optimization with an adaptive problem Hamiltonian for the shortest vector problem
Zhu, Y. R., Joseph, D., Ling, C., & Mintert, F. (2022) · Physical Review A · doi:10.1103/physreva.106.022435 · Cited by 5
Scalable fast benchmarking for individual quantum gates with local twirling
Zhang, Y., Yu, W., Zeng, P., Liu, G., & Ma, X. (2022) · Photonics Research · doi:10.1364/prj.473970 · Cited by 8
A multilayered Pauli tracking architecture for lattice surgery‐based logical qubits
On, J., Kim, C., Oh, S., Lee, S., & Cha, G. (2022) · ETRI Journal · doi:10.4218/etrij.2022-0037 · Cited by 8
Bang-bang algorithms for quantum many-body ground states: A tensor network exploration
Wang, R., Hsieh, T. H., & Vidal, G. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.195133 · Cited by 5
Quantum Approximate Optimization Algorithm-Enabled DER Disturbance Analysis of Networked Microgrids
Jing, H., Wang, Y., Li, Y., Du, L., & Wu, Z. (2022) · IEEE Energy Conversion Congress and Exposition (ECCE) · doi:10.1109/ecce50734.2022.9948058 · Cited by 7
Optimizing the Prioritization of Compiled Quantum Circuits by Machine Learning Approaches
Salm, M., Barzen, J., Leymann, F., & Wundrack, P. (2022) · Communications in computer and information science · doi:10.1007/978-3-031-18304-1_9 · Cited by 8
Variational Quantum Eigensolver with Mutual Variance-Hamiltonian Optimization
Chen, B.-L., & Zhang, D.-B. (2022) · Chinese Physics Letters · doi:10.1088/0256-307x/40/1/010303 · Cited by 6
Modified Iterative Quantum Amplitude Estimation is Asymptotically Optimal
Fukuzawa, S., Ho, C., Irani, S., & Zion, J. (2023) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611977561.ch12 · Cited by 27
Compilation of Entangling Gates for High-Dimensional Quantum Systems
Mato, K., Ringbauer, M., Hillmich, S., & Wille, R. (2023) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/3566097.3567930 · Cited by 15
Оценка возможностей классических компьютеров при реализации симуляторов квантовых алгоритмов
Zrelov, P., Zrelov, P. V., Ульянов, С. В., et al. (2022) · Международный журнал Программные продукты и системы · doi:10.15827/0236-235x.140.618-630 · Cited by 5
Combining Hard and Soft Constraints in Quantum Constraint-Satisfaction Systems
Wilson, E., Mueller, F., & Pakin, S. (2022) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41404.2022.00018 · Cited by 10
Analysis on Role of Quantum Computing in Machine Learning
Saju, B., Gopal, M. K., Nithya, B., Asha, V., & Kumar, V. (2022) · International Conference on Cognitive Computing and Information Processing · doi:10.1109/ccip57447.2022.10058679 · Cited by 5
Exploiting Quantum Power Flow in Smart Grid Co-Simulation
Vereno, D., Khodaei, A., Neureiter, C., & Lehnhoff, S. (2023) · Workshop on Modeling and Simulation of Cyber-Physical Energy Systems (MSCPES) · doi:10.1109/mscpes58582.2023.10123431 · Cited by 7
Segmented composite design of robust single-qubit quantum gates
Kaplan, I., Erew, M., Piasetzky, Y., Goldstein, M., Oz, Y., & Suchowski, H. (2023) · Physical Review A · doi:10.1103/physreva.108.042401 · Cited by 7
Quantum Cryptography: Mathematical Modelling and Security Analysis
Takalkar, A., & Shiragapur, B. K. (2023) · Asian Conference on Innovation in Technology (ASIANCON) · doi:10.1109/asiancon58793.2023.10270593 · Cited by 5
Precise image generation on current noisy quantum computing devices
Rehm, F., Vallecorsa, S., Borras, K., Krücker, D., Grossi, M., & Varo, V. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ad0389 · Cited by 11
Nishio, S., Oba, Y., & Kurashige, Y. (2023) · Physical Chemistry Chemical Physics · doi:10.1039/d3cp03520d · Cited by 9
Distributing Fuzzy Inference Engines on Quantum Computers
Acampora, G., Massa, A. A., Schiattarella, R., et al. (2023) · Proceedings of ... IEEE International Conference on Fuzzy Systems · doi:10.1109/fuzz52849.2023.10309786 · Cited by 5
Constant Depth Code Deformations in the Parity Architecture
Messinger, A., Fellner, M., & Lechner, W. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00022 · Cited by 9
Decoherence limiting the cost to simulate an anharmonic oscillator
Propp, T. B., Ray, S., DeBrota, J. B., Albash, T., & Deutsch, I. (2023) · Physical Review A · doi:10.1103/physreva.108.062219 · Cited by 7
Two-dimensional optomechanical crystal resonator in gallium arsenide
Povey, R. G., Chou, M.-H., Andersson, G., Conner, C. R., Grebel, J., Joshi, Y. J., Miller, J. M., Qiao, H. W., Wu, X., Yan, H., et al. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.014015 · Cited by 6
Sequentially witnessing entanglement by independent observer pairs
Li, M.-S., & Wang, Y. (2024) · Physics Letters A · doi:10.1016/j.physleta.2024.129500 · Cited by 7
Ferreira–Martins, A. J., da Silva, L. H. G., de Palhares, A. B., Pereira, R. G., Soares-Pinto, D. O., Chaves, R., & Canabarro, A. (2024) · Physical Review A · doi:10.1103/physreva.109.052623 · Cited by 8
Impact of Unreliable Devices on Stability of Quantum Computations
Dasgupta, S., & Humble, T. S. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3682071 · Cited by 52
Quantum Codes From Classical Graphical Models
Roffe, J., Zohren, S., Horsman, D., & Chancellor, N. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2938751 · Cited by 11
Experimental linear optical computing of the matrix permanent
Kim, Y., Hong, K.-H., Huh, J., & Kim, Y.-H. (2019) · Physical Review A · doi:10.1103/physreva.99.052308 · Cited by 5
Decoherence dynamics estimation for superconducting gate-model quantum computers
Gyöngyösi, L. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02863-7 · Cited by 7
Quantum Humanities: A First Use Case for Quantum-ML in Media Science
Barzen, J., & Leymann, F. (2019) · Digitale Welt · doi:10.1007/s42354-019-0243-2 · Cited by 5
Quantum algorithms for powering stable Hermitian matrices
González-García, G., Trivedi, R., & Cirac, J. I. (2021) · Physical Review A · doi:10.1103/physreva.103.062420 · Cited by 7
Measurement-Induced Transition in Long-Range Interacting Quantum Circuits
Block, M., Bao, Y., Choi, S., Altman, E., & Yao, N. Y. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.010604 · Cited by 241
Calculation of Gibbs partition function with imaginary time evolution on near-term quantum computers
Matsumoto, K. T., Shingu, Y., Endo, S., Kawabata, S., Watabe, S., Nikuni, T., Hakoshima, H., & Matsuzaki, Y. (2022) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/ac5152 · Cited by 10
Introduction to Monte Carlo for matrix models
Jha, R. G. (2022) · SciPost Physics Lecture Notes · doi:10.21468/scipostphyslectnotes.46 · Cited by 20
Quantum algorithms for conformal bootstrap
Bao, N., & Liu, J. (2019) · Nuclear Physics B · doi:10.1016/j.nuclphysb.2019.114702 · Cited by 5
Concatenated pieceable fault-tolerant scheme for universal quantum computation
Lin, C., & Yang, G. (2020) · Physical Review A · doi:10.1103/physreva.102.052415 · Cited by 8
Applications of Quantum Annealing in StatisticsPreprint
Foster, R. C., Weaver, B., & Gattiker, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.06819 · Cited by 10
Quantum and Quantum-inspired Methods for de novo Discovery of Altered Cancer PathwaysPreprint
Alghassi, H., Dridi, R., Robertson, A. G., & Tayur, S. R. (2019) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/845719 · Cited by 9
A quantum Poisson solver implementable on NISQ devicesPreprint
Wang, S., Wang, Z., Li, W., Fan, L., Cui, G., Wei, Z., & Gu, Y. (2020) · arXiv (Cornell University) · Cited by 5
Toward a standardized methodology for constructing quantum computing use casesPreprint
Chancellor, N., CUMMING, R. L., & Thomas, T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.05846 · Cited by 11
A Deductive Verification Framework for Circuit-building Quantum ProgramsPreprint
Chareton, C., Bardin, S., Bobot, F., Perrelle, V., & Valiron, B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.05841 · Cited by 22
Exploring a Double Full-Stack Communications-Enabled Architecture for Multi-Core Quantum ComputersPreprint
Rodrigo, S., Abadal, S., Alarcón, E., & Almudéver, C. G. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.08186 · Cited by 10
Atchade-Adelomou, P., Golobardes-Ribé, E., & Vilasis-Cardona, X. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.05863 · Cited by 16
Tornow, S., Gehrke, W., & Helmbrecht, U. (2020) · arXiv (Cornell University) · Cited by 3
Reducing the CNOT count for Clifford+T circuits on NISQ architecturesPreprint
Mukhopadhyay, P., Gheorghiu, V., Huang, J., Li, S. M., & Mosca, M. (2022) · doi:10.36227/techrxiv.19742422.v1 · Cited by 5
Relaxed Peephole Optimization: A Novel Compiler Optimization for Quantum CircuitsPreprint
Liu, J., Bello, L., & Zhou, H. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.07711 · Cited by 5
Physical Implementability of Quantum Maps and Its Application in Error MitigationPreprint
Jiang, J., Wang, K., & Wang, X. (2020) · arXiv (Cornell University) · Cited by 6
SpinQ Gemini: a desktop quantum computer for education and researchPreprint
Hou, S., Feng, G., Wu, Z., Zou, H., Shi, W., Zeng, J., Cao, C., Yü, S., Sheng, Z., Rao, X., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.10017 · Cited by 5
Rademacher complexity of noisy quantum circuitsPreprint
Bu, K., Koh, D. E., Li, L., Luo, Q., & Zhang, Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.03139 · Cited by 19
Exploring Information for Quantum Machine Learning Models
Telahun, M. (2020) · ThinkIR: The University of Louisville's Institutional Repository (University of Louisville) · doi:10.18297/etd/3433 · Cited by 7
Nonlinear Quantum Optimization Algorithms via Efficient Ising Model EncodingsPreprint
Patti, T. L., Kossaifi, J., Anandkumar, A., & Yelin, S. F. (2021) · Research Square · doi:10.21203/rs.3.rs-654802/v1 · Cited by 6
ChemiQ: A Chemistry Simulator for Quantum ComputerPreprint
Wang, Q., Liu, H., Li, Q., Zhao, J., Gong, Q., Li, Y., Wu, Y.-C., & Guo, G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.10162 · Cited by 12
A Leap among Entanglement and Neural Networks: A Quantum Survey.Preprint
Massoli, F. V., Vadicamo, L., Amato, G. M., & Falchi, F. (2021) · arXiv (Cornell University) · Cited by 5
Optimization of CNOT circuits under topological constraints.Preprint
Wu, B., He, X., Yang, S., Shou, L., Tian, G., Zhang, J., & Sun, X. (2019) · arXiv (Cornell University) · Cited by 5
Parrish, R. M., Anselmetti, G.-L., & Gogolin, C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.05040 · Cited by 18
A Hierarchy for Replica Quantum AdvantagePreprint
Chen, S., Cotler, J. S., Huang, H.-Y., & Li, J. Z. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.05874 · Cited by 5
Tamiya, S., & Yamasaki, H. (2021) · arXiv (Cornell University) · Cited by 5
Decoherence and quantum error correction for quantum computing and communications.
Martínez, J. E., & de Navarra, U. (2022) · Depósito Académico Digital Universidad de Navarra (University of Navarra) · doi:10.15581/10171/63013 · Cited by 14
Quantum Machine Learning Algorithms
Wong, R., Garg, T., Thombre, R., Maldonado-Romo, A., Niranjan, P., Sen, P., Saggi, M. K., & Bhatia, A. S. (2022) · Wiley eBooks · doi:10.1002/9781119813439.ch5 · Cited by 6
FrozenQubits: Boosting Fidelity of QAOA by Skipping Hotspot NodesPreprint
Ayanzadeh, R., Alavisamani, N., Das, P., & Qureshi, M. K. (2022) · Research Square · doi:10.21203/rs.3.rs-2252963/v1 · Cited by 6
Evaluating the impact of noise on the performance of the Variational Quantum EigensolverPreprint
Oliv, M., Matic-Flierl, A., Messerer, T., & Lorenz, J. M. (2023) · Research Square · doi:10.21203/rs.3.rs-2640456/v1 · Cited by 18
From Quantum Computing to Quantum-inspired Computation for Neuromorphic Advancement -- A SurveyPreprint
Jha, R. K. (2023) · doi:10.36227/techrxiv.24053250.v1 · Cited by 5
Baseri, Y., Chouhan, V., & Hafid, A. S. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4687851 · Cited by 5
Efficient classical calculation of the Quantum Natural Gradient
Jones, T. (2020) · arXiv · doi:10.48550/arxiv.2011.02991 · Cited by 5
Deterministic multi-mode gates on a scalable photonic quantum computing platform
Larsen, M. V., Guo, X., Breum, C. R., Neergaard-Nielsen, J. S., & Andersen, U. L. (2021) · Nature Physics · doi:10.1038/s41567-021-01296-y · Cited by 4
Robust Quantum Metrology With Explicit Symmetric States
Ouyang, Y., Shettell, N., & Markham, D. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3132634 · Cited by 46
Hamiltonian-oriented homotopy quantum approximate optimization algorithm
Kundu, A., Botelho, L., & Glos, A. (2024) · Physical Review A · doi:10.1103/physreva.109.022611 · Cited by 5
Efficient Chromatic-Number-Based Multiqubit Decoherence and Crosstalk Suppression
Brown, A. F., & Lidar, D. A. (2025) · PRX Quantum · doi:10.1103/1d4l-73x6 · Cited by 22
A obustness fication Tool for uantum Machine Learning Models
Lin, Y., Guan, J., Fang, W. S., Ying, M., & Su, Z. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-71162-6_21 · Cited by 5
Quantum machine learning for multiclass classification beyond kernel methods
Ding, C., Wang, S., Wang, Y., & Gao, W. (2025) · Physical Review A · doi:10.1103/physreva.111.062410 · Cited by 16
Enhancing Quantum Diffusion Models with Pairwise Bell State Entanglement
Shah, S. R. K., & Vatsa, M. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-78395-1_23 · Cited by 8
Variational Quantum Algorithms via Measurement-Induced Passive Steering
Sanjaya, S., Volya, D., & Mishra, P. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00063 · Cited by 5
Enhancement of radial basis function model via quantum kernel estimation
Zhou, X., Zhang, M., Cui, Q., & Jiang, T. (2025) · Journal of Mathematical Analysis and Applications · doi:10.1016/j.jmaa.2025.129254 · Cited by 6
Speeding up Grover’s algorithm
Creemers, S. (2025) · European Journal of Operational Research · doi:10.1016/j.ejor.2025.02.034 · Cited by 7
Space-Time Correlations in Monitored Kinetically Constrained Discrete-Time Quantum Dynamics
Cech, M., Cea, M., Bañuls, M. C., Lesanovsky, I., & Carollo, F. (2025) · Physical Review Letters · doi:10.1103/2lxs-wccj · Cited by 21
Quantum-enhanced feature learning: a hybrid QCNN for multi-category classification on NISQ devices
Dongfen, L., Yuan, Y., Hu, Z., Sun, Y., & Xiang, Q. (2025) · Physica Scripta · doi:10.1088/1402-4896/addef6 · Cited by 6
Robust, fast, and high-fidelity composite single-qubit gates for superconducting transmon qubits
Tonchev, H. G., Torosov, B. T., & Vitanov, N. V. (2025) · Physical Review A · doi:10.1103/s7h1-lqc1 · Cited by 9
Quantum Multiplexer Simplification for State Preparation
de Carvalho, J. A., Batista, C. A., Veras, T. M. L., Araujo, I. F., & da Silva, A. J. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3748260 · Cited by 11
State-agnostic approach to certifying electron–photon entanglement in electron microscopy
Rembold, P., Beltrán-Romero, S., Preimesberger, A., Bogdanov, S., Bicket, I. C., Friis, N., Agudelo, E., Rätzel, D., & Haslinger, P. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adf004 · Cited by 15
Quantum-Enhanced Cancer Detection for Histopathologic Images
Goyal, N., Uehara, G. S., & Spanias, A. (2025) · Proceedings - International Conference on Image Processing · doi:10.1109/icip55913.2025.11084595 · 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.