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,501–7,600 of 8,640
Li, X., & Yin, Z. (2026) · Physical review. B./Physical review. B · doi:10.1103/fq4j-2p2l · Cited by 1
Remote Entanglement Generation Via Enhanced Quantum State Transfer
Wang, T.-L., Wang, P., Zhao, Z., Zhang, S., Zhao, R.-Z., Yang, X., Zhang, H., Li, Z., Wu, Y. S., Guo, L.-L., et al. (2026) · PRX Quantum · doi:10.1103/4x8d-cmyx · Cited by 6
Lee, Y., Choi, M., Min, Y., Bae, E., & Bae, S. (2025) · Physical Review A · doi:10.1103/x6j4-gnww · Cited by 3
Managing the container premarshalling problem to optimality using quantum-enhanced deep learning
Tan, N. D., Kim, H., You, S., Long, L. N. B., Cuong, T. N., & Nguyễn, D. A. (2025) · Maritime Economics & Logistics · doi:10.1057/s41278-025-00338-z
Wen, Z., Chen, J., Lu, Y., Tan, S., Yin, J., Zhu, M., & Chen, W. (2025) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2025.3642559 · Cited by 1
Integrating EEG With Smart Devices: A Theoretical Overview
Shaikh, A., Kothuru, R. T., & Shaikh, K. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-2706-8.ch004
Mammola, A., Schaeverbeke, Q., & Molfetta, G. D. (2026) · Physical Review Research · doi:10.1103/wc4h-thmg
Shkolnik, G., Gopalakrishnan, S., Huse, D. A., Gazit, S., & Pixley, J. H. (2025) · Physical review. B./Physical review. B · doi:10.1103/nq1j-7tzg · Cited by 3
Probing entanglement and parameter sensitivity in QAOA via Quantum Fisher Information
Sarmina, B. G., Benavides, J. S., Sun, G.-H., & Dong, S. (2025) · Quantum Review Letters · doi:10.1016/j.qrl.2025.12.001 · Cited by 4
Symmetry operations and critical behavior in classical to quantum stochastic processes
Cabrera, G. M., Biswas, S., & Gorin, T. (2025) · Physical review. E · doi:10.1103/sxv8-vv6r
Qiao, M., & Liu, Y.-X. (2025) · Physical Review A · doi:10.1103/p78c-9rxb · Cited by 1
Estimation of multivariate traces of states given partial classical information
Simonov, K., Wagner, R., & Galvão, E. F. (2025) · Physical Review A · doi:10.1103/mrpz-xq28 · Cited by 6
Ghadimi, M., Salari, V., Bakrani, S., et al. (2025) · Physical Review A · doi:10.1103/b5d4-m3qc
Adaptive quantum dynamics with the time-dependent variational Monte Carlo method
Salioni, R., Martinazzo, R., Galli, D. E., & Apostoli, C. (2026) · Physical review. B./Physical review. B · doi:10.1103/qz9c-rrvh · Cited by 2
False Memory via Quantum Tunnelling: A Photosynthetic Simulation of Social Cyber Engineering Risks
Merat, S., & Almuhtadi, W. (2025) · IEEE International Conference on Consumer Electronics - Berlin (ICCE-Berlin) · doi:10.1109/icce-berlin67488.2025.11277867
Simulation of thermal-relaxation noise for quantum error correction
Garner, S. R., Myers, N. M., Wang, M., Stein, S., Liu, C., & Li, A. (2026) · Physical Review Research · doi:10.1103/hgnj-v4j7 · Cited by 2
Sub-Bath Cooling in Bosonic Systems: Gaussian Constraints and Non-Gaussian Enhancements
Png, W.-H., Hu, X., & Scarani, V. (2026) · PRX Quantum · doi:10.1103/3qnz-6bcz · Cited by 2
Quantum-Enhanced Facial Biometrics: A Hybrid Framework with Post-Quantum Security
Singh, S., Thakur, A., Hasan, M., & Bhatia, G. S. (2025) · Quantum Reports · doi:10.3390/quantum7040064
A Review of Formal Methods in Quantum Circuit VerificationPreprint
Govindankutty, A. (2025) · Qeios · doi:10.32388/h7d715
QUEST: A New Technical Committee for Quantum Earth Science and Technology [Technical Committees]
Cavallaro, G., Singh, U. N., Miroszewski, A., Rudolph, J., Strangfeld, A., Sebastianelli, A., Mauro, F., & Delilbasic, A. (2025) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2025.3562225
QuanGuard: Error Evolution-Based Fingerprinting for Fraud Detection in Quantum Cloud Services
Wu, J., Hu, T., & Li, Q. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3645773 · Cited by 3
Quantum Computers and Computing a Better World
Velu, C. K., Norman, K. W., Zhu, Y., Putra, F. H. R., & Noble, C. (2025) · Springer eBooks · doi:10.1007/978-3-031-99808-9_2
Anharmonicity-limited gate-time boundaries in transmon single-qubit quantum gates
Türkpençe, D., & Çakmak, S. (2026) · Journal of the Optical Society of America B · doi:10.1364/josab.581099 · Cited by 2
Neural Network Enhanced Robustness for Noisy Quantum Applications
Breslawski, D., Crimmins, A., & Alarcón, S. L. (2024) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc64395.2024.10937016 · Cited by 1
Challenges and Practices in Quantum Software Testing and Debugging: Insights from Practitioners
Zappin, J., Stalnaker, T., Chaparro, O., & Poshyvanyk, D. (2026) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3838727 · Cited by 10
Additional file 1 of Modelling carbon capture on metal-organic frameworks with quantum computing
Greene‐Diniz, G., Manrique, D. Z., Sennane, W., Magnin, Y., Shishenina, E., Cordier, P., Llewellyn, P. L., Krompiec, M., Rančić, M. J., & Ramo, D. M. (2024) · Figshare · doi:10.6084/m9.figshare.26554478
Quantum Shift in Cybersecurity: Strategic Insights for Executives and Practitioners
Abed, J., Awasthi, V., & Singh, R. (2025) · IT Professional · doi:10.1109/mitp.2025.3591942
Integration Technology Challenges in Quantum Computers: The Size, Noise and Wires Matter
Ishihara, R. (2025) · IEEE Electron Devices Magazine · doi:10.1109/med.2025.3588563
Quantum error mitigation based on the Z -mixed-expression of the amplitude damping channel
李, T. 汀. L., Zhang, H., 征, L. 玲. Z., & 李, F. 飞. L. (2025) · Chinese Physics B · doi:10.1088/1674-1056/ae067c · Cited by 1
LABRIKI, F. E., Elassad, Z. E. A., Meslouhi, O. E., et al. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5525974
From Classical Challenges to Quantum Solutions: Grover’s Algorithm for the N-Queens Problem
Montiel, O., Orozco-Rosas, U., López, D., et al. (2025) · Studies in computational intelligence · doi:10.1007/978-3-031-85614-3_15
McGarraghy, S., & Venkova, M. (2025) · Springer eBooks · doi:10.1007/978-3-319-07153-4_68-1
Efficient full-state simulation for quantum AI systems
Zhao, Y., Chen, Y., Li, H., Wang, Y., Chang, K., Wang, B., Li, B., & Han, Y. (2025) · Elsevier eBooks · doi:10.1016/b978-0-44-330259-6.00016-5
Quantum Preprocessing for Internet of Things Edge Computing Security Devices
Cheng, T., Sugerman, S., Farley, C., & Callahan, B. (2025) · IEEE International Conference on Secure IoT, Assured and Trusted Computing (SATC) · doi:10.1109/satc65530.2025.11137057
Miranda-Rodriguez, P., & Osaba, E. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5615862
Perrier, E., & Aboy, M. (2026) · Perspectives in law, business and innovation · doi:10.1007/978-981-92-3768-5_3 · Cited by 1
The Divided-QUBO-Based Quantum Algorithm for Optimal Wireless Link Scheduling
Ruan, Y., Chen, P., Yang, Z., Zhao, W., Tang, F., Liu, Z., & Kato, N. (2025) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2025.3630066 · Cited by 1
An Investigation of functional size measurement of error correction overhead in quantum softwarePreprint
Adel, Y., Soubra, H., Hacaloglu, T., et al. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5759456
Kumari, M., Ray, K., Lugo, J. E., Faubert, J., & Misaghian, K. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-95-1069-6_37
NISQ Security and Complexity via Simple Classical Reasoning
Cojocaru, A., Garay, J., Liu, Q., & Song, F. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-12296-4_15 · Cited by 1
Toward structure-preserving quantum encodings
Parzygnat, A. J., Bradley, T.-D., Vlasic, A., & Pham, A. (2025) · Physical Review Research · doi:10.1103/rph8-g15q · Cited by 6
Estimation of nonlinear physical quantities by measuring ancillas
Nghiem, N. A., & Wei, T.-C. (2025) · Physical Review A · doi:10.1103/q6t8-yrjb · Cited by 3
Dual-Discriminator Hybrid Quantum Generative Adversarial Networks for Improved GAN Performance
Pongpanich, P., & Phienthrakul, T. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3642110
A Framework for Quantum Circuit Optimization: Comparators as a Case Study
Orts, F. J., & Gil-Merino, R. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3642981
Counting Qubits and Gates: Resource Analysis in Quantum Programming Languages
Lago, U. D. (2025) · International Symposium on Principles and Practice of Declarative Programming (PPDP) · doi:10.1145/3756907.3756908
Xu, H. L., Li, W., Chen, T., Wei, K., & Zhang, C. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500799 · Cited by 1
Quantum deep neural networks modeling for inventory management
Maitra, S. (2025) · Journal of Modelling in Management · doi:10.1108/jm2-11-2024-0371
Quantum Governance in the Making: Why Standards Matter
Smith, H. L., Aboy, M., Davis, P. A. E., & Minssen, T. (2026) · Perspectives in law, business and innovation · doi:10.1007/978-981-92-3768-5_2 · Cited by 3
Cycle-Aware Parallel Optimization for Mitigating ZZ Crosstalk on Quantum Hardware
Zhong, J., & Deng, Y. (2025) · Proceedings of the International Conference on Parallel Processing · doi:10.1145/3754598.3754622 · Cited by 2
Parry, O., & McMinn, P. (2025) · International Conference on Evaluation and Assessment in Software Engineering (EASE) · doi:10.1145/3727967.3756820 · Cited by 2
Sultana, S., Sarker, M. F., Younus, M. F. B., Arefeen, M. A., & Nimi, S. T. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00434-0
Encoding molecular structures in quantum machine learning
Boy, C., Altamura, E., Manawadu, D., Tavernelli, I., Mensa, S., & Wales, D. J. (2025) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ae304f · Cited by 6
DISCRETE QND ENTANGLEMENT-PROTECTION PROTOCOL FOR A PHASE-SHIFTED BELL PAIR
Konovalenko, O. M., & Maizelis, Z. А. (2025) · The Journal of V N Karazin Kharkiv National University Series Physics · doi:10.26565/2222-5617-2025-42-06
Tedeschi, L. O., & Menendez, H. M. (2025) · Journal of Animal Science · doi:10.1093/jas/skaf452
Prospects for Quantum Computing in Onboard Computer Systems for Robotics
Bocharov, N. (2025) · Summa · doi:10.1109/summa68668.2025.11302253
Assessment of Quantum Feature Map for Binary Forest Classification using QSVM
Pramanik, S., & Jha, A. K. (2025) · IEEE International Geoscience and Remote Sensing Symposium (IGARSS) · doi:10.1109/igarss55030.2025.11313953
Quantum Computing for Sustainable Agriculture: A Review and Conceptual Framework
Wu, Y., Nagy, A. B., Szilvia, Á., et al. (2025) · IEEE International Symposium on Computational Intelligence and Informatics (CINTI) · doi:10.1109/cinti67731.2025.11311742
Compress, Encode, Diagnose: PCA-Enhanced QNNs for Breast Cancer Classification
Prajapati, A. K., Saha, L. K., Ahsan, M. N., & Aswath Babu, H. (2025) · IEEE International Conference on Recent Advances in Systems Science and Engineering (RASSE) · doi:10.1109/rasse64831.2025.11315389
QTIME: A Machine Learning Framework for Timing Side-Channel Analysis in Quantum Circuit Simulators
Dong, B., Feng, H. P., & Wang, Q. (2025) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd65941.2025.00055 · Cited by 1
Predicting Molecular Properties With Quantum Kernels: a Study on the Qm9 Dataset
Khattar, S., Kumawat, H., & Aryan (2025) · doi:10.1109/icwite64848.2025.11307106
Quantum Computing for First-Time Learners
German, D.-A., Snyder, C., & Phillips, J. M. (2025) · ACM Inroads · doi:10.1145/3774781
Um Ambiente integrado à Qiskit para Execução Remota de Algoritmos Quânticos em GPU
da Silva, M. E. M., Leal, H. C., Conceicao, C. M. D. O., et al. (2025) · doi:10.5753/erbase.2025.13726
Concolic Testing for Quantum Compilers
Choudhury, N., Bhave, A., & Basu, K. (2025) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd65941.2025.00057 · Cited by 2
Wang, G., Wu, Y., Hao, X., Wu, D., & Ren, J. (2025) · Communications in Theoretical Physics · doi:10.1088/1572-9494/ae3236
Latency-Optimal Quantum Circuits for IoT Networks
Glisic, S., & Lorenzo, B. (2025) · IEEE Access · doi:10.1109/access.2025.3649805
Advances in Quantum Technologies for Defense: Opportunities and Security Challenges
Śliwa, J., Wrona, K., Piani, M., et al. (2025) · IEEE Military Communications Conference (MILCOM) · doi:10.1109/milcom64451.2025.11310729
Reimagining Quantum Computing from Atomic Intelligence to Integrated Quantum Computational Systems
Malik, P. (2026) · Lecture notes in electrical engineering · doi:10.1007/978-981-95-0433-6_11
Unveiling Entanglement. Information Fields as the Fabric of Nonlocality
Azevedo, E., & Filho, J. P. (2026) · Studies in Rhythm Engineering · doi:10.1007/978-981-95-1742-8_3
Quantum-Enhanced Hardware Platforms for 6G Mobile Edge Computing
Ghaderi, S., Bassoli, R., & Fitzek, F. H. P. (2025) · IEEE Future Networks World Forum (FNWF) · doi:10.1109/fnwf66845.2025.11317287
Quantum Machine Learning Empowerment for Cloud Security: A Comprehensive Literature Review
Chandrasekhar, T., Lanka, D. R., Venkatesh, M., & Sankar, G. S. (2026) · Studies in big data · doi:10.1007/978-3-032-00586-1_21
Quantum Cloud Services: Getting Quantum Power
Malik, M. (2026) · Springer eBooks · doi:10.1007/978-3-032-10775-6_6
Detailed Cryptanalysis of “Privacy-Preserving Quantum Federated Learning via Gradient Hiding”
Iqbal, Z., Hassan, S. Z., Zhao, J., et al. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-08977-9_30
Breaking Integer Factorization Using Shor’s Algorithm: A Practical Approach with IBM Qiskit
Ghugare, A., Rajoba, A., & Saini, D. K. (2026) · Smart innovation, systems and technologies · doi:10.1007/978-3-032-12983-3_3
Multi-Quantum Agent System for DNA Self-Assembly
Vancea, V. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-12481-4_10
Paul, M., John, T. C., & Raveendran, N. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-13883-5_6
Qubits, Quantum Gates, and Quantum Circuits
Mishra, S. P., & Katakam, R. (2026) · Springer eBooks · doi:10.1007/978-3-032-10775-6_2
Hybrid Quantum-Classical Computers: A Critical Analysis to Quantum Computational Models
Hajizade, A., Bassoli, R., & Fitzek, F. H. P. (2025) · IEEE Future Networks World Forum (FNWF) · doi:10.1109/fnwf66845.2025.11317658
Quantum Computing in Digital Marketing: The Next Revolution
Xavier, B. (2026) · Studies in big data · doi:10.1007/978-3-032-00586-1_13
Transforming Big Data with Quantum Computing: Algorithmic Innovations and Applications
Mehta, P. S., Maske, Y. K., Lokhande, S. A., & Thakare, C. D. (2026) · Studies in big data · doi:10.1007/978-3-032-00586-1_15
Quantum Machine Learning: Merging Quantum and AI
Gadde, S. S., & Nalwade, A. P. (2026) · Springer eBooks · doi:10.1007/978-3-032-10775-6_8
Quantum Clustering for Classification of DNA Sequences
Vancea, V. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-12481-4_11
Impact of Quantum Computing on Cryptography
Lucas, J. M. M., Marques, M. M., & Lobo, V. (2026) · Smart innovation, systems and technologies · doi:10.1007/978-3-032-10947-7_25
Quantum Computing as a Paradigm Shift in Mechanical and Allied Engineering
Sharma, V. K. (2026) · Springer eBooks · doi:10.1007/978-3-032-10775-6_11
Artificial Intelligence-Driven Engineering Education
Zabalawi, I., Kordahji, H., Salti, H., & Alkhatib, F. (2026) · Springer eBooks · doi:10.1007/978-3-031-99068-7_11 · Cited by 1
Tensor Networks in Quantum Neural Network Architectures
Meenakshi, K., Chauhan, R., & Bhargava, D. (2026) · Signals and communication technology · doi:10.1007/978-981-95-1683-4_2
DeepQUBO: Quantum-Optimized Route Planning for Carpooling Service
Liu, Z., Zhao, Y., Gao, X., & Tian, K. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-5015-9_27
Quantum Computing Fundamentals: Beyond Classical Bits
Karni, S., & Rajamandrapu, A. K. (2026) · Springer eBooks · doi:10.1007/978-3-032-10775-6_1 · Cited by 6
Prediction of Molecular Structures and Properties by Using Quantum Technology
Krishna, R. (2025) · American Journal of Physical Chemistry · doi:10.11648/j.ajpc.20251404.14
Tower of Structured Excited States from Measurements
Guo, Y., & Ashida, Y. (2026) · Physical Review Letters · doi:10.1103/vywt-16r7
Rényi Markov length in one-dimensional nontrivial mixed-state phases
Kuno, Y., Orito, T., & Ichinose, I. (2026) · Physical review. B./Physical review. B · doi:10.1103/y8y1-2gqc · Cited by 6
Advancements in numerical methods for quantum resources
Kožić, S. B., Torre, G., & Giampaolo, S. M. (2026) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/ae1ff9 · Cited by 1
A System Architecture for Low Latency Multiprogramming Quantum Computing
Zhao, Y., Chen, Y., Chang, K., Li, H., Li, B., Han, Y., & Wang, Y. (2026) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3845611 · Cited by 1
Efficient variational quantum Korkin-Zolotarev algorithm for solving shortest-vector problems
Hou, X., Zhou, G., Jin, S., Li, Y., Huang, W., Sun, A., Wang, X., & Xu, B. (2026) · Physical Review A · doi:10.1103/lc7v-3kwg · Cited by 3
Design of a Superposition-Based Approximate QRAM for Noise-Tolerant Quantum Machine Learning
Sajadimanesh, S., & Atoofian, E. (2026) · International Conference on High Performance Computing in Asia-Pacific Region (HPC Asia) · doi:10.1145/3773656.3773677 · Cited by 2
A Review of Formal Methods in Quantum Circuit VerificationPreprint
Govindankutty, A. (2026) · Qeios · doi:10.32388/h7d715.2
Miranda-Rodriguez, P., & Osaba, E. (2026) · SoftwareX · doi:10.1016/j.softx.2026.102507 · Cited by 1
Why cut-and-choose quantum state verification cannot be both efficient and secure
Wiesner, F., Chaoui, Z., Kessler, D., Pappa, A., & Karvonen, M. (2025) · IACR Commun. Cryptol. · doi:10.62056/ay11c3c2h · Cited by 2
A large scale statistical analysis of quantum and classical neural networks in the medical domain
Ghisoni, F., Borrotti, M., & Mariani, P. (2026) · Scientific Reports · doi:10.1038/s41598-025-33825-7 · Cited by 6
The Quantum Shift in Machine Learning
Rai, P., John, T. J., & Dkhar, J. M. (2026) · Lecture notes in networks and systems · doi:10.1007/978-981-96-9184-5_45
Enhancing Neural Network with Quantum Computing
D’Souza, S. M., Prasad, R. R., Reddy, C. S., Reddy, P. U. M., Chethan, S. P., & Sushruth, M. S. (2026) · Lecture notes in networks and systems · doi:10.1007/978-981-96-8350-5_11
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.