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,301–8,400 of 8,640
An adaptive quantum-classical approach for scalable clustering and analytical decision-making
Hidayat, R., Novkaniza, F., Rustam, Z., & Akdemir, :. O. (2026) · Decision Analytics Journal · doi:10.1016/j.dajour.2026.100734
Oralkhan, A., & Zhaxalykov, T. (2026) · IEEE International Conference on Smart Information Systems and Technologies (SIST) · doi:10.1109/sist61674.2026.11595996
Contingency Analysis via QAOA in the NISQ Era
Lange, J., & Li, Y. (2026) · IEEE Transportation Electrification Conference and Expo · doi:10.1109/iteceats66641.2026.11592846 · Cited by 1
Singh, M., Sood, S. K., & Bhatia, M. (2026) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-026-10730-4
Single-Qubit Multi-data Encoding for Efficient Quantum Convolution in Image Recognition
Chen, L., Wang, X., Liu, Y., Deng, S., Liu, Y., & Song, H. (2026) · Lecture notes in computer science · doi:10.1007/978-981-92-2868-3_23
Anchoring Co-Design on the Engineered Quantum System: A Model-Based Approach
Ishida, H., Elsokary, A., Henshaw, M., et al. (2026) · ACM/IEEE International Conference on Model Driven Engineering Languages and Systems (MODELS) · doi:10.1145/3837062.3839079
Scalable simulation of quantum many-body dynamics with or-represented quantum algebra
Anonymous, Sun, R.-Y., & Yunoki, S. (2026) · Physical Review Applied · doi:10.1103/y8ft-m61w · Cited by 12
Amirov, O., Çelik, N., & Karabacak, M. (2026) · International Journal of Theoretical Physics · doi:10.1007/s10773-026-06401-6 · Cited by 1
Quantum machine learning in predictive maintenance: A comprehensive state-of-the-art review
Lisan, Z. A., Sifat, M. S. I., Kabir, M. A., Mahmud, A., Rehman, A. U., & Bermak, A. (2026) · Computers & Electrical Engineering · doi:10.1016/j.compeleceng.2026.111374 · Cited by 1
Quantum-Channel Matrix Optimization for Holevo Bound Enhancement
Niu, H., Yuen, C., Ashikhmin, A., & Hanzo, L. (2026) · International Conference on Communications · doi:10.1109/icc59461.2026.11587443
Experimental prime factorization via feedback quantum control
Krishnan, K. B. H., Varma, V., & Mahesh, T. S. (2026) · Physical Review A · doi:10.1103/mx49-b924
Anonymous, Qamar, S., Xiao, X., Gu, Y., Chai, X., Zhao, Z., Forcellini, N., & Liu, D. E. (2026) · Physical Review A · doi:10.1103/3bgq-jn3n · Cited by 6
Anselmetti, G.-L., Degroote, M., Moll, N., Santagati, R., & Streif, M. (2026) · Physical Review Research · doi:10.1103/hwcl-yfy4 · Cited by 4
Improved quasiparticle nuclear Hamiltonians for quantum computing
Anonymous, & Menéndez, J. (2026) · Physical Review C · doi:10.1103/yl3n-3tbf
Electrical energy cost of arbitrary state preparation with programmable integrated photonic circuits
Volpato, M. C., Sampaio, G. D. S., & de Assis, P.-L. (2026) · doi:10.1364/cleo_at.2026.jtu.99
QubitHammer: Remotely Inducing Qubit State Change on Superconducting Quantum Computers
Tan, Y., Choudhury, N., Basu, K., & Szefer, J. M. (2026) · IEEE International Symposium on Hardware Oriented Security and Trust (HOST) · doi:10.1109/host68814.2026.11604631
Tiotsop, M., Nguedia, P. D., & Fotué, A. J. (2026) · Physica E Low-dimensional Systems and Nanostructures · doi:10.1016/j.physe.2026.116611 · Cited by 1
Truby, J., & Baysal, O. (2026) · Journal of Cyber Policy · doi:10.1080/23738871.2026.2689321
Modular Quantum Recurrent Neural Networks: Scalable Reservoir Computing with High Noise Resilience
Sengupta, R. (2026) · International Conference on Secure Cyber Computing and Communications (ICSCCC) · doi:10.1109/icsccc69031.2026.11600184
Hybrid quantum–classical neural kernel emulator for scalable drive-by attack detection
Anbalagan, S. K. P., & Raja, S. K. S. (2026) · Array · doi:10.1016/j.array.2026.101090
Anonymous, da Motta, O., Castelano, L. K., & Napolitano, R. D. J. (2026) · Physical Review A · doi:10.1103/x847-zclc
A Boosted Quantum Convolutional Framework for 8-Class Chest X-ray Disease Recognition
Arora, R., & Saini, I. (2026) · International Conference on Secure Cyber Computing and Communications (ICSCCC) · doi:10.1109/icsccc69031.2026.11600249
Guéron, E. (2026) · Statistics & Probability Letters · doi:10.1016/j.spl.2026.110901
Karbin, K., Patel, V., Shafiee, M., Baxter-Jones, A. D. G., ERLANDSON, M. C., Lane, G. L., Chilibeck, P. D., Rayan, S., & Vatanparast, H. (2026) · Critical Reviews in Food Science and Nutrition · doi:10.1080/10408398.2026.2691231 · Cited by 1
Ugail, H., & Howard, N. (2026) · PLoS ONE · doi:10.1371/journal.pone.0353739 · Cited by 2
Quantum Neural Networks in the NISQ Era: Architectures, Challenges, and Applications
Palihakkara, K. W., & Jayakody, M. N. (2026) · Proceedings in Technology Transfer · doi:10.1007/978-981-92-0423-6_19
Direct characterization of quantum dynamics via generalized weak values
Xu, L., Pan, Y., Li, H., Wang, B., Zhang, A., Dong, Y., & Zhang, L. (2026) · Science Advances · doi:10.1126/sciadv.aeb7304
Toward Reliable Oracle Verification of Quantum Programs Under Noise and Resource Constraints
Ma, N. (2026) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/3803437.3804871 · Cited by 1
The Bridge to the Quantum Fortress: How Do Hybrid Cloud Attacks Exploit the Quantum Core?
Lamichhane, P., & Lee, K. H. (2026) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-032-32764-2_25
Nguedia, P. D., Fotué, A. J., & Tiotsop, M. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70363
AI-Empowered Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects
Yan, G., Wu, W., Chen, Y., Pan, K., Lü, X., Zh, Z., Wang, Y., Wang, R. L., & Yan, J. (2026) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2026.3715237 · Cited by 102
Reliability dynamics in dissipative quantum spin chains
Sun, B., & Zhou, D. L. (2026) · Physics Letters A · doi:10.1016/j.physleta.2026.132012
Chiral cat code: Enhanced error correction induced by higher-order nonlinearities
Labay-Mora, A., Mercurio, A., Savona, V., Giorgi, G. L., & Minganti, F. (2026) · Physical Review Research · doi:10.1103/kt69-mwf7 · Cited by 6
GLEAM: Mitigating Barren Plateaus in Hybrid Quantum Machine Learning via Small-World Entanglement
Ding, Z., Xing, F., Xia, Y., & Zeng, P. (2026) · International Conference on Image Processing and Artificial Intelligence (ICIPAI) · doi:10.1109/icipai70034.2026.11605634
Quantum Artificial Intelligence Architectures and Applications
Yıldırım, R., & Demirci, F. S. (2026) · International Symposium on AI-Driven Engineering Systems (ISADES) · doi:10.1109/isades69945.2026.11608200
Toward Fair and Budget-Aware Benchmarking in Hybrid Quantum Machine Learning
Bendouma, R., Tiberkak, A., & Bagaa, M. (2026) · International Conference on Pattern Analysis and Intelligent Systems (PAIS) · doi:10.1109/pais69842.2026.11605270 · Cited by 1
Protecting Quantum Circuits Through Compiler-Resistant Obfuscation
Parayil, P., Raj, A., & Balachandran, V. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-32560-0_7
Singh, N. P., Omana, J., & Nair, S. G. S. (2026) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2026.1836641
Visualizing Quantum Algorithms in NISQ Era: A Full Stack Platform
Lakshmi, G. D., Varma, D. R., Sai, B. N., Lokesh, D., & Reddy, B. D. (2026) · International Conference on Cognitive Computing and Networking Systems (ICC-CNS) · doi:10.1109/icc-cns70518.2026.11606114
Shang, L., Cao, H., Wu, Y. J., Niu, X., & Chen, J. Y. (2026) · Entropy · doi:10.3390/e28070829
Eliminating vendor lock-in in quantum machine learning via framework-agnostic neural networks
Kumaresan, P., Singaravelu, S., Rajendran, L., & Sivasubramani, S. (2026) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2026.1862700
Carducci, N. M. (2026) · IEEE International Conference on AI and Data Analytics (ICAD) · doi:10.1109/icad69378.2026.11609075
Suneetha, S., & Deepthi, K. K. C. (2026) · IEEE Access · doi:10.1109/access.2026.3716117
Kumar, S. M., Rashmi, B. H., Lakshmi, S. R., Rajath, B. S., Mallika, B. K., & Pazhamalai, S. (2026) · SN Computer Science · doi:10.1007/s42979-026-05220-0
Sigdel, D., & Panday, N. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.07.17.739210
Mohawesh, R., Salameh, H. B., Refae, G. A. E., & Barqawi, B. (2026) · International Conference on Emerging and Intelligent Technologies and Systems (EITS) · doi:10.1109/eits70066.2026.11609638
Constrained quantum optimization via iterative warm-start X Y -mixers
Bucher, D., Janetschek, M., Poppel, M., Stein, J., Linnhoff–Popien, C., & Feld, S. (2026) · New Journal of Physics · doi:10.1088/1367-2630/ae8ea2 · Cited by 12
A review of variational quantum algorithms: Insights into fault-tolerant quantum computing
Wang, Z., Huang, J., Ye, R., Li, Q., Ding, Q.-M., Huang, Y., Zhang, T., Zeng, Y., Gao, J., Yuan, X., et al. (2026) · Frontiers of Physics · doi:10.15302/frontphys.2027.023301 · Cited by 7
Barati, C. N., Croitoru, A., Gore, R. J., Jarret, M., Kennedy, W. G., Maciejunes, A., Malikov, M., & Mendelson, S. S. (2026) · SIMULATION · doi:10.1177/00375497261467053
Asymptotic optimality of Grover–Radhakrishnan–Korepin algorithm
Zhang, K., Chen, K.-Y., Wang, X.-H., & Korepin, V. E. (2026) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ae8f8d · Cited by 1
Shortcuts to Analog Preparation of Nonequilibrium Quantum Lakes
Anonymous, Sahay, R., & Yelin, S. F. (2026) · Physical Review Letters · doi:10.1103/7bc2-6cgy · Cited by 13
Representational efficiency and noise robustness in hybrid quantum-classical graph neural networks
Santo, I. A., Bannah, H., Nabi, M. S., & Karim, H. B. A. (2026) · Discover Quantum Science · doi:10.1007/s44464-026-00025-9 · Cited by 1
Zhou, G., Xu, R. A. N., & Xiao, J. (2026) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2026.3716373
Analysis and Verification of Quantum Communication Protocols in UPPAAL
Christensen, R. B., Kristensen, N. R., Larsen, K. G., Mikučionis, M., Srba, J., & Walsted, L. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-32537-2_18
Matseevich, S. V., Zakharov, A. S., Perlov, A. Y., et al. (2026) · 2018Systems of Signal Synchronization, Generating and Processing in Telecommunications (SYNCHROINFO) · doi:10.1109/synchroinfo70145.2026.11613484
Formal Verification of Quantum Ancilla Safety
Li, J., Mei, J., Fang, W. S., & Guan, J. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-32537-2_16 · Cited by 1
Dobariya, A. R., Gohil, J., Anghelescu, P., Ionescu, V., & Enescu, M. C. (2026) · European Conference on Artificial Intelligence · doi:10.1109/ecai69016.2026.11613609
Jiang, Q., & Dong, Y. (2026) · Neurocomputing · doi:10.1016/j.neucom.2026.134567 · Cited by 1
Zhang, S., Wang, Y.-J., Wang, P., Zhao, R.-Z., Yang, X., Zhao, Z., Wang, T.-L., Zhang, H., Li, Z., Wu, Y., et al. (2026) · Physical Review X · doi:10.1103/h5m3-qrn9 · Cited by 7
Quantum artificial intelligence for human health: A statistical framework
Hassani, H., Mashhad, L. M., & MacFeely, S. (2026) · Elsevier eBooks · doi:10.1016/b978-0-443-43934-6.00039-0
Quantum-controlled Pauli true randomness for secure BB84 quantum key distribution
Gururaja, T. S., & Praveenkumar, P. (2026) · Optics Communications · doi:10.1016/j.optcom.2026.133607
Polarization self-compensation quantum key distribution system with 5 GHz modulation
Hao, P.-L., Chen, W., Wang, S., et al. (2026) · Science China Information Sciences · doi:10.1007/s11432-025-4933-9
Bathula, N. R., & Misra, N. K. (2026) · e-Prime – Nexus of Electrical Electronic and Intelligent Engineering · doi:10.1016/j.eprime.2026.201223
Mitigating barren plateaus in quantum denoising diffusion probabilistic models
Cao, H., Zhang, K., Tao, D., & Su, Z. (2026) · Physical Review A · doi:10.1103/gg2j-xtk6 · Cited by 1
Quantum-annealing-aided key-recovery attack on the A5-GMR-2 cipher
Lee, M., Kim, I., Cho, J., Kang, T., Kim, S., & Lee, D. (2026) · Journal of Computational Science · doi:10.1016/j.jocs.2026.102989
Noise tolerance via reinforcement in the quantum search problem
Anonymous, & Ramezanpour, A. (2026) · Physical Review A · doi:10.1103/qt8h-6dyg
Rafi, M. U. (2026) · Research Square · doi:10.21203/rs.3.rs-10488762/v1
Photonic Quantum Hardware for AI Optimization Tasks
Daneshzad, S., & Parsanasab, G.-M. (2026) · International Interdisciplinary Conference on Artificial Intelligence: Engineering, Health, Finance and Humanities (IICAI) · doi:10.1109/iicai70155.2026.11620969 · Cited by 4
Quantum Logic Networks: PLN-Style Inference in the Operator Evidence Algebra
Goertzel, B. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-33010-9_18
Strømme, M. H. (2026) · IEEE Computer Architecture Letters · doi:10.1109/lca.2026.3718294
Information processing in quantum thermodynamic systems: An autonomous Hamiltonian approach
Anonymous, Doucet, E., Touil, A., Deffner, S., & Sone, A. (2026) · Physical review. E · doi:10.1103/rwkz-dc5z · Cited by 2
A qubit-efficient quantum algorithm for convolutional feature extraction
Roshanshah, M. R., Kazemikhah, P., Aghababa, H., & Barati, M. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00425-1
Portfolio optimization via FALQON variants: warm starting, XY mixing, and circuit depth reduction
Prado, P. B. B., do Carmo, R. S., Rattighieri, L. A. M., Arruda, L. G. E., Franco, G. S., de Oliveira, M. C., & Fanchini, F. F. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05291-1
Robust Hamiltonian estimation with partial prior information via random unsharp Pauli measurements
Zhang, X., Xi, C., Tang, Y., Wang, Y., Wang, C., Gao, H., Fu-li, L., Xiang, Y., Wang, F., & Zhang, P. (2026) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-026-3077-5
Khalfet, N., & Krikidis, I. (2026) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2026.3718832
Federated Variational Quantum Neural Networks for Privacy-Preserving Anomaly Detection in IoT
Delhibabu, R., Mazzara, M., & Distefano, S. (2026) · IEEE International Conference on Smart Computing Workshops and Other Affiliated Events (SMARTCOMP Companion) · doi:10.1109/smartcomp-companion70724.2026.00033
H-QDCT: hierarchical quantum DCT for structural–textural feature fusion in medical imaging
Font-Aragonès, X., & Ballester, M. Á. G. (2026) · International Journal of Computer Assisted Radiology and Surgery · doi:10.1007/s11548-026-03764-3
ANQOR: Anchor-based Quantum Multi-class Image Classification
Islam, A. K. M. M., Huang, Y., Yan, Y., & Li, G. (2026) · IEEE Cloud Summit · doi:10.1109/cloudsummit68932.2026.00013
Assessing the Feasibility of Quantum Autoencoders for Real-World Visual Anomaly Detection
Farsian, F., Azzarelli, A., Vita, F. D., Merlino, G., & Schillirò, F. (2026) · IEEE International Conference on Smart Computing Workshops and Other Affiliated Events (SMARTCOMP Companion) · doi:10.1109/smartcomp-companion70724.2026.00032
Future of Artificial General Intelligence
Singh, Y. B., Mishra, A. D., & T.Saravanan (2026) · Artificial General Intelligence · doi:10.1002/9781394422715.ch19
Hybrid Classical-Quantum Architecture for Vectorised Image Classification of Hand-Written Sketches
Cordero, Y., Biswas, S., Vilariño, F., & Bilkis, M. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-31673-8_24 · Cited by 1
Q-Tag: watermarking quantum circuit generative models
Yang, Y., Long, Y., Fang, H., Chen, Z., Li, Z., Zhang, W., & guo, G. (2026) · Science China Information Sciences · doi:10.1007/s11432-025-5016-2
DistributedEstimator: Distributed training of quantum neural networks via circuit cutting
Singh, P., Toosi, A. N., & Buyya, R. (2026) · Future Generation Computer Systems · doi:10.1016/j.future.2026.108746 · Cited by 2
f-EVOVAQ: A GPU-based Framework for Evolutionary Training of Variational Quantum Algorithms
Acampora, G., Chiatto, A., & Vitiello, A. (2026) · Proceedings of ... IEEE International Conference on Fuzzy Systems · doi:10.1109/fuzz69877.2026.11626396
Hardware-Aware Quantum Kernel Design Based on Graph Neural Networks
Meng, F., Liu, Y., Wang, L., Li, S., Han, Z., & Liu, L. (2026) · Entropy · doi:10.3390/e28080855 · Cited by 10
Entanglement Structure and Matrix Inequalities from Isotypic Measurements
Rico, A., Grinko, D., Krebs, R., & Zaw, L. H. (2026) · Physical Review Letters · doi:10.1103/nvk2-h8d5 · Cited by 1
Hybrid Quantum–Classical AI for Industrial Defect Classification in Welding Images
Srinivasan, A., Cheng, X., Yi, J., et al. (2026) · doi:10.3390/engproc2026150096
Taherdoost, H. (2026) · Cryptography · doi:10.3390/cryptography10040053
Algorithmic Quantum Simulations of Quantum Thermodynamics
Anonymous, Nan, J., Chen, D., Zache, T. V., Zhu, Q., Zhang, Y., Li, Y., Chen, X., Ying, C., Zha, C., et al. (2026) · Physical Review Letters · doi:10.1103/n7tv-p5bp · Cited by 1
An Explainable Fuzzy Logic-Based Approach to Quantum Backend Selection
Acampora, G., Cuzzocrea, A., & Vitiello, A. (2026) · Proceedings of ... IEEE International Conference on Fuzzy Systems · doi:10.1109/fuzz69877.2026.11626470
Investigation of the Principles of Quantum Mechanics and Their Applications
Hotak, D. R. (2026) · Integrated Journal for Research in Arts and Humanities · doi:10.55544/ijrah.6.4.25
Quantum Image Encoding Fidelity Metric (QIEF) for Performance Evaluation of Quantum Devices
Geng, A., & Moghiseh, A. (2026) · International Scientific Conference TechSys — Engineering, Technology and Systems (TechSys) · doi:10.3390/engproc2026150093
QUBO-Based Scheduling of Heterogeneous Quantum Computing Resources in Scale-Free Industrial Networks
Wang, Y., Wang, X., Pan, Y., & Gao, Q. (2026) · Youth Academic Annual Conference of Chinese Association of Automation (YAC) · doi:10.1109/yac71005.2026.11616218
Liu, C., & Deng, Y. (2026) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.6c00432 · Cited by 2
Distributed Variational Quantum Optimisation by Entanglement-Selective Transport
Matwiejew, E., Elahi, P. J., & Varetto, U. (2026) · International Conference on Distributed Computing Systems Workshops · doi:10.1109/icdcsw72724.2026.00044
Síntese de Operadores Unitários Baseada em Gramáticas
de Carvalho, J. A., & da Silva, A. J. (2026) · Simpósio Brasileiro de Computação e Comunicação Quânticas (SBCCQ) · doi:10.5753/sbccq.2026.23563
CHRONOS: A Causally-Constrained Architecture for Scientifically Defensible Counterfactual HistoryPreprint
Rafi, M. U. (2026) · Research Square · doi:10.21203/rs.3.rs-10584923/v1
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.