Quantum Computing in the NISQ era and beyond
Open accessThe DOI matches its Crossref record; 75 of the 82 references it cites were found in a registry or an index; 25 of the 40 sources its claims cite were checked for support.
Abstract
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away - we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing.
Overview
CoChat Summary
TL;DR
Preskill introduces the NISQ era—noisy intermediate-scale quantum devices with 50–100 qubits—as a near-term step toward quantum computing, useful for exploring many-body quantum physics but limited by noise and not expected to change the world by itself. He argues that fault-tolerant quantum computing remains distant and that near-term applications, especially hybrid quantum-classical algorithms, are promising but unproven.
Key findings
- NISQ devices will have 50 to a few hundred qubits; 50 qubits is a milestone because it is beyond brute-force simulation by the most powerful existing digital supercomputers. However, with two-qubit gate error rates above 0.1%, circuits with many more than about 1000 gates are not expected to be reliable.
- NISQ technology may be useful for exploring many-body quantum physics and quantum dynamics, and hybrid quantum-classical algorithms such as QAOA and VQE may find approximate solutions to optimization problems, but whether they outperform classical methods is an open question.
- Quantum algorithms offer speedups for problems such as factoring, matrix inversion (HHL runs in O(log N)), recommendation systems (O(poly(k)polylog(mn))), and semidefinite programming (polylog(N)), but many require error correction or QRAM and are probably not feasible in the NISQ era. A note added states that Tang’s quantum-inspired classical algorithm removes the exponential speedup claimed for quantum recommendation systems.
- Fault-tolerant quantum computing is still distant: running algorithms with thousands of protected qubits will require millions of physical qubits, so NISQ should be regarded as a step toward more powerful future quantum technologies.
Methods
- This is a conceptual review and keynote address, based on a Keynote Address at Quantum Computing for Business, 5 December 2017; it is not an empirical study.
- The paper assesses the current status and future potential of quantum computing, discussing hardware platforms, gate errors, qubit counts, quantum algorithms, and fault-tolerance requirements.
- The main analysis is a qualitative synthesis of theoretical arguments, experimental examples, and open questions; no dataset, sample, or statistical analysis is reported.
Limitations
- The paper states it is “the result of an uneasy compromise,” minimizes jargon and technical details for a broader audience, and does not attempt a comprehensive list of references.
- The paper states that NISQ devices have imperfect control and noise, that gate error rates are above 0.1% and may not be maintained in larger devices, that circuit size is limited to roughly 1000 gates, and that validating quantum outputs may be hard.
- Evident from the text: as a keynote-style review, it offers projections and opinions rather than new experimental data or a systematic review; several speedup claims are explicitly open questions, and the recommendation-systems speedup is later undercut by a quantum-inspired classical algorithm.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
14 Valid · 9 Not valid · 10 Not checked · 85 Own results and interpretations
Some cited sources support this claim and some don’t — read each source’s verdict below.
In the paper
“50 qubits is a significant milestone, because that's beyond what can be simulated by brute force using the most powerful existing digital supercomputers.”
What the sources say
- Supportedcites [11] [11] S. Boixo, S. V. Isakov, V. N. Smelyansky, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, Characterizing quantum supremacy in near-term devices, Nature Physics 14, 595-600 (2018), arXiv:1608.00263 (2016), https://doi.org/10.1038/s41567-018-0124-x. - source
The Introduction (p. 1) says that even modest-depth circuits acting on approximately fifty qubits cannot be directly simulated in practice. The Conclusion (p. 12) estimates that state-of-the-art supercomputers fail to simulate universal random circuits beyond approximately 48 qubits at a depth of about 40. The milestone claim is supported in that circuit context. (LLM, conf=0.90)
- Disputedcites [12] [12] S. Aaronson and L. Chen, Complexity-theoretic foundations of quantum supremacy experiments, arXiv:1612.05903 (2017). - sourceExperimental — accuracy not yet measured
Section 1.2 (p. 4) describes 40–50 qubits as a range where classical simulation is difficult but not impossible, contrary to the claim that 50 qubits is beyond brute-force simulation. Section 1.3 (p. 7) also describes a classical simulation method and says its 2^n time is reasonable for a planned setup with roughly 40 or 50 qubits. (LLM, conf=0.86)
Checked by a reasoning model — may be wrong.
- Supportedcites [13] [13] E. Pednault, J. A. Gunnels, G. Nannicini, L. Horesh, T. Magerlein, E. Solomonik, and R. Wisnieff, Breaking the 49-qubit barrier in the simulation of quantum circuits, arXiv:1710.05867 (2017). - source
The Abstract (p. 1) frames systems of more than 50 qubits as the coming regime and states that 'resource requirements for such calculations on classical computers grow exponentially', with the relevant calculations 'thought to be impossible due to resource requirements'. Section 2.1 (p. 3) gives the concrete brute-force bound: the full state of a 49-qubit system needs 2^49 complex numbers (8 PB in double precision), which 'eliminates the possibility of keeping the entire state in primary storage', and the Feynman-path alternative 'grows to intractable levels very quickly'. The Introduction (p. 2) reinforces this by noting that the state-of-the-art full-state techniques of the time would have required 8 PB (49 qubits) and 1 EB (56 qubits), far beyond the ~64 TB aggregate RAM of Vulcan/Sequoia-class machines. The citing sentence's 'brute force' qualifier matches the paper's own contrast with tensor-contraction-deferral methods, so the attribution holds; only the rhetorical label 'significant milestone' is the citing authors' framing. (LLM, conf=0.83)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“Eventually we expect to be able to protect quantum systems and scale up quantum computers using the principle of quantum error correction [10].”
What the sources say
- Supportedcites [10] [10] D. Gottesman, An introduction to quantum error correction and fault-tolerant quantum computation, Proceedings of Symposia in Applied Matthematics 68 (2010), arXiv:0904.2557. - source
The Background (p. 1) says quantum computers need protection from noise and identifies error correction as necessary. Fault-tolerant gates (p. 17) explains that, below an error-rate threshold, arbitrarily accurate quantum computation is possible with polylogarithmic overhead. This supports the expectation of protecting quantum systems and scaling up quantum computers, subject to that threshold. (LLM, conf=0.91)
hedgedstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“as of now we don't have a convincing theoretical argument or persuasive experimental evidence indicating that quantum annealers can really speed up the time to solution compared to the best classical hardware running the best algorithms for the same problems [28, 29].”
What the sources say
- Partly supportedcites [28] [28] T. F. Rønnow, Z. Wang, J. Job, S. Boixo, S. V. Isakov, D. Wecker, J. M. Martinis, D. A. Lidar, and M. Troyer, Defining and detecting quantum speedup, Science 345, 420-424 (2014), https://doi.org/10.1126/science.1252319. - sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
- Partly supportedcites [29] [29] S. Mandrà, H. G. Katzgraber, and C. Thomas, The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again), Quantum Sci. Technol. 2, 038501 (2017), arXiv:1703.00622, https://doi.org/10.1088/2058-9565/aa7877. - sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“In particular, the task of matrix inversion admits an exponential quantum speedup, which could have many applications.”
What the sources say
- Supportedcites [40] [40] A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009), arXiv:0811.3171, https://doi.org/10.1103/PhysRevLett.103.150502. - source
The paper’s Outline says its hardness results imply that the algorithm runs exponentially faster than any classical algorithm for the matrix-inversion task. The performance discussion qualifies this speedup: it is greatest when the condition number and inverse accuracy are polylogarithmic in matrix size, and the algorithm outputs a quantum representation rather than every component of the solution. (LLM, conf=0.92)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“As Laughlin and Pines [8] emphasized in the statement I quoted earlier, we think that simulating such 'strongly correlated' matter is a difficult computational problem, because many very good physicists have tried to solve it for decades and have not succeeded.”
What the sources say
- Supportedcites [8] [8] R. B. Laughlin and D. Pines, The theory of everything, PNAS 97, 28-31 (2000), https://doi.org/10.1073/pnas.97.1.28. - source
In the paper’s main text (page not supplied), Laughlin and Pines say accurate solutions become infeasible for more than about 10 particles because the computational requirements grow rapidly. They also describe notorious failures of approximate calculations for high-temperature superconductors, supporting the claim that simulating such matter is difficult. (LLM, conf=0.90)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
37 more claims · 4 with their cited sources checked
Create a free account to see all 118 claims and to verify the 5 references still open.
- It may state two separate claims as one. 26
- Probably not a substantial claim. 63
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source doesn’t support the claim as written.
In the citing paper
“so-called Noisy Intermediate-Scale Quantum (NISQ) computers already exist today”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [209]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Furthermore, they are challenging to make extensible as required to surpass noisy intermediate-scale quantum (NISQ)-era scales [221] and thereby enable practically relevant quantum computation.”
From 2022 Roadmap on integrated quantum photonics (2022) · cites this paper as [221]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Therefore, research on quantum algorithms splits, on the one hand, into algorithms for fault-tolerant quantum computers, which we may think of as a future perfect quantum computer, and, on the other hand, into algorithms for nearterm or noisy-intermediate stage quantum (NISQ) [120] devices of dozens to thousands of physical qubits, that are characterized by the absence of complete fault-tolerance.”
From Quantum Computing for Molecular Biology** (2023) · cites this paper as [120]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations within a limited coherence time.”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Preskill, 2018
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These hybrid quantum-classical algorithms are specifically designed to minimize the limitations of current quantum hardware, such as decoherence and gate errors, by delegating some computational tasks to classical processors. [8]”
From Limitations of Quantum Hardware for Molecular Energy Estimation Using VQE (2026) · cites this paper as [8]
Experimental — accuracy not yet measured
10 more claims about this paper
Create a free account to see every claim other papers make about this one.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 2 Opportunities at the entanglement frontier · p. 2
“We don't think that's not true for classical ( i.e. , nonquantum) digital computers”
§ 2 Opportunities at the entanglement frontier · p. 2
“which (as far as we know) can't simulate highly entangled quantum systems.”
Citations
Cites
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 1×
“to be hard for classical computers, but for which quantum algorithmshavebeendiscoveredthatcouldsolvetheseproblemseasily. Thebestknown exampleistheproblemoffindingtheprimefactorsofalargecompositeinteger[1]. Webelievefactoringishardbecausemanysmartpeoplehavetriedformanydecades to find better factoring algorithms and haven…”
BackgroundBiamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779 · cited 1×
“” Much of the literature on the subject builds on quantum algorithms that speed up linear algebra and related tasks [37, 38], and I’ll address such applications in the ensuing subsections.”
BackgroundA variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Degen, C. L., Reinhard, F., & Cappellaro, P. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.035002 · Cited by 4,045 · cited 1×
“antum sensing. Quantum technology has advantages for some kinds of sensing. Quantum systems can sense weak forces with better sensitivity and higher spatial resolution than other sensing technologies [19]; thus quantum sensing could have relatively near-term high-impact applications, to medicine for example. Quantum c…”
BackgroundPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 1×
“6.6 Quantummatrixinversion QRAMhasfurtherimplicationsforquantumalgorithms. Inparticular,thetaskofmatrix inversionadmitsanexponentialquantumspeedup,whichcouldhavemanyapplications. ThealgorithmwecallHHL[40](afterthethreeauthorswhofirstdiscusseditnineyears ago) takes as input a succinct representation of a very large N×N…”
BackgroundInfluentialSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“for a while, because of the large number of physical qubits needed. To run algorithms involving thousands of protected qubits we’ll need a number of physical qubits which is in the millions, or more [50]. That’s a very large leap from where we will be for the next few years, with of order a hundred qubits. Crossing th…”
BackgroundProbing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460 · cited 1×
“Analog quantum simulators have been getting notably more sophisticated, and are already being employed to study quantum dynamics in regimes which may be beyond the reach of classical simulators [51, 52].”
Background
Cited by
Items 5,401–5,500 of 8,640
Quantum linear system solvers: A survey of algorithms and applications
Morales, M. E. S., Pira, L., Schleich, P., Koor, K., Costa, P. C. S., An, D., Aspuru‐Guzik, A., Lin, L., Rebentrost, P., & Berry, D. W. (2026) · Reviews of Modern Physics · doi:10.1103/x6gh-d8gh · Cited by 94
A Hybrid Quantum-Enhanced Sandwich Convolutional Neural Network for Medical Image Classification
Long, C., Li, S., Huang, M., Ye, X., & Sakurai, T. (2026) · Current Bioinformatics · doi:10.2174/0115748936418250251104114256 · Cited by 4
Sankaradass, V., & Manish, V. K. M. (2026) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2026.113730 · Cited by 6
Sarker, S., Khriyenko, O., Mikkonen, T., & Haghparast, M. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae3a56 · Cited by 2
Yousuf, M. M., & Sofi, S. A. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.132809 · Cited by 12
Sahu, H. K., Parida, I., Bhandari, A., Jena, N. R., & Vijay, M. (2026) · Asia-Pacific Financial Markets · doi:10.1007/s10690-025-09588-6 · Cited by 3
Quo Vadis, Quantum Machine Learning?: Quantum kernel methods meet Earth observation
Miroszewski, A., Nalepa, J., Wijata, A. M., B, J. M. A., Saux, B. L., & Sebastianelli, A. (2026) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2025.3596291 · Cited by 4
Demonstration of measurement-free universal logical quantum computation
Butt, F., Pogorelov, I., Freund, R., Steiner, A., Meyer, M., Monz, T., & Müller, M. (2026) · Nature Communications · doi:10.1038/s41467-026-68533-x · Cited by 2
“Based on these outcomes, we perform a classical round of error detection and postselect on the two Z -stabilizers of the [[4, 1, 2]]-code.”
InfluentialIndividual trapped-ion addressing with adjoint-optimized multimode photonic circuits
Momenzadeh, M., Sun, K., Wu, Q., You, B., Tang, Y., Häffner, H., & Shcherbakov, M. R. (2026) · npj Nanophotonics · doi:10.1038/s44310-025-00102-4 · Cited by 9
Improving Quantum Machine Learning via Heat-Bath Algorithmic Cooling
Rodríguez-Briones, N. A., & Park, D. K. (2026) · PRX Quantum · doi:10.1103/24n3-tskj · Cited by 4
Quantum Approaches for the Unit Commitment Problem - a Literature Survey
Phillipson, F., & Muller, S. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-13855-2_1 · Cited by 2
Diffusion‐Enhanced Optimization of Variational Quantum Eigensolver for General Hamiltonians
Zhang, S., Qin, Z., Zhang, Y., Zhou, Y., Li, R., Du, C., & Xiao, Z. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.202500766 · Cited by 11
Characterizing conditional quantum dynamics on superconducting quantum processors
AbuGhanem, M. (2026) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-025-07284-y · Cited by 3
Enhanced algorithmic perfect state transfer on IBM quantum computers
Ge, Z., Wu, L., & Wang, Z.-M. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae4421 · Cited by 6
Quantum Machine Learning for Cyber Threat Detection: Enhancing Security in the Quantum Era
Noor, M. A. (2025) · CyberSystem journal. · doi:10.57238/csj.2025.1015 · Cited by 2
Quantum annealing for remote sensing data processing: A review of optimization based applications
Misra, I., Moorthi, S. M., & Dhar, D. (2026) · Remote Sensing Applications Society and Environment · doi:10.1016/j.rsase.2026.101936 · Cited by 3
Quantum neural networks for cloud cover parameterizations in climate models
Pastori, L., Grundner, A., Eyring, V., & Schwabe, M. (2026) · Machine Learning Earth · doi:10.1088/3049-4753/ae4981 · Cited by 12
The Lie algebra of XY-mixer topologies and warm starting QAOA for constrained optimization
Kordonowy, S., & Leipold, H. (2026) · npj Quantum Information · doi:10.1038/s41534-026-01192-4 · Cited by 15
Bidart, A., Vaish, P., Kabengele, T., Pang, Y., Liu, Y., & Rubenstein, B. M. (2026) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-082624-084635 · Cited by 10
A Dynamic Test Oracle for Quantum Programs With Separable Output States
Li, Y., Cai, K.-Y., & Yin, B. (2026) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2026.3670211 · Cited by 7
Why Oracle-Based Quantum Search Cannot Use Deep Loops: Physical Limits on Sequential Operations
Liu, Y. (2026) · Journal of Quantum Information Science · doi:10.4236/jqis.2026.161003 · Cited by 3
CQNAS: Convolutional quantum hybrid neural network architecture search for image classification
Kong, D., Jin, J., Cui, X., Yan, J., Tang, J., Fu, Y., Xu, J., & Wang, D. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.133236 · Cited by 2
Shen, Y., Zhong, Y., Ye, Y., Luo, Y.-Q., Xu, Z., He, S., Chen, J., Xue, S., Ding, G., Zhou, Y., et al. (2026) · International Journal of Extreme Manufacturing · doi:10.1088/2631-7990/ae5005 · Cited by 6
Gupta, N., Punia, D., Gautam, K., Sikka, G., Sharma, A. K., & Farouk, A. (2026) · Computer Science Review · doi:10.1016/j.cosrev.2026.100942 · Cited by 4
Nonlocal nonstabilizerness generation and information scrambling in noisy Clifford circuits
Dallas, E., & Zanardi, P. (2026) · Physical Review A · doi:10.1103/xkhn-d7yv · Cited by 4
Quantum Inner Product Scoring with Grid-Based Maps for Structure-Based Virtual Screening
Yang, P. (2026) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.6c00158 · Cited by 2
Quantum kernel and HHL-based support vector machines for multi-class classification
Pinheiro, G., Slabbert, D., Kowada, L. A. B., & Petruccione, F. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00484-0 · Cited by 9
Fedouaki, F., Fri, M., Douaioui, K., & Amellal, A. (2026) · Logistics · doi:10.3390/logistics10030067 · Cited by 8
Advancing quantum machine learning from conceptual design to practical use
Tera, S. P., Chinthaginjala, R., Zhao, X., & Hamdi, M. (2026) · Expert Systems with Applications · doi:10.1016/j.eswa.2026.132127 · Cited by 5
A Review of Quantum Computing Systems and Software
Yin, J.-W., Chen, Z.-R., Peng, S., Luo, H.-C., Tao, C.-N., Tan, S.-W., & Lu, L.-Q. (2026) · Journal of Computer Science and Technology · doi:10.1007/s11390-025-5953-3 · Cited by 4
Constraint-aware quantum optimization via Hamming weight operators
Hao, Y., Ding, Q., Yuan, X., & Wang, X. (2026) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-025-2895-4 · Cited by 6
Towards metaphors for quantum computational thinking
Beardow, C., & Stappers, P. J. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00502-1 · Cited by 4
Quantum Machine Learning for Earth Observation: A review and future prospects
Sebastianelli, A., Mauro, F., Delilbasic, A., Stasio, P. D., Fan, F., Meoni, G., Cavallaro, G., Zhu, X. X., Gamba, P. E., & Ullo, S. L. (2026) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2026.3676829 · Cited by 9
Reversible logic circuit for next-generation edge computing applications using IBM quantum system
Zohaib, M., Ahmadpour, S., Javadi, B., Noorallahzadeh, M., & Navimipour, N. J. (2026) · Measurement · doi:10.1016/j.measurement.2026.121543 · Cited by 2
Modeling noise in quantum computing of scalar convection
Yang, J., Lu, Z., & Yang, Y. (2026) · Acta Mechanica Sinica · doi:10.1007/s10409-026-51281-x · Cited by 4
Full quantum work statistics for non-homogeneous many-body systems
Palamara, A., Plastina, F., Sindona, A., et al. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae6a1b · Cited by 2
Quantum computing in image processing: A review of applications, models, and prospects
Kulkarni, K., & Desai, P. K. (2026) · Franklin Open · doi:10.1016/j.fraope.2026.100631 · Cited by 5
Physics-informed transformer for real-time high-fidelity topology optimization
Lutheran, A., Das, S., & Tabarraei, A. (2026) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-026-04342-6 · Cited by 6
Quantum-based self-attention mechanism for hardware-aware differentiable quantum architecture search
Liu, Y., Li, S., Meng, F., Zhang, Z., & Yu, X. (2026) · Physical Review Applied · doi:10.1103/qnld-73pk · Cited by 3
Qi, H., Xu, Y., Wang, H., Gani, A., & Por, L. Y. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05186-1 · Cited by 2
Suryanarayana, G., K, L. P., Gogineni, S., et al. (2026) · Discover Computing · doi:10.1007/s10791-026-10179-w · Cited by 2
A comprehensive review of quantum technologies for medical imaging
Zhao, X., Tie, P., & Chen, Z. (2026) · Frontiers in Physics · doi:10.3389/fphy.2026.1822647 · Cited by 3
Quantum computing applications in drug discovery
Li, J., Wei, L., Tong, H. H. Y., & Zou, Q. (2026) · Briefings in Bioinformatics · doi:10.1093/bib/bbag274 · Cited by 7
QSCL-EWIL: Quantum Stochastic Contrastive Learning for Enhanced Wi-Fi-Based Indoor Localization
Dastagir, M. B. A., Tariq, O., Han, D., Al-Kuwari, S. M., Mumtaz, S., & Farouk, A. (2026) · IEEE Internet of Things Journal · doi:10.1109/jiot.2026.3700055 · Cited by 3
Prince, S., DanielRaj, K., & Priya, A. A. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-2601-4.ch004 · Cited by 4
Bridging Quantum Computing and Artificial Intelligence for Next-Generation Innovation
Infant Kavin, F., DanielRaj, K., Ponseka, G., Ananthakumari, A., Raja, A. K., & Thomson, F. A. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-2601-4.ch005 · Cited by 3
QDBO: A Real-Time Quantum-Augmented Database System Optimizer
Liu, H., Kumar, A., Spedalieri, F. M., & Sabek, I. (2026) · Proceedings of the VLDB Endowment · doi:10.14778/3836663.3836712 · Cited by 2
Digital Quantum Simulations of Spin Models on Hybrid Platform and Near-Term Quantum Processors
Tacchino, F., Chiesa, A., LaHaye, M., Tavernelli, I., Carretta, S., & Gerace, D. (2019) · Italian Quantum Information Science Conference (IQIS) · doi:10.3390/proceedings2019012024 · Cited by 3
Quantum annealing for semi-supervised learning
Zheng, Y.-L., Zhang, W., Zhou, C., & Geng, W. (2021) · Chinese Physics B · doi:10.1088/1674-1056/abe298 · Cited by 3
Analog Ising chain simulation with transmons
Egorova, E. Y., Fedorov, G., Tsitsilin, I., Besedin, I. S., & Ustinov, A. V. (2020) · AIP conference proceedings · doi:10.1063/5.0011812 · Cited by 2
Quantum Algorithms and Methods
Djordjević, I. B. (2021) · Elsevier eBooks · doi:10.1016/b978-0-12-821982-9.00006-x · Cited by 2
Muten, E. R., Yusuf, T. T., & Tomut, A. V. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00024 · Cited by 2
Policy Gradient Approach to Compilation of Variational Quantum Circuits
Herrera-Martí, D. A. (2022) · Quantum · doi:10.22331/q-2022-09-08-797 · Cited by 7
Enterprise Security: Modern Challenges and Emerging Measures
Shukla, M., Tupsamudre, H., & Lodha, S. (2021) · IGI Global eBooks · doi:10.4018/978-1-6684-3698-1.ch021 · Cited by 3
ICCAD Special Session Paper: Quantum Variational Methods for Quantum Applications
Chakrabarti, S., You, X., & Wu, X. (2021) · International Conference on Computer Aided Design · doi:10.1109/iccad51958.2021.9643519 · Cited by 4
Using simulated annealing to learn the SDC quantum protocol
Situ, H., & He, Z. (2022) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-021-02336-5 · Cited by 2
OPTIMIZATION OF THE TRANSPORTATION PLAN OF DESIGNATED WASTE USING QUANTUM ANNEALING
MAKINO, J., Yabuki, N., & Fukuda, T. (2022) · Journal of Japan Society of Civil Engineers Ser F3 (Civil Engineering Informatics) · doi:10.2208/jscejcei.78.2_i_22 · Cited by 2
Superconducting Qubits as Musical Synthesizers for Live Performance
Topel, S., Serniak, K., Burkhart, L., et al. (2022) · Springer eBooks · doi:10.1007/978-3-031-13909-3_18 · Cited by 2
Closing the gaps in Quantum Computing: Co-Development and Co-Design
Engineers, I. Q. (2021) · Digitale Welt · doi:10.1007/s42354-021-0344-6 · Cited by 2
Wang, X., Zhang, A., & Zhao, S. (2022) · Acta Physica Sinica · doi:10.7498/aps.71.20220248 · Cited by 2
An Overview of Quantum Computing Approach in the Present-Day Energy Systems
Biswas, C., Pal, J., & Majumder, S. (2022) · Smart innovation, systems and technologies · doi:10.1007/978-981-19-2412-5_3 · Cited by 2
Simulation of a laser-driven three-level system by a noisy quantum computer
Nishi, T., Lötstedt, E., & Yamanouchi, K. (2022) · AVS Quantum Science · doi:10.1116/5.0098614 · Cited by 2
Possible limits on superconducting quantum computers from spontaneous wave-function collapse models
Vischi, M., Ferialdi, L., Trombettoni, A., & Bassi, A. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.174506 · Cited by 4
Cheng, J.-M., Zhang, Y.-C., Zhou, X.-F., & Zhou, Z.-W. (2022) · New Journal of Physics · doi:10.1088/1367-2630/acacbd · Cited by 3
MCQA: Multi-Constraint Qubit Allocation for Near-FTQC Device
Park, S., Kim, D., Sim, J., & Kang, S. (2022) · International Conference on Computer Aided Design · doi:10.1145/3508352.3549462 · Cited by 2
Singh, D., Jang, S., & Hyeon, C. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/acb029 · Cited by 3
Gravitationally invariant subspaces in quantum computing
Crowder, T., & Lanzagorta, M. O. (2023) · Natural Computing · doi:10.1007/s11047-022-09938-7 · Cited by 2
An Exact and Practical Classical Strategy for 2D Graph State Sampling
Zhang, S., Bao, J., Sun, Y., Li, L., Sun, H., & Zhang, X. (2023) · Annalen der Physik · doi:10.1002/andp.202200531 · Cited by 2
Revisiting semiconductor bulk hamiltonians using quantum computers
Pimenta, R. C. D. S., & Bezerra, A. T. (2023) · Physica Scripta · doi:10.1088/1402-4896/acbdc8 · Cited by 2
Quantum gates between mesoscopic spin ensembles
Niknam, M., Schwartz, R. N., & Bouchard, L. (2023) · Physical Review A · doi:10.1103/physreva.107.032601 · Cited by 2
Quantum Computing for Indoor Environmental Quality: A Leapfrogging Technology
Kapoor, N. R., Kumar, A., Kumar, A., Kumar, A., Arora, H. C., & Jahangir, H. (2023) · Advances in systems analysis, software engineering, and high performance computing book series · doi:10.4018/978-1-6684-6697-1.ch011 · Cited by 5
Dynamic analysis of quantum annealing programs
Pérez‐Castillo, R., Jiménez-Navajas, L., & Piattini, M. G. (2023) · Journal of Systems and Software · doi:10.1016/j.jss.2023.111683 · Cited by 2
Li, Z., Meng, F., Zeng, H., Gong, Z., Zhang, Z., & Yu, X. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202200130 · Cited by 3
Efficient Algorithms for High-Dimensional Quantum Optimal Control of a Transmon Qubit
Leng, Z., Mundada, P., Ghadimi, S., & Houck, A. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.044034 · Cited by 19
Ramos‐Vera, C., Serpa‐Barrientos, A., Vallejos-Saldarriaga, J., Calizaya-Milla, Y. E., & Saintila, J. (2023) · Depression Research and Treatment · doi:10.1155/2023/9969532 · Cited by 3
Anomalous non-Hermitian dynamical phenomenon on the quantum circuit
Dong, C., Yang, Z., Zeng, J., & Hu, J. (2023) · Chinese Physics B · doi:10.1088/1674-1056/acce9a · Cited by 2
Quantum simulation of quantum mechanical system with spatial noncommutativity
Chowdhury, S. H. H., Chowdhury, T. A., Nasri, S., Nazim, O. I., & Saad, S. (2023) · International Journal of Quantum Information · doi:10.1142/s0219749923500284 · Cited by 1
Bach, B. G., Kundu, A., Acharya, T., & Sarkar, A. (2023) · Entropy · doi:10.3390/e25050763 · Cited by 4
Gunderman, L. G. (2023) · Physical Review A · doi:10.1103/physreva.107.062416 · Cited by 3
Hybrid quantum singular spectrum decomposition for time series analysis
Postema, J. J., Bonizzi, P., Koekoek, G., Westra, R. L., & Kokkelmans, S. J. J. M. F. (2023) · AVS Quantum Science · doi:10.1116/5.0139846 · Cited by 3
Faster quantum state decomposition with Tucker tensor approximation
Protasov, S., & Lisnichenko, M. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00113-4 · Cited by 2
Image Classification using Quantum Convolutional Neural Network
Maurya, R., & Tripathi, S. (2023) · International Conference on Signal Processing, Computation, Electronics, Power and Telecommunication (IConSCEPT) · doi:10.1109/iconscept57958.2023.10170712 · Cited by 3
Quantum Enhancements for AlphaZero
Chao, J., Rodriguez, R., & Crowe, S. (2023) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3583133.3596302 · Cited by 8
Detecting Entanglement-Generating Circuits in Cloud-Based Quantum Computing
Seong, J., & Bae, J. (2023) · Intelligent Computing · doi:10.34133/icomputing.0051 · Cited by 3
Transfer of quantum states through a disordered channel with exponentially decaying couplings
Filho, F. J. A., Dutra, R. F., Santos, I. F., Lyra, M. L., Almeida, G. M. A., & de Moura, F. A. B. F. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04083-1 · Cited by 2
Quantum Computing with Dartboards
Ganti, I., & Iyengar, S. S. (2023) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.3c04262 · Cited by 2
Efficient Quantum Circuit Synthesis for SAT-Oracle With Limited Ancillary Qubit
Yang, S., Zi, W., Wu, B., Guo, C., Zhang, J., & Sun, X. (2023) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2023.3325974 · Cited by 5
VaR Estimation with Quantum Computing Noise Correction Using Neural Networks
de Pedro, L., Murillo, R. P., de Vergara, J. E. L., López-Buedo, S., & Gomez‐Arribas, F. J. (2023) · Mathematics · doi:10.3390/math11204355 · Cited by 2
Zirak, A. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04155-2 · Cited by 4
MEMQSim: Highly Memory-Efficient and Modularized Quantum State-Vector Simulation
Zhang, B., Fang, B., Guan, Q., et al. (2023) · doi:10.1145/3624062.3624217 · Cited by 2
Information-theoretic approach to readout-error mitigation for quantum computers
Nguyen, H. C. (2023) · Physical Review A · doi:10.1103/physreva.108.052419 · Cited by 2
Dimensionality Reduction with Variational Encoders Based on Subsystem Purification
Selvarajan, R., Sajjan, M., Humble, T. S., & Kais, S. (2023) · Mathematics · doi:10.3390/math11224678 · Cited by 7
Quantum computing and its revolutionary potential
Chia, H. L. B. (2023) · Advances in Engineering Innovation · doi:10.54254/2977-3903/4/2023022 · Cited by 2
Bounded Quantum Regular Language Generator
Kwon, Y., & Agha, G. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00072 · Cited by 2
A Reconfigurable Quantum State Tomography Solver in FPGA
Miller, N. E., Chakraborty, B., & Mukhopadhyay, S. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00160 · Cited by 4
Decomposing (n+1)$(n+1)$‐Qubit Toffoli Gate with Shallow Circuit Depth and No Ancilla
Leng, J., Yang, F., & Wang, X. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300370 · Cited by 2
Gago-Encinas, F., Hartung, T., Reich, D. M., Jansen, K., & Koch, C. P. (2023) · Quantum · doi:10.22331/q-2023-12-21-1214 · Cited by 10
Quantum and Classical Computing using Machine Learning Techniques
Padmakala, S. (2023) · International Conference on Sustainable Communication Networks and Application (ICSCNA) · doi:10.1109/icscna58489.2023.10370566 · Cited by 2
QUESC: Environmental Sound classification Using Quantum Quantized Networks
Dutta, S., Bhanushali, M., Bhan, S., Varma, L., Kanani, P., & Narvekar, M. (2023) · Procedia Computer Science · doi:10.1016/j.procs.2023.12.111 · Cited by 6
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.