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,001–8,100 of 8,640
Caballero, E. I. J., Tapia‐McClung, H., & Mezura‐Montes, E. (2026) · Mathematical and Computational Applications · doi:10.3390/mca31030078
Kulkarni, V. R., Lee, J. C., Hutchings, A., Albahri, A., Nana, J., Xu, S., & Chaudhary, V. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00125 · Cited by 2
A Distributed Quantum Neural Network for Network Anomaly Detection
Hdaib, M., Rajasegarar, S., & Loke, S. W. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00109
Federated Quantum Kernel Learning for Decentralized Anomaly Detection in Zero Trust Edge Networks
Xu, S., & Qian, Y. (2026) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc69040.2026.00161
Quantum feature analysis in double qubit–cavity coupling system under dephasing
Hassan, T., Ali, S. I., Mesmouli, M. B., Zaidi, H. N., & Ramadan, R. Α. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae6a48 · Cited by 1
Ahsan, M. (2026) · ACM Transactions on Quantum Computing · doi:10.1145/3815786
Burgholzer, L., & Wille, R. (2026) · Springer eBooks · doi:10.1007/978-3-032-06770-8_19
Quantum Simulation Tools: A Comprehensive Survey
Devani, Z., Kanudawala, Z., Thakar, R., Padh, C., & Trivedi, H. (2026) · Studies in computational intelligence · doi:10.1007/978-981-95-6276-3_7 · Cited by 2
Hybrid facial expression analysis model using quantum edge-aware landmark correction
Rengasamy, K., Joshi, P., & Raveendra, V. V. S. (2026) · The Journal of Supercomputing · doi:10.1007/s11227-026-08565-8
Quantum circuit evolutionary framework applied to the set partitioning problem
Fernandez, B. O., Bloot, R., & Moret, M. A. (2026) · The Journal of Supercomputing · doi:10.1007/s11227-026-08511-8 · Cited by 1
Experimental qudit-assisted quantum operations by dimension expansion and partial measurement
Chi, Y., Pan, C., Lu, X. P., Zhu, Y., & Wang, F. (2026) · APL Photonics · doi:10.1063/5.0309870 · Cited by 1
A novel quantum-enhanced sentiment analysis for financial news classification
Bhangu, K. S., Sehra, S. S., & Singh, J. (2026) · Expert Systems with Applications · doi:10.1016/j.eswa.2026.132841
A Hybrid Classical-Quantum Annealing Algorithm for the TSP
Hu, S., Lopata, V., Sinno, S., Thuravakkath, S., & Zuliani, P. (2026) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3795101.3814699
Quantum-classical computational framework for many-fermion response and structure
Du, W., Yang, Y., Liu, Z., Yang, C., & Vary, J. P. (2026) · Physics Letters B · doi:10.1016/j.physletb.2026.140538 · Cited by 3
Decoherence uncertainty by entropic and thermodynamic bounds in non-unitary quantum channels
Sihare, S. R. (2026) · Quantum Studies Mathematics and Foundations · doi:10.1007/s40509-026-00399-6
Kaliappan, T., Ratnaparkhi, P., Raj, R., Pujari, M., & Abhinav, V. S. (2026) · European Journal of Educational Research · doi:10.12973/eu-jer.15.3.979 · Cited by 1
Alimohammadi, Z., Mohammadzadeh, N., Seyedi, S., & Abdoli, H. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00519-6
Quantum-Hybrid Neural Networks for Continuous Time Series
Habiba, M., Pearlmutter, B. A., & Maleki, M. (2026) · Springer eBooks · doi:10.1007/978-3-032-18022-3_7
Mayaluri, Z. L., & Ganapati, P. (2026) · Cureus Journal of Computer Science. · doi:10.7759/s44389-025-00066-8 · Cited by 1
Logarithmic growth of operator entanglement in a clean nonintegrable circuit
Tan, M. T., & Prosen, T. (2026) · Physical review. B./Physical review. B · doi:10.1103/sqyj-5spd · Cited by 4
Full-phase distributed quantum differential cryptanalysis and its variants on block ciphers
Shang, T., Zhang, K., & Zhang, Y. (2026) · Designs Codes and Cryptography · doi:10.1007/s10623-026-01814-0
QPing: A Quantum Ping Primitive for Quantum Networks
Miguel-Ramiro, J., Illiano, J., Mazza, F., et al. (2026) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2026.3693981
Q-ST: A Comprehensive Review of Quantum Software and Toolchains, Ecosystems, and Technologies
Hassan, S., & Giri, K. J. (2026) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-026-10615-6
A Distributed Variational Quantum Eigensolver Algorithm for Unit Commitment
Hasanzadeh, M., Rajabi, A., & Kargarian, A. (2026) · 2026 IEEE Texas Power and Energy Conference (TPEC) · doi:10.1109/tpec67884.2026.11513141 · Cited by 7
Singh, D., Mehendale, S., Arvind, & Dorai, K. (2026) · Pramana · doi:10.1007/s12043-025-03102-3
Mahanta, A., Kaur, J., Kumar, K. S., & Jain, M. (2026) · International Conference on Smart Electronic Devices and Intelligent Systems (ICSEDIS) · doi:10.1109/icsedis68157.2026.11518232
Diagonal Adaptive Non-local Observables on Quantum Neural Networks
Tseng, H.-A., Li, Y., Lin, H.-Y., & Chen, S. Y.-C. (2026) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn69946.2026.11662839 · Cited by 1
Analysis of quantum primitives for quantum utility
Kim, T., & Choi, B.-S. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05201-5
Quantum circuit learning using complex spectra of non-integrable systems
Sato, R., Aota, Y., Yoshida, T., Kawaguchi, H., Mori, Y., Kuji, H., & Matsuzaki, Y. (2026) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/ae6f5b
Quantum Innovation and Geopolitical Transformation: A Historical-Comparative Analysis
Rashidi, P., & Nadh, P. O. (2026) · Minerva · doi:10.1007/s11024-026-09647-w
Prasittisopin, L., Sukmas, W., Xu, J.-S., Xu, X.-Y., Rodthongkum, N., Kang, T. H.-K., & Potiyaraj, P. (2026) · Next research. · doi:10.1016/j.nexres.2026.101897 · Cited by 1
Noise resilience in symmetric exchange interactions on NISQ processors
AbuGhanem, M. (2026) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-026-07757-8
Error convergence of quantum linear system solvers
Ginzburg, M. D., & Marzolino, U. (2026) · Physical Review A · doi:10.1103/rjvs-sj7h · Cited by 3
Cross-resonant gates in hybrid fluxonium-transmon systems
Dimitrov, N. D., Wang, C., Manucharyan, V., & Vavilov, M. (2026) · Physical Review Applied · doi:10.1103/2j47-b79k · Cited by 3
A Hybrid Approach Combining Quantum and Neuromorphic Computing for Live City Traffic Management
Swain, S. S., Sekaran, R., S., G., S, J., K.Vengatesan, & Nagu, B. (2026) · 2026 Third International Conference on Networking and Communications (ICNWC) · doi:10.1109/icnwc68145.2026.11518477
Zhao, Z., Zhuang, W., Gu, Y., 钱, P. 鹏. Q., Xiao, X., & Dong, L. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae6fe6
FCA Quantum Neural Networks for Interpretable Neuro-symbolic Classification
Akremi, O., Sellami, M., & Gammoudi, M. M. (2026) · IEEE International Conference on Complex Systems and Intelligent Computing (ICCSIC) · doi:10.1109/iccsic69301.2026.11521467
A Universal Quantum Gradient Descent Framework for Exact Cover Problems
Huo, J., Zhang, R., & Cao, C. (2026) · International Conference on Advanced Electronic Materials, Computers and Software Engineering (AEMCSE) · doi:10.1109/aetcse69203.2026.11504007
A Simulation of Quantum Key Distribution Using BB84 Protocol
Manzoor, A., Saeed, M., & Ahmed, F. (2025) · International Multi-Topic ICT Conference (IMTIC) · doi:10.1109/imtic68267.2025.11520516
Pham, V. P., Huynh, D., Jung, H., Canberk, B., Cotton, S. L., Shin, H., & Duong, T. Q. (2026) · IEEE Internet of Things Journal · doi:10.1109/jiot.2026.3694955 · Cited by 1
Quantum Integer Wavelet Transform Via Lifting Scheme Over Min-Max-Plus Algebra
Firmansyah, M. I. D., Yunus, M., & Subiono (2026) · Journal of Physics Conference Series · doi:10.1088/1742-6596/3238/1/012044
Vukmirović, D., Radojičić, S., Stanojević, N. D., Dragović, N., & Comic, T. (2026) · Advanced sciences and technologies for security applications · doi:10.1007/978-3-032-20948-1_5 · Cited by 1
The dawn of quantum AI in nuclear medicine: an EANM perspective
Papp, L., Visvikis, D., Sollini, M., Shi, K., & Kirienko, M. (2026) · The EANM Journal · doi:10.1016/j.eanmj.2026.100227
Jha, A., Bhandari, R., & Chadha, R. (2026) · 2026 Second International Conference on Emerging Computational Intelligence (ICECI) · doi:10.1109/iceci69159.2026.11519457
Deterministic ground state preparation via power-cosine filtering of time evolution operators
Jo, J. (2026) · Physics Letters A · doi:10.1016/j.physleta.2026.131813
MEDQUA: A NISQ-Aware Quantum Adapter for Medical Vision–Language Models
Li, Y., Pan, Y., Chen, J., Zhou, Y., Jiang, H., Zhao, H., Lyu, Y., Liu, Z., Zhao, L., Zhu, D., et al. (2026) · IEEE International Symposium on Biomedical Imaging (ISBI) · doi:10.1109/isbi61048.2026.11515966
Zhao, J., Xiao, Y., Sun, W., Zhang, Y.-N., Liang, C.-J., Cui, T.-R., Yang, Q., Li, X., & Liu, Z.-J. (2026) · Optics & Laser Technology · doi:10.1016/j.optlastec.2026.115565
Generative AI for Small Molecule Synthesis: A Conditional Hybrid Quantum Cycle GAN Approach
K., A. A., Omer, K. R., Aditya, R., Yuvaraj, N. M., & Chitrakala, S. (2026) · International Conference on Research Methodologies in Knowledge Management, Artificial Intelligence and Telecommunication Engineering (RMKMATE) · doi:10.1109/rmkmate69073.2026.11518705
Rezaei, P., Rahgozar, B., Khan, M. S., Yadollahi, M., & SaberiKamarposhti, M. (2026) · IEEE International Colloquium on Signal Processing & Its Applications (CSPA) · doi:10.1109/cspa68262.2026.11517902 · Cited by 1
Ab initio many-fermion structure calculations on a quantum computer
Du, W., Yang, Y.-G., Liu, Z. X., Yang, C., & Vary, J. P. (2026) · Physical Review C · doi:10.1103/1spg-5ld3 · Cited by 3
A, F. K., & Raghavan, G. (2026) · Research Square · doi:10.21203/rs.3.rs-9598370/v1
Yang, X., Zhou, F., & Xu, R. (2026) · Journal of Physics Conference Series · doi:10.1088/1742-6596/3236/1/012022
Sampling Noise and Optimized Measurement Distribution in Imaginary‐Time Quantum Dynamics Simulations
Zhang, F., Gomes, N., Aftergood, J., Iadecola, T., Yao, Y., & Orth, P. P. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70418
Beyond trotterization: Variational product formulas for quantum simulation
Assi, I. A., Vogl, M. R., Kumari, M., & LeBlanc, J. P. F. (2026) · Physical review. B./Physical review. B · doi:10.1103/941r-ql3g · Cited by 1
Beyond correlation: causal learning for open-set single-source RF fingerprinting in dynamic IoT
Zhang, X., Huang, Q., Ji, X., Shi, L., Li, K., & Hu, G. (2026) · Internet of Things · doi:10.1016/j.iot.2026.101977
Afonso, S., Llorente, J. M. G., & Plata, J. (2026) · Physical Review A · doi:10.1103/gb82-y4z3
Lee, D., & Lee, S. (2026) · Computer-Aided Civil and Infrastructure Engineering · doi:10.1016/j.cacaie.2026.100101
Adversarially Robust Quantum-Classical Neural Network for Malware Detection
Vyas, K. P., Patel, D. K., Tanna, R., et al. (2026) · doi:10.1145/3807501.3808237
Balakrishna, P., & Misra, N. K. (2026) · Journal of Circuits Systems and Computers · doi:10.1142/s0218126626502312
Louise, N., & Kavitha, V. (2026) · International Conference on Artificial Intelligence and Machine Learning Applications Theme: Healthcare and Internet of Things (AIMLA) · doi:10.1109/aimla67915.2026.11522502 · Cited by 1
Quantum Circuit Transpilation: A Comprehensive Overview
Karmakar, D., Chatterjee, K., & Kole, D. K. (2026) · Lecture notes in networks and systems · doi:10.1007/978-981-95-0497-8_43
Quantum Computing for Optimal Dispatch of Virtual Power Plants Under Wind and Solar Uncertainty
Liu, N., Zhang, Y., Liu, Z., & Zheng, C. (2026) · Entropy · doi:10.3390/e28060586
DVQE: Discrete variational quantum eigensolver for memory allocation in continual learning
Zheng, Y., Xie, C., Fang, C., Zhou, Y., Pan, W., & Shi, H. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.134086 · Cited by 1
Inoue, N., & Nakamura, H. (2026) · Journal of Computational Chemistry · doi:10.1002/jcc.70400
Benchmarking engineered exchange interactions on NISQ hardware
AbuGhanem, M. (2026) · Scientific Reports · doi:10.1038/s41598-026-53082-6
A-QAOA: IMPROVED CONVERGENCE VIA ADAPTIVE PARAMETER SCHEDULING IN PRECISION AGRICULTURE
Vivekanand, J., & Yogesh Kumar, B. (2026) · Genetics and Molecular Research · doi:10.4238/2md73f52
Rosas-Bustos, J. R., Thé, J. V. G., Fraser, R. A., et al. (2026) · Journal of Cybersecurity and Privacy · doi:10.3390/jcp6030087
Adaptive V16: Cost-Aware Reinforcement Learning Control for Robust NISQ Variational Optimization
Sivaparvathi, K., & Prabhavathi, C. (2026) · International Conference on Knowledge Engineering and Communication Systems (ICKECS) · doi:10.1109/ickecs70176.2026.11527763
Nonadiabatic self-healing of Trotter errors in digitized counterdiabatic dynamics
Vizzuso, M., Passarelli, G., Cantele, G., Lucignano, P., Chen, X., & Paul, K. (2026) · Physical Review A · doi:10.1103/5ck5-tp69 · Cited by 2
Rakesh, B., & G.Murali (2026) · International Conference on Knowledge Engineering and Communication Systems (ICKECS) · doi:10.1109/ickecs70176.2026.11527643
How Quantum Computing Breaks RSA? - A Study of Shor's Algorithm
Jain, A. (2025) · IEEE MIT Undergraduate Research Technology Conference (URTC) · doi:10.1109/urtc68753.2025.11533064 · Cited by 1
Reddy, A. J., & Bhavya, L. (2026) · International Conference on Knowledge Engineering and Communication Systems (ICKECS) · doi:10.1109/ickecs70176.2026.11527921
Sreeja, R. R., Kamala, J., Akshai, S., & Kanagesan, S. (2026) · Computer Applications in Engineering Education · doi:10.1002/cae.70212
Quantum Assisted Drug Discovery in Human Beings
Anupama, B. S., R, A. S., & Kumar, A. C. (2026) · International Conference on Knowledge Engineering and Communication Systems (ICKECS) · doi:10.1109/ickecs70176.2026.11527919
A Hybrid Classical–Quantum Variational Learning Framework for Breast Mass Classification
Khot, B. A. P., Shanthamallappa, M., Havaldar, R. H., Ittannavar, S. S., Vijayalaxmi, R. S., & Kumar, B. P. P. (2026) · International Conference on Knowledge Engineering and Communication Systems (ICKECS) · doi:10.1109/ickecs70176.2026.11527499
Role of overparametrization in quantum approximate optimization
Rabinovich, D., Kardashin, A., & Adhikary, S. (2026) · Physical Review A · doi:10.1103/m1d6-1v47 · Cited by 4
Ito, R., Matsuo, T., & Ohzeki, M. (2026) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.95.094003 · Cited by 1
Measurement Reduction in Orbital‐Optimized Variational Quantum Eigensolver via Orbital Compression
Tao, Y., Wan, L., & Liu, J. (2026) · International Journal of Quantum Chemistry · doi:10.1002/qua.70221
Programmable Open Quantum Systems
Jing, M., Guo, M., Zhu, L., Yao, H., & Wang, X. (2026) · Physical Review Letters · doi:10.1103/yqlr-2dhr · Cited by 4
Improving Quantum Multi-Objective Optimization with Archiving and Substitution
Ekstrøm, L., Hosogi, T., Bonet-Monroig, X., Wang, H., Bäck, T., & Schmitt, S. (2026) · International Conference on Machine Learning, Optimization, and Data Science · doi:10.1007/978-3-032-21480-5_4 · Cited by 1
Modern Data Structures for Machine Learning: A Comprehensive Survey and Future Directions
Muskan, Mehrotra, S., Nagappan, P., & Kumar, H. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-20606-0_38
A graph-based quantum-inspired approximation of the Feynman path integral
Collignon, B. (2026) · Academia quantum. · doi:10.20935/acadquant8290
Casado-Vara, R., & Corchado, J. M. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05223-z
Liu, H., Zhang, Z., Zheng, K., Liang, Z., Chen, C.-S., Carothers, C., & Hahn, J. (2026) · Annals of Biomedical Engineering · doi:10.1007/s10439-026-04204-8 · Cited by 5
W stronę bezhasłowej bankowości
Kot, M., & Wawrzyniak, D. (2026) · Wroclaw University of Economics and Business eBooks · doi:10.15611/2026.43.2.06
Quantum hidden Markov model for sequential analysis
Deb, B., Pandey, S., & Pakray, P. (2026) · Evolutionary Intelligence · doi:10.1007/s12065-026-01205-3
Solution of the equation-of-motion phonon method eigenvalue problems on the D-wave quantum annealer
Lucia, C. D., Martone, A., D'Aniello, F. A., Mastroianni, A., Nunziata, G., Gregorio, G. D., Folprecht, R., Knapp, F., Iudice, N. L., & Veselý, P. (2026) · Physical Review C · doi:10.1103/h6pm-chbl
Blind-QEM: A Privacy-Preserving Framework for Quantum Error Mitigation via Zero-Knowledge Proofs
Lee, J., Cho, J., Jung, H., Lee, E., Choi, Y., Son, S., & Kim, S. (2026) · International World Wide Web Conference (WWW) · doi:10.1145/3774905.3794699
Quantum Computing Applications in Engineering: Current Status and Future Prospects
Rukmanikanthan, S., Dullah, H., Teoh, Y. X., & Ahmed, A. N. (2026) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-026-10569-9 · Cited by 1
Rahman, M., Paul, P. C., Begum, A., Sultana, K., Akter, N., Majumder, A., Zhu, M., Sheng, Z., Xin, W., Jin, X., et al. (2026) · Journal of Imaging · doi:10.3390/jimaging12060232
Qu, Z., Li, K., Sun, L., Liu, W., Yu, Y., Al-Kuwari, S. M., & Farouk, A. (2026) · IEEE Internet of Things Journal · doi:10.1109/jiot.2026.3698182 · Cited by 1
A Cross-Level Traceable Modeling for Hybrid Quantum–Classical Software
Sepúlveda, S., Navarro, C., Cravero, A., et al. (2026) · doi:10.5753/cibse.2026.42447
Sumeet, Hörmann, M., & Schmidt, K. P. (2026) · Physical Review Research · doi:10.1103/sdpn-s42c · Cited by 2
QRAP: A Quantum Resource Allocation Platform for Adaptive Scheduling Under Topology Constraints
Guo, S., Liu, Z., & Qu, Z. (2026) · Software Practice and Experience · doi:10.1002/spe.70080
Quantum k-Means Clustering Using Hadamard-Test-Based Similarity Estimation
Alaeiyan, M., Torabi, S., & Alaeiyan, M. (2026) · Computers · doi:10.3390/computers15060355
Miriyala, S., & Chirra, V. R. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70310 · Cited by 1
Turab, A., Latif, J., Zaidi, S. A., & Hussain, A. (2026) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2026.117857 · Cited by 1
A Quadratic Unconstrained Binary Optimization Formulation for the Knight’s Tour Problem
Meseguer, L. M., Trillo, J. R., Cuéllar, M. P., et al. (2026) · IEEE Conference on Artificial Intelligence (CAI) · doi:10.1109/cai68641.2026.11536478
Branch-Aware Quantum Constant Propagation for Dynamic Quantum Circuits
Fulginiti, I., & Chen, Y. (2026) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw72780.2026.00024 · Cited by 1
Hamiltonian-Informed Point Group Symmetry-Respecting Ansätze for the Variational Quantum Eigensolver
He, R., Ablimit, A., Hong, X., Chai, Q., Zhou, J., Guan, J., Cui, G., & Ying, S. (2026) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.6c00057 · Cited by 3
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.