Quantum Computing in the NISQ era and beyond
Open accessThe DOI matches its Crossref record; 75 of the 82 references it cites were found in a registry or an index; 25 of the 40 sources its claims cite were checked for support.
Abstract
Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today's classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away - we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing.
Overview
CoChat Summary
TL;DR
Preskill introduces the NISQ era—noisy intermediate-scale quantum devices with 50–100 qubits—as a near-term step toward quantum computing, useful for exploring many-body quantum physics but limited by noise and not expected to change the world by itself. He argues that fault-tolerant quantum computing remains distant and that near-term applications, especially hybrid quantum-classical algorithms, are promising but unproven.
Key findings
- NISQ devices will have 50 to a few hundred qubits; 50 qubits is a milestone because it is beyond brute-force simulation by the most powerful existing digital supercomputers. However, with two-qubit gate error rates above 0.1%, circuits with many more than about 1000 gates are not expected to be reliable.
- NISQ technology may be useful for exploring many-body quantum physics and quantum dynamics, and hybrid quantum-classical algorithms such as QAOA and VQE may find approximate solutions to optimization problems, but whether they outperform classical methods is an open question.
- Quantum algorithms offer speedups for problems such as factoring, matrix inversion (HHL runs in O(log N)), recommendation systems (O(poly(k)polylog(mn))), and semidefinite programming (polylog(N)), but many require error correction or QRAM and are probably not feasible in the NISQ era. A note added states that Tang’s quantum-inspired classical algorithm removes the exponential speedup claimed for quantum recommendation systems.
- Fault-tolerant quantum computing is still distant: running algorithms with thousands of protected qubits will require millions of physical qubits, so NISQ should be regarded as a step toward more powerful future quantum technologies.
Methods
- This is a conceptual review and keynote address, based on a Keynote Address at Quantum Computing for Business, 5 December 2017; it is not an empirical study.
- The paper assesses the current status and future potential of quantum computing, discussing hardware platforms, gate errors, qubit counts, quantum algorithms, and fault-tolerance requirements.
- The main analysis is a qualitative synthesis of theoretical arguments, experimental examples, and open questions; no dataset, sample, or statistical analysis is reported.
Limitations
- The paper states it is “the result of an uneasy compromise,” minimizes jargon and technical details for a broader audience, and does not attempt a comprehensive list of references.
- The paper states that NISQ devices have imperfect control and noise, that gate error rates are above 0.1% and may not be maintained in larger devices, that circuit size is limited to roughly 1000 gates, and that validating quantum outputs may be hard.
- Evident from the text: as a keynote-style review, it offers projections and opinions rather than new experimental data or a systematic review; several speedup claims are explicitly open questions, and the recommendation-systems speedup is later undercut by a quantum-inspired classical algorithm.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
14 Valid · 9 Not valid · 10 Not checked · 85 Own results and interpretations
Some cited sources support this claim and some don’t — read each source’s verdict below.
In the paper
“50 qubits is a significant milestone, because that's beyond what can be simulated by brute force using the most powerful existing digital supercomputers.”
What the sources say
- Supportedcites [11] [11] S. Boixo, S. V. Isakov, V. N. Smelyansky, R. Babbush, N. Ding, Z. Jiang, M. J. Bremner, J. M. Martinis, and H. Neven, Characterizing quantum supremacy in near-term devices, Nature Physics 14, 595-600 (2018), arXiv:1608.00263 (2016), https://doi.org/10.1038/s41567-018-0124-x. - source
The Introduction (p. 1) says that even modest-depth circuits acting on approximately fifty qubits cannot be directly simulated in practice. The Conclusion (p. 12) estimates that state-of-the-art supercomputers fail to simulate universal random circuits beyond approximately 48 qubits at a depth of about 40. The milestone claim is supported in that circuit context. (LLM, conf=0.90)
- Disputedcites [12] [12] S. Aaronson and L. Chen, Complexity-theoretic foundations of quantum supremacy experiments, arXiv:1612.05903 (2017). - sourceExperimental — accuracy not yet measured
Section 1.2 (p. 4) describes 40–50 qubits as a range where classical simulation is difficult but not impossible, contrary to the claim that 50 qubits is beyond brute-force simulation. Section 1.3 (p. 7) also describes a classical simulation method and says its 2^n time is reasonable for a planned setup with roughly 40 or 50 qubits. (LLM, conf=0.86)
Checked by a reasoning model — may be wrong.
- Supportedcites [13] [13] E. Pednault, J. A. Gunnels, G. Nannicini, L. Horesh, T. Magerlein, E. Solomonik, and R. Wisnieff, Breaking the 49-qubit barrier in the simulation of quantum circuits, arXiv:1710.05867 (2017). - source
The Abstract (p. 1) frames systems of more than 50 qubits as the coming regime and states that 'resource requirements for such calculations on classical computers grow exponentially', with the relevant calculations 'thought to be impossible due to resource requirements'. Section 2.1 (p. 3) gives the concrete brute-force bound: the full state of a 49-qubit system needs 2^49 complex numbers (8 PB in double precision), which 'eliminates the possibility of keeping the entire state in primary storage', and the Feynman-path alternative 'grows to intractable levels very quickly'. The Introduction (p. 2) reinforces this by noting that the state-of-the-art full-state techniques of the time would have required 8 PB (49 qubits) and 1 EB (56 qubits), far beyond the ~64 TB aggregate RAM of Vulcan/Sequoia-class machines. The citing sentence's 'brute force' qualifier matches the paper's own contrast with tensor-contraction-deferral methods, so the attribution holds; only the rhetorical label 'significant milestone' is the citing authors' framing. (LLM, conf=0.83)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“Eventually we expect to be able to protect quantum systems and scale up quantum computers using the principle of quantum error correction [10].”
What the sources say
- Supportedcites [10] [10] D. Gottesman, An introduction to quantum error correction and fault-tolerant quantum computation, Proceedings of Symposia in Applied Matthematics 68 (2010), arXiv:0904.2557. - source
The Background (p. 1) says quantum computers need protection from noise and identifies error correction as necessary. Fault-tolerant gates (p. 17) explains that, below an error-rate threshold, arbitrarily accurate quantum computation is possible with polylogarithmic overhead. This supports the expectation of protecting quantum systems and scaling up quantum computers, subject to that threshold. (LLM, conf=0.91)
hedgedstates a possible cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“as of now we don't have a convincing theoretical argument or persuasive experimental evidence indicating that quantum annealers can really speed up the time to solution compared to the best classical hardware running the best algorithms for the same problems [28, 29].”
What the sources say
- Partly supportedcites [28] [28] T. F. Rønnow, Z. Wang, J. Job, S. Boixo, S. V. Isakov, D. Wecker, J. M. Martinis, D. A. Lidar, and M. Troyer, Defining and detecting quantum speedup, Science 345, 420-424 (2014), https://doi.org/10.1126/science.1252319. - sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
- Partly supportedcites [29] [29] S. Mandrà, H. G. Katzgraber, and C. Thomas, The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again), Quantum Sci. Technol. 2, 038501 (2017), arXiv:1703.00622, https://doi.org/10.1088/2058-9565/aa7877. - sourceExperimental — accuracy not yet measured
Split into 2 atoms — 1 confirmed, 1 partially supported, 0 disputed, 0 misattributed, 0 unverifiable. Expand the claim to see per-atom verdicts.
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“In particular, the task of matrix inversion admits an exponential quantum speedup, which could have many applications.”
What the sources say
- Supportedcites [40] [40] A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009), arXiv:0811.3171, https://doi.org/10.1103/PhysRevLett.103.150502. - source
The paper’s Outline says its hardness results imply that the algorithm runs exponentially faster than any classical algorithm for the matrix-inversion task. The performance discussion qualifies this speedup: it is greatest when the condition number and inverse accuracy are polylogarithmic in matrix size, and the algorithm outputs a quantum representation rather than every component of the solution. (LLM, conf=0.92)
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
Every source the paper cites for this claim was checked and supports it.
In the paper
“As Laughlin and Pines [8] emphasized in the statement I quoted earlier, we think that simulating such 'strongly correlated' matter is a difficult computational problem, because many very good physicists have tried to solve it for decades and have not succeeded.”
What the sources say
- Supportedcites [8] [8] R. B. Laughlin and D. Pines, The theory of everything, PNAS 97, 28-31 (2000), https://doi.org/10.1073/pnas.97.1.28. - source
In the paper’s main text (page not supplied), Laughlin and Pines say accurate solutions become infeasible for more than about 10 particles because the computational requirements grow rapidly. They also describe notorious failures of approximate calculations for high-temperature superconductors, supporting the claim that simulating such matter is difficult. (LLM, conf=0.90)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
37 more claims · 4 with their cited sources checked
Create a free account to see all 118 claims and to verify the 5 references still open.
- It may state two separate claims as one. 26
- Probably not a substantial claim. 63
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source doesn’t support the claim as written.
In the citing paper
“so-called Noisy Intermediate-Scale Quantum (NISQ) computers already exist today”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [209]
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Furthermore, they are challenging to make extensible as required to surpass noisy intermediate-scale quantum (NISQ)-era scales [221] and thereby enable practically relevant quantum computation.”
From 2022 Roadmap on integrated quantum photonics (2022) · cites this paper as [221]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Therefore, research on quantum algorithms splits, on the one hand, into algorithms for fault-tolerant quantum computers, which we may think of as a future perfect quantum computer, and, on the other hand, into algorithms for nearterm or noisy-intermediate stage quantum (NISQ) [120] devices of dozens to thousands of physical qubits, that are characterized by the absence of complete fault-tolerance.”
From Quantum Computing for Molecular Biology** (2023) · cites this paper as [120]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations within a limited coherence time.”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Preskill, 2018
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“These hybrid quantum-classical algorithms are specifically designed to minimize the limitations of current quantum hardware, such as decoherence and gate errors, by delegating some computational tasks to classical processors. [8]”
From Limitations of Quantum Hardware for Molecular Energy Estimation Using VQE (2026) · cites this paper as [8]
Experimental — accuracy not yet measured
10 more claims about this paper
Create a free account to see every claim other papers make about this one.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rated minor: it would not touch a result — a value no result rests on, a p-value that stays on the same side of the significance level, or a conflict that is clerical, resolved elsewhere in the paper, or outside its own findings.
In the paper
§ 2 Opportunities at the entanglement frontier · p. 2
“We don't think that's not true for classical ( i.e. , nonquantum) digital computers”
§ 2 Opportunities at the entanglement frontier · p. 2
“which (as far as we know) can't simulate highly entangled quantum systems.”
Citations
Cites
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · cited 1×
“to be hard for classical computers, but for which quantum algorithmshavebeendiscoveredthatcouldsolvetheseproblemseasily. Thebestknown exampleistheproblemoffindingtheprimefactorsofalargecompositeinteger[1]. Webelievefactoringishardbecausemanysmartpeoplehavetriedformanydecades to find better factoring algorithms and haven…”
BackgroundBiamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779 · cited 1×
“” Much of the literature on the subject builds on quantum algorithms that speed up linear algebra and related tasks [37, 38], and I’ll address such applications in the ensuing subsections.”
BackgroundA variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
Degen, C. L., Reinhard, F., & Cappellaro, P. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.035002 · Cited by 4,045 · cited 1×
“antum sensing. Quantum technology has advantages for some kinds of sensing. Quantum systems can sense weak forces with better sensitivity and higher spatial resolution than other sensing technologies [19]; thus quantum sensing could have relatively near-term high-impact applications, to medicine for example. Quantum c…”
BackgroundPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325 · cited 1×
“6.6 Quantummatrixinversion QRAMhasfurtherimplicationsforquantumalgorithms. Inparticular,thetaskofmatrix inversionadmitsanexponentialquantumspeedup,whichcouldhavemanyapplications. ThealgorithmwecallHHL[40](afterthethreeauthorswhofirstdiscusseditnineyears ago) takes as input a succinct representation of a very large N×N…”
BackgroundInfluentialSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 1×
“for a while, because of the large number of physical qubits needed. To run algorithms involving thousands of protected qubits we’ll need a number of physical qubits which is in the millions, or more [50]. That’s a very large leap from where we will be for the next few years, with of order a hundred qubits. Crossing th…”
BackgroundProbing many-body dynamics on a 51-atom quantum simulator
Bernien, H., Schwartz, S., Keesling, A., Levine, H., Omran, A., Pichler, H., Choi, S., Zibrov, A. S., Endres, M., Greiner, M., et al. (2017) · Nature · doi:10.1038/nature24622 · Cited by 2,460 · cited 1×
“Analog quantum simulators have been getting notably more sophisticated, and are already being employed to study quantum dynamics in regimes which may be beyond the reach of classical simulators [51, 52].”
Background
Cited by
Items 7,201–7,300 of 8,640
Optimization of Quantum Encoding for Combinatorial Problems in Rydberg Atom Array
Liu, J., Zhu, Y., Zheng, Q., Cui, J., & Su, Z. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00017
Hypergraphic representation for adaptive quantum circuits
Cambiucci, W., Silveira, R. M., & Ruggiero, W. V. (2025) · International Conference on Quantum Communications, Networking, and Computing (QCNC) · doi:10.1109/qcnc64685.2025.00109
Freshness flavour perception via quantum-inspired and quantum ligand-based virtual screening
Rodríguez-Otero, A., Juane, M. M., Paredes-Ramos, M., Nelen, J., Rentero, A. B., Pérez‐Sánchez, H., Tato, A. G., & Vilariño, J. M. L. (2026) · Scientific Reports · doi:10.1038/s41598-026-66827-0
N00N State Generation by Floquet Engineering
Maleki, Y. (2025) · Mathematics · doi:10.3390/math13101667 · Cited by 1
Quantum repeaters: current research trends and latest achievements
Ахмеджанов, Р. А., Balega, Y. Y., Deev, A. D., & Kalachev, A. A. (2025) · Uspekhi Fizicheskih Nauk · doi:10.3367/ufnr.2025.05.039918
Thermodynamics of ancilla-assisted erasure of quantum information
Neto, C. O. A. R., & Bernardo, B. D. L. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04770-1 · Cited by 3
Quantum Computing and GAN Aspect
Bhadoria, R. S., Thakur, V., & Allahviranloo, T. (2025) · Studies in computational intelligence · doi:10.1007/978-3-031-82058-8_19
New Optimized Grover's Algorithm Optimization of Grover's algorithm: with quantum simulatingPreprint
Sood, I., Sirohia, A., & Juneja, A. D. (2025) · doi:10.36227/techrxiv.174803113.34775460/v1
First-Principles Design of Qubits in Charged Carbon Nanomaterials
Yang, H., Wu, M., Xie, F., Meng, D., Luo, J., & Zhu, J. (2025) · Materials · doi:10.3390/ma18112451
Li, G., Wang, S., Ni, X., Gao, F., Guo, F.-Z., Qin, S., & Wen, Q. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.130690 · Cited by 2
Variational quantum neural networks based on dynamic layerwise strategy
Qi, H., Zhang, L., Gong, C., Por, L. Y., & Gani, A. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07394-5 · Cited by 2
Quantum process overlapping tomography: Theory and experiment
Hu, Y., Zheng, C., Wang, X., Zhang, Z., Xu, P., & Wang, K. (2025) · Physical Review Applied · doi:10.1103/jkf7-wfcn · Cited by 4
Ghosh, A., Kundu, D., Chatterjee, A., & Ghosh, S. (2025) · International Symposium on Quality Electronic Design (ISQED) · doi:10.1109/isqed65160.2025.11014340 · Cited by 5
New Optimized Grover's Algorithm Optimization of Grover's algorithm: with quantum simulatingPreprint
Sood, I., Sirohia, A., & Juneja, A. D. (2025) · doi:10.36227/techrxiv.174803113.34775460/v2
Nonequilibrium Quantum Dynamics of a Low-Dimensional Spin System
Siurakshina, L., & Yushankhaï, V. Y. (2025) · Physics of Particles and Nuclei Letters · doi:10.1134/s1547477125700128
Optimizing Initial Qubit Mappings Under Fixed Gate Error Rates Using Deep Reinforcement Learning
Oancea, R. A., van der Linde, S., de Kok, W., Sabatelli, M., & Feld, S. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-94263-1_12
Hieu, N. Q., Manh, B. D., Hoang, D. T., Nguyen, D. N., & Hossain, E. (2025) · Elsevier eBooks · doi:10.1016/b978-0-44-329032-9.00018-x
Iizuka, S., Asai, H., Kato, K., Oka, H., Chiashi, Y., Hattori, J., Fukuda, K., & Mori, T. (2025) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/ade214
Efficient Quantum Computing to Solve Case Studies in Science and Engineering
Donaire, L. M., Ortega, G., & Orts, F. J. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-90203-1_43
Wang, P., Yang, X., Wu, C.-W., Li, C.-Y., Wu, W., & Chen, P.-X. (2025) · Physical Review A · doi:10.1103/79nd-mr7f · Cited by 3
Optimizing a Quantum BCD Adder in Terms of T-Gates and CNOT Gates
Donaire, L. M., Ortega, G., Orts, F. J., & Garzón, E. M. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-90200-0_6
Variational Quantum Eigensolver for Classification in Distributed Data Sets
Wiśniewska, J., & Sawerwain, M. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-90200-0_4
Raj, G. K. R. G. K. (2025) · Journal of Software Engineering and Simulation · doi:10.35629/3795-11051521
Meng, X., Shi, X., Liu, M., et al. (2025) · New Journal of Chemistry · doi:10.1039/d5nj01540e
Systematical study of effects of chip parameters and control waveforms on fidelity of CZ gate
Shi, W., Yan, Z., Jie, H., Yongjin, Y., Yang, J., & Yongzheng, W. (2025) · Acta Physica Sinica · doi:10.7498/aps.74.20250108
Scalable quantum simulations of molecular systems via improved optimization of neural quantum states
Zhang, G.-Z., Huang, J.-C., Ye, L., Li, J., & Hu, H. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0269200 · Cited by 1
On the fidelity estimation for Entanglement Distribution Protocols
Z., L. A. G., Bassoli, R., & Fitzek, F. H. P. (2024) · IEEE Future Networks World Forum (FNWF) · doi:10.1109/fnwf63303.2024.11028712
Qiskit-Based Simulation of Quantum Attacks Against RSA Encryption
Kayode, B. F. (2025) · International Journal of Latest Technology in Engineering Management & Applied Science · doi:10.51583/ijltemas.2025.140500061
Solving the Ising Problem by Noisy Quantum Genetic Algorithms
Acampora, G., Minolfi, G., & Schiattarella, R. (2025) · doi:10.1109/mcii64973.2025.11032994
Genetic Algorithm-based QAOA Training improved with Fuzzy Clustering
Acampora, G., Chiatto, A., & Vitiello, A. (2025) · doi:10.1109/mcii64973.2025.11032773
Tan, K. C., Liu, D., Bharti, K., Bhowmick, D., & Sengupta, P. (2025) · Physical review. B./Physical review. B · doi:10.1103/gydb-9jt2
Catalyzing Aerospace Progress Machine Learning Strategies for Emerging Economics
Paul, S., & Das, D. (2025) · IGI Global eBooks · doi:10.4018/979-8-3693-7525-9.ch009
Simulating the Unruh Effect on Real Quantum HardwarePreprint
Ahmed, Z. (2025) · SSRN Electronic Journal · doi:10.21203/rs.3.rs-6911166/v1
Zhang, J., & Tian, Z. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04812-8 · Cited by 1
Universal Graph Theory Operations for Graph State Preparation
Cam, T., Gavoille, C., Borgne, Y. L., & Martiel, S. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-97063-4_5 · Cited by 1
Pattern-Based Generation and Adaptation of Quantum Workflows
Beisel, M., Barzen, J., Leymann, F., Stiliadou, L., Vietz, D., & Weder, B. (2025) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse55347.2025.00196 · Cited by 1
Hybrid classical-quantum computation of heat diffusion in multilayer materialsPreprint
Moradi, S. (2025) · Research Square · doi:10.21203/rs.3.rs-6887498/v1
Quantum Technologies and Cybersecurity in Economy and Industry: Further Research
Rivas, G., Rodríguez-Almazán, A., Falcó, D., Valdeolmillos, D., & Alonso, R. S. (2025) · Quantum Economics and Finance · doi:10.1177/29767032251340690
Exact analytic toolbox for quantum dynamics with tunable noise strength
Okyay, M., Hart, O., Nandkishore, R., & Friedman, A. J. (2025) · Physical Review A · doi:10.1103/qqb7-h7xf · Cited by 1
Swiftn: Accelerating Quantum Circuit Simulation Through Tensor Optimization
Kim, S., Kim, C., Sim, A., Wu, K. J., Tang, H., & Kim, S. (2025) · IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) · doi:10.1109/ccgrid64434.2025.00022
Modulation of Quantum Features of a Driven Two-Level System via a rf Field
Sun, S., Meng, X., & Cai, X.-J. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0013
Rahmati, M. (2025) · InPrime Indonesian Journal of Pure and Applied Mathematics · doi:10.15408/inprime.v7i1.44960
Rossi, I., & Petrova, E. (2025) · International Journal of Intelligent Data and Machine Learning · doi:10.55640/ijidml-v02i06-01 · Cited by 1
Bridging Quantum Level Paradigm and Business Management
Cuomo, M. T., & Foroudi, P. (2025) · Big and integrated artificial intelligence · doi:10.1007/978-3-031-92052-3_1 · Cited by 1
Suthar, N., Kumar, D., & Joshi, A. (2025) · IGI Global eBooks · doi:10.4018/979-8-3693-4030-1.ch024 · Cited by 2
QUDA: quantum distributed adder algorithm
Catrina, S.-A., Guţoiu, R. A., Tănăsescu, A., & Popescu, P. G. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00387-6
Kim, S., & Shin, D. (2025) · Journal of computational fluids engineering · doi:10.6112/kscfe.2025.30.2.001
Dynamics of nonlocality in bipartite quantum systems subjected to global noise environment
Kong, F., & Zhao, J. (2025) · Laser Physics Letters · doi:10.1088/1612-202x/adeb58
Quantum Enhanced Convolutional Neural Networks for Breast Cancer Classification
Deep, P. C. N., Akhila, N., & Hemanth, P. (2025) · International Conference on Data Science and Information System (ICDSIS) · doi:10.1109/icdsis65355.2025.11071099
Learning Feedback Mechanisms for Measurement-Based Variational Quantum State Preparation
Puente, D. A., & Rizzi, M. (2025) · Quantum · doi:10.22331/q-2025-07-11-1792 · Cited by 6
Quantum Communication Stability and the Evolution of Local Quantum Uncertainty under Noisy Channels
Li, H. (2025) · International Symposium on Computer Technology and Information Science (ISCTIS) · doi:10.1109/isctis65944.2025.11065340
AdaptDQC: Adaptive Distributed Quantum Computing With Quantitative Performance Analysis
Xiang, D., Lu, L., Tan, S., Jia, X., Zhou, Z., Sun, G., Chen, M., & Yin, J. (2025) · IEEE Transactions on Computers · doi:10.1109/tc.2025.3586027 · Cited by 7
Quantum Circuit Optimization for Protein Structure Prediction
Li, X., Kulkarni, V. R., Nana, J., Pu, S., Xie, N., Guan, Q., Li, R., Zhang, S., Xu, S., Blankenberg, D. J., et al. (2025) · International Conference on Dependable Systems and Networks workshops · doi:10.1109/dsn-w65791.2025.00065 · Cited by 1
On-chip microwave coherent source with in-situ control of the photon number distribution
Mastrovito, P., Ahmad, H. G., Porzio, A., Esposito, M., Massarotti, D., & Tafuri, F. (2025) · Communications Physics · doi:10.1038/s42005-025-02219-6 · Cited by 1
A Variational Quantum Classifier for predictive analysis in industrial production
Angelino, A., Landolfi, E., Massa, A. A., & Troiano, A. (2025) · Internet of Things · doi:10.1016/j.iot.2025.101695 · Cited by 4
POPQC: Parallel Optimization for Quantum Circuits
Liu, P., Arora, J., Xu, M., & Acar, U. A. (2025) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/3694906.3743325 · Cited by 3
Revealing Quantum Information Encoded in Classical Images
Ainelkitane, O., Recktenwall-Calvet, B., Iqbal, A., & Kuhn, C. C. N. (2026) · Knowledge · doi:10.3390/knowledge6020012
Secure and efficient quantum signature scheme based on the controlled unitary operations encryption
Ghosh, D., Roy, S., Bagchi, P., Chakrabarty, I., & Das, A. K. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04843-1
Variational quantum algorithms on cat-state qubits
Bornens, A.-S., & Nowak, M. (2025) · Physical Review A · doi:10.1103/l7lq-tmfd · Cited by 6
Seidel, T., Leib, D., Awasthi, A., Bortz, M., & Heese, R. (2025) · Lecture notes in operations research · doi:10.1007/978-3-031-58405-3_19
Quantum optimization techniques and applications
Lee, E., & Kim, S. (2025) · Advances in computers · doi:10.1016/bs.adcom.2025.06.001 · Cited by 1
Quantum Serverless paradigm and application development using the QFaaS framework
Nguyen, H. T., Pham, B. B. A., Usman, M., & Buyya, R. (2025) · Elsevier eBooks · doi:10.1016/b978-0-443-29096-1.00002-7 · Cited by 2
Quantum generative classification with mixed states
Useche, D. H., Quiroga-Sandoval, S., Díaz, S. L. L. M., Vargas-Calderón, V., Ardila-García, J. E., & Gonzalez, F. A. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adf350 · Cited by 1
Quantum computing and Artificial Intelligence: Toward a new computational paradigmPreprint
Fatunmbi, T. O. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5355156
Makraini, M. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5351521
Comparative Analysis of Robust Entanglement Generation in Engineered XX Spin Chains
Soares, E. K., Neto, G. D. D. M., & Andrade, F. M. (2025) · Entropy · doi:10.3390/e27070764 · Cited by 1
Meckel, M., Hacker, P., Steinacker, L., Lukoševičienė, A., Soekadar, S. R., Slosser, J. L., & Pöhlmann, G. (2025) · Quantum Economics and Finance · doi:10.1177/29767032251363962
Neural Distribution Correction and Anomaly Detection for Noisy Entanglement in the E91 ProtocolPreprint
Gauba, A. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5373284
Quantum information chemistry: Exploring non-local entanglement phenomena
Olea, R. O. E. (2025) · Suplemento de la Revista Mexicana de Física · doi:10.31349/suplrevmexfis.6.011313
Rochin, F. C. (2025) · Revista Multidisciplinar Epistemología de las Ciencias · doi:10.71112/dmmjg615
Partial blind quantum computation: a framework for selective circuit protection
Lee, Y., & Chung, D. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04865-9 · Cited by 6
1958 Quantum-Supported UAV Environmental Sensing
Vemulapalli, R. (2025) · De Gruyter eBooks · doi:10.1515/9783111619323-008
The Applications of Quantum Chips in RoboticsPreprint
Yarlagadda, H. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5354846
Entanglement entropy scaling laws from fluctuations of nonconserved quantities
Głodzik, S., Moghaddam, A. G., Pöyhönen, K., & Ojanen, T. (2025) · Physical review. B./Physical review. B · doi:10.1103/msq9-w6hv
Quantum Machine Learning (QML)
Natarajan, V. (2025) · Springer eBooks · doi:10.1007/978-981-96-5051-4_5
Huffman-Code-Based Ternary Tree Transformation
Li, Q., Liu, H., Wang, Q., Wu, Y.-C., & Guo, G. (2025) · Chinese Physics Letters · doi:10.1088/0256-307x/42/10/100001 · Cited by 2
HUANG, 黄. J.-D., QIAN, 钱. Y., LU, 陆. J., & YAN, 延. Y. (2024) · Acta Sinica Quantum Optica · doi:10.3788/jqo20243004.0103
On a quantum-inspired kernel for classifying protein torsion anglesPreprint
Malik, A. J., & Ascher, D. B. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.08.05.668681
Fast numerical solver of Ising optimization problems via pruning and domain selection
Li, L., Dong, D., & Pan, Y. (2025) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2025.107945 · Cited by 2
Simplificação de Multiplexadores Quânticos para Compilação de Software Quântico
de Carvalho, J. A., & da Silva, A. J. (2025) · Revista Eletrônica de Iniciação Científica em Computação · doi:10.5753/reic.2025.6055
Quantome: A Quantum Surrogate Model for Biophysical LandscapesPreprint
Malik, A. J., & Ascher, D. B. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.08.06.668871
Hilbert Space Theory and Its Implementation in Quantum Computing SystemsPreprint
Keçeci, M. (2025) · doi:10.24108/preprints-3113653
Noncontextual Pauli Hamiltonians
Ralli, A., Weaving, T., & Love, P. J. (2025) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/adf677
Reconfiguring Staggered Quantum Walks with ZX
Jardim, B., Santos, J., & Barbosa, L. S. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-94748-3_10
Transforming machine learning: An exploration of quantum algorithms and their applications
Pawan, Y. V. R. N., & Kolla, B. P. (2025) · Advances in computers · doi:10.1016/bs.adcom.2025.06.005 · Cited by 2
Analysis of Quantum Phase Estimation Algorithm Using Quantum Fourier Transform
Sharma, P., Zafar, R., & Sharma, A. K. (2025) · Lecture notes in electrical engineering · doi:10.1007/978-981-96-3644-0_21
Scalable and low-power reversible logic for future devices: QCA and IBM-based gate realization
Ahmadpour, S., Navimipour, N. J., Zohaib, M., et al. (2025) · Sustainable Computing Informatics and Systems · doi:10.1016/j.suscom.2025.101182
Quantum Delta Encoding: Optimizing Data Storage on Quantum Computers with Resource Efficiency
Zhang, J., Che, X., Fan, Y., & Hu, J. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-99872-0_8
331Chapter 14 Design and deployment of a quantum algorithm on cloud
Morapakula, S. N. (2025) · De Gruyter eBooks · doi:10.1515/9783111264349-014
203Chapter 8 Quantum computing and blind computing for secure futuristic networks
Dua, A., Aseri, V., Slimani, K., Patel, S., & Singh, A. (2025) · De Gruyter eBooks · doi:10.1515/9783111264349-008
273Chapter 11 Quantum security in 6G networks
Krishna, K., & Pathak, P. (2025) · De Gruyter eBooks · doi:10.1515/9783111264349-011
Technologies Related to Quantum Computing and Its Uses: An Overview
Gupta, D. N. (2025) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijarsct-23099
Data-centric Approach of Macroscopic Physical System with NISQ Quantum Computers
Lee, J., Cho, J., Jung, H., Lee, E., Lee, S., Choi, Y., & Kim, S. (2025) · IEEE International Conference on Data Engineering Workshops (ICDEW) · doi:10.1109/icdew67478.2025.00043
Jansen, N. D., & Hunt, K. L. C. (2025) · Entropy · doi:10.3390/e27090891 · Cited by 1
AI and Quantum Computing: The Future of Financial Modeling and Risk Assessment
Bhati, S., Thareja, R., & Sharma, S. (2025) · Information systems engineering and management · doi:10.1007/978-3-031-92916-8_21 · Cited by 3
Briegel, H. J., & Müller, T. (2025) · Synthese Library/Synthese library · doi:10.1007/978-3-031-98119-7_5
Lee, D., & Ryu, H. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00961 · 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.