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 4,201–4,300 of 8,640
Arresting quantum chaos dynamically in transmon arrays
Mukherjee, R., Guo, H., Lewellen, K., & Chowdhury, D. (2025) · Newton · doi:10.1016/j.newton.2025.100011 · Cited by 5
Entanglement estimation of Werner states with a quantum extreme learning machine
Assil, H., Allati, A. E., & Giorgi, G. L. (2025) · Physical Review A · doi:10.1103/physreva.111.022412 · Cited by 11
Qubit Movement-Optimized Program Generation on Zoned Neutral Atom Processors
Jang, E., Kim, Y., Kim, H., Choi, S., Huang, Y.-P., & Ro, W. (2025) · IEEE/ACM International Symposium on Code Generation and Optimization · doi:10.1145/3696443.3708937 · Cited by 11
Exponential optimization of adiabatic quantum-state preparation
Cugini, D., Nigro, D., Bruno, M., & Gerace, D. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.l012074 · Cited by 6
Li, Y.-Z., Liu, W., Xu, G., Li, M., Chen, K., & He, S.-L. (2025) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2025.101923 · Cited by 7
Finding Key Nodes in Complex Networks Through Quantum Deep Reinforcement Learning
Xiong, J., Ren, X.-L., & Lü, L. (2025) · Entropy · doi:10.3390/e27040382 · Cited by 7
QEKLR: quantum-enhanced kernel logistic regression for classification
Misra, S., & Rani, P. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07266-y · Cited by 6
The travelling salesperson problem and the challenges of near-term quantum advantage
Smith‐Miles, K., Hoos, H. H., Wang, H., Bäck, T., & Osborne, T. J. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/add61d · Cited by 19
Exact Decoding of Quantum Error-Correcting Codes
Cao, H., Zhao, S. J., Feng, D., Shen, Z., Yan, H., Su, T., Sun, W., Xu, H., Pan, F. P., Yu, H., et al. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.190603 · Cited by 21
Comparison of encoding schemes for quantum computing of S > 1 / 2 spin chains
Lötstedt, E., & Yamanouchi, K. (2025) · Physical Review A · doi:10.1103/7mvy-zq7j · Cited by 6
Quantum graph learning and algorithms applied in quantum computer sciences and image classification
Shayeganfar, F., Ramazani, A., Sundararaghavan, V., & Duan, Y. (2025) · Applied Physics Reviews · doi:10.1063/5.0237599 · Cited by 11
Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search
Lipardi, V., Dibenedetto, D., Stamoulis, G., & Winands, M. H. M. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500093 · Cited by 13
Error-Corrected Fermionic Quantum Processors with Neutral Atoms
Ott, R., González-Cuadra, D., Zache, T. V., Zoller, P., Kaufman, A. M., & Pichler, H. (2025) · Physical Review Letters · doi:10.1103/zkpl-hh28 · Cited by 27
Computation-efficient quantum convolutional neural networks for autonomous driving applications
Roh, E. J., Im, C., Jeong, W., & Park, S. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07507-0 · Cited by 7
Construction of Chemistry-Inspired Dynamic Ansatz Utilizing Generative Machine Learning
Halder, S., Anand, K., & Maitra, R. (2025) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.5c02346 · Cited by 9
Exploring Chemical Space with Chemistry-Inspired Dynamic Quantum Circuits in the NISQ Era
Chen, L.-Y., Li, T.-Y., Li, Y., Chen, N.-Y., & You, F. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00305 · Cited by 7
QD-MSA : A quantum distributed tensor network framework for multimodal sentiment analysis
Li, Y., Li, Y., Qi, Z., Yang, H., Shang, R., & Jiao, L. (2025) · Information Fusion · doi:10.1016/j.inffus.2025.103404 · Cited by 8
Industrial progress with quantum algorithms: an in-depth review
Sood, S. K., Singh, M., & Bhatia, M. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07555-6 · Cited by 9
A universal circuit set using the S3 quantum double
Chen, L., Ren, Y., Fan, R., & Jaffe, A. M. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01063-4 · Cited by 21
Designing quantum error correction codes for practical spin qudit systems
Lim, S., & Ardavan, A. (2025) · Physical Review A · doi:10.1103/7q6l-d4qh · Cited by 9
Envisioning responsible quantum software engineering and quantum artificial intelligence
Bano, M., Ali, S., & Zowghi, D. (2025) · Automated Software Engineering · doi:10.1007/s10515-025-00541-5 · Cited by 11
ATP: Adaptive Threshold Pruning for Efficient Data Encoding in Quantum Neural Networks
Afane, M., Ebbrecht, G., Wang, Y. N., Chen, J., & Farooq, J. (2025) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr52734.2025.01902 · Cited by 10
Maio, V. D., Brandić, I., Deelman, E., & Cito, J. (2025) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/3696630.3731623 · Cited by 6
A Review on Models and Applications of Quantum Computing
Grigoryan, E., Kumar, S., & Pinheiro, P. R. (2025) · Quantum Reports · doi:10.3390/quantum7030039 · Cited by 14
Bernal, D. E., Brown, R., Sathe, P., Wudarski, F., Pavone, M., Rieffel, E. G., & Venturelli, D. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00311-2 · Cited by 22
Quantum Computing for Transport Network Optimization
Ju, J., Liu, Z., Bai, Y., Wang, Y., Gao, Q., Ma, Y., Zheng, C., & Wen, K. (2025) · Entropy · doi:10.3390/e27090953 · Cited by 8
Relaxation Control of Open Quantum Systems
Beato, N., & Teza, G. (2026) · Physical Review Letters · doi:10.1103/4frd-ck2z · Cited by 46
Bosonic quantum error correction using squeezed Fock states
Bashmakova, E. N., Korolev, S. B., & Golubeva, T. Y. (2025) · Physical Review A · doi:10.1103/97yt-nzg2 · Cited by 8
Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning
Zen, R. A. M., Ollé, J., Colmenárez, L., Puviani, M. B., Müller, M., & Marquardt, F. (2025) · Physical Review X · doi:10.1103/gqpr-dgz7 · Cited by 58
Engineering bosonic codes with quantum lattice gates
Guo, L., Huang, T., & Du, L. (2025) · Communications Physics · doi:10.1038/s42005-025-02354-0 · Cited by 10
An Introduction to Variational Quantum Eigensolver Applied to Chemistry
Fonseca, M. D. S., Porto, C. M., Carpio, N. A. C., Morais, G. D., Morgon, N. H., Nome, R. A., & Villas-Bôas, C. J. (2025) · Brazilian Journal of Physics · doi:10.1007/s13538-025-01892-w · Cited by 7
A hybrid quantum-classical approach for liver disease detection using quantum machine learning
Donaire, L. M., Ortega, G., Orts, F. J., Garzón, E. M., & Filatovas, E. (2025) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2025.113240 · Cited by 9
Mohith, V., & Sakthivel, R. (2025) · Results in Engineering · doi:10.1016/j.rineng.2025.108460 · Cited by 14
Flow to Nishimori Universality in Weakly Monitored Quantum Circuits with Qubit Loss
Pütz, M., Vasseur, R., Ludwig, A. W. W., Trebst, S., & Zhu, G.-Y. (2025) · PRX Quantum · doi:10.1103/ygfz-crvp · Cited by 25
Towards quantum computing enhanced general computational homogenization without readout problem
Xu, Y., Kuang, Z., Li, L., Huang, Q., Yang, J., Huang, K., Wang, Z., Fan, H., & Hu, H. (2026) · International Journal of Mechanical Sciences · doi:10.1016/j.ijmecsci.2026.111214 · Cited by 11
Physics-informed neural networks in clean combustion: A pathway to sustainable aerospace propulsion
Mousavi, M., Caldwell, C., Baltes, J., Parizad, F. A., Aljasem, M., Lee, B. J., & Karimi, N. (2026) · Chemical Engineering Research and Design · doi:10.1016/j.cherd.2026.01.008 · Cited by 11
Kumar, S., Singh, S. S., Bathla, G., Sharma, S., & Chahal, M. (2026) · Information Fusion · doi:10.1016/j.inffus.2026.104159 · Cited by 12
Gomez-Tejedor, A., Osaba, E., & Villar-Rodríguez, E. (2026) · Future Generation Computer Systems · doi:10.1016/j.future.2026.108481 · Cited by 17
Quantum generative adversarial networks for learning and loading quantum image in noisy environment
Ren, W., Li, Z., Huang, Y., Guo, R., Feng, L., Li, H., Li, Y., & Li, X. (2021) · Modern Physics Letters B · doi:10.1142/s0217984921503607 · Cited by 5
Zhang, K., & Zhang, J. (2022) · Optik · doi:10.1016/j.ijleo.2022.169756 · Cited by 5
Experimental Boson Sampling Enabling Cryptographic One-Way Function
Wang, X., Zhou, W.-H., Fu, Y.-X., Gao, J., Lu, Y., Chang, Y.-J., Qiao, L., Ren, R.-J., Jiang, Z.-K., Jiao, Z., et al. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.060802 · Cited by 9
A backdoor attack against quantum neural networks with limited information
Huang, C.-Y., & 张, S.-B. 仕. Z. (2023) · Chinese Physics B · doi:10.1088/1674-1056/acd8ab · Cited by 11
Slysz, M., Kurowski, K., Waligóra, G., & Węglarz, J. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-36030-5_15 · Cited by 10
Quantum-Enhanced Control of a Tandem Queue System
Stamatiou, G. T., & Magoutis, K. (2024) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-031-48885-6_7 · Cited by 5
Kernel Approximation on a Quantum Annealer for Remote Sensing Regression Tasks
Pasetto, E., Riedel, M., Michielsen, K. F. L., & Cavallaro, G. (2024) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2024.3350385 · Cited by 5
A Quick Overview of Quantum Machine Learning
Jiang, J. (2023) · IEEE Eurasia Conference on IOT, Communication and Engineering (ECICE) · doi:10.1109/ecice59523.2023.10383149 · Cited by 8
Díez-Valle, P., Porras, D., & García‐Ripoll, J. J. (2024) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2024.1321264 · Cited by 14
On the optimality of quantum circuit initial mapping using reinforcement learning
Amer, N. E., Gomaa, W. E., Kimura, K. R., Ueda, K., & El-Mahdy, A. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00225-1 · Cited by 9
Improved Quantum Approximate Optimization Algorithm for Low‐Density Parity‐Check Channel Decoding
Zeng, H., Meng, F., Luan, T., Yu, X., & Zhang, Z. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300262 · Cited by 6
Meta-optimization of resources on quantum computers
Mohammad, I. A., Pivoluska, M., & Plesch, M. (2024) · Scientific Reports · doi:10.1038/s41598-024-59618-y · Cited by 10
Machine learning of reduced quantum channels on noisy intermediate-scale quantum devices
Cemin, G., Cech, M., Weiss, E., Sołtan, S., Braun, D., Lesanovsky, I., & Carollo, F. (2024) · Physical Review A · doi:10.1103/physreva.110.052418 · Cited by 16
Majorization-based benchmark of the complexity of quantum processors
Tacla, A. B., O'Neill, N. M., Carlo, G. G., de Melo, F., & Vallejos, R. O. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04457-z · Cited by 8
Decompositions of multiple controlled- Z gates on various qubit-coupling graphs
Nakanishi, K. M., Satoh, T., & Todo, S. (2024) · Physical Review A · doi:10.1103/physreva.110.012604 · Cited by 8
Accelerated Decay due to Operator Spreading in Bulk-Dissipated Quantum Systems
Shirai, T., & Mori, T. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.040201 · Cited by 11
Hybrid Quantum Annealing with Innovative Trend Ratio Model for Portfolio Optimization
Chou, Y., Wu, C.-H., Huang, P.-S., Kuo, S., Jiang, Y.-C., Kuo, S., & Chang, C. (2024) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec60901.2024.10612069 · Cited by 7
Quantum Software Quality Metrics
Cruz-Lemus, J. A., Rodríguez, M., Barba-Rojas, R., & Piattini, M. G. (2024) · Springer eBooks · doi:10.1007/978-3-031-64136-7_6 · Cited by 10
Hybrid Quantum Classical Machine Learning with Knowledge Distillation
Li, M., Fan, L., Cummings, A., Zhang, X., Pan, M., & Han, Z. (2024) · International Conference on Communications · doi:10.1109/icc51166.2024.10622755 · Cited by 12
Linear Decomposition of Approximate Multicontrolled Single Qubit Gates
Silva, J. D. S., Azevedo, T. M. D., Araujo, I. F., & da Silva, A. J. (2024) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2024.3471905 · Cited by 9
Quantum circuit generation for amplitude encoding using a transformer decoder
Daimon, S., & Matsushita, Y. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.l041001 · Cited by 15
Explainable Quantum Neural Networks: Example-Based and Feature-Based Methods
Tian, J., & Yang, W. (2024) · Electronics · doi:10.3390/electronics13204136 · Cited by 10
Inverted-circuit zero-noise extrapolation for quantum-gate error mitigation
Koenig, K. F., Reinecke, F., Hahn, W., & Wellens, T. (2024) · Physical Review A · doi:10.1103/physreva.110.042625 · Cited by 22
Hamiltonian learning using machine-learning models trained with continuous measurements
Tucker, K., Rege, A. K., Smith, C., Monteleoni, C., & Albash, T. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.044080 · Cited by 11
Molecular electronic structure calculation via a quantum computer
Naeij, H. R., Mahmoudi, E., Yeganeh, H. D., & Akbari, M. (2024) · Computational and Theoretical Chemistry · doi:10.1016/j.comptc.2024.114945 · Cited by 12
Simulating the Landau–Zener sweep in deeply sub-Ohmic environments
Kahlert, F., Link, V., Hartmann, R., & Strunz, W. T. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0235741 · Cited by 15
Adaptive denoising quantum state preparation in a dynamic environment
Wang, Z.-M., & Chen, T.-Z. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043195 · Cited by 7
Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms
Ha, Y., Shashaani, S., & Menickelly, M. (2024) · INFORMS journal on computing · doi:10.1287/ijoc.2024.0575 · Cited by 6
Full band-structure calculation of semiconducting materials on a noisy quantum processor
Zhang, S., Karim, A., Quiney, H. M., & Usman, M. (2024) · Physical Review A · doi:10.1103/physreva.110.062415 · Cited by 8
Profiling quantum circuits for their efficient execution on single- and multi-core architectures
Bandić, M., le Henaff, P., Ovide, A., Escofet, P., Rached, S. B., Rodrigo, S., van Someren, H., Abadal, S., Alarcón, E., Almudéver, C. G., et al. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ada180 · Cited by 15
Measurement-induced phase transition in state estimation of chaotic systems and the directed polymer
Gerbino, F., Giachetti, G., Doussal, P. L., et al. (2025) · Physical Review Research · doi:10.1103/6375-8ncz · Cited by 5
Leveraging Zero-Level Distillation to Generate High-Fidelity Magic States
Hirano, Y., Itogawa, T., & Fujii, K. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00104 · Cited by 29
Enhancing quantum approximate optimization with CNN-CVaR integration
Cai, P., Shen, K., Yang, T., Hu, Y., Lv, B., Fan, L., Liu, Z., Hu, Q., Chen, S., Zhu, Y., et al. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04655-3 · Cited by 6
Generating Shuttling Procedures for Constrained Silicon Quantum Dot Array
Sato, N., Sekiguchi, T., Utsugi, T., & Mizuno, H. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3542462 · Cited by 6
A Power Transformer Fault Diagnosis Method Based on Improved Variational Quantum Shadow Learning
He, H., Yu, J., Lee, W., Luo, D., & Liang, W. (2025) · IEEE Transactions on Power Delivery · doi:10.1109/tpwrd.2025.3546722 · Cited by 7
From Problem to Solution: A General Pipeline to Solve Optimisation Problems on Quantum Hardware
Rohe, T., Grätz, S., Kölle, M., Zielinski, S., Stein, J., & Linnhoff–Popien, C. (2025) · Lecture notes in networks and systems · doi:10.1007/978-3-031-84460-7_2 · Cited by 11
Microwave-activated two-qubit gates for fixed-coupling and fixed-frequency transmon qubits
Jiang, L., Xu, P., Wu, S., Sun, J., & Dou, F.-Q. (2025) · Physical Review A · doi:10.1103/physreva.111.032609 · Cited by 9
Quantum Algorithms for the Pathwise Lasso
Doriguello, J. F., Lim, D., Pun, C. S., Rebentrost, P., & Vaidya, T. S. (2025) · Quantum · doi:10.22331/q-2025-03-25-1674 · Cited by 10
NRQNN: The Role of Observable Selection in Noise-Resilient Quantum Neural Networks
Kashif, M., & Shafique, M. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-85884-0_10 · Cited by 14
Sobhani, M., Chai, Y., Hartung, T., & Jansen, K. (2025) · Physical Review A · doi:10.1103/physreva.111.042413 · Cited by 13
Design of an efficient fault-tolerant quantum-computing circuit with quantum neural network learning
Lin, C., Xu, R., & Li, Y. (2025) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2025.110808 · Cited by 9
A quantum neural network-based approach to power quality disturbances detection and recognition
Li, G., He, H., Li, Y., Li, X., Liu, H., Wang, Q., & Cheng, L. (2025) · Physica Scripta · doi:10.1088/1402-4896/adda9e · Cited by 16
Sentiment-Enhanced Recommendation Systems: Understanding Emotional Influence in Consumer Behavior
Jagan, S., Girirajan, B., Mane, M. B., B, H. J. R., Anil, M., & Rani, M. T. (2025) · International Journal of Computational and Experimental Science and Engineering · doi:10.22399/ijcesen.2493 · Cited by 5
Tightly-integrated quantum–classical computing using the QHDL hardware description language
Netzer, G., Hegde, P. R., Peng, I. B., & Markidis, S. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107977 · Cited by 5
Simple high-saturation-power quantum-limited rf-SQUID-array-based Josephson parametric amplifiers
Kaufman, R., Liu, C., Cicak, K., et al. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.24.014052 · Cited by 5
Multireference error mitigation for quantum computation of chemistry
Zou, H., Magnusson, E., Brunander, H., Dobrautz, W., & Rahm, M. (2025) · Digital Discovery · doi:10.1039/d5dd00202h · Cited by 12
Multipartite Entanglement Structure of Monitored Quantum Circuits
Lira-Solanilla, A., Turkeshi, X., & Pappalardi, S. (2025) · Physical Review Letters · doi:10.1103/fl34-h1p1 · Cited by 17
V.Karlatthe, B., Choudhari, J. S., Adsure, S., Kale, D. R., Lilhare, S. G., & Dange, A. S. (2025) · International Conference on Information, Implementation, and Innovation in Technology (I2ITCON) · doi:10.1109/i2itcon65200.2025.11210757 · Cited by 6
Limitations of noisy quantum devices in computing and entangling power
Yan, Y., Du, Z., Chen, J., & Ma, X. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01136-4 · Cited by 25
Boson Sampling Enhanced Quantum Chemistry
Shang, Z.-X., Zhang, Y., Zhong, H.-S., Yu, C., Yuan, X., Lu, C., Pan, J.-W., & Chen, M.-C. (2025) · PRX Quantum · doi:10.1103/gw1c-5b58 · Cited by 12
Quantum long short-term memory for drug discovery
Zhang, L., Xu, Y., Wu, M., Wang, L., & Xu, H. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00467-1 · Cited by 13
Minimal time robust control for two superconducting qubits
George, N., Allen, J. L., Kosut, R. L., & Ginossar, E. (2025) · Scientific Reports · doi:10.1038/s41598-025-32747-8 · Cited by 11
One Additional Qubit is Enough: Encoded Embeddings for Boolean Components in Quantum Circuits
Zulehner, A., Niemann, P., Drechsler, R., & Wille, R. (2019) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2019.00009 · Cited by 7
Hybrid Helmholtz machines: a gate-based quantum circuit implementation
van Dam, T. J., Neumann, N. M. P., Phillipson, F., & van den Berg, H. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02660-2 · Cited by 10
Engineering a Cost Function for Real-world Implementation of a Variational Quantum Algorithm
Premaratne, S., & Matsuura, A. Y. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00042 · Cited by 9
Estimation of correlations and nonseparability in quantum channels via unitarity benchmarking
Girling, M., Cîrstoiu, C., & Jennings, D. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023041 · Cited by 5
“Therefore, detection and quantification of noise correlations such as crostalk in quantum devices not only impacts NISQ era devices [11] by improving circuit fidelities and error mitigation methods but goes beyond it in providing necessary tools to test physical assumptions of quantum error correction.”
MethodApplication of Quantum Generative Adversarial Learning in Quantum Image Processing
Ren, W., Li, Z., Li, H., Li, Y., Zhang, C., & Fu, X. (2020) · International Conference on Information Technology and Computer Application (ITCA) · doi:10.1109/itca52113.2020.00104 · Cited by 6
Wu, Q., Filzinger, M., Shi, Y., Wang, Z., & Zhang, J. (2021) · Review of Scientific Instruments · doi:10.1063/5.0044372 · Cited by 7
Using Genetic Improvement to Retarget quantum Software on Differing Hardware
O'Brien, G. O., & Clark, J. A. (2021) · IEEE/ACM International Workshop on Genetic Improvement (GI) · doi:10.1109/gi52543.2021.00015 · Cited by 4
Current Advances in Information Quantum Technologies – Critical Issues
Nałęcz-Charkiewicz, K., Meles, J., Rzesa, W., Wojciechowski, A. A., Warchulski, E., Kania, K., Stypułkowska, J. S., Fluder, G., & Romaniuk, R. S. (2021) · International Journal of Electronics and Telecommunications · doi:10.24425/ijet.2021.137839 · Cited by 5
Efficient Parabolic Optimisation Algorithm for Adaptive VQE Implementations
Armaos, V., Badounas, D. A., Deligiannis, P., Lianos, K., & Yordanov, Y. S. (2022) · SN Computer Science · doi:10.1007/s42979-022-01346-z · Cited by 7
On the dissipative dynamics of entangled states in coupled-cavity quantum electrodynamics arrays
Mirza, I. M., & Cruz, A. S. (2021) · Journal of the Optical Society of America B · doi:10.1364/josab.441224 · Cited by 5
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.