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 1,701–1,800 of 8,640
An exact qubit allocation approach for NISQ architectures
Zhu, P., Cheng, X., & Guan, Z. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02901-4 · Cited by 34
Millikelvin temperature cryo-CMOS multiplexer for scalable quantum device characterisation
Potočnik, A., Brebels, S., Verjauw, J., Acharya, R., Grill, A., Wan, D., Mongillo, M., Li, R., Ivanov, T., Winckel, S. V., et al. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac29a1 · Cited by 31
Benfenati, F., Mazzola, G., Capecci, C., Barkoutsos, P. K., Ollitrault, P. J., Tavernelli, I., & Guidoni, L. (2021) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c00091 · Cited by 41
Mizuta, K., Fujii, M., Fujii, S., Ichikawa, K., Imamura, Y., Okuno, Y., & Nakagawa, Y. O. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.043121 · Cited by 29
Quantum imaginary time evolution steered by reinforcement learning
Cao, C., An, Z., Hou, S., Zhou, D. L., & Zeng, B. (2022) · Communications Physics · doi:10.1038/s42005-022-00837-y · Cited by 34
LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States
Vinkhuijzen, L., Coopmans, T. J., Elkouss, D., Dunjko, V., & Laarman, A. (2023) · Quantum · doi:10.22331/q-2023-09-11-1108 · Cited by 58
Quantum criticality using a superconducting quantum processor
Dupont, M., & Moore, J. E. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.l041109 · Cited by 36
Quantum Scheduling for Millimeter-Wave Observation Satellite Constellation
Kim, J., Kwak, Y., Jung, S., & Kim, J. (2021) · IEEE VTS Asia Pacific Wireless Communications Symposium (APWCS) · doi:10.1109/apwcs50173.2021.9548770 · Cited by 28
Patterns for Hybrid Quantum Algorithms
Weigold, M., Barzen, J., Leymann, F., & Vietz, D. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-87568-8_2 · Cited by 38
Omiya, K., Nakagawa, Y. O., Koh, S., Mizukami, W., Gao, Q., & Kobayashi, T. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c00877 · Cited by 43
An Evaluation of Hardware-Efficient Quantum Neural Networks for Image Data Classification
Nguyen, T., Paik, I., Watanobe, Y., & Thang, T. C. (2022) · Electronics · doi:10.3390/electronics11030437 · Cited by 36
Abah, O., Chiara, G. D., Paternostro, M., & Puebla, R. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.l022017 · Cited by 31
Learning quantum dynamics with latent neural ordinary differential equations
Choi, M., Flam-Shepherd, D., Kyaw, T. H., & Aspuru‐Guzik, A. (2022) · Physical Review A · doi:10.1103/physreva.105.042403 · Cited by 39
Quantum time dynamics employing the Yang-Baxter equation for circuit compression
Peng, B., Gulania, S., Alexeev, Y., & Govind, N. (2022) · Physical Review A · doi:10.1103/physreva.106.012412 · Cited by 38
Noisy-Intermediate-Scale Quantum Electromagnetic Transients Program
Zhou, Y., Zhang, P., & Feng, F. (2022) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2022.3172655 · Cited by 29
Uncovering instabilities in variational-quantum deep Q-networks
Franz, M., Wolf, L., Periyasamy, M., Ufrecht, C., Scherer, D. D., Plinge, A., Mutschler, C., & Mauerer, W. (2023) · Journal of the Franklin Institute · doi:10.1016/j.jfranklin.2022.08.021 · Cited by 26
Securing Reset Operations in NISQ Quantum Computers
Mi, A., Deng, S., & Szefer, J. M. (2022) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3548606.3559380 · Cited by 32
Fast High-Fidelity Gates for Galvanically-Coupled Fluxonium Qubits Using Strong Flux Modulation
Weiss, D., Zhang, H., Ding, C., Ma, Y., Schuster, D., & Koch, J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040336 · Cited by 33
Variational quantum one-class classifier
Park, G., Huh, J., & Park, D. K. (2023) · Machine Learning Science and Technology · doi:10.1088/2632-2153/acafd5 · Cited by 42
Low-Depth Hamiltonian Simulation by an Adaptive Product Formula
Zhang, Z., Sun, J., Yuan, X., & Yung, M. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.040601 · Cited by 48
Gradient-Descent Quantum Process Tomography by Learning Kraus Operators
Ahmed, S., Quijandría, F., & Kockum, A. F. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.150402 · Cited by 54
Research Trends in Quantum Computers by Focusing on Qubits as Their Building Blocks
Dejpasand, M. T., & Ghamsari, M. S. (2023) · Quantum Reports · doi:10.3390/quantum5030039 · Cited by 37
Noisy gates for simulating quantum computers
Bartolomeo, G. D., Vischi, M., Cesa, F., Wixinger, R., Grossi, M., Donadi, S., & Bassi, A. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043210 · Cited by 41
Warm-Starting and Quantum Computing: A Systematic Mapping Study
Truger, F., Barzen, J., Bechtold, M., Beisel, M., Leymann, F., Mandl, A., & Yussupov, V. (2024) · ACM Computing Surveys · doi:10.1145/3652510 · Cited by 51
Individual control and readout of qubits in a sub-diffraction volume
Bersin, E. A., Walsh, M. E., Mouradian, S., Trusheim, M. E., Schröder, T., & Englund, D. R. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0154-y · Cited by 29
Principled network reliability approximation: A counting-based approach
Paredes, R., Dueñas‐Osorio, L., Meel, K. S., & Vardi, M. Y. (2019) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2019.04.025 · Cited by 33
Modeling and control of a reconfigurable photonic circuit using deep learning
Youssry, A., Chapman, R. J., Peruzzo, A., Ferrie, C., & Tomamichel, M. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab60de · Cited by 41
Variational quantum policies for reinforcement learning.Preprint
Jerbi, S., Gyurik, C., Marshall, S., Briegel, H. J., & Dunjko, V. (2021) · arXiv (Cornell University) · Cited by 34
Demonstration of Breast Cancer Detection Using QSVM on IBM Quantum ProcessorsPreprint
Shan, Z., Guo, J., Ding, X., Zhou, X., Wang, J., Lian, H., Gao, Y., Zhao, B., & Xu, J. (2022) · Research Square · doi:10.21203/rs.3.rs-1434074/v1 · Cited by 33
A review of Quantum Neural Networks: Methods, Models, Dilemma
Zhao, R., & Wang, S. (2021) · arXiv · doi:10.48550/arxiv.2109.01840 · Cited by 26
Quantum error mitigation by Pauli check sandwiching
Gonzales, A., Shaydulin, R., Saleem, Z. H., & Suchara, M. (2023) · Scientific Reports · doi:10.1038/s41598-023-28109-x · Cited by 26
“Thus, these techniques are ideal for the noisy intermediate-scale quantum (NISQ) era [16] because current state-of-the-art NISQ devices contain few qubits, typically fewer than 50, and a limited number of gate operations because of fast decoherence times.”
MethodLow-depth Hamiltonian Simulation by Adaptive Product Formula
Zhang, Z.-J., Sun, J., Yuan, X., & Yung, M.-H. (2020) · arXiv · doi:10.48550/arxiv.2011.05283 · Cited by 26
QCEC: A JKQ tool for quantum circuit equivalence checking
Burgholzer, L., & Wille, R. (2020) · Software Impacts · doi:10.1016/j.simpa.2020.100051 · Cited by 37
Spin–Lattice Relaxation Decoherence Suppression in Vanishing Orbital Angular Momentum Qubits
Buch, C. D., Kundu, K., Marbey, J., van Tol, J., Weihe, H., Hill, S., & Piligkos, S. (2022) · Journal of the American Chemical Society · doi:10.1021/jacs.2c07057 · Cited by 28
Peham, T., Burgholzer, L., & Wille, R. (2023) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/3566097.3567932 · Cited by 45
Nofer, M., Bauer, K., Hinz, O. F., van der Aalst, W. M. P., & Weinhardt, C. (2023) · Business & Information Systems Engineering · doi:10.1007/s12599-023-00823-w · Cited by 34
Quantum kernel estimation-based quantum support vector regression
Zhou, X., Yu, J., Tan, J., & Jiang, T. (2024) · Quantum Information Processing · doi:10.1007/s11128-023-04231-7 · Cited by 39
NISQ Quantum Computing: A Security-Centric Tutorial and Survey [Feature]
Chen, F., Jiang, L., Müller, H. A., Richerme, P., Chu, C., Fu, Z., & Min, Y. (2024) · IEEE Circuits and Systems Magazine · doi:10.1109/mcas.2024.3349665 · Cited by 43
Characterization of entanglement on superconducting quantum computers of up to 414 qubits
Kam, J. F., Kang, H., Hill, C. D., Mooney, G. J., & Hollenberg, L. C. L. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033155 · Cited by 42
Engineered dissipation to mitigate barren plateaus
Sannia, A., Tacchino, F., Tavernelli, I., Giorgi, G. L., & Zambrini, R. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00875-0 · Cited by 59
Quantum-inspired genetic algorithm for designing planar multilayer photonic structure
Xu, Z., Shang, W., Kim, S., Bobbitt, A., Lee, E., & Luo, T. (2024) · npj Computational Materials · doi:10.1038/s41524-024-01438-9 · Cited by 35
Scalable quantum convolutional neural network for image classification
Sun, Y., Li, D., Xiang, Q., Yuan, Y., Hu, Z., Hua, X., Jiang, Y., Zhu, Y., & Fu, Y. (2024) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2024.130226 · Cited by 41
Vasile, C.-E., Ulmamei, A., & Bîră, C. (2024) · Journal of Imaging · doi:10.3390/jimaging10120298 · Cited by 42
Survey of Quantum Generative Adversarial Networks (QGAN) to Generate Images
Pajuhanfard, M., Kiani, R., & Sheng, V. S. (2024) · Mathematics · doi:10.3390/math12233852 · Cited by 32
A Comprehensive Survey on GenAI-Enabled 6G: Technologies, Challenges, and Future Research Avenues
Sheraz, M., Chuah, T. C., Tareen, W. U. K., Al-Habashna, A., Saeed, S. I., Ahmed, M., Lee, I. E., & Guizani, M. (2025) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2025.3568496 · Cited by 38
Pathak, A., Theagarajan, R., Rizqi, M. M., Nugraha, A. S., Boruah, T., Pratiksha, Kumar, H., Naik, B., Yadav, S., Jha, A. K., et al. (2025) · Discover Molecules · doi:10.1007/s44345-025-00037-5 · Cited by 44
Switchable Next-Nearest-Neighbor Coupling for Controlled Two-Qubit Operations
Zhao, P., Xu, P., Lan, D., Tan, X., Yu, H., & Yu, Y. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.064016 · Cited by 25
Two quantum Ising algorithms for the shortest-vector problem
Joseph, D., Callison, A., Ling, C., & Mintert, F. (2021) · Physical Review A · doi:10.1103/physreva.103.032433 · Cited by 33
Just Like the Real Thing: Fast Weak Simulation of Quantum Computation
Hillmich, S., Markov, I. L., & Wille, R. (2020) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18072.2020.9218555 · Cited by 38
Cappelletti, W., Erbanni, R., & Keller, J. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00013 · Cited by 29
Approaches to Constrained Quantum Approximate Optimization
Saleem, Z. H., Tomesh, T., Tariq, B., & Suchara, M. (2023) · SN Computer Science · doi:10.1007/s42979-022-01638-4 · Cited by 40
Quantum-enhanced barcode decoding and pattern recognition
Banchi, L., Zhuang, Q., & Pirandola, S. (2020) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 25
Qubit Routing Using Graph Neural Network Aided Monte Carlo Tree Search
Sinha, A., Azad, U., & Singh, H. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i9.21231 · Cited by 44
Phase polynomials synthesis algorithms for NISQ architectures and beyond
Vandaele, V., Martiel, S., & de Brugière, T. G. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac5a0e · Cited by 54
Adiabatic theorem revisited: The unexpectedly good performance of adiabatic passage
Benseny, A., & Mølmer, K. (2021) · Physical Review A · doi:10.1103/physreva.103.062215 · Cited by 30
An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation
Camps, D., Kökcü, E., Oftelie, L. B., de Jong, W. A., Kemper, A. F., & Beeumen, R. V. (2022) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/21m1439298 · Cited by 45
Variational quantum packaged deflation for arbitrary excited states
Wen, J., Lv, D., Yung, M., & Long, G. (2021) · Quantum Engineering · doi:10.1002/que2.80 · Cited by 32
Counterdiabatic control in the impulse regime
Carolan, E., Kiely, A., & Campbell, S. (2022) · Physical Review A · doi:10.1103/physreva.105.012605 · Cited by 25
A Quantum-Classical Hybrid Method for Image Classification and Segmentation
Pramanik, S., Chandra, M. G., Sridhar, C. V., Kulkarni, A., Sahoo, P. R., Vishwa, C. D. V., Sharma, H., Navelkar, V., Poojary, S., Shah, P., et al. (2022) · IEEE/ACM Symposium on Edge Computing (SEC) · doi:10.1109/sec54971.2022.00068 · Cited by 33
Single shot i-Toffoli gate in dispersively coupled superconducting qubits
Baker, A. J., Huber, G. B. P., Glaser, N. J., Roy, F., Tsitsilin, I., Filipp, S., & Hartmann, M. J. (2022) · Applied Physics Letters · doi:10.1063/5.0077443 · Cited by 34
Quantum computational phase transition in combinatorial problems
Zhang, B., Sone, A., & Zhuang, Q. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00596-2 · Cited by 43
Born machine model based on matrix product state quantum circuit
Gong, L., Xiang, L.-Z., Liu, S., & Zhou, N. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.126907 · Cited by 29
Qubit Regularization and Qubit Embedding Algebras
Liu, H., & Chandrasekharan, S. (2022) · Symmetry · doi:10.3390/sym14020305 · Cited by 36
Tannu, S., Das, P., Ayanzadeh, R., & Qureshi, M. K. (2022) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3503222.3507703 · Cited by 38
Universal Parity Quantum Computing
Fellner, M., Messinger, A., Ender, K., & Lechner, W. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.180503 · Cited by 42
An overview of quantum error mitigation formulas
Qin, D., Xu, X., & Li, Y. (2022) · Chinese Physics B · doi:10.1088/1674-1056/ac7b1e · Cited by 40
QPlayer: Lightweight, scalable, and fast quantum simulator
Jin, K., & Cha, G. (2022) · ETRI Journal · doi:10.4218/etrij.2021-0442 · Cited by 26
Quantum-Inspired Power System Reliability Assessment
Nikmehr, N., & Zhang, P. (2022) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2022.3204393 · Cited by 45
Quantum simulation with just-in-time compilation
Efthymiou, S., Lazzarin, M., Pasquale, A., & Carrazza, S. (2022) · Quantum · doi:10.22331/q-2022-09-22-814 · Cited by 43
Mancilla, J., & Père, C. (2022) · Entropy · doi:10.3390/e24111656 · Cited by 40
Training Variational Quantum Circuits with CoVaR: Covariance Root Finding with Classical Shadows
Boyd, G., & Koczor, B. (2022) · Physical Review X · doi:10.1103/physrevx.12.041022 · Cited by 52
Solving DC power flow problems using quantum and hybrid algorithms
Gao, F., Wu, G., Guo, S., Dai, W., & Shuang, F. (2023) · Applied Soft Computing · doi:10.1016/j.asoc.2023.110147 · Cited by 36
Experimental Simulation of Larger Quantum Circuits with Fewer Superconducting Qubits
Ying, C., Cheng, B., Zhao, Y., Huang, H.-L., Zhang, Y.-N., Gong, M., Wu, Y., Wang, S., Liang, F., Lin, J., et al. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.110601 · Cited by 40
Measurement Noise Susceptibility in Quantum Estimation
Kurdziałek, S., & Demkowicz-Dobrzański, R. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.160802 · Cited by 30
Constructing Optimal Bushy Join Trees by Solving QUBO Problems on Quantum Hardware and Simulators
Nayak, N., Rehfeld, J., Winker, T., Warnke, B., Çalıkyılmaz, U., & Groppe, S. (2023) · International Workshop on Big Data in Emergent Distributed Environments (BiDEDE) · doi:10.1145/3579142.3594298 · Cited by 46
Quantum computing for power systems: Tutorial, review, challenges, and prospects
Liu, H., & Tang, W. (2023) · Electric Power Systems Research · doi:10.1016/j.epsr.2023.109530 · Cited by 39
Two Algorithms for Excited-State Quantum Solvers: Theory and Application to EOM-UCCSD
Kim, Y., & Krylov, A. I. (2023) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.3c02480 · Cited by 29
Quantum-Inspired Spectral-Spatial Pyramid Network for Hyperspectral Image Classification
Zhang, J., Zhang, Y., & Zhou, Y. (2023) · 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/cvpr52729.2023.00957 · Cited by 32
An Empirical Comparison of Optimizers for Quantum Machine Learning with SPSA-Based Gradients
Wiedmann, M., Hölle, M., Periyasamy, M., Meyer, N., Ufrecht, C., Scherer, D. D., Plinge, A., & Mutschler, C. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00058 · Cited by 48
Exploiting the Quantum Advantage for Satellite Image Processing: Review and Assessment
Otgonbaatar, S., & Kranzlmüller, D. A. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3338970 · Cited by 39
Rydberg Platform for Nonergodic Chiral Quantum Dynamics
Valencia-Tortora, R. J., Pancotti, N., Fleischhauer, M., Bernien, H., & Marino, J. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.223201 · Cited by 35
Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix
Caro, M. C. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3670418 · Cited by 68
Controlling error orientation to improve quantum algorithm success rates
Murphy, D. C., & Brown, K. R. (2019) · Physical Review A · doi:10.1103/physreva.99.032318 · Cited by 30
Quantum Accelerated Computer Architectures
Riesebos, L., Fu, X., Mouedenne, A. A., Lao, L., Varsamopoulos, S., Ashraf, I., van Someren, J., Khammassi, N., Almudéver, C. G., & Bertels, K. (2019) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2019.8702488 · Cited by 31
Quantum Divide and Compute: Hardware Demonstrations and Noisy Simulations
Ayral, T., Régent, F.-M. L., Saleem, Z. H., Alexeev, Y., & Suchara, M. (2020) · IEEE Computer Society Annual Symposium on VLSI · doi:10.1109/isvlsi49217.2020.00034 · Cited by 41
DisQ: a novel quantum output state classification method on IBM quantum computers using openpulse
Patel, T., & Tiwari, D. (2020) · doi:10.1145/3400302.3415619 · Cited by 29
Tailoring the excited-state energy landscape in supramolecular nanostructures
Kreger, K., Schmidt, H., & Hildner, R. (2021) · Electronic Structure · doi:10.1088/2516-1075/abf485 · Cited by 25
Efficient classical simulation of noisy quantum computationPreprint
Gao, X., & Duan, L. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.03176 · Cited by 108
Chaos and Complexity from Quantum Neural Network: A study with Diffusion Metric in Machine Learning
Choudhury, S., Dutta, A., & Ray, D. (n.d.) · MPG.PuRe (Max Planck Society) · Cited by 22
Robust and efficient verification of graph states in blind measurement-based quantum computation
Li, Z., Zhu, H., & Hayashi, M. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00783-9 · Cited by 28
The barren plateaus of quantum neural networks: review, taxonomy and trends
Qi, H., Wang, L., Zhu, H., Gani, A., & Gong, C. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04188-7 · Cited by 42
In‐Network Quantum Computing for Future 6G Networks
Urgelles, H., Maheshwari, S., Nande, S. S., Bassoli, R., Fitzek, F. H. P., & Monserrat, J. F. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300334 · Cited by 41
Mesoscopic ultrafast nonlinear optics—the emergence of multimode quantum non-Gaussian physics
Yanagimoto, R., Ng, E., Jankowski, M., Nehra, R., McKenna, T. P., Onodera, T., Wright, L. G., Hamerly, R., Marandi, A., Fejer, M. M., et al. (2024) · Optica · doi:10.1364/optica.514075 · Cited by 41
Hamiltonian quantum generative adversarial networks
Kim, L., Lloyd, S., & Marvian, M. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033019 · Cited by 32
Information processing at the speed of light
AbuGhanem, M. (2024) · Frontiers of Optoelectronics · doi:10.1007/s12200-024-00133-3 · Cited by 35
Qiskit Code Assistant: Training LLMs for generating Quantum Computing Code
Dupuis, N., Buratti, L., Vishwakarma, S., Forrat, A. V., Kremer, D., Faro, I., Puri, R., & Cruz-Benito, J. (2024) · IEEE LLM Aided Design Workshop (LAD) · doi:10.1109/lad62341.2024.10691762 · Cited by 61
Extending the computational reach of a superconducting qutrit processor
Goss, N., Ferracin, S., Hashim, A., Carignan-Dugas, A., Kreikebaum, J. M., Naik, R., Santiago, D., & Siddiqi, I. A. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00892-z · Cited by 58
Long-lived topological time-crystalline order on a quantum processor
Xiang, L., Jiang, W., Bao, Z., Song, Z., Xu, S., Wang, K., Chen, J., Jin, F., Zhu, X., Zhu, Z., et al. (2024) · Nature Communications · doi:10.1038/s41467-024-53077-9 · Cited by 41
Quantum annealing-assisted lattice optimization
Xu, Z., Shang, W., Kim, S., Lee, E., & Luo, T. (2025) · npj Computational Materials · doi:10.1038/s41524-024-01505-1 · Cited by 41
A Quantum-Enhanced Artificial Neural Network Model for Efficient Medical Image Compression
Subbiyan, B., Renjith, P. N., Leelasankar, K., Rajavel, R., Malarvel, M., & Shankar, A. (2025) · IEEE Access · doi:10.1109/access.2025.3542807 · Cited by 29
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.