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 7,701–7,800 of 8,640
eilkhas, E., Lari, B., & Hassanabadi, H. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae4395 · Cited by 1
Nearly-optimal CSS code subspace verification with local measurement
Hu, Y., Zheng, C., Yu, X., & Zhang, Z. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae4420 · Cited by 1
A Review of Formal Methods in Quantum Circuit VerificationPreprint
Govindankutty, A. (2026) · Qeios · doi:10.32388/h7d715.6
Variational quantum algorithm for constrained combinatorial optimization problems
Li, H., Han, Y.-L., Wang, Z., & Fei, S. (2026) · Physical Review A · doi:10.1103/ykxd-h19w · Cited by 3
Nguyen, B. T., Nguyen, V., & Thi, H. L. (2026) · International Journal of Modern Physics C · doi:10.1142/s0129183126430011 · Cited by 1
QuCoWE: Quantum Contrastive Word Embeddings with Variational Circuits for Near-Term Quantum Devices
Karanjai, R., Madhavarao, H. H., Xu, L., & Shi, W. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-17625-7_6
Limits of information flow between classically interacting particles
Miller-Dickson, M., & Rose, C. (2026) · Physical review. E · doi:10.1103/xb2l-78n3
Kim, H., & Ko, J. H. (2026) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001426520051
Decoded quantum interferometry under noise
Bu, K., Gu, W., Koh, D. E., & Li, X. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae4536 · Cited by 13
QuantAid : A Quiz-Based Quantum Learning Platform for High-school and Undergraduate Students
Hernandez, K., Patel, K., & Patel, T. (2026) · ACM Technical Symposium on Computer Science Education (SIGCSE) · doi:10.1145/3770762.3772593 · Cited by 3
Low-qubit quantum circuits for efficient integer squaring
Donaire, L. M., Ortega, G., Garzón, E. M., Filatovas, E., & Orts, F. J. (2026) · The Journal of Supercomputing · doi:10.1007/s11227-026-08255-5
Quantum AI and deep-tech innovations: A comprehensive review of next-generation intelligence
Thamizhmaran, K., & Vimali, R. (2026) · i-manager’s Journal on Software Engineering · doi:10.26634/jse.20.2.22957
A Quaternary Interpretation of Quantum Dynamics (QIQD) Dialogic Computer
Malik, P., & Hilton, K. (2025) · IEEE Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON) · doi:10.1109/iemcon67450.2025.11381037
Understanding Neural Networks in Surveillance Systems
Mathur, S., Sehgal, R., & Kumar, N. (2026) · Emerald Group Publishing Limited eBooks · doi:10.1108/978-1-80592-815-720261004
Efficient Quantum Amplitude Encoding via Improved Success Probability
Lu, X. P., Li, X., Li, Y., Yi, X., Hou, S., & Pan, C. (2025) · International Conference on Computing, Communication, Perception and Quantum Technology (CCPQT) · doi:10.1109/ccpqt66408.2025.11382951 · Cited by 1
Molecular Ground-State Energy Estimation Using VQE
Enoth Kumar, N., Irene, S., Jani, V., Sethukkarasi, C., & Ethirajan, D. (2025) · IEEE Pune Section International Conference (PuneCon) · doi:10.1109/punecon67554.2025.11378391 · Cited by 1
A Visual Composer for Quantum Circuits
Osman, A. T., Ghantous, M. M., & Soubra, H. (2025) · doi:10.1109/ic-ftai67960.2025.11384299
Quantum Computing: Principles, Technologies, and Future Directions - A Comprehensive Review
Nagaraju, D., Nimmala, H., Srinivasulu, T., Hemabala, K., & Jayalakshmi, P. (2025) · 2025 IEEE Pune Section International Conference (PuneCon) · doi:10.1109/punecon67554.2025.11378432
Scalable Error-Aware Quantum Teleportation in Trapped-Ion Systems
Luan, C., Li, X., Cheng, L., Cheng, Y., Pan, C., & Wang, F. (2025) · International Conference on Computing, Communication, Perception and Quantum Technology (CCPQT) · doi:10.1109/ccpqt66408.2025.11383076
Unveiling the Quantum Realm: A Comprehensive Analysis of Quantum Computing
helmy, S. M. A., El-Regaily, S. A., Mahmoud, A. M., et al. (2025) · doi:10.1109/ic-ftai67960.2025.11384159
Drone Delivery Packing Problem on a Neutral‐Atom Quantum Computer
Tarquini, S., Vandelli, M., Ferrari, F., Dragoni, D., & Tudisco, F. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70468 · Cited by 2
Study of thermal insulated transmission line for superconducting quantum computers
Fuwa, M., Arakawa, T., Hashimoto, N., et al. (2025) · Asia-Pacific Microwave Conference (APMC) · doi:10.1109/apmc65046.2025.11379847
Wurm, M. C. (2026) · AVS Quantum Science · doi:10.1116/5.0312410 · Cited by 1
Caballero, E. I. J., Tapia‐McClung, H., & Montes, E. M. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-17933-3_19
The role of the parameter landscape in Hartree–Fock quantum computing benchmarks
der Stichelen, R. V., Bohy, R., Bultinck, P., & Acke, G. (2026) · The Journal of Chemical Physics · doi:10.1063/5.0301030
Multi-Class Quantum Convolutional Neural Networks Using Strongly Entangling Circuits
Syafalni, I., Putri, M. D. A., Widyatmaja, M. D. S., Ditya, E. A., Mulyawan, R., Ruskanda, F. Z., & Maulidevi, N. U. (2025) · International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS) · doi:10.1109/ispacs68724.2025.11382899
Design of a quantum computing education program for high school students
Choi, J.-I., Cho, H., & Kim, A. (2025) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc66702.2025.11388309
A Study and Exploration of Hyperparameters in Quantum Convolutional Neural Networks
Ghazali, M. A. A., Syafalni, I., Maulidevi, N. U., & Mulyawan, R. (2025) · International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS) · doi:10.1109/ispacs68724.2025.11383323
Kasbi, H. A., Triyason, T., & Bramantoro, A. (2025) · International Conference on Advanced Information Scientific Development (ICAISD) · doi:10.1109/icaisd68166.2025.11385711
Entanglement-aware Quantum Error Mitigation for Complex Quantum Circuits
Kim, S. Y., Jhun, G. S., Kwon, Y. J., Kim, J., & Lee, Y. K. (2025) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc66702.2025.11388057
Hybrid Quantum-Classical Algorithm for Digital Filter Design: Bridging NISQ Optimisation
Siddiqui, L., Mani, A., & Singh, J. (2025) · doi:10.1109/icetce66848.2025.11388948
Evaluating Encoding Strategies and Quantum Circuit Designs for Sentiment Classification
Ruskanda, F. Z., Kurniawan, F., & Syafalni, I. (2025) · International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS) · doi:10.1109/ispacs68724.2025.11382677
Evaluating Quantum Wire Cutting for QAOA: Performance Benchmarks in Ideal and Noisy Environments
Meulen, M., Neumann, N. M. P., & Verbree, J. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-13852-1_29 · Cited by 1
Climate Modelling 2.0: Simulating Future Scenarios with Quantum Computing and HPC Power
Priyanga, M. A., Sathiya, B., Kayalvizhi, B., et al. (2026) · Springer eBooks · doi:10.1007/978-3-032-15188-9_10
Q-PORT: Quantum Portfolio Optimization with Resource-Efficient Encoding and Scalability Analysis
Marchisio, A., Hafeez, M. U., Innan, N., Kashif, M., & Shafique, M. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-13852-1_34
Janani, N., Kumar, T. V., Shree, K. D., Kumar, A. V. S., & Karthiga, M. (2026) · Springer eBooks · doi:10.1007/978-3-032-15188-9_9
Validation of an analyzability model for quantum software: a family of experiments
Muñoz, A. D., Cruz-Lemus, J. A., Rodríguez, M., Baldassarre, M. T., & Piattini, M. G. (2026) · Empirical Software Engineering · doi:10.1007/s10664-026-10825-3 · Cited by 1
The Urgency of Change: Climate and Environmental Challenges in the Quantum Era
Kumar, G. S., Maheshwari, G. U., Kumar, B. A., Dinola, A. A., & Jenita, P. (2026) · Springer eBooks · doi:10.1007/978-3-032-15188-9_1
Explainable AI for Environmental Solutions: Building Trust and Transparency in Quantum Systems
Jeyalakshmi, P. (2026) · Springer eBooks · doi:10.1007/978-3-032-15188-9_11
Quantum Leap: Unveiling the Power of Quantum Computing for Environmental Science
Pooranam, N., Surendran, D., Narmadha, R. P., Aruna, N., & Nisha, M. R. (2026) · Springer eBooks · doi:10.1007/978-3-032-15188-9_5
Dependence-Driven, Scalable Quantum Circuit Mapping with Affine Abstractions
Benbetka, M., Bekkar, M., Baghdadi, R., & Kong, M. (2026) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo68049.2026.11394841 · Cited by 2
Ahn, G., & Hong, S. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05081-9
Impact of leakage on the dynamics of an ST 0 qubit implemented in a double quantum dot device
del Moral, J. O., Larrarte, O. S., Dastbasteh, R., Martínez, J. E., & Otxoa, R. M. (2026) · Physical review. B./Physical review. B · doi:10.1103/6p7p-w1lc · Cited by 2
Performance of parity QAOA for the signed Max-Cut problem
Weidinger, A., Mbeng, G. B., FELLNER, M. J., Khachatryan, D., & Lechner, W. (2026) · New Journal of Physics · doi:10.1088/1367-2630/ae49b6 · Cited by 8
Fault-Tolerant Quantum Communication Systems Using Clifford Hierarchy-based CSS CodesPreprint
Das, M. K., Bhardwaj, P., Kumar, B., Ghorai, S. K., & Lal, R. K. (2026) · Research Square · doi:10.21203/rs.3.rs-8557720/v1
STQS: A Unified System Architecture for Spatial Temporal Quantum Sensing
Jebraeilli, A., Liu, C., Yin, K., Stein, S., Lentz, E., Ding, Y., & Li, A. (2026) · ACM Transactions on Quantum Computing · doi:10.1145/3795881 · Cited by 3
Quantum-Inspired Algorithms for Large-Scale Data Analytics: A Tensor Network Approach
Jarsania, J., & Chavda, C. (2026) · IEEE Annual Computing and Communication Workshop and Conference (CCWC) · doi:10.1109/ccwc67433.2026.11393744
Enhanced Leukemia Diagnosis Using Quantum-Inspired Feature Optimization and Transfer Learning
Banchhor, M., & Khadatkar, D. R. (2025) · International Conference on Artificial Intelligence for Innovations in Healthcare Industries (ICAIIHI) · doi:10.1109/icaiihi67124.2025.11403591
Non-convex optimization algorithm based on alternating quantum walk with potentials
Li, D., & Ju, G. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05107-2
Quantum Computing and Artificial Intelligence in Pharmaceutical Demand Planning
Takawira, B. (2026) · IGI Global eBooks · doi:10.4018/979-8-3373-9928-7.ch010
Wang, Y. Z., Cao, Y., Xie, P., et al. (2026) · Frontiers in Earth Science · doi:10.3389/feart.2026.1642714
Markov chain decision-making with quantum-assisted entropy kernels
Peretz, O., & Koren, M. (2026) · Discover Quantum Science · doi:10.1007/s44464-026-00010-2
Exploiting non-Markovian memory effects for robust quantum teleportation
Gaidi, S., Abouelkhir, N.-E., Slaoui, A., Falaki, M. E., & Laamara, R. A. (2026) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-026-07455-5 · Cited by 3
Hybrid Quantum-Classical Agentic AI for Resource-Efficient Optimization of National Power Grids
Konda, A. (2025) · International Conference on Intelligent Systems and Embedded Design (ISED) · doi:10.1109/ised67359.2025.11404913
Hardware-efficient quantum arithmetic logic units for square lattice architectures
Li, J. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae4b73
Larasati, H. T., & Choi, B.-S. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00483-1 · Cited by 1
Krishna, R. (2026) · International Journal of Computational and Theoretical Chemistry · doi:10.11648/j.ijctc.20261401.11
Future in Artificial Intelligence and Knowledge Management
Rezaei, M. (2026) · Emerald Group Publishing Limited eBooks · doi:10.1108/978-1-80686-251-120261006
A Review of Artificial Intelligence Technology: Applications and Impacts in Cybersecurity Evaluation
范, 佳. (2026) · Artificial Intelligence and Robotics Research · doi:10.12677/airr.2026.152040
Secure Communication for Industrial Applications via Measurement-Based Distributed Quantum Computing
Gupta, N., Punia, D., Gautam, K., Sikka, G., & Sharma, A. K. (2025) · OITS International Conference on Information Technology (OCIT) · doi:10.1109/ocit66168.2025.11400031 · Cited by 1
Hybrid Quantum-Classical UNet for Image Segmentation: Breaking the Parameter Scaling Barrier
Lim, S.-C., & Kim, J.-C. (2026) · IEEE Access · doi:10.1109/access.2026.3669206 · Cited by 2
Rodrigues, W. W. T., & Filho, J. F. (2025) · doi:10.5753/eradse.2025.16905
An Operations Research Guided Layout Framework for Quantum Multi-Programming
Cao, S., Zhou, X., Chen, Q., et al. (2025) · International Conference on Communication Technology and Information Technology (ICCTIT) · doi:10.1109/icctit68197.2025.11406557
Wang, Y.-H., Zhu, M.-D., Wang, X.-F., Zhong, W., Du, M., Zhou, L., & Sheng, Y. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05108-1
Nguyen, H. T., Usman, M., & Buyya, R. (2026) · ACM Transactions on Quantum Computing · doi:10.1145/3799898 · Cited by 10
NQ-SVM: Scalable Quantum Kernel Learning via Nyström-Based Support Vector MachinesPreprint
Do, D. T., Thudumu, S., Jayaraman, P. P., & Nguyen, D. T. (2026) · Research Square · doi:10.21203/rs.3.rs-8962794/v1
Quantum-Inspired Data Representations for Classical Machine Learning
Kumar, S., Binjrawat, H., & Singal, G. (2026) · International Conference on Computational Intelligence in Data Science (ICCIDS) · doi:10.1109/iccids69108.2026.11407855
Adaptive Quantum Error Mitigation Using Machine Learning in Noisy Intermediate-Scale Quantum Systems
Jefin Rojar, J., Haribaskar, R., Jayakumar, N., & Jayakumar, R. (2026) · International Conference on Computational Intelligence in Data Science (ICCIDS) · doi:10.1109/iccids69108.2026.11407599
The Convergence of Quantum Computing and Artificial Intelligence
Tank, N. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-7779-7.ch004
Zhou, Y., & Wang, Q. (2026) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca68181.2026.11408484
A Comprehensive Review of the Convergence of Quantum Computing and Finance
Aggarwal, A., Shrivastava, P., & Kler, R. (2025) · Global AI Summit - International Conference on Artificial Intelligence and Emerging Technology (AI Summit) · doi:10.1109/aisummit66170.2025.11411648
Calculating the binding energies of the first 29 light nuclei with VQE on quantum computing
Baskan, T., & Yılmaz, A. H. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae4dc7 · Cited by 1
Kuno, Y., Orito, T., & Ichinose, I. (2026) · SciPost Physics Core · doi:10.21468/scipostphyscore.9.1.014 · Cited by 7
Quantum-Assisted Big Data Analytics for Ultra-High-Dimensional Datasets
Meruga, V. B. (2025) · Asia Pacific Conference on Innovation in Technology (APCIT) · doi:10.1109/apcit65661.2025.11411655
Schrödinger’s bug: a survey on quantum software debugging
Rosa, E. C. R., & de Santiago, R. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05114-3 · Cited by 4
QEFS: Quantum evolutionary feature selector for a real quantum computer
Kaushik, B., Rajpal, A., & Kumar, N. (2026) · Applied Soft Computing · doi:10.1016/j.asoc.2026.114965 · Cited by 1
Quantum federated learning for intrusion detection in Industrial Internet-of-Things
Sankaran, S., Nedungadi, N., & Sharma, A. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-38349-6.00001-4
Cai, W., Wang, Y., Xu, Y., Du, S., Qin, Q., & Li, Y. (2026) · The Journal of Supercomputing · doi:10.1007/s11227-026-08360-5
Quantum–classical collaborative neural network for automatic modulation classification
Xu, W., Zhou, R., Li, Y., & Zhang, X. (2026) · Advanced Engineering Informatics · doi:10.1016/j.aei.2026.104566
qc-kmeans: A Quantum Compressive K-Means Algorithm for NISQ Devices
Chumpitaz-Flores, P., Duong, M., Mao, Y., & Hua, K. (2025) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata66926.2025.11400889 · Cited by 3
Demidova, L. A., & Масленников, В. В. (2026) · AIP conference proceedings · doi:10.1063/5.0322584
Exploring the fidelity of flux-qubit measurement in different bases via the quantum flux parametron
Ji, Y., Kirchhoff, S., & Wilhelm, F. K. (2026) · Physical Review A · doi:10.1103/86jt-by9x · Cited by 1
A Critical Analysis of a Multi-Input Cnn Architecture for Quantum-Enhanced Forecasting
Mahmud, A. (2025) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw69685.2025.00428
Subtrajectory Clustering with Machine Learning on Quantum Computers
Bishop, W., Leal, E., & Gruenwald, L. (2025) · IEEE ... International Conference on Data Mining workshops · doi:10.1109/icdmw69685.2025.00263
QGCNLP: Hybrid Quantum–classical Graph Convolutional Network based Link Prediction
Singh, N., Kumar, M., Sharma, J., & Biswas, B. (2026) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2026.131449 · Cited by 1
Memory Bottlenecks in Quantum Simulation: Cache Contention and Adaptive Allocation Policy
Chouhan, M., & Kulkarni, S. G. (2026) · International Conference on Communication Systems & Networks (COMSNETS) · doi:10.1109/comsnets67989.2026.11418259
Hybrid Classical-Quantum Neural Network for Distributed Denial of Service Attacks Detection
Alomari, A., & Kumar, S. A. P. (2025) · International Conference on Cognitive Machine Intelligence · doi:10.1109/cogmi67134.2025.00042
TreeVQA: A Tree-Structured Execution Framework for Shot Reduction in Variational Quantum Algorithms
Hou, Y., Bharadwaj, D., & Ravi, G. S. (2026) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3779212.3790239 · Cited by 1
Quantum Regression for Cognitive Intelligence in Complex Environments
Alomari, A., & Kumar, S. B. R. (2025) · IEEE International Conference on Cognitive Machine Intelligence (CogMI) · doi:10.1109/cogmi67134.2025.00047 · Cited by 2
Quantum Clustering for Cognitive Intelligence: Methods, Applications and Challenges
Alomari, A., & Kumar, S. B. R. (2025) · IEEE International Conference on Cognitive Machine Intelligence (CogMI) · doi:10.1109/cogmi67134.2025.00037
Elshamy, A. A., Metwaly, H. A., Eldagla, M. I., et al. (2025) · International Japan-Africa Conference on Electronics, Communications, and Computations (JAC-ECC) · doi:10.1109/jac-ecc67970.2025.11417557
Yang, J., Cai, Q., Guo, J., & Deng, G. (2026) · Acta Physica Sinica · doi:10.7498/aps.75.20251792
Scalable protocol for coherence estimation from scarce data: Theory and experiment
Ding, Q.-M., Zhang, T., Li, H., & Zhang, D.-J. (2026) · Physical Review A · doi:10.1103/g8sh-hts2
Predicting Drug Sensitivity in TP53-Mutated Cancer via Quantum Boltzman Machines
Vancea, V. (2025) · IEEE International Conference on Intelligent Computer Communication and Processing (ICCP) · doi:10.1109/iccp68926.2025.11427125
Symmetry-adapted perturbation theory
Hapka, M., & Patkowski, K. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-26596-9.00001-6 · Cited by 1
Exploration of Key Challenges and Features of Quantum Computing
Tripathi, A., Mishra, G. R., Srivastava, G., Singh, S. K., & Dubey, V. (2026) · Springer proceedings in physics · doi:10.1007/978-3-032-15441-5_28
Scalable tomography of many-body quantum environments with low temporal entanglement
Luchnikov, I. A., Sonner, M., & Abanin, D. A. (2026) · Physical Review A · doi:10.1103/78jc-wcqb · Cited by 4
Ugwumba, N. K. (2026) · Research Square · doi:10.21203/rs.3.rs-9105513/v1
Generative artificial intelligence for de novo drug design
Ali, A. M., Qazi, S., Almuqdadi, H. T. A., Neeraj, Majeed, O. S., Majeed, A. A., Temur, A. A., Murshedi, G. H. M. A., & Waheed, M. S. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-44415-9.00018-1
Quantum urbanism and the NFT nexus: Redefining virtual land value in decentralized cities
Dorostkar, E. (2025) · Spatium · doi:10.2298/spat250811010d
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.