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,501–8,600 of 8,640
Kernel-Weighted Aggregation for Hyperparameter-Free Quantum Federated Learning
Huang, R. (2026) · Entropy · doi:10.3390/e28090958
Antor, M. S. U. M., Imran, T. A., Hossain, M. R., Podder, N. K., & Khan, I. (2026) · 2026 International Conference on Power, Electronics, Communications, Computing, and Intelligent Infrastructure (PECCII) · doi:10.1109/peccii70991.2026.11661945
DisMap: Calibration-Aware Distributed Compilation for Multi-Chip Quantum Systems
Du, Z., Palma, M., Mo, Z., Wei, W., Chen, J., Buyya, R., & Mao, Y. (2026) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw72780.2026.00013 · Cited by 1
Decentralized quantum intelligence: pioneering cross-silo quantum federated learning protocols
Delhibabu, R. (2026) · Frontiers in Computer Science · doi:10.3389/fcomp.2026.1879944
Majeed, M. R., Zhang, P., Balis, P. G., Kobra, M. J., Rahman, O., & Hossain, Z. M. I. (2026) · International Conference on Electronics Technology (ICET) · doi:10.1109/icet69987.2026.11659283 · Cited by 1
Quantum Machine Learning versus Machine Learning for Intrusion Detection in 5G Environments
Leonidas, I. D., Grammatikis, P. I. R., Markakis, E., Kourtis, M., Lagkas, T., Papadopoulos, G. T., Argyriou, V., & Sarigiannidis, P. G. (2026) · International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT) · doi:10.1109/dcoss-iot69657.2026.00091
Braga, C. M., Serrano, M. A., & Fernández‐Medina, E. (2026) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw72780.2026.00018
Quantum generative AI foundation models: integrating VQAs with fault-tolerant error correction
Delhibabu, R. (2026) · Frontiers in Computer Science · doi:10.3389/fcomp.2026.1879630
Quantum computing-driven evolution of drug discovery paradigms
Han, L., Ke, Z., Liu, L., Cao, L., Wang, Z., Zhang, X., Zhou, W., & Xiao, W. (2026) · Chinese Science Bulletin (Chinese Version) · doi:10.1360/csb-2026-0450
Chittem, M. B., & Sambhaje, V. (2026) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw72780.2026.00019
Noise or Signal? A Causal Mediation Analysis of Quantum Circuit Learning Under Real Hardware Noise
Kesiku, C. Y., & García-Zapirain, B. (2026) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw72780.2026.00027
Hernández-Sánchez, L., Escudero, E. A. F., & Arceo, R. (2026) · Revista Multidisciplinar Epistemología de las Ciencias · doi:10.71112/nankke17
Wang, X., Li, J., & Zhuo, Z. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70415
Schneider, J., Könecke, T., & Hanss, M. (2026) · IEEE International Conference on Quantum Control, Computing and Learning (qCCL) · doi:10.1109/qccl70331.2026.11668578
Fulton, C. P., Tsapara, I., & Fulton, L. V. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00430-4
Reers, V., & Maußner, M. (2026) · IEEE International Conference on Quantum Control, Computing and Learning (qCCL) · doi:10.1109/qccl70331.2026.11668558 · Cited by 2
Faster than MIP Decoding of Graph Codes with a Single Logical Qubit
Basak, N., & Paul, G. (2026) · IEEE International Conference on Quantum Control, Computing and Learning (qCCL) · doi:10.1109/qccl70331.2026.11668573
Predicting IBM quantum computer calibration parameters using different time series methods
Elsokkary, S. K., & Petersen, I. R. (2026) · IEEE International Conference on Quantum Control, Computing and Learning (qCCL) · doi:10.1109/qccl70331.2026.11668562
Barreto, A. D. H., Vargas-Galarza, Z., Estudillo, J. L. P., & Escobar, K. Y. M. (2026) · IEEE International Conference on Quantum Control, Computing and Learning (qCCL) · doi:10.1109/qccl70331.2026.11668550
Dang, G. P., Si, W., Alsinglawi, B. S., et al. (2026) · doi:10.1109/qccl70331.2026.11668569
Adaptive Multi-Embedding Quantum Feature Fusion for Intrusion Detection Systems
Kerkatou, R. A., Belhadef, H., Eutamene, A., & Stefanova, S. P. (2026) · International Conference on Electronics, Engineering Physics and Earth Science (EEPES) · doi:10.3390/engproc2026154006
Hernández-Romero, I. M., Oliva-González, I., Lara‐Montaño, O. D., Hernández-Romero, K., Esquivel-Patiño, G. G., Kharissova, O. V., Orozco, A. I. R., & González, L. T. (2026) · Springer eBooks · doi:10.1007/978-3-031-87501-4_60-1
Accelerating materials discovery for room-temperature qubits via Generative Quantum Machine Learning
Delhibabu, R. (2026) · Physica B Condensed Matter · doi:10.1016/j.physb.2026.419255
Quantum Reinforcement Learning: Principles and Research Progress
Zhao, Y., & Zhu, K. (2026) · International Conference on Innovation Management and Information Systems (ICIMIS) · doi:10.1145/3821966.3821973
Toward a Framework for Ethical Quantum Computing: Foundations and Research Directions
Perrier, E. (2026) · Perspectives in law, business and innovation · doi:10.1007/978-981-92-3768-5_4
A Framework for Hybrid Quantum-Classical Supply-Chain Optimization (HQCSCO)
Mehta, Y., Nandan, D., & Maheshkar, C. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-2600-0848-5.ch006
Towards quantum-ready optimization: A QUBO model for task assignment to autonomous mobile robots
Prüfer, O. C., & Heger, J. (2026) · Procedia CIRP · doi:10.1016/j.procir.2026.03.241
Hybrid VQA architectures for cloud-based quantum platforms: maximizing computational utility
Joseph, A., & Delhibabu, R. (2026) · Frontiers in Computer Science · doi:10.3389/fcomp.2026.1879448
Shah, K., Masanagi, R., Saboowala, M., et al. (2026) · International Journal on Smart Sensing and Intelligent Systems · doi:10.2478/ijssis-2026-0063
Joseph, A., & Delhibabu, R. (2026) · Frontiers in Computer Science · doi:10.3389/fcomp.2026.1879744
Joint Circuit and Network Orchestration for Distributed Quantum Computing
Tan, Y. L., Zhang, S., Alfauri, H., Ni, Z., Tang, Y., Mahgoub, I., Yang, L., Jiang, W., & Yang, Z. (2026) · doi:10.1145/3833409.3833441
Wang, J., Kanezashi, T., Tsukayama, D., Awaya, K., Saito, R., & Shirakashi, J. (2026) · IEEE International Conference on Nanotechnology (IEEE-NANO) · doi:10.1109/nano67986.2026.11667508
Farsi, M., Mahmoud, M., & Helmy, A. (2026) · Sensors · doi:10.3390/s26175629
Reimagining breast cancer diagnosis with quantum technology
ShivajiRao, G., Jaiganesh, M., Kumar, A. V. A., Sruthi, S., Balaji, K. S., & Lathika, M. (2026) · The Philosophical Magazine A Journal of Theoretical Experimental and Applied Physics · doi:10.1080/14786435.2026.2719597
Physics-Informed Multi-Head Networks for Adaptive Quantum Noise Reconstruction and Mitigation
Zhang, Q., Zhang, Z., He, Y., & Miao, Z. (2026) · IEEE International Conference on Cybernetics (CYBCONF) · doi:10.1109/cybconf69298.2026.11670278
Digital Sovereignty in AI-Enabled Public Sector Transformation
Jonathan, G. M., Han, S., & Perjons, E. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-36676-4_18
Nonlinear path-following via the asymptotic numerical method on a quantum processor
Xu, Y., Kuang, Z., Huang, Q., Yang, J., Zahrouni, H., Potier‐Ferry, M., Huang, K., Zhang, J.-C., Fan, H., & Hu, H. (2026) · Computational Mechanics · doi:10.1007/s00466-026-02852-0 · Cited by 3
Quantum Information Entanglement Index for Facial Expression Analysis
Rengasamy, K., Joshi, P., & Raveendra, V. V. S. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37667-1_24
Sarma, B., Tiwari, H., Llamas‐Garro, I., Tripathi, R., & Mishra, S. K. (2026) · Laser & Photonics Review · doi:10.1002/lpor.71837
Bhullar, A., Newlands, N. K., Ali, R. A., Lord, É., & Champagne, C. (2026) · Computers and Electronics in Agriculture · doi:10.1016/j.compag.2026.112376
Quantum computing in drug discovery
Gadbail, H. N., Rewatkar, R. M., Jumde, N. R., Manker, M., Nagre, P., & Zade, S. (2026) · Frontiers in Drug Discovery · doi:10.3389/fddsv.2026.1815176
Ensembling personalized quantum models with local differential privacy
Xhelollari, F., Chen, S. Y.-C., Farooq, J., & Chen, J. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00440-2
Post-quantum cryptography transition governance in GCC banking: a regulatory readiness framework
Osman, M. (2026) · Digital Policy Regulation and Governance · doi:10.1108/dprg-05-2026-0296
On the path-based entanglement purification model in online quantum networks
Halder, J., Ahmed, N., Tunc, H. S. D., et al. (2026) · Scientific Reports · doi:10.1038/s41598-026-70573-8
VQRC: Variational Quantum Residual Compensation for Deep Neural Network Compression
Jiang, Z., Chen, N., Yuan, X., & Sun, C. (2026) · IEEE International Conference on Smart Internet of Things (SmartIoT) · doi:10.1109/smartiot70864.2026.00028
Synthesis of Application-Specific Quantum Network-on-Chip
Eslaminia, M., & Beux, S. L. (2026) · IEEE Interregional NEWCAS Conference (NEWCAS) · doi:10.1109/newcas64543.2026.11673963
Sankar, N. G., Miliotis, G., & Caton, S. J. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.09.04.749434
Data-driven, multi-objective QUBO-based optimization for multi-phase alloy design
Plehn, T., Barragán-Yani, D., Breitbarth, E., Requena, G., & Melching, D. (2026) · Digital Discovery · doi:10.1039/d6dd00126b · Cited by 1
Dynamics of quantum correlations in a squeezed generalized amplitude damping channel
Kesavulu, T., & Muthuganesan, R. (2026) · Optical and Quantum Electronics · doi:10.1007/s11082-026-09136-0
Quantum deep convolutional neural networks for damage classification
Siddique, A. B., & Cha, Y. (2026) · Computer-Aided Civil and Infrastructure Engineering · doi:10.1016/j.cacaie.2026.100217
Ahmed, M., & Abdulrahman, I. (2026) · Quantum Reports · doi:10.3390/quantum8030094
Introduction to artificial intelligence and machine learning
Singh, M. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-43914-8.00014-5
Natanael, N., Sugiarto, H. S., & Tjandra, Y. (2026) · Journal of Computing Theories and Applications · doi:10.62411/jcta.17214
Twin-QNN: Two-View Fusion with Variational Quantum Circuits for Sentiment Classification
Altarazi, A. M., & Awajan, A. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-32732-1_44
Guehika, A. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-32732-1_45
Örücü, S. (2026) · Black Sea Journal of Engineering and Science · doi:10.34248/bsengineering.1992510
Ishra, F. A., & Chitathukattle, J. (2026) · MEC International Conference on Big Data and Smart City (ICBDSC) · doi:10.1109/icadaai64945.2026.11679192
Formalising the incremental execution of static quantum circuits
Bocci, A., Bisicchia, G., Pimentel, E., & Antonio Brogi, A. (2026) · Journal of Logical and Algebraic Methods in Programming · doi:10.1016/j.jlamp.2026.101174 · Cited by 1
Compact Quantum Circuits for Autosymmetric and Dimension Reducible Functions
Bernasconi, A., Ciriani, V., Cuciniello, G., Manini, N., & Monfared, A. T. (2026) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3845812
QUBO/QAOA-compatible inference for reproducible rate-resolved electrochemical analysis of MoS2
Yu, S.-L., Wu, Y.-E., Ramam, K., Hsu, T.-E., Ho, M.-K., Li, T.-Y., Hsieh, S., Manjunatha, K., & Wu, S. Y. (2026) · Journal of Energy Storage · doi:10.1016/j.est.2026.124552
Jayanthy, S., Rajasekaran, A. S., Nithin Krishna, P., et al. (2026) · International Conference on Inventive Systems and Control (ICISC) · doi:10.1109/icisc69558.2026.11681856
Tunable Ring Quantum LSTM for Temporal Modeling
Rohith Arumugam, S., Killivalavan, S., & Angel Deborah, S. (2026) · International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT) · doi:10.1109/tqcebt67648.2026.11681728
Gogineni, R., Mane, V. M., & Doshi, A. (2026) · International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT) · doi:10.1109/tqcebt67648.2026.11681365
Rai, P., Chanti, S., & George, J. (2026) · International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT) · doi:10.1109/tqcebt67648.2026.11681568
Awtar, R., & Pandey, R. (2026) · 2026 International Conference on Green Technologies and Sustainable Solutions (GTSS) · doi:10.1109/gtss68743.2026.11679593
Ninlawat, S., Singhun, K., Chooseang, T., Prabpal, P., Khompittaya, P., Sonasang, S., & Angkawisittpan, N. (2026) · Electricity · doi:10.3390/electricity7030108
Babu, M. V., Kalpana, K., Prasanthi, Y., Kumaresan, D. M., & Satheesh, N. (2026) · International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT) · doi:10.1109/tqcebt67648.2026.11681216
Quantum Algorithms for Trading: A Survey of Speedups, Thresholds, and Dequantization
Laura, L., Parrillo, M., Pascucci, A., Rossi, M., & Rughetti, V. (2026) · Information · doi:10.3390/info17090908
Low-Depth Fixed-Layer Variational Quantum Eigensolver for Small Transverse-Field Ising Ground States
Wang, F., Song, X., & Zhang, Z. (2026) · International Journal of Theoretical Physics · doi:10.1007/s10773-026-06487-y
Inverse reconstruction of disordered Hamiltonians from open dynamics
Anonymous, Zhang, K., & Song, T. (2026) · Physical Review A · doi:10.1103/4bmd-rqcs
Li, G., Yang, Y., Lin, H., Zhang, J., Zheng, S., & Zhou, X. (2026) · IEICE Electronics Express · doi:10.1587/elex.23.20260366
Jałowiecki, K., Pawłowski, J., Gardas, B., & Pawela, Ł. (2026) · SoftwareX · doi:10.1016/j.softx.2026.103031
Hybrid method for quantum dynamics simulation
Gomes, N., Yin, J., Niu, S., Yang, C., & de Jong, W. A. (2026) · Physical Review A · doi:10.48550/arxiv.2307.15231 · Cited by 6
Bhatia, V., Shah, A., & Halbe, A. (2026) · International Journal of Remote Sensing · doi:10.1080/01431161.2026.2729422
Yakubova, N., Usmanov, K. I., & Akramkhodjayev, Y. (2026) · doi:10.3390/engproc2026145019
Kong, W. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-39708-9_31
Găiceanu, M., Buhosu, R., Marin, G., et al. (2026) · Electronics · doi:10.3390/electronics15184288
Metalloporphyrin Zr-MOF Nanoparticles Film for Device Integration of Spin Qubits and Qudits
Serrano-Oiza, J., Tejedor, I., Natividad, E., Hemmerle, A., Fontaine, P., Novikov, V. V., Aromí, G., Gascón, I., & Roubeau, O. (2026) · Inorganic Chemistry · doi:10.1021/acs.inorgchem.6c03040
An introduction to energy markets: a mathematical viewpoint
Spinella, D., Duro, R., & Vespri, V. (2026) · SeMA Journal · doi:10.1007/s40324-026-00442-x
Datta, D., Biswas, D., Mahapatra, U. S., Paul, M., & White, D. (2026) · Agriculture · doi:10.3390/agriculture16192069
Efficient Circuit Management and Scheduling in Multi-Node Quantum Systems with Dynamic Links
Du, Z., Zhang, W., Gesseck, J., Wei, W., Chen, J., Han, T., Liang, Z., & Mao, Y. (2026) · IEEE International Conference on Application-specific Systems, Architectures and Processors (ASAP) · doi:10.1109/asap71856.2026.00022 · Cited by 1
Soufyani, M. H. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7517986
Pêlαγos: An Adaptive GPU Decoder for Error Correction Simulations of Quantum LDPC Codes
Diamantopoulos, D., von Niederhäusern, L., Anghel, A. S., Pletka, R. A., Kayi, A., Müller, T., Papandreou, N., Blanuša, J., Sarafijanović, S., Gonzalez, N. M., et al. (2026) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw72780.2026.00025 · Cited by 1
HyQ-Guard AI-Driven Runtime Anomaly Monitoring and Mitigation for Hybrid Quantum Workflows
Ahmed, E., & Mäkitalo, M. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-39766-9_6
Beyond the hype: an empirical assessment of quantum computing in bioinformatics
Arcieri, M., Zuliani, P., Carotenuto, G., Carrus, M., & Castrignanò, T. (2026) · Frontiers in High Performance Computing · doi:10.3389/fhpcp.2026.1923360
de Lima, A. M., Silva, E. D. R. D. A., Teixeira, E. S., & Longo, R. L. (2026) · Journal of Molecular Modeling · doi:10.1007/s00894-026-06951-w
Garg, A., & Vishnoi, P. (2026) · International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence (ISMSI) · doi:10.1145/3820820.3820842
Anis, R. (2026) · Journal of Modern Classical Physics & Quantum Neuroscience · doi:10.63721/26jpqn0170
Security policies in quantum computing: a systematic review of literature
Cordero, J. N., Monterrubio, S. M. M., & Elipe, G. T. (2026) · Discover Computing · doi:10.1007/s10791-026-10596-x
Chaiyatho, T., Li, Z., Xu, J., Xu, X.-Y., & Sukmas, W. (2026) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.6c01171
Memory-Efficient State-Vector Simulation of Quantum Computer in Massively Parallel Supercomputers
Yoshioka, N., & Ito, N. (2026) · Springer proceedings in physics · doi:10.1007/978-981-92-0844-9_21
STL-QCRYPTO: Strategic Industrial Framework for Quantum-Resistant Cyber Defense
Bishwas, A. K., & Bishwas, M. S. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-28460-0_16
Passo, S. J. G., Kothavade, V. H., & Prevost, J. J. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-28460-0_21
Hertkorn, J., & Oreg, B. (2026) · Nature Physics · doi:10.1038/s41567-026-03459-1
Rakshath Raj, Y., N, C. S., Praveen, S., Yeswanth, M., & Pramila, R. P. (2026) · IEEE Region 10 Symposium (TENSYMP) · doi:10.1109/tensymp68909.2026.11704011
Quantum Machine Learning for Diagnosing Dysarthria from Speech Patterns
Shaipi, N., Patel, T. K., Kadambi, P., Uehara, G. S., Berisha, V., & Spanias, A. (2026) · International Conference on Information, Intelligence, Systems & Applications (IISA) · doi:10.1109/iisa71656.2026.11705576
Huang, H.-W., Yang, S.-L., Huang, C.-C., Chen, Y.-N., & Chen, H.-B. (2026) · Scientific Reports · doi:10.1038/s41598-026-66035-w · Cited by 3
Quantum Machine Learning Algorithms for Credit Card Fraud Detection
Patel, T. K., Hodges, T. M. W., Uehara, G. S., Samanta, S., Wang, D., Ferenczi, A., & Spanias, A. (2026) · International Conference on Information, Intelligence, Systems & Applications (IISA) · doi:10.1109/iisa71656.2026.11705567
Gajula, K. K., & Karnewar, S. (2026) · QP-AIDSE · doi:10.65713/qpv2i122
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.