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 2,901–3,000 of 8,640
Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures
Escofet, P., Gonzalvo, A., Alarcón, E., Almudéver, C. G., & Abadal, S. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00110 · Cited by 27
PO-QA: A Framework for Portfolio Optimization using Quantum Algorithms
Zaman, K., Marchisio, A., Kashif, M., & Shafique, M. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00166 · Cited by 12
Utilizing Resource Estimation for the Development of Quantum Computing Applications
Quetschlich, N., Soeken, M., Murali, P., & Wille, R. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00036 · Cited by 22
Applying an Evolutionary Algorithm to Minimize Teleportation Costs in Distributed Quantum Computing
Sünkel, L., Dawar, M., & Gabor, T. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10272 · Cited by 12
Reinforcement learning-based architecture search for quantum machine learning
Rapp, F., Kreplin, D. A., Huber, M. F., & Roth, M. (2025) · Machine Learning Science and Technology · doi:10.1088/2632-2153/adaf75 · Cited by 16
Comparative study of quantum error correction strategies for the heavy-hexagonal lattice
Benito, C., López, E., Peropadre, B., & Bermúdez, A. (2025) · Quantum · doi:10.22331/q-2025-02-06-1623 · Cited by 37
Lim, S., Vaganov, M. V., Liu, J., & Ardavan, A. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.070603 · Cited by 22
Optimizing Gate Decomposition for High-Level Quantum Programming
Rosa, E. C. R., Duzzioni, E. I., & de Santiago, R. (2025) · Quantum · doi:10.22331/q-2025-03-12-1659 · Cited by 27
Meunier, T., Daval, N., Perruchot, F., & Vinet, M. (2025) · The European Physical Journal A · doi:10.1140/epja/s10050-025-01514-8 · Cited by 15
Potential of quantum machine learning for processing multispectral Earth observation data
Gupta, M. K., Romaszewski, M., & Gawron, P. (2025) · Bulletin of the Polish Academy of Sciences Technical Sciences · doi:10.24425/bpasts.2025.154279 · Cited by 23
Savadatti, S. G., Cherukuri, A. K., Jonnalagadda, A., & Vasilakos, A. V. (2025) · Complex & Intelligent Systems · doi:10.1007/s40747-025-01851-7 · Cited by 19
Ahmed, S., Shihab, I. F., & Khokhar, A. (2025) · Measurement Digitalization · doi:10.1016/j.meadig.2025.100005 · Cited by 29
Quantum computing for space applications: a selective review and perspectives
Torta, P., Casati, R., Bruni, S., Mandarino, A., & Prati, E. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00369-8 · Cited by 20
Memory-augmented hybrid quantum reservoir computing
Settino, J., Salatino, L., Mariani, L., D’Amore, F., Channab, M., Bozzolo, L., Vallisa, S., Barillà, P., Policicchio, A., Gullo, N. L., et al. (2025) · Physical Review Applied · doi:10.1103/wzwv-7rk2 · Cited by 27
Taghavi, M., & Farnoosh, R. (2025) · Iran Journal of Computer Science · doi:10.1007/s42044-025-00306-z · Cited by 24
Opportunities and challenges of quantum computing for climate modeling
Schwabe, M., Pastori, L., de Vega, I., Gentine, P., Iapichino, L., Lahtinen, V., Leib, M., Lorenz, J. M., & Eyring, V. (2025) · Environmental Data Science · doi:10.1017/eds.2025.10010 · Cited by 23
Quantum computing quantum Monte Carlo algorithm
Zhang, Y., Huang, Y., Sun, J., Lv, D., & Yuan, X. (2025) · Physical Review A · doi:10.1103/jt8s-hzhd · Cited by 36
Optimising trotter-suzuki decompositions for quantum simulation using evolutionary strategies
Jones, B. D. M., White, D. R., O'Brien, G. O., Clark, J. A., & Campbell, E. T. (2019) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3321707.3321835 · Cited by 29
Ge, Y., & Dunjko, V. (2020) · Journal of Mathematical Physics · doi:10.1063/1.5119235 · Cited by 12
One-way Transfer of Quantum States via Decoherence
Matsuzaki, Y., Bastidas, V. M., Takeuchi, Y., Munro, W. J., & Saito, S. (2020) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.89.044003 · Cited by 15
An updated LLVM-based quantum research compiler with further OpenQASM support
Litteken, A., Fan, Y.-C., Singh, D., Martonosi, M., & Chong, F. T. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8c2c · Cited by 28
Incoherent quantum algorithm dynamics of an open system with near-term devices
Mahdian, M., & Yeganeh, H. D. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02800-8 · Cited by 14
Eliminating Redundant Computation in Noisy Quantum Computing Simulation
Li, G., Ding, Y., & Xie, Y. (2020) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18072.2020.9218666 · Cited by 17
Efficient assessment of process fidelity
Greenaway, S., Sauvage, F., Khosla, K. E., & Mintert, F. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033031 · Cited by 20
A Cationic Oligomer as an Organic Template for Direct Synthesis of Aluminosilicate ITH Zeolite
López, A. R., Carocci, S., Martin, T., Molinari, A., Alexander, J., Martínez, P., Bianchi, G., Feller, L., Bernardi, P., Conte, E., et al. (2014) · DIGITAL.CSIC (Spanish National Research Council (CSIC)) · doi:10.13039/501100000781 · Cited by 15
Vietz, D., Barzen, J., Leymann, F., & Wild, K. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77980-1_10 · Cited by 26
Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
Wang, D., Wang, Y.-J., Cao, N., Zeng, B., & Laflamme, R. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac4737 · Cited by 13
Depth-efficient proofs of quantumness
Liu, Z., & Gheorghiu, A. (2022) · Quantum · doi:10.22331/q-2022-09-19-807 · Cited by 30
Hybrid quantum-classical algorithms: Foundation, design and applications
Chen, R.-Y.-L., Zhao, B., Song, Z., Zhao, X., Wang, K., & Wang, X. (2021) · Acta Physica Sinica · doi:10.7498/aps.70.20210985 · Cited by 16
i -QER: An Intelligent Approach Towards Quantum Error Reduction
Basu, S., Saha, A., Chakrabarti, A., & Sur‐Kolay, S. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3539613 · Cited by 21
Mitigating Crosstalk in Quantum Computers through Commutativity-Based Instruction Reordering
Xie, L., Zhai, J., & Zheng, W. (2021) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18074.2021.9586145 · Cited by 21
Quantum-inspired evolutionary algorithms on continuous space multiobjective problems
Olvera, C., Montiel, O., & Rubio, Y. (2022) · Soft Computing · doi:10.1007/s00500-022-06916-0 · Cited by 13
Mitigation of Routing Congestion on Data Networks: A Quantum Game Theory Approach
Silva, A., Zabaleta, O. G., & Arizmendi, C. M. (2022) · Quantum Reports · doi:10.3390/quantum4020010 · Cited by 12
Search space pruning for quantum architecture search
He, Z., Su, J., Chen, C., Pan, M., & Situ, H. (2022) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-022-02714-7 · Cited by 16
A Multiscale Simulation Approach for Germanium-Hole-Based Quantum Processor
Wu, T., & Guo, J. H. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2022.3166107 · Cited by 11
Complementarity between success probability and coherence in Grover search algorithm
Pan, M., Situ, H., & Zheng, S. (2022) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/ac7165 · Cited by 12
Leveraging randomized compiling for the quantum imaginary-time-evolution algorithm
Ville, J.-L., Morvan, A., Hashim, A., Naik, R., Lu, M., Mitchell, B., Kreikebaum, J. M., O’Brien, K. P., Wallman, J. J., Hincks, I., et al. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033140 · Cited by 38
Estimating the randomness of quantum circuit ensembles up to 50 qubits
Liu, M., Liu, J., Alexeev, Y., & Jiang, L. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00648-7 · Cited by 19
Probing Phases of Quantum Matter with an Ion-Trap Tensor-Network Quantum Eigensolver
Meth, M., Kuzmin, V., van Bijnen, R., Postler, L., Stricker, R., Blatt, R., Ringbauer, M., Monz, T., Silvi, P., & Schindler, P. (2022) · Physical Review X · doi:10.1103/physrevx.12.041035 · Cited by 22
Decohering tensor network quantum machine learning models
Liao, H., Convy, I., Yang, Z., & Whaley, K. B. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00095-9 · Cited by 16
Parasitic-Free Gate: An Error-Protected Cross-Resonance Switch in Weakly Tunable Architectures
Xu, X., & Ansari, M. H. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.024057 · Cited by 23
Excited-state molecular dynamics simulation based on variational quantum algorithms
Hirai, H. (2023) · Chemical Physics Letters · doi:10.1016/j.cplett.2023.140404 · Cited by 14
Avkhadiev, A., Shanahan, P. E., & Young, R. D. (2023) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.107.054507 · Cited by 14
Robust measurement of wave function topology on NISQ quantum computers
Xiao, X., Freericks, J. K., & Kemper, A. F. (2023) · Quantum · doi:10.22331/q-2023-04-27-987 · Cited by 22
Deep learning optimal quantum annealing schedules for random Ising models
Hegde, P. R., Passarelli, G., Cantele, G., & Lucignano, P. (2023) · New Journal of Physics · doi:10.1088/1367-2630/ace547 · Cited by 17
Quantum circuit compilation for nearest-neighbor architecture based on reinforcement learning
Li, Y., Liu, W., Li, M., & Li, Y. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04050-w · Cited by 18
Discrimination of Quantum States Under Locality Constraints in the Many-Copy Setting
Cheng, H., Winter, A., & Yu, N. (2023) · Communications in Mathematical Physics · doi:10.1007/s00220-023-04836-0 · Cited by 19
Universality classes of thermalization for mesoscopic Floquet systems
Morningstar, A., Huse, D. A., & Khemani, V. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.174303 · Cited by 16
Quantum Vulnerability Analysis to Guide Robust Quantum Computing System Design
Qi, F., Smith, K. N., LeCompte, T., Tzeng, N.-F., Yuan, X., Chong, F. T., & Peng, L. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3343625 · Cited by 23
P, S. S., & Divya, S. (2023) · International Conference on Quantum Technologies, Communications, Computing, Hardware and Embedded Systems Security (iQ-CCHESS) · doi:10.1109/iq-cchess56596.2023.10391714 · Cited by 20
Analyzing variational quantum landscapes with information content
Pérez-Salinas, A., Wang, H., & Bonet-Monroig, X. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00819-8 · Cited by 25
Topological defects in Floquet circuits
Tan, M. T., Wang, Y., & Mitra, A. (2024) · SciPost Physics · doi:10.21468/scipostphys.16.3.075 · Cited by 19
Preti, F., Schilling, M., Jerbi, S., Trenkwalder, L. M., Nautrup, H. P., Motzoi, F., & Briegel, H. J. (2024) · Quantum · doi:10.22331/q-2024-05-14-1343 · Cited by 23
AI-Powered Risk Modeling in Quantum Finance : Redefining Enterprise Decision Systems
Dixit, S. (2022) · International Journal of Scientific Research in Science Engineering and Technology · doi:10.32628/ijsrset221656 · Cited by 26
Multiple-shot and unambiguous discrimination of von Neumann measurements
Puchała, Z., Pawela, Ł., Krawiec, A., Kukulski, R., & Oszmaniec, M. (2021) · Quantum · doi:10.22331/q-2021-04-06-425 · Cited by 23
Near-term quantum-classical associative adversarial networks
Anschuetz, E. R., & Zanoci, C. (2019) · Physical Review A · doi:10.1103/physreva.100.052327 · Cited by 18
On the Computational Viability of Quantum Optimization for PMU Placement
Jones, E. B., Kapit, E., Chang, C.-Y., Biagioni, D., Vaidhynathan, D., Graf, P. A., & Jones, W. B. (2020) · IEEE Power Engineering Society General Meeting · doi:10.1109/pesgm41954.2020.9281420 · Cited by 22
Entanglement dynamics in dispersive optomechanics: Nonclassicality and revival
Brandão, I., Suassuna, B. B., Melo, B., & Guerreiro, T. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043421 · Cited by 14
A quantum circuit simulator and its applications on Sunway TaihuLight supercomputer
Wang, Z., Chen, Z., Wang, S., Li, W., Gu, Y., Guo, G., & Wei, Z. (2021) · Scientific Reports · doi:10.1038/s41598-020-79777-y · Cited by 18
Fast computation of spherical phase-space functions of quantum many-body states
Koczor, B., Zeier, R., & Glaser, S. J. (2020) · Physical Review A · doi:10.1103/physreva.102.062421 · Cited by 13
Qubits’ mapping and routing for NISQ on variability of quantum gates
Li, Z., Meng, F., Zhang, Z., & Yu, X. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02873-5 · Cited by 13
A continuous variable Born machine
Čepaitė, I., Coyle, B., & Kashefi, E. (2022) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00063-3 · Cited by 22
Quantifying the Difference between Many-Body Quantum States
Girolami, D., & Anzà, F. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.170502 · Cited by 14
Stochastic Quantum Circuit Simulation Using Decision Diagrams
Grurl, T., Kueng, R., FuB, J., & Wille, R. (2021) · Design, Automation, and Test in Europe · doi:10.23919/date51398.2021.9474135 · Cited by 15
Sugisaki, K., Toyota, K., Sato, K., Shiomi, D., & Takui, T. (2021) · Chemical Science · doi:10.1039/d0sc04847j · Cited by 17
Ultimate limits of thermal pattern recognition
Harney, C., Banchi, L., & Pirandola, S. (2021) · Physical Review A · doi:10.1103/physreva.103.052406 · Cited by 14
Hartmann, A., Mbeng, G. B., & Lechner, W. (2022) · Physical Review A · doi:10.1103/physreva.105.022614 · Cited by 15
Supervised Learning Enhanced Quantum Circuit Transformation
Zhou, X., Feng, Y., & Li, S. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2022.3179223 · Cited by 18
Finding Solutions to the Integer Case Constraint Satisfiability Problem Using Grover’s Algorithm
Vinod, G. M., & Shaji, A. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3120449 · Cited by 17
Quantum anonymous notification for network-based applications
Khan, A., Rehman, J. U., & Shin, H. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03339-y · Cited by 16
Quantum pattern recognition algorithms for charged particle tracking
Gray, H. M. (2021) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0103 · Cited by 14
Complex natural gradient optimization for optical quantum circuit design
Yao, Y., Cussenot, P., Wolf, R. A., & Miatto, F. M. (2022) · Physical Review A · doi:10.1103/physreva.105.052402 · Cited by 14
Applications of universal parity quantum computation
Fellner, M., Messinger, A., Ender, K., & Lechner, W. (2022) · Physical Review A · doi:10.1103/physreva.106.042442 · Cited by 22
Characterizing Error Mitigation by Symmetry Verification in QAOA
Kakkar, A., Larson, J. M., Galda, A., & Shaydulin, R. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00086 · Cited by 20
Ikeda, K. (2023) · Quantum Information Processing · doi:10.1007/s11128-022-03806-0 · Cited by 14
Ever more optimized simulations of fermionic systems on a quantum computer
Wang, Q., Cian, Z.-P., Li, M., Markov, I. L., & Nam, Y. (2023) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac56929.2023.10247693 · Cited by 14
Herbert, S., & Sengupta, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.11619 · Cited by 46
Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum AlgorithmsPreprint
Oh, Y.-H., Mohammadbagherpoor, H., Dreher, P., Singh, A., Yu, X., & Rindos, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.00595 · Cited by 33
Challenges in Scaling-up the Control Interface of a Quantum ComputerPreprint
Reilly, D. J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.05114 · Cited by 12
Avoiding local minima in Variational Quantum Algorithms with Neural NetworksPreprint
Rivera-Dean, J., Huembeli, P., Acín, A., & Bowles, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.02955 · Cited by 43
(2020) · doi:10.1109/ises50453.2020.00015 · Cited by 12
Classification and reconstruction of optical quantum states with deep neural networks
Ahmed, S., Muñoz, C. S., Nori, F., & Kockum, A. F. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033278 · Cited by 119
Variational quantum algorithms for trace distance and fidelity estimation
Chen, R., Song, Z., Zhao, X., & Wang, X. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac38ba · Cited by 87
Adaptive neural network for quantum error mitigation
Adeniyi, T. B., & Kumar, S. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00234-4 · Cited by 21
Quantum machine learning early opportunities for the energy industry: a scoping review
Strata, F., Migliori, L., Gebran, N., Guarino, N., Colombo, G. C., Pezzuolo, S., & Luzietti, E. (2025) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2025.1653104 · Cited by 18
Efficient Preparation of Dicke States
Yu, J., Muleady, S. R., Wang, Y.-X., Schine, N., Gorshkov, A. V., & Childs, A. M. (2026) · Physical Review Letters · doi:10.1103/9gjk-rgql · Cited by 46
Resource estimations for the Hamiltonian simulation in correlated electron materials
Kanno, S., Endo, S., Utsumi, T., & Tada, T. (2022) · Physical Review A · doi:10.1103/physreva.106.012612 · Cited by 11
Evaluation of vibrational energies and wave functions of CO2 on a quantum computer
Lötstedt, E., Yamanouchi, K., & Tachikawa, Y. (2022) · AVS Quantum Science · doi:10.1116/5.0091144 · Cited by 12
Adaptive Problem Solving Dynamics in Gate-Model Quantum Computers
Gyöngyösi, L. (2022) · Entropy · doi:10.3390/e24091196 · Cited by 14
Quantum Computing Meets Artificial Intelligence: Innovations and Challenges
Metawei, M. A., ElDeeb, H. E., Nassar, S. M., & Taher, M. (2022) · Artificial intelligence-enhanced software and systems engineering · doi:10.1007/978-3-031-08202-3_12 · Cited by 13
Training Variational Quantum Circuits through Genetic Algorithms
Acampora, G., Chiatto, A., & Vitiello, A. (2022) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec55065.2022.9870242 · Cited by 19
Long-Range Bell States from Local Measurements and Many-Body Teleportation without Time Reversal
Agarwal, L., Langlett, C. M., & Xu, S. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.020801 · Cited by 17
UniQ: A Unified Programming Model for Efficient Quantum Circuit Simulation
Zhang, C., Wang, H., Ma, Z., Xie, L., Song, Z., & Zhai, J. (2022) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41404.2022.00054 · Cited by 25
Shirai, S., Iwakiri, H., Kanno, K., Horiba, T., Omiya, K., Hirai, H., & Koh, S. (2023) · ACS Omega · doi:10.1021/acsomega.3c01875 · Cited by 15
Alomari, A., & Kumar, S. (2023) · IEEE Cognitive Communications for Aerospace Applications Workshop (CCAAW) · doi:10.1109/ccaaw57883.2023.10219316 · Cited by 12
Quantum approximate optimization algorithm parameter prediction using a convolutional neural network
Xie, N., Lee, X., Cai, D., Saito, Y., & Asai, N. (2023) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2595/1/012001 · Cited by 17
Grain size in low loss superconducting Ta thin films on c axis sapphire
Jones, S. G., Materise, N., Leung, C. K. W., Weber, J. C., Isakov, B. D., Chen, X., Zheng, J., Gyenis, A., Jäck, B., & McRae, C. R. (2023) · Journal of Applied Physics · doi:10.1063/5.0169391 · Cited by 14
Quantum computing with trapped ions: a beginner’s guide
Bernardini, F., Chakraborty, A., & ORDÓÑEZ, C. R. (2023) · European Journal of Physics · doi:10.1088/1361-6404/ad06be · Cited by 31
Matsuo, A., Suzuki, Y., Hamamura, I., & Yamashita, S. (2023) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2023edp7071 · Cited by 28
Can shallow quantum circuits scramble local noise into global white noise?
Foldager, J., & Koczor, B. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad0ac7 · Cited by 19
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.