Quantum Computing in the NISQ era and beyond
Open accessThe DOI matches its Crossref record; 75 of the 82 references it cites were found in a registry or an index; 25 of the 40 sources its claims cite were checked for support.
Abstract
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away - we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing.
Overview
CoChat Summary
TL;DR
Preskill introduces the NISQ era—noisy intermediate-scale quantum devices with 50–100 qubits—as a near-term step toward quantum computing, useful for exploring many-body quantum physics but limited by noise and not expected to change the world by itself. He argues that fault-tolerant quantum computing remains distant and that near-term applications, especially hybrid quantum-classical algorithms, are promising but unproven.
Key findings
- NISQ devices will have 50 to a few hundred qubits; 50 qubits is a milestone because it is beyond brute-force simulation by the most powerful existing digital supercomputers. However, with two-qubit gate error rates above 0.1%, circuits with many more than about 1000 gates are not expected to be reliable.
- NISQ technology may be useful for exploring many-body quantum physics and quantum dynamics, and hybrid quantum-classical algorithms such as QAOA and VQE may find approximate solutions to optimization problems, but whether they outperform classical methods is an open question.
- Quantum algorithms offer speedups for problems such as factoring, matrix inversion (HHL runs in O(log N)), recommendation systems (O(poly(k)polylog(mn))), and semidefinite programming (polylog(N)), but many require error correction or QRAM and are probably not feasible in the NISQ era. A note added states that Tang’s quantum-inspired classical algorithm removes the exponential speedup claimed for quantum recommendation systems.
- Fault-tolerant quantum computing is still distant: running algorithms with thousands of protected qubits will require millions of physical qubits, so NISQ should be regarded as a step toward more powerful future quantum technologies.
Methods
- This is a conceptual review and keynote address, based on a Keynote Address at Quantum Computing for Business, 5 December 2017; it is not an empirical study.
- The paper assesses the current status and future potential of quantum computing, discussing hardware platforms, gate errors, qubit counts, quantum algorithms, and fault-tolerance requirements.
- The main analysis is a qualitative synthesis of theoretical arguments, experimental examples, and open questions; no dataset, sample, or statistical analysis is reported.
Limitations
- The paper states it is “the result of an uneasy compromise,” minimizes jargon and technical details for a broader audience, and does not attempt a comprehensive list of references.
- The paper states that NISQ devices have imperfect control and noise, that gate error rates are above 0.1% and may not be maintained in larger devices, that circuit size is limited to roughly 1000 gates, and that validating quantum outputs may be hard.
- Evident from the text: as a keynote-style review, it offers projections and opinions rather than new experimental data or a systematic review; several speedup claims are explicitly open questions, and the recommendation-systems speedup is later undercut by a quantum-inspired classical algorithm.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
14 Valid · 9 Not valid · 10 Not checked · 85 Own results and interpretations
Some cited sources support this claim and some don’t — read each source’s verdict below.
In the paper
“50 qubits is a significant milestone, because that's beyond what can be simulated by brute force using the most powerful existing digital supercomputers.”
What the sources say
- Supportedcites [11] [11] S. Boixo, S. V. Isakov, V. N. Smelyansky, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, Characterizing quantum supremacy in near-term devices, Nature Physics 14, 595-600 (2018), arXiv:1608.00263 (2016), https://doi.org/10.1038/s41567-018-0124-x. - source
The Introduction (p. 1) says that even modest-depth circuits acting on approximately fifty qubits cannot be directly simulated in practice. The Conclusion (p. 12) estimates that state-of-the-art supercomputers fail to simulate universal random circuits beyond approximately 48 qubits at a depth of about 40. The milestone claim is supported in that circuit context. (LLM, conf=0.90)
- Disputedcites [12] [12] S. Aaronson and L. Chen, Complexity-theoretic foundations of quantum supremacy experiments, arXiv:1612.05903 (2017). - sourceExperimental — accuracy not yet measured
Section 1.2 (p. 4) describes 40–50 qubits as a range where classical simulation is difficult but not impossible, contrary to the claim that 50 qubits is beyond brute-force simulation. Section 1.3 (p. 7) also describes a classical simulation method and says its 2^n time is reasonable for a planned setup with roughly 40 or 50 qubits. (LLM, conf=0.86)
Checked by a reasoning model — may be wrong.
- Supportedcites [13] [13] E. Pednault, J. A. Gunnels, G. Nannicini, L. Horesh, T. Magerlein, E. Solomonik, and R. Wisnieff, Breaking the 49-qubit barrier in the simulation of quantum circuits, arXiv:1710.05867 (2017). - source
The Abstract (p. 1) frames systems of more than 50 qubits as the coming regime and states that 'resource requirements for such calculations on classical computers grow exponentially', with the relevant calculations 'thought to be impossible due to resource requirements'. Section 2.1 (p. 3) gives the concrete brute-force bound: the full state of a 49-qubit system needs 2^49 complex numbers (8 PB in double precision), which 'eliminates the possibility of keeping the entire state in primary storage', and the Feynman-path alternative 'grows to intractable levels very quickly'. The Introduction (p. 2) reinforces this by noting that the state-of-the-art full-state techniques of the time would have required 8 PB (49 qubits) and 1 EB (56 qubits), far beyond the ~64 TB aggregate RAM of Vulcan/Sequoia-class machines. The citing sentence's 'brute force' qualifier matches the paper's own contrast with tensor-contraction-deferral methods, so the attribution holds; only the rhetorical label 'significant milestone' is the citing authors' framing. (LLM, conf=0.83)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“Eventually we expect to be able to protect quantum systems and scale up quantum computers using the principle of quantum error correction [10].”
What the sources say
- Supportedcites [10] [10] D. Gottesman, An introduction to quantum error correction and fault-tolerant quantum computation, Proceedings of Symposia in Applied Matthematics 68 (2010), arXiv:0904.2557. - source
The Background (p. 1) says quantum computers need protection from noise and identifies error correction as necessary. Fault-tolerant gates (p. 17) explains that, below an error-rate threshold, arbitrarily accurate quantum computation is possible with polylogarithmic overhead. This supports the expectation of protecting quantum systems and scaling up quantum computers, subject to that threshold. (LLM, conf=0.91)
hedgedstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“as of now we don't have a convincing theoretical argument or persuasive experimental evidence indicating that quantum annealers can really speed up the time to solution compared to the best classical hardware running the best algorithms for the same problems [28, 29].”
What the sources say
- Partly supportedcites [28] [28] T. F. Rønnow, Z. Wang, J. Job, S. Boixo, S. V. Isakov, D. Wecker, J. M. Martinis, D. A. Lidar, and M. Troyer, Defining and detecting quantum speedup, Science 345, 420-424 (2014), https://doi.org/10.1126/science.1252319. - sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
- Partly supportedcites [29] [29] S. Mandrà, H. G. Katzgraber, and C. Thomas, The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again), Quantum Sci. Technol. 2, 038501 (2017), arXiv:1703.00622, https://doi.org/10.1088/2058-9565/aa7877. - sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“In particular, the task of matrix inversion admits an exponential quantum speedup, which could have many applications.”
What the sources say
- Supportedcites [40] [40] A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009), arXiv:0811.3171, https://doi.org/10.1103/PhysRevLett.103.150502. - source
The paper’s Outline says its hardness results imply that the algorithm runs exponentially faster than any classical algorithm for the matrix-inversion task. The performance discussion qualifies this speedup: it is greatest when the condition number and inverse accuracy are polylogarithmic in matrix size, and the algorithm outputs a quantum representation rather than every component of the solution. (LLM, conf=0.92)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“As Laughlin and Pines [8] emphasized in the statement I quoted earlier, we think that simulating such 'strongly correlated' matter is a difficult computational problem, because many very good physicists have tried to solve it for decades and have not succeeded.”
What the sources say
- Supportedcites [8] [8] R. B. Laughlin and D. Pines, The theory of everything, PNAS 97, 28-31 (2000), https://doi.org/10.1073/pnas.97.1.28. - source
In the paper’s main text (page not supplied), Laughlin and Pines say accurate solutions become infeasible for more than about 10 particles because the computational requirements grow rapidly. They also describe notorious failures of approximate calculations for high-temperature superconductors, supporting the claim that simulating such matter is difficult. (LLM, conf=0.90)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
37 more claims · 4 with their cited sources checked
Create a free account to see all 118 claims and to verify the 5 references still open.
- It may state two separate claims as one. 26
- Probably not a substantial claim. 63
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source doesn’t support the claim as written.
In the citing paper
“so-called Noisy Intermediate-Scale Quantum (NISQ) computers already exist today”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [209]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Furthermore, they are challenging to make extensible as required to surpass noisy intermediate-scale quantum (NISQ)-era scales [221] and thereby enable practically relevant quantum computation.”
From 2022 Roadmap on integrated quantum photonics (2022) · cites this paper as [221]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Therefore, research on quantum algorithms splits, on the one hand, into algorithms for fault-tolerant quantum computers, which we may think of as a future perfect quantum computer, and, on the other hand, into algorithms for nearterm or noisy-intermediate stage quantum (NISQ) [120] devices of dozens to thousands of physical qubits, that are characterized by the absence of complete fault-tolerance.”
From Quantum Computing for Molecular Biology** (2023) · cites this paper as [120]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations within a limited coherence time.”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Preskill, 2018
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These hybrid quantum-classical algorithms are specifically designed to minimize the limitations of current quantum hardware, such as decoherence and gate errors, by delegating some computational tasks to classical processors. [8]”
From Limitations of Quantum Hardware for Molecular Energy Estimation Using VQE (2026) · cites this paper as [8]
Experimental — accuracy not yet measured
10 more claims about this paper
Create a free account to see every claim other papers make about this one.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 2 Opportunities at the entanglement frontier · p. 2
“We don't think that's not true for classical ( i.e. , nonquantum) digital computers”
§ 2 Opportunities at the entanglement frontier · p. 2
“which (as far as we know) can't simulate highly entangled quantum systems.”
Citations
Cites
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 1×
“to be hard for classical computers, but for which quantum algorithmshavebeendiscoveredthatcouldsolvetheseproblemseasily. Thebestknown exampleistheproblemoffindingtheprimefactorsofalargecompositeinteger[1]. Webelievefactoringishardbecausemanysmartpeoplehavetriedformanydecades to find better factoring algorithms and haven…”
BackgroundBiamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779 · cited 1×
“” Much of the literature on the subject builds on quantum algorithms that speed up linear algebra and related tasks [37, 38], and I’ll address such applications in the ensuing subsections.”
BackgroundA variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Degen, C. L., Reinhard, F., & Cappellaro, P. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.035002 · Cited by 4,045 · cited 1×
“antum sensing. Quantum technology has advantages for some kinds of sensing. Quantum systems can sense weak forces with better sensitivity and higher spatial resolution than other sensing technologies [19]; thus quantum sensing could have relatively near-term high-impact applications, to medicine for example. Quantum c…”
BackgroundPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 1×
“6.6 Quantummatrixinversion QRAMhasfurtherimplicationsforquantumalgorithms. Inparticular,thetaskofmatrix inversionadmitsanexponentialquantumspeedup,whichcouldhavemanyapplications. ThealgorithmwecallHHL[40](afterthethreeauthorswhofirstdiscusseditnineyears ago) takes as input a succinct representation of a very large N×N…”
BackgroundInfluentialSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“for a while, because of the large number of physical qubits needed. To run algorithms involving thousands of protected qubits we’ll need a number of physical qubits which is in the millions, or more [50]. That’s a very large leap from where we will be for the next few years, with of order a hundred qubits. Crossing th…”
BackgroundProbing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460 · cited 1×
“Analog quantum simulators have been getting notably more sophisticated, and are already being employed to study quantum dynamics in regimes which may be beyond the reach of classical simulators [51, 52].”
Background
Cited by
Items 8,401–8,500 of 8,640
O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling
Zhu, C., Wu, X., Chen, J., He, K., Wu, J., Wang, X., & Lao, L. (2026) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca66397.2026.00149 · Cited by 7
Decomposição em Produto de Kronecker para Compilação Quântica
Azevedo, T. M. D., Langeloh, G. M., Brito, S., et al. (2026) · doi:10.5753/sbccq.2026.23567
Salcedo-Reyes, J. C., & Rodríguez, G. A. G. (2025) · Revista Ciberespacio Tecnología e Innovación · doi:10.25062/2955-0270.5014
Chen, J., Zhu, C., Bai, G., & Wang, X. (2026) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca66397.2026.00069 · Cited by 3
Liu, S., Elahi, P. J., & Varatto, U. (2026) · IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW) · doi:10.1109/icdcsw72724.2026.00043
Mondal, D., Patra, A. K., & Maitra, R. (2026) · Chemical Science · doi:10.1039/d6sc03132c · Cited by 2
Enhancing quantum classification with custom feature maps in variational quantum classifiers
Verma, P., & Vishwakarma, D. K. (2026) · Applied Soft Computing · doi:10.1016/j.asoc.2026.116164
Trustworthy Neuromorphic and Quantum Machine Learning: Challenges and Emerging Directions
Marchisio, A., & Shafique, M. (2026) · IEEE International Symposium on On-Line Testing and Robust System Design (IOLTS) · doi:10.1109/iolts69666.2026.11633693
Salem, M., Pontes, D., Böhm, L., dos Reis, H., Ono, K. S., & Ferrugem, A. P. (2026) · Simpósio Brasileiro de Computação e Comunicação Quânticas (SBCCQ) · doi:10.5753/sbccq.2026.23307
Przygocki, M., Kotas, R., & Zubert, M. (2026) · International Conference Mixed Design of Integrated Circuits and Systems · doi:10.23919/mixdes69535.2026.11617244
Quantum State Preparation for Classical Data Encoding
Lisboa, M. A., Brasil, V. H. F., Duarte, J. V. H., & Souza, L. C. (2026) · Simpósio Brasileiro de Computação e Comunicação Quânticas (SBCCQ) · doi:10.5753/sbccq.2026.20984
QCLink: Offloading Hybrid Quantum-Classical Computation to SmartNICs via RDMA
Li, X., Lu, Y., Liu, Z., Yue, X., Chen, J., Peng, Y., Li, T., Li, Z., Zhao, Z., & Yin, J. (2026) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/2575-8411.2026.00013 · Cited by 2
Fundamental limits on polarization entanglement distribution in optical fiber
Pirandola, S. (2026) · Physical Review Research · doi:10.1103/xqrp-xrby · Cited by 1
CARL: Crosstalk-Aware Quantum Compilation Based on Reinforcement Learning
Zhang, X., Liu, Y., Mao, Y., Xu, X., & Yang, Y. (2026) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/2575-8411.2026.00043
An Overview of the Latest Quantum Technologies and Their Accessibility for Science
Duniec, P., Zubert, M., & Hałagan, K. (2026) · International Conference on Mixed Design of Integrated Circuits and Systems (MIXDES) · doi:10.23919/mixdes69535.2026.11617222
A Streaming Architecture for Quantum Error Syndrome Compression at 4 Kelvin
Papanikolaou, P., Hou, R., Volk, J. E., & Tzimpragos, G. (2026) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca66397.2026.00071 · Cited by 2
An entangling gate for dual-rail erasure qubits
Mehta, N., Teoh, J. D., Noh, T., Agrawal, A., Anderson, A., Birdsall, B., Brahmbhatt, A., Byrd, W., Cabrera, A., Cacioppo, M., et al. (2026) · Nature · doi:10.1038/s41586-026-10822-y · Cited by 4
Bonança, M. V. S., Deffner, S., & Ingold, G. (2026) · Brazilian Journal of Physics · doi:10.1007/s13538-026-02127-2 · Cited by 1
Hoyt, A. C., Wang, M., Jin, Y., Wu, C., Liu, C., Zheng, M., Stein, S. R., Rebar, D. J., Ding, Y., Humble, T. S., et al. (2026) · ACM Transactions on Quantum Computing · doi:10.1145/3837861
Hybrid HPC and Quantum Computing Framework for Multiscale Modeling of Chemical Systems
Thacker, J. C. R., Meller, M., Popescu, A., Patterson, A., Izsák, R., Szeremi, V., & Keal, T. W. (2026) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.6c00542 · Cited by 1
Hybrid artificial intelligence and quantum annealing as an optimization layer in drug discovery
Ou, C., Liao, J.-C., Huang, C., & Lee, O. K. (2026) · Patterns · doi:10.1016/j.patter.2026.101634
A comprehensive survey of quantum computing approaches for portfolio optimization in FinTech
Chiv, K., Nayyar, A., & Kim, T.-K. (2026) · ICT Express · doi:10.1016/j.icte.2026.07.025
Entropy density benchmarking of near-term quantum circuits
Anonymous, Mills, J. K., Hammam, K., & García−Patrón, R. (2026) · Physical Review A · doi:10.1103/swvt-3pkh · Cited by 5
Schworm, P., Gayer, J., Wagner, M., et al. (2026) · Manufacturing Letters · doi:10.1016/j.mfglet.2026.08.041
Quantum Attention Mechanisms: Architectures, Measurement Overhead, and Empirical Evidence
Sithamparanathan, L., & Kumar, S. (2026) · IEEE Access · doi:10.1109/access.2026.3721090
Quantum Genetic Algorithm with Dynamic Encoding Scheme
Kim, J. S., Kim, M.-J., & Ahn, C. W. (2026) · Informatica · doi:10.15388/26-infor639
Ventocilla, J. L. R., Alvarado, R. P., Huamaní, J., Milla, E. C., & Esquivel, J. L. A. (2026) · IEEE Access · doi:10.1109/access.2026.3721134
Hassan, T. (2026) · APL Quantum · doi:10.1063/5.0328310
On Representation Smoothness for Robust Architecture Discovery of Variational Quantum Circuits
Zorn, M., Stein, J., Altmann, P. J., Stenzel, G., Rohe, T., & Linnhoff–Popien, C. (2026) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3770855.3818199
Forecasting low-dimensional turbulence via multi-dimensional hybrid quantum reservoir computing
Salatino, L., Mariani, L., Giordano, A., D’Amore, F., Mastroianni, C., Pontieri, L., Vinci, A., Gencarelli, C. N., Primavera, L., Plastina, F., et al. (2026) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0334540 · Cited by 6
Sampled-detuning optimal control for robust entanglement generation in dipole-coupled atoms
Fan, L., & Guo, Y. (2026) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/ae965c
Kannan, V. S., Pavan, B. V. V. S. R. K. K., Athiraja, A., & Babu, B. (2026) · Evolutionary Intelligence · doi:10.1007/s12065-026-01240-0
Halving the arbitrary rotation cost of controlled, Trotterized time evolution
Anonymous, & Love, P. J. (2026) · Physical Review A · doi:10.1103/h9gv-ml7w · Cited by 3
Pradhan, U., Ray, S., Aditya, M. N., & Anand, V. (2026) · Springer eBooks · doi:10.1007/978-3-032-26858-7_19
Adhars, M., Deepashree, M., Ashwin, R., & Hamithra Jothi, D. (2026) · IEEE Global Symposium on Emerging and Communication Technologies (GSEACT) · doi:10.1109/gseact68539.2026.11619972
Rahman, R., & Nguyen, D. C. (2026) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2026.3721807 · Cited by 2
Yang, C. (2026) · International Journal of Quantum Chemistry · doi:10.1002/qua.70271 · Cited by 2
Özkurt, C., DUZCAN, B., OZENC, S., & Uzun, S. (2026) · Mathematics · doi:10.3390/math14162865
Quantum Tunneling Inspired Probabilistic Filter for Deep Learning Models
Mirza, S., Sharma, A. K., Anand, K., & Nassrullah, M. T. N. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-27669-8_23
Quantum Technologies as a Driver of Future Industrial Policy
Narin, K. T., & Öz, S. (2026) · Industrial Policy · doi:10.61192/indpol.1829442
QCutSim: Accelerating Quantum Circuit Cutting Simulation on Consumer-Grade Classical Systems
Huang, P.-H., Tai, C.-Y., Tu, C.-H., & Hung, S. (2026) · ACM Transactions on Design Automation of Electronic Systems · doi:10.1145/3833423
Thompson, D., Mitchell, S., Adams, R., & Brown, J. (2025) · Pharmacophore · doi:10.51847/d59nkxqobj
Quantum-enhanced multi-echelon inventory control
Mayaluri, Z. L., & Mishra, S. (2026) · Journal of Simulation · doi:10.1080/17477778.2026.2706030 · Cited by 1
Akhatov, A., Ruzikulovich, T. M., Kuvandikov, J., et al. (2026) · Future Internet · doi:10.3390/fi18080422
Bhatt, A., Bhosale, N. P., & Mehan, V. (2026) · Research Square · doi:10.21203/rs.3.rs-10565365/v1
High-dimensional data-driven simulation for multiphysics problems with quantum computing
Li, L., Xu, Y., Liu, Z., Huang, Q., Yang, J., & Hu, H. (2026) · International Journal of Mechanical Sciences · doi:10.1016/j.ijmecsci.2026.111980
Practical limitations on Hamiltonian simulation using quantum processors
Sadhu, A., Dey, M., & Ghosh, D. (2026) · Electronic Structure · doi:10.1088/2516-1075/ae97a8
Quantum‐Enhanced Genetic Algorithm for Quantum Neural Network Optimization
Chen, K., Wei, Y., & Yan, F. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70394
Divakaran, H., Mani, G., Mangipudi, V. V., Patel, S. P., Soni, S., Mangalagowri, R., & Subramani, C. (2026) · 2026 International Conference on Data Science and Business Systems (ICDSBS) · doi:10.1109/icdsbs69077.2026.11634835
Balasubramaniam, A., Surendiran, B., Cheng, X., & Mohanty, S. N. (2026) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2026.1862834
EDM4QS: An Emulator-Driven Model for Quantum Scheduling
Nguyen, T., Chung, M. T., Diep, T.-D., et al. (2026) · Communications in computer and information science · doi:10.1007/978-981-92-2587-3_13
Wang, P., Lu, B.-H., Wang, T.-L., Zhang, S., Chen, Z.-Y., Zhang, H.-F., Zhao, R.-Z., Yang, X.-Y., Zhao, Z.-Y., Zhang, Z.-Z., et al. (2025) · Physical Review Letters · doi:10.1103/zywf-twfv
Gluhovic, J. (2026) · American Journal of Computer Science and Technology · doi:10.11648/j.ajcst.20260903.11
Introduction to Quantum Information Science
Kantsepolsky, B., & Topor, L. (2026) · Springer eBooks · doi:10.1007/978-3-032-26223-3_7
Circumventing query complexity barriers in learning quantum dynamics via physics-informed kernels
Wang, Y., & Zhang, L. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae98ec
Deepika, S., & Jeyanthi, N. (2026) · Frontiers in Physics · doi:10.3389/fphy.2026.1878327
Edwin, S., Padhi, P., Thalaimalaichamy, M., & Madhawa, S. (2026) · International Conference on Electronics, Computing, Communication and Control Technology (ICECCC) · doi:10.1109/iceccc70334.2026.11633013
Penalty Sensitivity in Quantum Optimisation Across Computational Paradigms: A Benchmark Study
Liu, J., & Moraglio, A. (2026) · GECCO Companion · doi:10.1145/3795101.3814661
Lakshman, V., Wijayakulasooriya, J., & Yatigammana, T. M. S. S. K. (2026) · Cureus Journal of Computer Science. · doi:10.7759/s44389-026-00222-8
Tiwari, G., & Owais, M. (2026) · Studies in big data · doi:10.1007/978-3-032-29599-6_4
Vertical Quantum Federated Learning
Ballester, R., Blum, C., Cerquides, J., & Artiles, L. (2025) · International Conference on Intelligent Computing and Its Emerging Applications (ICEA) · doi:10.1145/3803817.3803821
Hybrid Quantum-Classical Layer-7 Traffic Classification: Methodology and Evaluation
Mainardi, S., Bansal, K., & Singh, P. (2026) · Silicon Valley Cybersecurity Conference (SVCC) · doi:10.1109/svcc69905.2026.11642303
Trade-off Between Complexity and Energy in Quantum Phase Estimation
Anonymous, Guţǎ, M., & Adesso, G. (2026) · PRX Energy · doi:10.1103/zlhs-7m9m · Cited by 1
Yu, S. (2026) · International Journal of Theoretical Physics · doi:10.1007/s10773-026-06433-y
Luo, W., Lin, X., Zeng, Q., & Zheng, Y. (2026) · International Conference on Artificial Intelligence and Electromechanical Automation (AIEA) · doi:10.1109/aiea70743.2026.11632704
Hierarchical Parallel Computing for Optimal Qubit Mapping in NISQ Systems
Valois, J.-P., Helbecque, G., & Melab, N. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-35248-4_37
Ghosh, S., Kundu, A., Mithaguru, & Vegi Fernando, A. (2026) · International Conference on Intelligent and Sustainable AI Systems (ICOSAAS) · doi:10.1109/icosaas68663.2026.11648877
Roadmap for quantum agriculture: Challenges and future directions
Kaur, G., Sandhu, R., Kaur, A., & Ghai, D. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-44247-6.00004-x
Pixel-Translation-Equivariant Quantum Convolutional Neural Networks via Fourier MultiplexersPreprint
Chirkov, D., & Lobanov, I. S. (2026) · Research Square · doi:10.21203/rs.3.rs-10574918/v1
Hybrid Quantum-Classical Deep Learning Model for Global Cotton Yield Forecasting
Purohit, P., & Janrao, P. (2026) · Journal of Trends in Computer Science and Smart Technology · doi:10.36548/jtcsst.2026.3.019
Realizing scalable conditional operations through auxiliary energy levels
Zhang, S., Duan, P., Wang, Y.-J., Wang, T.-L., Wang, P., Zhao, R.-Z., Yang, X., Zhao, Z.-A., Zhang, H.-F., Li, Z. P., et al. (2026) · Science China Information Sciences · doi:10.1007/s11432-025-4760-9 · Cited by 2
Quantum image processing filters based on FRQI representation
Shayegan, A. H. S. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05321-y
Quantum machine learning in diabetes and metabolism: Applications and translational challenges
Riente, A., Serantoni, C., Giulio, M. M. D., Capezzone, S., Esposito, R., Spirito, M. D., & Maulucci, G. (2026) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2026.109609
Chandrakanth, P., & Venugopal, K. (2026) · IEEE Guwahati Subsection Conference (GCON) · doi:10.1109/gcon69192.2026.11648316
Anonymous, Elahi, P. J., Varetto, U., He, K., Hou, J., & Liu, S. (2026) · Physical Review Applied · doi:10.1103/1hwv-bmqs · Cited by 3
Design and Implementation of NISQ-Compatible Quantum Machine Learning Models for Hardware Security
Kalyan, B. S., & Shahi, A. (2026) · IEEE Guwahati Subsection Conference (GCON) · doi:10.1109/gcon69192.2026.11649049
Ravichandran, A. R., Narayanan, B., Posenau, C., et al. (2026) · doi:10.1109/smacd70206.2026.11647822
Predictive Product Design—Using Digital Twins for Prototype Simulation and Innovation
Anitha, G. (2026) · Emerald Group Publishing Limited eBooks · doi:10.1108/978-1-80686-859-920261007
Anonymous, & Tang, H.-K. (2026) · APS Open Science · doi:10.1103/4tft-d7gf
Keta, O. D., Chatzipapas, K., & Dordevic, M. (2026) · Applied Sciences · doi:10.3390/app16168158
Alzboun, B. M., & Abed-alguni, B. H. (2026) · Information Sciences · doi:10.1016/j.ins.2026.124009
Hangun, B., Altun, O., Eyecioğlu, Ö., Kayışlı, K., & Beken, M. (2026) · International Conference on Cybersecurity, Digital Forensics, and AI Applications (ICCSDFAI) · doi:10.1109/iccsdfai70505.2026.11647992
Quantum-inspired cyber threat detection via entanglement-based feature fusion
Hemalatha, S. (2026) · ARPN Journal of Engineering and Applied Sciences · doi:10.59018/042656
Hybrid Classical-Quantum Systems: The Unsung Heroes of the NISQ EraPreprint
Amiri, S. M. H., & Zahan, A. (2026) · SSRN Electronic Journal · doi:10.20944/preprints202608.1044.v1
Boschero, J. C., Oancea, R. A., Mazzarella, L., Doeleman, H. M., & Cramer, S. (2026) · Entropy · doi:10.3390/e28080924
Automated design of photonic two-qubit quantum gates and circuits via optimization and pruning
Anonymous, & Vala, J. (2026) · APS Open Science · doi:10.1103/xjrz-csmx
Quantum random walk path planning with coherent feasibility marking
Yu, W., Li, J., Wang, Y., Zhang, Y., Li, R., Yin, C., & Chen, Y. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae9bf2
Hybrid Quantum-Classical Complex-Valued Classifier: A Statevector-Based Approach
Akinola, T. A., Li, X., & Qian, L. (2026) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw71298.2026.00155
Lie-algebra-assisted quantum simulation and quantum optimal control via high-order Magnus expansions
dos Santos, R. F., & Kokkelmans, S. (2025) · Physical Review A · doi:10.1103/jmrn-t4jw
Scavuzzo, L., Boschero, J. C., Doornweerd, J. E., Vandenplas, J., Cramer, S., Aguilera, E. P., & Pook, T. (2026) · Smart Agricultural Technology · doi:10.1016/j.atech.2026.102498
A general framework for differentially private quantum measurements
Angrisani, A., Doosti, M., & Kashefi, E. (2026) · ACM Transactions on Quantum Computing · doi:10.1145/3842143 · Cited by 25
Sheikh, S. M., Peshwe, P. D., & Naik, B. V. (2026) · National Academy Science Letters · doi:10.1007/s40009-026-02422-1
BO-QGAN+: A Hybrid Quantum Classical GAN for Drug Molecule Generation on ZINC-250K
Bani, O. E., Kissi, C., & Srifi, M. N. (2026) · IEEE International Conference on Circuits and Systems for Communications · doi:10.1109/iccsc71566.2026.11650504
Entangling power and fidelity diagnostics for bipartite quantum channels
Rudziński, M., Tartaglione, G., & Życzkowski, K. (2026) · Physical Review A · doi:10.1103/gkc7-tkbq · Cited by 2
High-fidelity control of superconducting qubits with an optically transmitted signal
Anonymous, Fan, D., Li, N., Chen, F., Li, S., Li, D., Xu, Y., Lin, J., Gong, M., Huang, H.-L., et al. (2026) · Physical Review A · doi:10.1103/m1wg-synr
A Mixture of Experts Vision Transformer for High-Fidelity Surface Code Decoding
Viet, N. H., Hùng, N. M., Ta, H., Vu, V. K., & Chee, Y. M. (2026) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit62367.2026.11653737 · Cited by 2
Noise-robust one-copy distillation protocol for all distillable Bell-diagonal qutrits
Anonymous, Popp, C., & Hiesmayr, B. C. (2026) · Physical Review A · doi:10.1103/bgdw-3bln
AdaReQ: An Adaptive Reuploading Quantum Model for Resource-Efficient Cybersecurity Threat Detection
Zahar, A., Aidi, M. E., Elassad, Z. E. A., Meslouhi, O. E., & Khennou, F. (2026) · Applied Artificial Intelligence · doi:10.1080/08839514.2026.2721305
Error-Correction Transitions in Finite-Depth Quantum Channels
Anonymous, Lami, G., Ribeiro, P., Luca, A. D., & Nardis, J. D. (2026) · Physical Review Letters · doi:10.1103/drwg-dgb7 · Cited by 2
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.