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,601–7,700 of 8,640
A finite state automaton for quantum computing
Kwon, Y., & Agha, G. (2026) · Quantum Information Processing · doi:10.1007/s11128-025-05047-3
Real-time error mitigation for variational optimization on quantum hardware
Robbiati, M., Sopena, A., Papaluca, A., & Carrazza, S. (2026) · Physical Review Research · doi:10.1103/zyb2-zl2d · Cited by 15
Evaluating Loss Functions for QNet: A Comparative Analysis on Modern NISQ Simulators
Amadoun, K., Kissi, C., Moumen, I., & Boujiha, T. (2025) · International Symposium on Advanced Electrical and Communication Technologies (ISAECT) · doi:10.1109/isaect68904.2025.11318683
A Randomized Data Structure for Efficient Quantum Encoding
Zollner, J. M., Rieger, C., & Werner, M. (2025) · Q-Spatial · doi:10.1145/3764923.3777404 · Cited by 1
Performance Analysis of Quantum Machine Learning for Malware Detection
Dudeja, H., & Modi, C. (2026) · Lecture notes in electrical engineering · doi:10.1007/978-981-95-2196-8_33 · Cited by 1
Application of Quantum Computers to Study the Dative Bond Between Pyridine Molecule and Lithium Ion
Ghasemi, F., Kawashima, Y., & Moon, K. (2025) · IEEE Conference on Pervasive and Intelligent Computing (PICom) · doi:10.1109/picom68402.2025.00045
A Review on Quantum-Enhanced Deep Learning Frameworks for Reliable Plant Disease Detection
Naresh, U., & Reddy, T. B. (2026) · Current Agriculture Research Journal · doi:10.12944/carj.13.3.3
FRQI Pairs method for image classification using Quantum Recurrent Neural Network
Potempa, R., Kordasz, M., Khan, S. N., Werner, K., Wereszczyński, K., Simiński, K., & Cyran, K. A. (2025) · International Conference on Control, Decision and Information Technologies (CoDIT) · doi:10.1109/codit66093.2025.11321716
Quantum Computing-Based State-of-Charge Estimation of Electric Vehicle Battery
Kumar, S. S., Vinod Kumar, D. M., & Deshmukh, R. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-7041-5.ch011
Radar Signal Classification with Quantum Machine Learning: Ansatz Depth Impact on Expressibility
Martinez, G. F., Croci, A., Drago, F., Niccolai, A., Mussetta, M., & Zich, R. E. (2026) · Electronics · doi:10.3390/electronics15020370 · Cited by 1
Mapping the quantum computing landscape: growth, collaboration, and thematic convergence
Conde-Torres, D., Seco-González, A., Piñeiro, Á., & Fandino, R. G. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00464-4 · Cited by 3
Quantum Computing and Generative AI
Kaswan, K. S., Dhatterwal, J. S., Malik, K., & Kantha, P. (2026) · Wiley eBooks · doi:10.1002/9781394305698.ch7
Lu, D., Wang, Z., Liu, J., Li, Y., Ewe, W.-B., & Liu, Z. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae397e · Cited by 1
Many-body entanglement swapping protocol: Opportunities for distributed quantum computing
Huhtanen, S., Mafi, Y., Moghaddam, A. G., & Ojanen, T. (2026) · Physical Review Research · doi:10.1103/9n1d-7jwj · Cited by 4
Multilevel quantum metaheuristics: applications in data exploration
Jaiswal, S., & Tyagi, N. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-33136-7.00015-3
Thapa, S., Behuria, S., Das, A., Chakraborty, P., & Bandyopadhyay, A. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-33136-7.00011-6 · Cited by 1
Kaur, I. (2025) · De Gruyter eBooks · doi:10.1515/9783112213049-011 · Cited by 1
Benchmarking the Quantum Frontier: Evaluating QML Models on Core Learning Tasks
Samarth, P., Shashidhar, S., Rajani, S., Masand, S. P., & Ramasamy, P. (2025) · International Conference on AI-ML Systems (AIMLSystems) · doi:10.1109/aimlsystems67835.2025.11330254
Goyal, K., & Pathak, A. (2025) · International Conference on AI-ML Systems (AIMLSystems) · doi:10.1109/aimlsystems67835.2025.11331164
Performance Analysis of Quantum Algorithms on Multi-CPU and GPU Quantum Simulators
More, K., & Yadav, R. S. (2025) · Supercomputing India (SCI) · doi:10.1109/sci68648.2025.11333873
FastTrack ART: Accelerating HIV Treatment via Quantum-AI-Enhanced Molecular Simulations
Singh, S. K., Yadav, P. K., Kumar, P., et al. (2025) · IEEE International Conference on Computing, Communication and Automation (ICCCA) · doi:10.1109/iccca66364.2025.11325489
Kumar, A., Rani, P., Sachdeva, S., & Alharbe, N. (2025) · De Gruyter eBooks · doi:10.1515/9783112213049-003
Bantupalli, R., Sutradhar, K., & Halavar, B. (2025) · doi:10.1109/sci68648.2025.11333872
Logarithmic-depth MCT gate implementation method on a given arbitrary number of clean ancillae
Lee, J., & Kang, Y. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05056-w
Pushing the Limits of Large Language Models in Quantum Operations
Closser, D., & Kabala, Z. J. (2026) · Quantum Reports · doi:10.3390/quantum8010007 · Cited by 3
SaiPrasath, B., SasiKumar, R., & Dineshkumar, A. (2025) · International Conference on Applied Artificial Intelligence and Computing (ICAAIC) · doi:10.1109/icaaic64647.2025.11330392
AQUA: An Agile Process to Develop Quantum Annealing Applications
Marchesi, L., Nasharti, A., & Marchesi, M. (2026) · IEEE Access · doi:10.1109/access.2026.3728144
Quantum state tomography for tensor networks in two dimensions
Qin, Z., & Zhu, Z. (2026) · Physical Review A · doi:10.1103/wqrc-z7th · Cited by 6
Hao, Y. (2025) · International Conference on Electronic Information Engineering and Computer Technology (EIECT) · doi:10.1109/eiect68017.2025.11331653
Learning Sequential Measurements Protocols for Quantum Sensing via Reinforcement Learning
Yang, Y. (2025) · International Conference on Electronic Information Engineering and Computer Technology (EIECT) · doi:10.1109/eiect68017.2025.11331835
Quantum Machine Learning Models for Enhancing Big Data Analytics
Prasant, P., Hariharan, R., Sudha, E., Jeshurun, S. B., Radhakrishna, V., & Reddy, P. V. V. (2025) · International Conference on Future Technologies (ICFT) · doi:10.1109/icft66708.2025.11336505 · Cited by 2
Smith, M. L. (2026) · Research Square · doi:10.21203/rs.3.rs-8629227/v1
Mid-Measurement Quantum Reservoir Computing for Time Series Forecasting
Li, Q. (2025) · International Conference on Electronic Information Engineering and Computer Technology (EIECT) · doi:10.1109/eiect68017.2025.11332019
A Review of Formal Methods in Quantum Circuit VerificationPreprint
Govindankutty, A. (2026) · Qeios · doi:10.32388/h7d715.3
Optimization of Approximate Quantum Random Access Memory for NISQ Devices
Sajadimanesh, S., Faye, J. P. L., & Atoofian, E. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00062 · Cited by 1
A Study of the Effects of Quantum Noise on Hybrid Quantum Genetic Algorithm
Acampora, G., Pignataro, M., Riolo, A., et al. (2025) · doi:10.1109/qai63978.2025.00038
A Quantum Circuit Optimization Framework for Distributed Quantum Computing
Liu, F., Liu, F., Fei, Y., Wang, H., Wang, J., Jiang, H., & Ma, Z. (2026) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2026.3656760
Chiatto, A., Colace, F., Massa, A. A., Trezza, G., Troiano, A., Valentino, C., & Zullo, N. C. L. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00046
Characterizing Scaling Trends of Post-Compilation Circuit Resources for NISQ-Era QML Models
Bhattacharjee, R., Escofet, P., Rodrigo, S., Abadal, S., Almudéver, C. G., & Alarcón, E. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00059
Quadratic Continuous Quantum Optimization
Mücke, S., Gerlach, T., & Piatkowski, N. (2025) · doi:10.1109/qai63978.2025.00041
Scalable Quantum Approximate Optimisation with Adaptive Bayesian Dimensionality Reduction
Alizadeh, A., Pourabdollah, A., & Lotfi, A. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00037
Quantum Neuromorphic Classification of EEG Brain Signals
Brand, D., & Jha, R. K. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00022 · Cited by 1
HPC-Accelerated Simulation and Calibration for Silicon Quantum Dots
Nag, D., Johnson, C., Kim, S., & Sumrell, C. (2025) · IEEE International Conference on Collaborative Advances in Software and Computing (CASCON) · doi:10.1109/cascon66301.2025.00105
On the Effect of Local Readout Error Mitigation on Genetic Algorithm-Based QAOA
Acampora, G., Chiatto, A., Schiattarella, R., & Vitiello, A. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00042
Extending Elliptic Curve Cryptography for Quantum Readiness
Abhishek, K. (2025) · IEEE International Conference on Public Key Infrastructure and its Applications (PKIA) · doi:10.1109/pkia67529.2025.11347262
Cross-Platform Benchmarking of Shor's Algorithm for Quantum Cryptanalysis
UbaidurRahman, N. H., Jayavijayan, V., & Rajarajan, M. (2025) · IEEE International Conference on Public Key Infrastructure and its Applications (PKIA) · doi:10.1109/pkia67529.2025.11347220
Divide-Et-Impera Heuristic-Based Randomized Search for the Qubit Routing Problem
Baioletti, M., Fagiolo, F., Oddi, A., & Rasconi, R. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00050
Approximating Ground States of Quantum Hamiltonians with Snapshot-QAOA
Tate, R., Langfitt, Q., Pelofske, E., Kirmani, A. A., Bärtschi, A., Golden, J. K., & Eidenbenz, S. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00035 · Cited by 1
Kernel $k$-Medoids as General Vector Quantization
Gerlach, T., Mücke, S., & Bauckhage, C. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00052
Enhancing Credit Risk Prediction Through Co-Trained Hybrid Quantum Transfer Learning Model
Gopakumar, P., Rubell Marion Lincy, G., Sinno, S., & Thuravakkath, S. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00021
Special-Unitary Parameterization for Trainable Variational Quantum Circuits
Chen, K., Tseng, H.-A., Chen, S. Y.-C., Liu, C.-Y., & Leung, K. K. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00061 · Cited by 1
A quantum neural network with built-in self-attention mechanism
Shi, S., Wang, Z., Li, J. X., Li, Y. N., Shang, R., Zheng, H., Zhong, G., Gu, Y., & Huang, X. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.132862
T-count Reduction Method Based on Proximal Policy Optimization
Xiong, K., Shang, T., Zhang, C., & Liu, Y. (2026) · Communications in computer and information science · doi:10.1007/978-981-95-4791-3_2
Quantum distortion model for running variational quantum algorithms without error corrections
Daskin, A. (2026) · Discover Quantum Science · doi:10.1007/s44464-026-00006-y
Li, Q., Wu, Y. F., Niu, Z., He, X., Gao, W., Peng, W., & Wang, Z. (2026) · IEEE Transactions on Applied Superconductivity · doi:10.1109/tasc.2026.3657682 · Cited by 1
Ultrafast optical spectroscopy with quantum light and quantum control
Fan, J., Deng, X., & Zhang, Z. (2026) · Progress in Quantum Electronics · doi:10.1016/j.pquantelec.2026.100613 · Cited by 1
Quantum-stable robust principal component analysis: theory and evidence from NISQ regimes
Majumdar, A. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00348-x
The adaptive decision-making strategy for surface code decoding
Xia, Z., Wang, S., Yan, Y., & Wang, X. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae3f4e · Cited by 1
PIQS: an efficient quantum subspace method for dynamical property estimation
Wang, Y., Yu, W., Fan, Y., & Zhang, L. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae3f4d
Quantum Diffusion Models for Few-Shot Learning
Wang, R., Wang, Y., Liu, J., & Koike–Akino, T. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-15931-1_4
From NISQ to Scalable Architectures: Challenges and Prospects for Practical Quantum Computing
Galappaththi, K. (2025) · International Conference on Advancements in Computing (ICAC) · doi:10.1109/icac69156.2025.11361428
Towards the Practical Quantum Computing: Object Detection Using Quantum Computing Methods
Upadhyay, A., & Tiwari, B. K. (2025) · International Conference for Advancement in Technology (ICONAT) · doi:10.1109/iconat66879.2025.11362887
Distributed exact generalized Grover’s algorithm
Zhou, X., Xu, X., Zheng, S., & Luo, L. (2026) · Frontiers of Computer Science · doi:10.1007/s11704-025-50239-w · Cited by 6
Mandal, S., & Mukherjee, P. (2026) · bioRxiv · doi:10.64898/2026.01.27.699805 · Cited by 1
Fan, T., Wang, H., & Hodel, T. (2026) · Social Science Computer Review · doi:10.1177/08944393261416783
A Review of Formal Methods in Quantum Circuit VerificationPreprint
Govindankutty, A. (2026) · Qeios · doi:10.32388/h7d715.4
Quantum Frontiers in the Battle for Information Integrity
Loia, V., & Tomasiello, S. (2026) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.70067
Romeike, F., & Wieczorek, G. (2026) · Springer eBooks · doi:10.1007/978-3-658-48843-7_10
A Mixture of Quantum Experts for Multi-task Classifications and Global Generalizability
Bhati, G., Kumar, A., Jain, S., & Dwivedi, R. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-15404-0_23
Robust composite two-qubit gates for silicon-based spin qubits
Yu, Y.-Y., Zhang, G.-H., He, Y.-J., Wu, J., Song, X., & Wang, D. (2026) · Physical Review Applied · doi:10.1103/t8xj-6c5m
Analytical Perspective of Quantum Computing-Based Big Data Security Mechanisms
Kotangale, A., Kumar, M. S., & Bhagat, A. P. (2026) · Lecture notes in networks and systems · doi:10.1007/978-981-96-7526-5_27
Hybrid quantum–classical machine translation
Abbaszadeh, M., Moghadam, M. Z., Sadrzadeh, M., Salari, V., & Kurian, P. (2026) · Quantum Information Processing · doi:10.1007/s11128-025-05032-w
Silva, A., & Fuertes, A. O. (2026) · Review of Scientific Instruments · doi:10.1063/5.0301360 · Cited by 1
Optimal birobust quantum control by inverse optimization
Hezzi, G., Harutyunyan, M., Dridi, G., Mejatty, M., & Guérin, S. (2026) · Physical Review A · doi:10.1103/288v-kg8g
Montes, J., Borondo, F., & Carlo, G. G. (2026) · Physical Review A · doi:10.1103/pwz2-yg3f
Q-Forge: An Efficient Two-Stage Framework for Noise-Aware Quantum Model Training
Nguyen, N.-T., & Thai, H.-T. (2025) · RIVF International Conference on Computing and Communication Technologies (RIVF) · doi:10.1109/rivf68649.2025.11365059
Quantum Mechanics Primer for Non-physicists
Singh, M. S. I., & Rawal, B. S. (2026) · Springer eBooks · doi:10.1007/978-981-95-2498-3_1
Quantum AI Trends and Future Outlook
Singh, M. S. I., & Rawal, B. S. (2026) · Springer eBooks · doi:10.1007/978-981-95-2498-3_19
Spin-Based Simulation and Optimization of Multi-Qubit Quantum Gates
Mokkapati, D. S. N. P. S., Kumar, V. R., De, D., et al. (2025) · International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) · doi:10.1109/icrcicn68210.2025.11364889
Singh, M. S. I., & Rawal, B. S. (2026) · Springer eBooks · doi:10.1007/978-981-95-2498-3_14
A quantum logic gate framework for triosephosphate isomerase: Decoherence-induced toxicity
Romanello, D., & Romanello, A. (2026) · Biosystems · doi:10.1016/j.biosystems.2026.105715 · Cited by 1
K-ADAPT-VQE: Optimizing Molecular Ground State Searches by Chunking Operators
Bespalova, T. A., Ladhari, O., & Masella, G. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-13855-2_20 · Cited by 1
Executing Circuits on Real Devices
Singh, M. S. I., & Rawal, B. S. (2026) · Springer eBooks · doi:10.1007/978-981-95-2498-3_5
Scalable quantum dynamics compilation via quantum machine learning
Zhang, Y., Wiersema, R., Carrasquilla, J., Cincio, Ł., & Kim, Y. B. (2026) · Physical Review Research · doi:10.1103/wswv-nq6d · Cited by 24
Kamble, K. R., Fernandes, J., Bandyan, J., et al. (2025) · IEEE International Conference on Computational Intelligence and Communication Networks (CICN) · doi:10.1109/cicn67655.2025.11367890
Quantum error mitigation via structural encoding with classical error correction codes
Sohn, I., Lee, C., Song, W., Bae, K., & Lee, W. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00474-2 · Cited by 3
Kaldari, J., & Al-Kuwari, S. M. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05069-5 · Cited by 1
Navigating technological and ethical challenges in a post quantum world
Hai, F. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-34193-9.00014-4
Wang, S., & Chattopadhyay, A. (2026) · Computer architecture and design methodologies · doi:10.1007/978-981-95-6039-4_2
Getting ready for a quantum future
Roosan, D. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-34193-9.00015-6 · Cited by 1
Control of Open Quantum Systems via Dynamical Invariants
Cangemi, L. M., Espinós, H., Puebla, R., Torrontegui, E., & Levy, A. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.202500798 · Cited by 5
An Interactive Bloch Sphere with MQTT API
Liao, Y.-P., Huang, S.-Y., Chen, H., et al. (2025) · International Conference on Control, Mechatronics and Automation (ICCMA) · doi:10.1109/iccma67641.2025.11369561
A universal theory of high-accuracy surface modeling and its quantum intelligent computing methods
Yue, T., Wu, C., Zhao, N., Liu, Y., Wang, Y., Du, Z., Shi, W., & Fan, Z. (2026) · Chinese Science Bulletin (Chinese Version) · doi:10.1360/csb-2025-5716
Distributed Kuperberg’s algorithm
Yang, P.-Y., Zhang, X., & Lin, S. (2025) · Chinese Physics B · doi:10.1088/1674-1056/adfb58 · Cited by 1
Experimental demonstration of entanglement forging for solving Max-Cut problem
Wang, T., Wu, Z., 陈, Y. 昱. C., Hou, Y., Li, Z., & Peng, X. (2026) · Physical Review Research · doi:10.1103/kk9v-5jk8
Phase-Encoded Semantic Relationships: Noise-Robust Quantum Natural Language ProcessingPreprint
Kannan, P., & Sundaram, V. M. (2026) · Research Square · doi:10.21203/rs.3.rs-8765443/v1
A Review of Formal Methods in Quantum Circuit VerificationPreprint
Govindankutty, A. (2026) · Qeios · doi:10.32388/h7d715.5
Engineering the Quantum Future: Impact of Electrical Engineering in the Field of Quantum Mechanics
Kaza, S. V. M., & Beg, O. A. (2026) · World Journal of Engineering and Technology · doi:10.4236/wjet.2026.141012
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.