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 8,101–8,200 of 8,640
BRIDG-Q: Barren-Plateau-Resilient Initialisation with Data-Aware LLM-Generated Quantum Circuits
Nguyen, N. N., Vu, T. T., Le, J., Dam, H. K., Duong, D. H., & Hoang, D. T. (2026) · IFIP advances in information and communication technology · doi:10.1007/978-3-032-27993-4_30 · Cited by 1
Migrating QAOA from Qiskit 1.x to 2.x: An experience report
Cardinal, J., Benzarti, I., Boussaidi, G. E., & Père, C. (2026) · IEEE/ACM International Workshop on Quantum Software Engineering (Q-SE) · doi:10.1145/3786150.3788612 · Cited by 4
Avcı, A. B. (2026) · Indoor Air · doi:10.1155/ina/3385686
Spectral gap estimation via adiabatic preparation
Cugini, D., Ghisoni, F., Morgillo, A. R., & Scala, F. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae7674
Wang, X., Huang, C., & Fan, X. (2026) · Applied Sciences · doi:10.3390/app16115409
Entanglement entropy from correlation functions of scalar fields in and out of equilibrium
Sarkar, M. K., Moitra, S., & Sensarma, R. (2026) · Physical Review A · doi:10.1103/jt4g-j6mr · Cited by 1
Quantum optimization algorithms for strongly correlated many-body systems
Pexe, G. E. L., Rattighieri, L. A. M., Prado, P. B. B., Fritsch, A. R., & Fanchini, F. F. (2026) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/ae9dd5 · Cited by 1
Quantum Computing Explained: A Beginner's Guide to the Future of Processing
John, W. M. (2025) · International Journal of Information Technology Research Studies (IJITRS) · doi:10.63090/ijitrs/3139.3209.0013
Quantum-Enhanced Real-Time CO 2 Classification System for Urban Environmental Monitoring
Granados, G., Arreaga, C. S., Quinde, M. M., et al. (2026) · IEEE Conference on Technologies for Sustainability · doi:10.1109/sustech67720.2026.11536603
Curato, G., Ponzi, M., Chiatello, E., & Giorgetti, R. (2026) · APS Open Science · doi:10.1103/hj46-qw5t
Advancing reproducibility and replicability in simulation: Challenges and opportunities
Huang, Y., & Çetinkaya, D. (2026) · SIMULATION · doi:10.1177/00375497261444678 · Cited by 2
Ramu, M., Reddy, P. C., Harika, T., Kulsum, U. F., Masumbee, S., & Manoja, M. Y. (2026) · International Conference on Trends in Electronics and Informatics (ICOEI) · doi:10.1109/icoei68323.2026.11541766
Quantum-enhanced spectral analysis for materials and networked systems
Ghosh, K., & Basu, B. (2026) · APL Quantum · doi:10.1063/5.0334173
Quantum Information Harvesting with the Parallel Quantum Flow Algorithm
Bauman, N. P., Panyala, A., Liu, C., Zheng, M., Wang, M., & Kowalski, K. (2026) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.6c02025 · Cited by 1
Ultra-Low Logical Depth Fault-Tolerant Quantum Circuit Synthesis via Lattice Surgery
Kuo, C.-T., Tsai, C.-E., & Huang, C.-Y. R. (2026) · Design, Automation, and Test in Europe · doi:10.23919/date69613.2026.11539371 · Cited by 1
SonarQiskit: Extending SonarQube for quantum code quality analysis
Muñoz, A. D., Oviedo, J., Verdugo, J., et al. (2026) · SoftwareX · doi:10.1016/j.softx.2026.102767
Quantum-Assisted Federated Learning for Privacy-Preserving Medical Diagnosis
Pathak, R., Mohammed, B. A., Saxena, S., et al. (2026) · doi:10.1109/icisessc68634.2026.11542760
Quantum computing for loan portfolio pricing optimization
Wang, Y. J., Yang, X., Ju, C., et al. (2026) · Frontiers in Physics · doi:10.3389/fphy.2026.1744791
Quantum computing applications in drug discovery: Unraveling complex molecular interactions
Kulkarni, A. D., Katkar, T. R., Jadhav, S., & Jadhav, P. A. (2026) · AIP conference proceedings · doi:10.1063/5.0327515
A hardware-efficient Berkeley gate for superconducting quantum processors
AbuGhanem, M. (2026) · Scientific Reports · doi:10.1038/s41598-026-56236-8
Quantum physics-informed neural network for scattered wavefields
Duarte, D. H. G., de Lima, P. D. S., de Palhares, A. B., Varela, J. M., de Araújo, J. M., & Chaves, R. (2026) · International Journal of Modern Physics C · doi:10.1142/s0129183126430096
Gayathri, S. S., Muthulakshmi, P., & Palanivel, R. (2026) · Quantum Information and Computation · doi:10.2478/qic-2026-0002
Tensor Network QAOA for Document Graphs: Narrative Map Extraction from News
Keith, B., & Flores-Bustos, C. (2026) · Electronics · doi:10.3390/electronics15112487
Quantum-Inspired or Neuromorphic Discrete-Event Computing Paradigms for Future Ubiquitous Systems
Math, S., Madhuri, H. D., Yadhav, V., et al. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-9785-6.ch004
Guerrero, E. M., Sun, G.-H., & Dong, S. (2026) · Physical Review A · doi:10.1103/z33f-l4jg
Quantum Chess as a Pedagogical Tool for Teaching Quantum Information Science in High Schools
Kaushik, P., Vu, N. P., Yeung, C., Tadisina, S., Boyle, L. K., Venkatesh, V., Zilberstein, M., Sorak, N., Subedi, K., Cabral, D. G. A., et al. (2026) · Journal of Chemical Education · doi:10.1021/acs.jchemed.5c00836
Equality Saturation for Quantum Circuit Optimization
Yang, G., Raun, P., Tao, R., & Gu, R. (2026) · Proceedings of the ACM on Programming Languages · doi:10.1145/3808254 · Cited by 3
Realization of fermionic Laughlin state on a quantum processor
Shen, L., Lin, M., Lin, C. Y.-Y., Xiao, D., & Cao, T. (2026) · Nature Communications · doi:10.1038/s41467-026-72769-y · Cited by 12
A Coevolutionary Framework for Noise-Resistant Quantum Architecture Search
Urbaneja, J., Kumagai, M., Sato, M., Komatsu, K., & Kobayashi, H. (2026) · ISC High Performance (ISC) · doi:10.23919/isc.2026.11520504
Multi-Path Parallel Quantum Convolutional Neural Network
Qi, H., Huo, X., & Gani, A. (2026) · International Conference on Multi-scale Artificial Intelligence (MAI) · doi:10.1109/mai69289.2026.11543763
Mustofa, S., Emon, Y. R., Hasan, M., & Karim, A. (2026) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2026.111287
Earliest Failure Localization in Pipelines Via Quantum Search
Fisher, A., & Bobda, C. (2026) · IEEE Dallas Circuits and Systems Conference (DCAS) · doi:10.1109/dcas69364.2026.11544612
Quantum Kernels for Parity-Structured Classification: A Hybrid Pipeline
Pandey, T. (2026) · IEEE Dallas Circuits and Systems Conference (DCAS) · doi:10.1109/dcas69364.2026.11544464
Bit-Vector Abstractions to Formally Verify Quantum Error Detection & Entanglement
Govindankutty, A. (2026) · IEEE Dallas Circuits and Systems Conference (DCAS) · doi:10.1109/dcas69364.2026.11544428
Quantum Machine Learning for IoT: Trends, Challenges, and Technology Readiness
Sharma, C., Sood, K., & Sood, S. K. (2026) · IEEE Internet of Things Journal · doi:10.1109/jiot.2026.3701410
An AI-Based Framework for Decoherence Mitigation in Quantum Systems
Dubey, R., & Takkar, S. (2026) · International Conference on Signal, Systems, and Computing for Next-Gen Automation (ICSSCNA) · doi:10.1109/icsscna68616.2026.11546938
Momentum-based quantum adversarial attack algorithm
Pan, M., Liu, W., Xu, Y., Sun, S., & Yang, F. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00409-1
An Uncertainty-Aware Adaptive Hybrid Quantum-Classical Learning Framework for Drug Discovery
Nantha, A. S., Jayalakshmi, M., Maharajan, K., KaiSu, H., & Sanmugasundaram, R. (2026) · International Conference on Signal, Systems, and Computing for Next-Gen Automation (ICSSCNA) · doi:10.1109/icsscna68616.2026.11546736
Novel Quantum Ensemble Machine Learning Models for IoT Intrusion Detection
Okekeogbu, C. C., Mostafa, S. A., & Patooghy, A. (2026) · IEEE Dallas Circuits and Systems Conference (DCAS) · doi:10.1109/dcas69364.2026.11544356
Exploring all-quantum long short-term memory networks to enhance text sentiment classification
Yan, F., Yang, J. H., Kawamoto, K., et al. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05236-8
Kim, I., Lee, M., Kang, T., Ahn, G., Kim, S., Hong, S., & Lee, D. (2026) · ACM Symposium on Applied Computing · doi:10.1145/3748522.3779914
Optically Active Yb 3+ Spin Defects in Cerium Oxide Nanocrystals
Miura-Stempel, E., Snoeren, T. J., Bittner, W., Mckenna, C., Stoll, S., Gamelin, D. R., & Cossairt, B. M. (2026) · ACS Applied Nano Materials · doi:10.1021/acsanm.6c01017 · Cited by 1
Quantum-Assisted Deep Learning for Fault Detection and Diagnosis in Distributed Sensor Networks
Bykov, A. A., Daurenbayeva, N., Жакыпбеков, С. Ж., Bissarinova, A., Nurlanuly, A., & Daniyarova, D. (2026) · Signals · doi:10.3390/signals7030055
JGRA: Jacobian Geometry Robustness Assessment in NISQ Noise-Aware Quantum Neural Networks
Scanu, G., Barletta, L., & Rini, S. (2026) · IEEE International Conference on Quantum Control, Computing and Learning (qCCL) · doi:10.1109/qccl70331.2026.11668552
Dynamics of Majorana fermions on a quantum computer
Hang, Y., Felice, R. D., Nakano, A., & Haas, S. (2026) · Physical review. B./Physical review. B · doi:10.1103/8dlm-y2rq
Why Classical-Quantum Machine Learning Works Better Than Classical Machine Learning
Chy, A. M. R., & Shahriyar, M. F. (2026) · IEEE International Conference on Quantum Photonics, Artificial Intelligence & Networking (QPAIN) · doi:10.1109/qpain69676.2026.11546286 · Cited by 1
Engineering Qudit Operations in a Tunable Transmon System
Therrien-Motamedi, A., & Žilić, Ž. (2026) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl68998.2026.00011
Trotskyi, S., & Bożejko, W. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-27927-9_42
Quantum image representation-based quantum neural networks for binary classification
Tiwari, A., Siyanwal, S., Sakhuja, S., Kumar, S., & Tyagi, P. (2026) · The Journal of Supercomputing · doi:10.1007/s11227-026-08621-3 · Cited by 1
dos Santos, V. F., Brasil, V. P., Contri, P. A. S., & Maziero, J. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70342
Moghaddam, B. P., Zaky, M. A., Lopes, A. M., & Galhano, A. M. (2026) · Axioms · doi:10.3390/axioms15060433
Generalized stochastic spin-wave theory for open quantum spin systems
Li, Z., Delmonte, A., & Fazio, R. (2026) · Physical review. B./Physical review. B · doi:10.1103/d942-3lmt · Cited by 1
Future of AI for Cybersecurity: Quantum Computing and Beyond
Ramachandran, M. (2026) · Texts in computer science · doi:10.1007/978-3-032-25874-8_3
Performance of Circuit-Based Blind Quantum Computation in NISQ Era
Joshi, M., Mishra, M. K., & Karthikeyan, S. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-26349-0_13
A Computational Framework for Adaptive Circuit Selection in Noisy Quantum Communication Simulations
Dehingia, K., & Dutta, N. (2026) · Concurrency and Computation Practice and Experience · doi:10.1002/cpe.70803
Gate Value Quantification for Efficient Quantum Machine Learning Circuits
Rodríguez-Díaz, F., Gutiérrez‐Avilés, D., Troncoso, A., et al. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-29254-4_34
Dudkiewicz, I. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-29254-4_36
Amadoun, K., Kissi, C., Chakrabarti, A., & Boujiha, T. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-28819-6_43
Martín-Pérez, D., Rodríguez-Díaz, F., Troncoso, A., et al. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-29254-4_37
Salehi, S. A., Naderi, H., Asghari, S. A., Chaharlang, J., & Savaria, Y. (2026) · Quantum Reports · doi:10.3390/quantum8020054
Calibration-Aware Bit-Flip Averaging For Quantum Error Mitigation
Choptiany, D. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-29254-4_33
QFL-Adaptive: Uma Abordagem Híbrida de Aprendizado Federado Quântico Personalizado e Resiliente
Bustincio, R. W. C., Pozo, E. C., Ancori, R. J. H., Silva, F. A., Souza, A. M. D., & Bittencourt, L. F. (2026) · doi:10.5753/sbrc.2026.19918
Tampakaki, A. E., Barmparis, G. D., Angelaki, E., Marketou, M. E., & Tsironis, G. P. (2026) · AI in Medicine · doi:10.64898/2026.06.08.26355139
Framework Federado para Redes Neurais Quânticas sem Pesos Distribuídas
de Oliveira, N. M., & da Silva, A. J. (2026) · doi:10.5753/wqunets.2026.23840
Experimental quantum Bernoulli factories via Bell-basis measurements
Roy, T. (2026) · Applied Physics Letters · doi:10.1063/5.0335817
Hybrid quantum AI in logistics and operations management: Operational fit and strategic value
Bertl, M. (2026) · Transportation Research Part E Logistics and Transportation Review · doi:10.1016/j.tre.2026.105012
Chandrasekaran, M. (2026) · 2026 IEEE Wireless Communications and Networking Conference Workshops (WCNCW) · doi:10.1109/wcncw67598.2026.11555717
Mpofu, K. T., Tsebesebe, N., & Manoto, S. L. (2026) · Biomedical engineering · doi:10.5772/intechopen.1016231
Robust negativity in the quantum-to-classical transition of Kerr dynamics
Raza, M., DeBrota, J. B., Shlosberg, A., Lordi, N., & Deutsch, I. (2026) · Physical Review A · doi:10.1103/r9j9-6ndl · Cited by 1
Taha, O. M. E., & Ahmed, S. M. (2026) · Transportation Infrastructure Geotechnology · doi:10.1007/s40515-026-00951-2
Optimized Quantum Classifiers for the Prevention of Anxiety Disorders Using Wearable Data
Papamentzelopoulos, S., & Nikoletseas, S. (2026) · Applied Sciences · doi:10.3390/app16126132 · Cited by 1
Role of entanglement in quantum reservoir computing with coupled Kerr nonlinear oscillators
Anonymous, Zadeh‐Haghighi, H., Kora, Y., & Simon, C. (2026) · Physical Review A · doi:10.1103/vwn7-y9vj · Cited by 1
Quantum-Enhanced Adversarial Robustness in Artificial Intelligence
Sen, J. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-0156-1.ch009
Quantum Similarity for Vision: Swap-Test vs. Amplitude-Estimation Pipelines
Borgalli, R. A., Raj, U., & Shetty, S. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-0156-1.ch005
Challenges and Opportunities in the Quantum-Enhanced AI Industry
Rismayanti, I., Anwar, N., Panuntun, D. P., et al. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-0156-1.ch008
Variational quantum algorithm for anion exchange across an electrolyzer membrane
Gubaev, T., Pfeffer, P., Dreßler, C., & Schumacher, J. (2026) · Physical Review Applied · doi:10.1103/149q-4z6s · Cited by 1
Quantum Machine Learning for Industrial Artificial Intelligence
Farhan, M. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-0156-1.ch012
Senapati, P., Luo, W., Peng, B., & Guan, Q. (2026) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/3787109.3816378 · Cited by 1
MA-RQAOA: A System-Algorithm Co-Design Framework for Coherence-Limited Topological Quantum Computing
Zhao, X., & Wang, H. (2026) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas66217.2026.11562873
Hybrid quantum-classical neural networks for real-time fault detection in power systems
Hashmi, H., Kumar, A., Kuttan, S. R., Moolchandani, J., Goel, P., Smerat, A., Massebo, Y. A., & Hashmi, A. (2026) · PLoS ONE · doi:10.1371/journal.pone.0349887
A Methodological Analysis of Empirical Studies in Quantum Software Testing
Li, Y., Shao, M., Zhao, J., & Wang, Q. (2026) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3819590 · Cited by 16
A Unified Quantum Circuit Framework for Grover Search and Quantum Walks in NISQ Cryptanalysis
Lavagna, L., Vittori, G., Rosato, A., et al. (2026) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas66217.2026.11562366
A Comprehensive Analysis of Anomaly-Driven Fuzzing for Quantum Circuits
Dinakarrao, S. M. P., & Lalichetti, H. K. (2026) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/3787109.3816398
Unlocking Nonlinear Dynamics in Fuzzy Cognitive Maps: A Quantum Kernel Approach
Kalampokas, Τ., & Papakostas, G. A. (2026) · Applied Computational Intelligence and Soft Computing · doi:10.1155/acis/4363446
Pandey, S. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-0156-1.ch006
Wang, Q., Zhukas, L. A., Miao, Q., Dalvi, A. S., Love, P. J., Monroe, C., Chong, F. T., & Ravi, G. S. (2026) · npj Unconventional Computing · doi:10.1038/s44335-026-00073-5
Quantum-Enhanced Artificial Intelligence
Ali, S. I. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-0156-1.ch001
ML–Enabled FPGA Framework for Fast Quantum State Discrimination in Mid-Circuit Measurement Regimes
Vora, N., Xu, Y., Hashim, A., et al. (2026) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/3787109.3816383
Rath, M., & Date, H. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70346
Alkurdi, Y., Al-Haija, Q. S. A., & Alghuried, A. (2026) · Applied Sciences · doi:10.3390/app16126183
Hybrid Quantum-Classical Neural Networks for Molecular Property Prediction from SMILES
Gushanskiy, S. M., Potapov, V., & Polenov, M. (2026) · International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM) · doi:10.1109/icieam69213.2026.11549807
Analytical Dimensions and Performance Evaluation of the Quantum Approximate Optimization Algorithm
Trigueros, B., Roig, P. J., Alcaraz, S., & Gilly, K. (2026) · International Conference on Integrated Intelligence and Cognitive Engineering (ICIICE) · doi:10.1109/iciice69672.2026.11565281
Design and Implementation of a Quantum Reversible Full Adder-Subtractor
Indra, J., Siva Prasanna, E., & Sushma, V. R. (2026) · doi:10.1109/icima68728.2026.11564624
Exoplanetary atmospheres retrieval via a quantum extreme learning machine
Vetrano, M., Zingales, T., Palma, G. M., & Lorenzo, S. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00414-4 · Cited by 1
DAG-Aware Gate Fusion for Efficient State-Vector Quantum-Circuit Simulation
Li, S., Wang, Z.-A., & Fan, H. (2026) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2026.3705783
Qubit Routing via swap Network: A Minimum Dominating Path Approach
Romanello, R., Bosco, D. L., Serra, G., & Piazza, C. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-29921-5_5
Anonymous, Calarco, T., & Muratori, A. (2026) · Physical Review Research · doi:10.1103/t2zk-4nxh · Cited by 2
Quantum Bayesian Time Series Forecasting with Uncertainty Quantification
Oloyede, I. (2026) · Reliability: Theory & Applications · doi:10.66721/3s6jbr20 · Cited by 1
Daka, C., & Bhattacharyya, S. (2026) · New Journal of Physics · doi:10.1088/1367-2630/ae8053 · Cited by 1
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.