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 801–900 of 8,640
A Domain-agnostic, Noise-resistant, Hardware-efficient Evolutionary Variational Quantum Eigensolver
Rattew, A. G., Hu, S., Pistoia, M., Chen, R., & Wood, S. (2019) · arXiv · doi:10.48550/arxiv.1910.09694 · Cited by 59
Simultaneous Execution of Quantum Circuits on Current and Near-Future NISQ Systems
Ohkura, Y., Satoh, T., & Meter, R. V. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3164716 · Cited by 82
Schetakis, N. A., Aghamalyan, D., Griffin, P., & Boguslavsky, M. (2022) · Scientific Reports · doi:10.1038/s41598-022-14876-6 · Cited by 94
Illa, M., & Savage, M. J. (2022) · Physical Review A · doi:10.1103/physreva.106.052605 · Cited by 79
Avoiding barren plateaus via transferability of smooth solutions in a Hamiltonian variational ansatz
Mele, A. A., Mbeng, G. B., Santoro, G. E., Collura, M., & Torta, P. (2022) · Physical Review A · doi:10.1103/physreva.106.l060401 · Cited by 96
Experimental Realization of Two Qutrits Gate with Tunable Coupling in Superconducting Circuits
Luo, K., Huang, W., Tao, Z., Zhang, L., Zhou, Y., Chu, J., Liu, W., Wang, B.-Y., Cui, J., Liu, S., et al. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.030603 · Cited by 79
Archives of Quantum Computing: Research Progress and Challenges
Sood, V., & Chauhan, R. P. (2023) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-023-09973-2 · Cited by 70
A semi-agnostic ansatz with variable structure for variational quantum algorithms
Bilkis, M., Cerezo, M., Verdon, G., Coles, P. J., & Cincio, L. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00132-1 · Cited by 58
Naik, A. S., Yeniaras, E., Hellstern, G., Prasad, G., & Vishwakarma, S. (2025) · Financial Innovation · doi:10.1186/s40854-025-00751-6 · Cited by 106
Majorana Loop Stabilizer Codes for Error Mitigation in Fermionic Quantum Simulations
Jiang, Z., McClean, J., Babbush, R., & Neven, H. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.064041 · Cited by 58
Quasiprobability decompositions with reduced sampling overhead
Piveteau, C., Sutter, D., & Woerner, S. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00517-3 · Cited by 57
Quantum Software Development Lifecycle
Weder, B., Barzen, J., Leymann, F., & Vietz, D. (2022) · Springer eBooks · doi:10.1007/978-3-031-05324-5_4 · Cited by 100
Fundamental limitations on distillation of quantum channel resources
Regula, B., & Takagi, R. (2021) · Nature Communications · doi:10.1038/s41467-021-24699-0 · Cited by 90
Entanglement Dynamics in Hybrid Quantum Circuits
Potter, A. C., & Vasseur, R. (2022) · Quantum science and technology · doi:10.1007/978-3-031-03998-0_9 · Cited by 249
Quantum Machine Learning for Finance ICCAD Special Session Paper
Pistoia, M., Farhan, S., Ajagekar, A., Buts, A., Chakrabarti, S., Herman, D., Hu, S., Jena, A., Minssen, P., Niroula, P., et al. (2021) · International Conference on Computer Aided Design · doi:10.1109/iccad51958.2021.9643469 · Cited by 104
Rivera-Dean, J., Lamprou, T., Pisanty, E., Stammer, P., Ordóñez-Lasso, A. F., Maxwell, A., Ciappina, M. F., Lewenstein, M., & Tzallas, P. (2022) · Physical Review A · doi:10.1103/physreva.105.033714 · Cited by 79
Scalable algorithm simplification using quantum AND logic
Chu, J., He, X., Zhou, Y., Yuan, J., Zhang, L., Guo, Q., Hai, Y.-J., Han, Z., Hu, C.-K., Huang, W., et al. (2022) · Nature Physics · doi:10.1038/s41567-022-01813-7 · Cited by 72
Prediction of Solar Irradiance One Hour Ahead Based on Quantum Long Short-Term Memory Network
Yu, Y., Hu, G., Liu, C., Xiong, J., & Wu, Z. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3271362 · Cited by 71
Hybrid quantum-classical machine learning for generative chemistry and drug design
Gircha, A. I., Boev, A. S., Avchaciov, K., Fedichev, P. O., & Fedorov, A. K. (2023) · Scientific Reports · doi:10.1038/s41598-023-32703-4 · Cited by 56
Decomposition of matrix product states into shallow quantum circuits
Rudolph, M. S., Chen, J., Miller, J. A., Acharya, A., & Perdomo‐Ortiz, A. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ad04e6 · Cited by 144
Low charge noise quantum dots with industrial CMOS manufacturing
Elsayed, A., Shehata, M. M. E. K., Godfrin, C., Kubicek, S., Massar, S., Canvel, Y., Jussot, J., Simion, G., Mongillo, M., Wan, D., et al. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00864-3 · Cited by 113
Event Classification with Quantum Machine Learning in High-Energy Physics
Terashi, K., Kaneda, M., Kishimoto, T., Saito, M., Sawada, R., & Tanaka, J. (2021) · Computing and Software for Big Science · doi:10.1007/s41781-020-00047-7 · Cited by 72
Preparation of excited states for nuclear dynamics on a quantum computer
Roggero, A., Gu, C., Baroni, A., & Papenbrock, T. (2020) · Physical Review C · doi:10.1103/physrevc.102.064624 · Cited by 64
Classification of Remote Sensing Images With Parameterized Quantum Gates
Otgonbaatar, S., & Datcu, M. (2022) · IEEE Geoscience and Remote Sensing Letters · doi:10.1109/lgrs.2021.3108014 · Cited by 57
Cybersecurity in Critical Infrastructures: A Post-Quantum Cryptography Perspective
del Moral, J. O., iOlius, A. D., Vidal, G., Crespo, P. M., & Martinez, J. E. (2024) · arXiv · doi:10.48550/arxiv.2401.03780 · Cited by 57
Montañez-Barrera, J. A., Willsch, D., Maldonado-Romo, A., & Michielsen, K. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad35e4 · Cited by 57
“However, we are currently in a noisy intermediate-scale quantum (NISQ) stage and QPUs are restricted in terms of qubits number and circuit depth [6].”
BackgroundHybrid Quantum Computing with Conditional Beam Splitter Gate in Trapped Ion System
Gan, J., Maslennikov, G., Tseng, K.-W., Nguyen, C. H., & Matsukevich, D. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.170502 · Cited by 85
Adaptive pruning-based optimization of parameterized quantum circuits
Sim, S., Romero, J., Gonthier, J. F., & Kunitsa, A. A. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abe107 · Cited by 56
Driving Enhanced Quantum Sensing in Partially Accessible Many-Body Systems
Mishra, U., & Bayat, A. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.080504 · Cited by 77
Bridging Classical and Quantum with SDP initialized warm-starts for QAOA
Tate, R., Farhadi, M., Herold, C., Mohler, G., & Gupta, S. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3549554 · Cited by 57
Quantum circuit cutting with maximum-likelihood tomography
Perlin, M. A., Saleem, Z. H., Suchara, M., & Osborn, J. C. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00390-6 · Cited by 92
Resilience of Quantum Random Access Memory to Generic Noise
Hann, C. T., Lee, G., Girvin, S. M., & Jiang, L. (2021) · University of Chicago · doi:10.6082/027wm-z2x67 · Cited by 57
Seif, A., Cian, Z.-P., Zhou, S., Chen, S., & Jiang, L. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010303 · Cited by 95
Scaling Superconducting Quantum Computers with Chiplet Architectures
Smith, K. N., Ravi, G. S., Baker, J. M., & Chong, F. T. (2022) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro56248.2022.00078 · Cited by 114
Making Sense of Meaning: A Survey on Metrics for Semantic and Goal-Oriented Communication
Getu, T. M., Kaddoum, G., & Bennis, M. (2023) · IEEE Access · doi:10.1109/access.2023.3269848 · Cited by 93
Network Community Detection on Small Quantum Computers
Shaydulin, R., Ushijima‐Mwesigwa, H., Safro, I., Mniszewski, S., & Alexeev, Y. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201900029 · Cited by 56
Quantum Phase Estimation with Time‐Frequency Qudits in a Single Photon
Lu, H., Hu, Z., Alshaykh, M. S., Moore, A. J., Wang, Y., Imany, P., Weiner, A. M., & Kais, S. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201900074 · Cited by 72
Partial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machines
Gokhale, P., Ding, Y., Propson, T., Winkler, C., Leung, N., Shi, Y., Schuster, D., Hoffmann, H., & Chong, F. T. (2019) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3352460.3358313 · Cited by 102
Classical algorithms for quantum mean values
Bravyi, S., Gosset, D., & Movassagh, R. (2021) · Nature Physics · doi:10.1038/s41567-020-01109-8 · Cited by 56
Depth optimization of quantum search algorithms beyond Grover's algorithm
Zhang, K., & Korepin, V. E. (2020) · Physical Review A · doi:10.1103/physreva.101.032346 · Cited by 70
The theory of the quantum kernel-based binary classifier
Park, D. K., Blank, C., & Petruccione, F. (2020) · Physics Letters A · doi:10.1016/j.physleta.2020.126422 · Cited by 70
The U.S. National Quantum Initiative: From Act to action
Monroe, C., Raymer, M. G., & Taylor, J. (2019) · Science · doi:10.1126/science.aax0578 · Cited by 55
Dimensional Expressivity Analysis of Parametric Quantum Circuits
Funcke, L., Hartung, T., Jansen, K., Kühn, S., & Stornati, P. (2021) · Quantum · doi:10.22331/q-2021-03-29-422 · Cited by 104
Measurement-induced criticality as a data-structure transition
Turkeshi, X. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.144313 · Cited by 77
Variational Quantum-Neural Hybrid Eigensolver
Zhang, S., Wan, Z., Lee, C., Hsieh, C., Zhang, S., & Yao, H. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.120502 · Cited by 77
Heuristic Quantum Optimization for 6G Wireless Communications
Kim, M., Kasi, S., Lott, P. A., Venturelli, D., Kaewell, J., & Jamieson, K. (2021) · IEEE Network · doi:10.1109/mnet.012.2000770 · Cited by 58
Error mitigation for variational quantum algorithms through mid-circuit measurements
Botelho, L., Glos, A., Kundu, A., Miszczak, J. A., Salehi, Ö., & Zimborás, Z. (2022) · Physical Review A · doi:10.1103/physreva.105.022441 · Cited by 80
Quantum generative adversarial networks with multiple superconducting qubits
Huang, K., Wang, Z., Song, C., Xu, K., Li, H., Wang, Z., Guo, Q., Song, Z., Liu, Z., Zheng, D. N., et al. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00503-1 · Cited by 78
Theoretical error performance analysis for variational quantum circuit based functional regression
Qi, J., Yang, C.-H. H., Chen, P., & Hsieh, M.-H. (2023) · npj Quantum Information · doi:10.1038/s41534-022-00672-7 · Cited by 83
Network Anomaly Detection Using Quantum Neural Networks on Noisy Quantum Computers
Kukliansky, A., Orescanin, M., Bollmann, C. A., & Huffmire, T. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3359574 · Cited by 86
Beyond Bits: A Review of Quantum Embedding Techniques for Efficient Information Processing
Khan, M. A., Aman, M. N., & Sikdar, B. (2024) · IEEE Access · doi:10.1109/access.2024.3382150 · Cited by 89
Cybersecurity in Critical Infrastructures: A Post-Quantum Cryptography Perspective
del Moral, J. O., iOlius, A. D., Vidal, G., Crespo, P. M., & Martínez, J. E. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3410702 · Cited by 94
Temperature effects on quantum non-Markovianity via collision models
Man, Z., Xia, Y., & Franco, R. L. (2018) · Physical Review A · doi:10.1103/physreva.97.062104 · Cited by 64
Experimental test of non-macrorealistic cat states in the cloud
Ku, H.-Y., Lambert, N., Chan, F.-J., Emary, C., Chen, Y.-N., & Nori, F. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00321-x · Cited by 68
Quantum inverse iteration algorithm for programmable quantum simulators
Kyriienko, O. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0239-7 · Cited by 86
Correlating AGP on a quantum computer
Khamoshi, A., Evangelista, F. A., & Scuseria, G. E. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abc1bb · Cited by 73
Hamiltonian learning for quantum error correction
Valenti, A., van Nieuwenburg, E., Huber, S. D., & Greplová, E. (2019) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000377386 · Cited by 54
Chicco, S., Chiesa, A., Allodi, G., Garlatti, E., Atzori, M., Sorace, L., Renzi, R. D., Sessoli, R., & Carretta, S. (2021) · Chemical Science · doi:10.1039/d1sc01358k · Cited by 63
Boundaries of quantum supremacy via random circuit sampling
Zlokapa, A., Boixo, S., & Lidar, D. (2020) · arXiv · doi:10.48550/arxiv.2005.02464 · Cited by 55
Variational quantum algorithm for nonequilibrium steady states
Yoshioka, N., Nakagawa, Y. O., Mitarai, K., & Fujii, K. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043289 · Cited by 54
“[4] John Preskill, “Quantum Computing in the NISQ era and beyond,” Quantum 2, 79 (2018).”
BackgroundMethodImpact of qubit connectivity on quantum algorithm performance
Holmes, A., Johri, S., Guerreschi, G. G., Clarke, J. S., & Matsuura, A. Y. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab73e0 · Cited by 54
Optimizing quantum phase estimation for the simulation of Hamiltonian eigenstates
Cruz, P. M. Q., Catarina, G., Gautier, R., & Fernández-Rossier, J. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abaa2c · Cited by 82
Dimensional Expressivity Analysis of Parametric Quantum Circuits
Funcke, L., Hartung, T., Jansen, K., Kühn, S., & Stornati, P. (2021) · Desy Publications Database (Deutsches Elektronen-Synchrotron DESY) · Cited by 57
Advances and opportunities in materials science for scalable quantum computing
Lordi, V., & Nichol, J. M. (2021) · MRS Bulletin · doi:10.1557/s43577-021-00133-0 · Cited by 87
Quantum advantages for Pauli channel estimation
Chen, S., Zhou, S., Seif, A., & Jiang, L. (2022) · Physical Review A · doi:10.1103/physreva.105.032435 · Cited by 120
Error-mitigated simulation of quantum many-body scars on quantum computers with pulse-level control
Chen, I.-C., Burdick, B., Yao, Y., Orth, P. P., & Iadecola, T. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043027 · Cited by 76
Quantum distributed deep learning architectures: Models, discussions, and applications
Kwak, Y., Yun, W. J., Kim, J. P., Cho, H., Park, J., Choi, M., Jung, S., & Kim, J. (2022) · ICT Express · doi:10.1016/j.icte.2022.08.004 · Cited by 79
Development of variational quantum deep neural networks for image recognition
Wang, Y., Wang, Y., Chen, C., Jiang, R., & Huang, W. (2022) · Neurocomputing · doi:10.1016/j.neucom.2022.06.010 · Cited by 68
Optimizing Resource Efficiencies for Scalable Full-Stack Quantum Computers
Fellous-Asiani, M., Chai, J. H., Thonnart, Y., Ng, H. K., Whitney, R. S., & Auffèves, A. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040319 · Cited by 120
Methods for Simulating String-Net States and Anyons on a Digital Quantum Computer
Liu, Y.-J., Shtengel, K., Smith, A., & Pollmann, F. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040315 · Cited by 78
Insights from incorporating quantum computing into drug design workflows
Lau, B., Emani, P. S., Chapman, J., Yao, L., Lam, T., Merrill, P., Warrell, J., Gerstein, M. B., & Lam, H. Y. K. (2023) · Bioinformatics · doi:10.1093/bioinformatics/btac789 · Cited by 54
Demonstration of Algorithmic Quantum Speedup
Pokharel, B., & Lidar, D. A. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.210602 · Cited by 80
Two-Qutrit Quantum Algorithms on a Programmable Superconducting Processor
Roy, T., Li, Z., Kapit, E., & Schuster, D. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.064024 · Cited by 92
MorphQ: Metamorphic Testing of the Qiskit Quantum Computing Platform
Paltenghi, M., & Pradel, M. (2023) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse48619.2023.00202 · Cited by 111
Using Adaptiveness and Causal Superpositions Against Noise in Quantum Metrology
Kurdziałek, S., Górecki, W., Albarelli, F., & Demkowicz-Dobrzański, R. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.090801 · Cited by 103
Acharya, R., Brebels, S., Grill, A., Verjauw, J., Ivanov, T., Lozano, D. P., Wan, D., Damme, J. V., Vadiraj, A. M., Mongillo, M., et al. (2023) · Nature Electronics · doi:10.1038/s41928-023-01033-8 · Cited by 97
Fermion-qudit quantum processors for simulating lattice gauge theories with matter
Zache, T. V., González-Cuadra, D., & Zoller, P. (2023) · Quantum · doi:10.22331/q-2023-10-16-1140 · Cited by 92
Quantum and Classical Spin-Network Algorithms for q -Deformed Kogut-Susskind Gauge Theories
Zache, T. V., González-Cuadra, D., & Zoller, P. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.171902 · Cited by 105
Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
Yamasaki, H., & Koashi, M. (2024) · Nature Physics · doi:10.1038/s41567-023-02325-8 · Cited by 131
QFaaS: A Serverless Function-as-a-Service framework for Quantum computing
Nguyen, H. T., Usman, M., & Buyya, R. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.01.018 · Cited by 91
Integrating quantum computing resources into scientific HPC ecosystems
Beck, T. L., Baroni, A., Bennink, R. S., Buchs, G., Pérez, E. A. C., Eisenbach, M., da Silva, R. F., Meena, M. G., Gottiparthi, K., Groszkowski, P., et al. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.06.058 · Cited by 109
Noisy coupled qubits: Operator spreading and the Fredrickson-Andersen model
Rowlands, D. A., & Lamacraft, A. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.98.195125 · Cited by 61
Entanglement spectroscopy with a depth-two quantum circuit
Subaşı, Y., Cincio, L., & Coles, P. J. (2019) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8121/aaf54d · Cited by 53
Quantum-Enhanced Data Classification with a Variational Entangled Sensor Network
Xia, Y., Li, W., Zhuang, Q., & Zhang, Z. (2021) · Physical Review X · doi:10.1103/physrevx.11.021047 · Cited by 76
Iterative quantum-assisted eigensolver
Bharti, K., & Haug, T. (2021) · Physical Review A · doi:10.1103/physreva.104.l050401 · Cited by 54
A Hybrid Quantum-Classical Approach to Mitigating Measurement Errors in Quantum Algorithms
Kwon, H., & Bae, J. (2021) · IEEE Transactions on Computers · doi:10.1109/tc.2020.3009664 · Cited by 54
Quantum natural gradient generalised to noisy and non-unitary circuits
Koczor, B., & Benjamin, S. C. (2019) · arXiv · doi:10.48550/arxiv.1912.08660 · Cited by 54
Kiesenhofer, D., Hainzer, H., Zhdanov, A., Holz, P. C., Bock, M., Ollikainen, T., & Roos, C. F. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020317 · Cited by 53
Training Optimization for Gate-Model Quantum Neural Networks
Gyöngyösi, L., & Imre, S. (2019) · Scientific Reports · doi:10.1038/s41598-019-48892-w · Cited by 62
Quantum Enhancements for Deep Reinforcement Learning in Large Spaces
Jerbi, S., Trenkwalder, L. M., Nautrup, H. P., Briegel, H. J., & Dunjko, V. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010328 · Cited by 114
Quantum walk-based portfolio optimisation
Slate, N., Matwiejew, E., Marsh, S., & Wang, J. B. (2021) · Quantum · doi:10.22331/q-2021-07-28-513 · Cited by 54
Scalable Neural Decoder for Topological Surface Codes
Meinerz, K., Park, C.-Y., & Trebst, S. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.080505 · Cited by 54
Statistical complexity of quantum circuits
Bu, K., Koh, D. E., Li, L., Luo, Q., & Zhang, Y. (2022) · Physical Review A · doi:10.1103/physreva.105.062431 · Cited by 82
Benchmarking Quantum Coprocessors in an Application-Centric, Hardware-Agnostic, and Scalable Way
Martiel, S., Ayral, T., & Allouche, C. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3090207 · Cited by 100
Ge, X., Wu, R.-B., & RABITZ, H. A. (2022) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2022.06.001 · Cited by 83
Overlapped grouping measurement: A unified framework for measuring quantum states
Wu, B., Sun, J., Huang, Q. J., & Yuan, X. (2023) · Quantum · doi:10.22331/q-2023-01-13-896 · Cited by 105
Contemporary Quantum Computing Use Cases: Taxonomy, Review and Challenges
Singh, J., & Bhangu, K. S. (2022) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-022-09809-5 · Cited by 66
Portfolio optimization with digitized counterdiabatic quantum algorithms
Hegade, N. N., Chandarana, P., Paul, K., Chen, X., Albarrán-Arriagada, F., & Solano, E. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043204 · Cited by 76
Opportunities for quantum computing within net-zero power system optimization
Morstyn, T., & Wang, X. (2024) · Joule · doi:10.1016/j.joule.2024.03.020 · Cited by 86
Quantum-Inspired Optimization Algorithms for Scalable Machine Learning in Edge Computing
Goyal, R., Kumar, K., Sharma, V., Bhutia, R., Jain, A., & Kumar, M. (2024) · International Conference on Technological Advancements in Computational Sciences (ICTACS) · doi:10.1109/ictacs62700.2024.10840586 · Cited by 56
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.