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,301–4,400 of 8,640
A quantum approach to the discretizable molecular distance geometry problem
Lavor, C., Marquezino, F. D. L., Oliveira, A., & Portugal, R. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03583-w · Cited by 6
Intelligent pharmaceutical patent search on a near-term gate-based quantum computer
Wang, P., Chen, J., & Tseng, Y. J. (2022) · Scientific Reports · doi:10.1038/s41598-021-04031-y · Cited by 5
Quantum annealing with pairs of 2Σ molecules as qubits
Asnaashari, K., & Krems, R. V. (2022) · Physical Review A · doi:10.1103/physreva.106.022801 · Cited by 4
Virtual Lab by Quantum Flytrap: Interactive simulation of quantum mechanics
Jankiewicz, K., Migdał, P., & Grabarz, P. (2022) · CHI Conference on Human Factors in Computing Systems Extended Abstracts · doi:10.1145/3491101.3519885 · Cited by 5
Waiting for the Quantum Simulation Revolution
Anonymous (2019) · Physics · doi:10.1103/physics.12.112 · Cited by 5
Fast evolution of single qubit gate in non-adiabatic geometric quantum computing
Tang, G., Yang, X., Yan, Y. L., & Lu, J. (2022) · Physics Letters A · doi:10.1016/j.physleta.2022.128349 · Cited by 5
Liu, J., Zhong, C., Otten, M., Chandra, A., Cortes, C. L., Ti, C., Gray, S. K., & Han, X. (2023) · Machine Learning Science and Technology · doi:10.1088/2632-2153/acc726 · Cited by 12
A Quantum Approach for Tactical Capacity Management of Distributed Electricity Generation
Phillipson, F., & Chiscop, I. (2022) · Communications in computer and information science · doi:10.1007/978-3-031-06668-9_23 · Cited by 7
An Example of Use of Variational Methods in Quantum Machine Learning
Simonetti, M., Perri, D., & Gervasi, O. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-10592-0_43 · Cited by 6
Learning quantum dissipation by the neural ordinary differential equation
Chen, L., & Wu, Y. (2022) · Physical Review A · doi:10.1103/physreva.106.022201 · Cited by 10
Quantum computing for data-centric engineering and science
Herbert, S. (2022) · Data-Centric Engineering · doi:10.1017/dce.2022.36 · Cited by 6
Distinction between transport and Rényi entropy growth in kinetically constrained models
Yang, Z.-C. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.l220303 · Cited by 5
Advances in quantum error correction based on superconducting quantum systems
Chen, Z.-J., Pan, X., Hua, Z., Wang, W., Ma, Y., Li, M., Zou, X., Sun, L., & Zou, C. (2022) · Acta Physica Sinica · doi:10.7498/aps.71.20221824 · Cited by 5
Coreset of Hyperspectral Images on a Small Quantum Computer
Otgonbaatar, S., Datcu, M. P., & Demir, B. (2022) · IEEE International Geoscience and Remote Sensing Symposium (IGARSS) · doi:10.1109/igarss46834.2022.9884273 · Cited by 6
Valencia, D., Moguel, E., Rojo, J., Berrocal, J., García-Alonso, J. M., & Murillo, J. M. (2022) · Springer eBooks · doi:10.1007/978-3-031-05324-5_8 · Cited by 7
QSpeech: Low-Qubit Quantum Speech Application Toolkit
Hong, Z., Wang, J., Qu, X., Zhao, C., Wei, T., & Xiao, J. (2022) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn55064.2022.9892496 · Cited by 9
Symmetric Trotterization in digital quantum simulation of quantum spin dynamics
Lee, Y. (2023) · Journal of the Korean Physical Society · doi:10.1007/s40042-023-00722-z · Cited by 6
Quantum computing for data science
Sanders, B. C. (2023) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2438/1/012007 · Cited by 5
Efficacy of noisy dynamical decoupling
Qi, J., Xu, X., Poletti, D., & Ng, H. K. (2023) · Physical Review A · doi:10.1103/physreva.107.032615 · Cited by 8
Fidelity-based distance bounds for N -qubit approximate quantum error correction
Fiusa, G., Soares-Pinto, D. O., & Pires, D. P. (2023) · Physical Review A · doi:10.1103/physreva.107.032422 · Cited by 6
High efficiency radio frequency antennas for amplifier free quantum sensing applications
Mahtab, S. S., Milas, P., Veal, D. T., et al. (2023) · Review of Scientific Instruments · doi:10.1063/5.0136233 · Cited by 5
Robust Quantum Arithmetic Operations with Intermediate Qutrits in the NISQ-era
Saha, A., Chattopadhyay, A., & Chakrabarti, A. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-023-05339-3 · Cited by 5
Hidden Quantum Memory: Is Memory There When Somebody Looks?
Taranto, P., Elliott, T. J., & Milz, S. (2023) · Quantum · doi:10.22331/q-2023-04-27-991 · Cited by 16
Efficient Data Loading with Quantum Autoencoder
Wu, S.-R., Li, C.-T., & Cheng, H. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10096496 · Cited by 6
The Improvement of Decision Tree Construction Algorithm Based on Quantum Heuristic Algorithms
Mannapov, I. (2023) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080223020269 · Cited by 5
Time-optimal control of driven oscillators by variational circuit learning
Huang, T., Ding, Y., Dupays, L., Ban, Y., Yung, M., del Campo, A., & Chen, X. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023173 · Cited by 9
Quantum emulation of the transient dynamics in the multistate Landau-Zener model
Stehli, A., Brehm, J. D., Wolz, T., Schneider, A., Rotzinger, H., Weides, M. P., & Ustinov, A. V. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00731-7 · Cited by 5
Exploiting subspace constraints and ab initio variational methods for quantum chemistry
Gustiani, C., Meister, R., & Benjamin, S. C. (2023) · New Journal of Physics · doi:10.1088/1367-2630/ace182 · Cited by 7
Reliability of IBM’s Public Quantum Computers.
Antón, R. P., Corbí, A., Sánchez, J. I. L., & Burgos, D. (2025) · International Journal of Interactive Multimedia and Artificial Intelligence · doi:10.9781/ijimai.2023.04.005 · Cited by 8
Decoherence mitigation by embedding a logical qubit in a qudit
Miyahara, H., Chen, Y., Roychowdhury, V., & Bouchard, L. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04035-9 · Cited by 7
Hybrid Multi-Objective Genetic Programming for Parameterized Quantum Operator Discovery
Gemeinhardt, F., Klikovits, S., & Wimmer, M. (2023) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3583133.3590696 · Cited by 7
MCBeth: A Measurement-based Quantum Programming Language
Evans, A., Omonije, S., Soulé, R., & Rand, R. W. (2023) · IEEE/ACM International Workshop on Quantum Software Engineering (Q-SE) · doi:10.1109/q-se59154.2023.00007 · Cited by 10
Performance Analysis of the Hardware-Efficient Quantum Search Algorithm
Ahmadkhaniha, A., Mafi, Y., Kazemikhah, P., Aghababa, H., Barati, M., & Kolahdouz, M. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-023-05424-7 · Cited by 6
Lingenfelter, A., & Clerk, A. A. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00748-y · Cited by 5
Improving the implementation of quantum blockchain based on hypergraphs
Orts, F. J., Paulavičius, R., & Filatovas, E. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04096-w · Cited by 8
Basic Research Perspective on Quantum Information Science for the Aerospace Community
Metcalfe, G. D., Tabakov, B., Nguyen, T., Lu, J., & Sayir, A. (2023) · AIAA Journal · doi:10.2514/1.j062978 · Cited by 6
Framework for learning and control in the classical and quantum domains
Vedaie, S. S., Dalal, A., Paez, E. J., & Sanders, B. C. (2023) · Annals of Physics · doi:10.1016/j.aop.2023.169471 · Cited by 8
Ratini, L., Capecci, C., & Guidoni, L. (2023) · Electronic Structure · doi:10.1088/2516-1075/ad018e · Cited by 6
Preparing a Fast Pauli Decomposition for Variational Quantum Solving Linear Equations
Ying, J., Shen, J., Zhou, L., Zhong, W., Du, M., & Sheng, Y. (2023) · Annalen der Physik · doi:10.1002/andp.202300212 · Cited by 8
Operating with Quantum Integers: An Efficient ‘Multiples of’ Oracle
Sanchez‐Rivero, J., Talaván, D., García-Alonso, J. M., Ruiz–Cortés, A., & Murillo, J. M. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-45728-9_7 · Cited by 7
Ghasemian, E., Razminia, A., & Rostami, H. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04137-4 · Cited by 5
Time optimal quantum state transfer in a fully-connected quantum computer
Jameson, C., Basyildiz, B., Moore, D., Clark, K., & Gong, Z. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ad0770 · Cited by 7
Completely Positive Map for Noisy Driven Quantum Systems Derived by Keldysh Expansion
Huang, Z., Lu, Y., Grassellino, A., Romanenko, A., Koch, J., & Zhu, S. (2023) · Quantum · doi:10.22331/q-2023-11-03-1158 · Cited by 6
Diagrammatic Analysis for Parameterized Quantum Circuits
Stollenwerk, T., & Hadfield, S. (2023) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.394.15 · Cited by 19
State preparation in a Jaynes-Cummings lattice with quantum optimal control
Parajuli, P., Govindarajan, A., & Tian, L. (2023) · Scientific Reports · doi:10.1038/s41598-023-47002-1 · Cited by 7
Designing Quantum Games and Quantum Art for Exploring Quantum Physics
Piispanen, L. J. (2023) · IEEE Conference on Games (CoG) · doi:10.1109/cog57401.2023.10333162 · Cited by 5
Accurate harmonic vibrational frequencies for diatomic molecules via quantum computing
Chou, S.-K., Chou, J., Hu, A., Cheng, Y., & Goan, H. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043216 · Cited by 5
A Bibliometric Analysis of Quantum Machine Learning Research
Ahmadikia, A. A., Shirzad, A., & Saghiri, A. M. (2024) · Science & Technology Libraries · doi:10.1080/0194262x.2023.2292049 · Cited by 7
Yu, W., & Zhao, J. (2023) · International Conference on Computer and Applications (ICCA) · doi:10.1109/icca59364.2023.10401605 · Cited by 11
Mode entanglement in fermionic and bosonic Harmonium
Ernst, J. O., & Tennie, F. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad240f · Cited by 10
Practical circuit optimization algorithm for quantum simulation based on template matching
Liu, Y., Zhang, Z., Hu, Y. Y., Meng, F., Luan, T., Zhang, X., & Yu, X. (2024) · Quantum Information Processing · doi:10.1007/s11128-023-04252-2 · Cited by 10
Quantum radio astronomy: Quantum linear solvers for redundant baseline calibration
Renaud, N., Rodríguez-Sánchez, P., Hidding, J., & Broekema, P. C. (2024) · Astronomy and Computing · doi:10.1016/j.ascom.2024.100803 · Cited by 7
A Cryo-CMOS DAC-Based 40-Gb/s PAM4 Wireline Transmitter for Quantum Computing
Fakkel, N., Mortazavi, M., Overwater, R. W. J., Sebastiano, F., & Babaie, M. (2024) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2024.3364968 · Cited by 7
HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids
Jing, H., Li, Y., Brandsema, M. J., Chen, Y., & Yue, M. (2024) · Applied Energy · doi:10.1016/j.apenergy.2024.122878 · Cited by 11
Quantum error mitigation in the regime of high noise using deep neural network: Trotterized dynamics
Zhukov, A., & Pogosov, W. V. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04296-y · Cited by 6
Zhang, Z., & You, Y. (2024) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ad3330 · Cited by 10
ℤ2 × ℤ2 Equivariant Quantum Neural Networks: Benchmarking against Classical Neural Networks
Dong, Z., Cara, M. C., Dahale, G. R., Forestano, R. T., Gleyzer, S. V., Justice, D., Kong, K., Magorsch, T., Matchev, K. T., Matcheva, K., et al. (2024) · Axioms · doi:10.3390/axioms13030188 · Cited by 5
Exponential Hardness of Optimization from the Locality in Quantum Neural Networks
Zhang, H.-K., Zhu, C., Liu, G., & Wang, X. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i15.29614 · Cited by 11
Variational quantum eigensolver with embedded entanglement using a tensor-network ansatz
Watanabe, R., Fujii, K., & Ueda, H. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023009 · Cited by 9
Kanimozhi, T., Sridevi, S., Valliammai, M., Mohanraj, J., Vinodhkumar, N., & Sathasivam, A. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00150-7 · Cited by 7
Construction and volumetric benchmarking of quantum computing noise models
Weber, T., Borras, K., Jansen, K., Krücker, D., & Riebisch, M. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad406c · Cited by 9
A Novel Scheduling Framework for Multi-Programming Quantum Computing in Cloud Environment
Zheng, D., Xv, J., Yue, F., Du, Q., Wang, Z., & Shan, Z. (2024) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2024.048956 · Cited by 8
Quantum-assisted Hilbert-space Gaussian process regression
Farooq, A., Galvis-Florez, C. A., & Särkkä, S. (2024) · Physical Review A · doi:10.1103/physreva.109.052410 · Cited by 10
Resource-efficient quantum-classical hybrid algorithm for energy gap evaluation
Yang, Y., Li, Y., Xu, X., & Yuan, X. (2024) · Physical Review A · doi:10.1103/physreva.109.052416 · Cited by 8
Quantum Computing: A Comprehensive Review
Tamrakar, A., & Sharma, R. (2019) · Türk bilgisayar ve matematik eğitimi dergisi · doi:10.61841/turcomat.v10i3.14623 · Cited by 6
Deterministic Ansätze for the measurement-based variational quantum eigensolver
Schroeder, A. K., Heller, M., & Gachechiladze, M. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad51e5 · Cited by 8
Hermitian-preserving ansatz and variational open quantum eigensolver
Shang, Z.-X. (2024) · Physical Review A · doi:10.1103/physreva.109.062608 · Cited by 6
Characterization of overparametrization in the simulation of realistic quantum systems
Duschenes, M., Carrasquilla, J., & Laflamme, R. (2024) · Physical Review A · doi:10.1103/physreva.109.062607 · Cited by 6
BosonSampling.jl: A Julia package for quantum multi-photon interferometry
Seron, B., & Restivo, A. (2024) · Quantum · doi:10.22331/q-2024-06-18-1378 · Cited by 12
Non-Markovian quantum dynamics from symmetric measurements
Siudzińska, K. (2024) · Physical Review A · doi:10.1103/physreva.110.012440 · Cited by 7
Prolonging a discrete time crystal by quantum-classical feedback
Camacho, G., & Fauseweh, B. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033092 · Cited by 10
Resource Optimization for Quantum Dynamics with Tensor Networks: Quantum and Classical Algorithms
Dwivedi, A., Lopez-Ruiz, M. A., & Iyengar, S. S. (2024) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.4c03407 · Cited by 6
Noise-Aware Variational Eigensolvers: A Dissipative Route for Lattice Gauge Theories
Cobos, J., Locher, D. F., Bermúdez, A., Müller, M., & Rico, E. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030340 · Cited by 7
Exploring the topological sector optimization on quantum computers
Ding, Y.-M., Wang, Y.-C., Zhang, S., & Zheng, Y. Q. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.034031 · Cited by 7
Mootz, M., Iadecola, T., & Yao, Y. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00874 · Cited by 8
Wang, W., Xu, J., Ding, X., Song, Z., Huang, Y., Zhou, X., & Shan, Z. (2024) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2024.054055 · Cited by 14
Quantum Approach for Contextual Search, Retrieval, and Ranking of Classical Information
Alodjants, A. P., Avdyushina, A. E., Tsarev, D. V., Bessmertny, I., & Khrennikov, A. Y. (2024) · Entropy · doi:10.3390/e26100862 · Cited by 9
Triply-heavy/strange baryons with Cornell potential on a quantum computer
Arenaza, N. M., Gálvez-Viruet, J. J., & Llanes–Estrada, F. J. (2024) · The European Physical Journal A · doi:10.1140/epja/s10050-024-01430-3 · Cited by 11
Can quantum computers do nothing?
Nico-Katz, A., Keenan, N., & Goold, J. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00918-6 · Cited by 12
Javanmard, Y., Liaubaitė, U., Osborne, T. J., Xu, X., & Yung, M. (2024) · APL Quantum · doi:10.1063/5.0215573 · Cited by 10
Quantum Shifts: The Societal Implications of Quantum Computing on Security, Privacy, and the Economy
Wheatley, M. C. (2024) · Premier Journal of Computer Science · doi:10.70389/pjcs.100002 · Cited by 5
Towards Compute Capacity Maximization in Constrained Interconnect Multi-Chip Quantum Computing
Ullah, M. A., Awan, A. J., & Svensson, E. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10309 · Cited by 5
QuantumAnnealing: A Julia Package for Simulating Dynamics of Transverse Field Ising Models
Morrell, Z., Vuffray, M., Misra, S., & Coffrin, C. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00096 · Cited by 11
Hacking Cryptographic Protocols with Advanced Variational Quantum Attacks
Aizpurua, B., Bermejo, P., Martínez, J. E., & Orús, R. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3718349 · Cited by 16
Quantum Error Correction in Green Communications: Toward Sustainable Quantum Networks
Thakur, V. S., Kumar, A., & Dev, K. (2025) · IEEE Transactions on Green Communications and Networking · doi:10.1109/tgcn.2025.3544274 · Cited by 9
Enhanced natural parameterized quantum circuit
Chen, Y., Hou, Y., Wang, Z., Wang, T., Wu, Z., Li, Z., & Peng, X. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013221 · Cited by 5
Characterization of coherent errors in gate layers with robustness to Pauli noise
Kaufmann, N., Rojkov, I., & Reiter, F. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.034014 · Cited by 14
Bubble Clustering Decoder for Quantum Topological Codes
Forlivesi, D., Valentini, L., & Chiani, M. (2025) · IEEE Transactions on Communications · doi:10.1109/tcomm.2025.3558012 · Cited by 12
Soil conservation and information technologies: A literature review
Chaves, J. V. B., Rosas, C. L. G., Ferraz, C. P. A., Aiello, L. H. F., Filho, A. P., Mota, L. T. M., Longo, R. M., & Ribeiro, A. ́. (2025) · Smart Agricultural Technology · doi:10.1016/j.atech.2025.100935 · Cited by 8
Optimization Tools and Techniques for AI and ML: Exploring Future Directions and Emerging Trends
Thirupathi, L., Vasundara, B., Rajan, P., & Arella, T. (2025) · Advances in systems analysis, software engineering, and high performance computing book series · doi:10.4018/979-8-3693-6885-5.ch005 · Cited by 7
Comparative Analysis of Fault-Tolerant Implementation of Quantum Logic
Prajapati, M., & Killana, K. B. (2025) · International Conference on Device Intelligence, Computing and Communication Technologies (DICCT) · doi:10.1109/dicct64131.2025.10986350 · Cited by 6
Quantum repeaters: current research trends and latest achievements
Ахмеджанов, Р. А., Balega, Y. Y., Deev, A. D., & Kalachev, A. A. (2025) · Physics-Uspekhi · doi:10.3367/ufne.2025.05.039918 · Cited by 7
A Digital Twin of Scalable Quantum Clouds
Luo, W., Baheri, B., Humble, T. S., Zhao, J., Zhan, T., Maharjan, R., & Guan, Q. (2025) · ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation (PADS) · doi:10.1145/3726301.3732296 · Cited by 10
High dimensional counterdiabatic quantum computing
Tancara, D., & Albarrán-Arriagada, F. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01070-5 · Cited by 10
Zhang, B., Fang, B., Ye, F., Guo, L., Song, F., Tallent, N. R., & Tao, D. (2025) · International Conference on Supercomputing · doi:10.1145/3721145.3725747 · Cited by 9
Turjya, S. M., Bandyopadhyay, A., Kaiser, M. S., & Ray, K. (2025) · AI · doi:10.3390/ai6090209 · Cited by 5
Can Biological Quantum Networks Solve NP‐Hard Problems?
Wendin, G. P. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201800081 · Cited by 5
Benchmarking quantum processors with a single qubit
Göktaş, O., Tham, W. K., Bonsma-Fisher, K., & Brodutch, A. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02642-4 · Cited by 8
Manipulation of superconducting qubit with direct digital synthesis*
Li, Z., Yu, H., Tan, X., Zhao, S.-P., & Yu, Y. (2019) · Chinese Physics B · doi:10.1088/1674-1056/ab37f9 · Cited by 6
Conditions for superdecoherence
Kattemölle, J., & van Wezel, J. (2020) · Quantum · doi:10.22331/q-2020-05-14-265 · Cited by 7
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.