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 3,601–3,700 of 8,640
Artificial-intelligence-driven shot reduction in quantum measurement
Liang, S., Zhu, L., Liu, X., Yang, C., & Li, X. (2024) · Chemical Physics Reviews · doi:10.1063/5.0219663 · Cited by 22
Invited: Graph Learning for Parameter Prediction of Quantum Approximate Optimization Algorithm
Liang, Z., Liu, G., Liu, Z., Cheng, J., Hao, T., Liu, K., Ren, H., Song, Z., Liu, J., Ye, Y., et al. (2024) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3649329.3663523 · Cited by 27
Using quantum switches to mitigate noise in Grover’s search algorithm
Srivastava, S., Pati, A. K., Chakrabarty, I., & Bhattacharya, S. (2024) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad9efc · Cited by 8
Unitary Synthesis of Clifford+T Circuits with Reinforcement Learning
Rietsch, S., Dubey, A. Y., Ufrecht, C., Periyasamy, M., Plinge, A., Mutschler, C., & Scherer, D. D. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00102 · Cited by 31
Barata, J., Ikeda, K., Mukherjee, S., & Raghoonanan, J. (2025) · Journal of High Energy Physics · doi:10.1007/jhep02(2025)118 · Cited by 16
Quantum technology: a financial risk assessment
Nguyen, P.-N. (2025) · Digital Finance · doi:10.1007/s42521-025-00127-6 · Cited by 18
Subspace preserving quantum convolutional neural network architectures
Monbroussou, L., Landman, J., Wang, L., Grilo, A. B., & Kashefi, E. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adbf43 · Cited by 23
Quantum reservoir computing in atomic lattices
Llodrà, G., Mujal, P., Zambrini, R., & Giorgi, G. L. (2025) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2025.116289 · Cited by 26
Near-Term Spin-Qubit Architecture Design via Multipartite Maximally Entangled States
Paraskevopoulos, N., Steinberg, M., Undseth, B., Sarkar, A., Vandersypen, L. M. K., Xue, X., & Feld, S. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.020307 · Cited by 11
Sun, J., Cheng, L., & Zhang, S. (2025) · Quantum · doi:10.22331/q-2025-06-24-1782 · Cited by 24
Uso de computación cuántica en la mejora de algoritmos de aprendizaje automático
Galarza-Sánchez, P. C., Erazo-Luzuriaga, A. F., & Boné-Andrade, M. F. (2023) · Revista Científica Ciencia y Método · doi:10.55813/gaea/rcym/v1/n4/25 · Cited by 10
An Early Investigation of the HHL Quantum Linear Solver for Scientific Applications
Zheng, M., Liu, C., Stein, S., Li, X., Mülmenstädt, J., Chen, Y., & Li, A. (2025) · Algorithms · doi:10.3390/a18080491 · Cited by 18
A quantum algorithm for solving 0-1 Knapsack problems
Wilkening, S., Lefterovici, A.-I., Binkowski, L., Perk, M., Fekete, S. P., & Osborne, T. J. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01097-8 · Cited by 22
The SWITCH test for discriminating quantum evolutions
Chamorro‐Posada, P., & García-Escartín, J. C. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/acecc5 · Cited by 11
Designing ground states of Hopfield networks for quantum state preparation
Dlaska, C., Sieberer, L. M., & Lechner, W. (2019) · Physical Review A · doi:10.1103/physreva.99.032342 · Cited by 10
Implementing perceptron models with qubits
Wiersema, R., & Kappen, H. J. (2019) · Physical Review A · doi:10.1103/physreva.100.020301 · Cited by 7
Distance-based classifier on the Quantum Inspire
Wezeman, R. S., Neumann, N. M. P., & Phillipson, F. (2019) · Digitale Welt · doi:10.1007/s42354-019-0240-5 · Cited by 8
Near-term Quantum Algorithms for Quantum Many-body Systems
Ritter, M. B. (2019) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1290/1/012003 · Cited by 12
Quantum-resistant Lattice-based Authentication for V2X Communication in C-ITS
Ha, S., Lee, H., Won, D., & Lee, Y. (2020) · International Conference on Ubiquitous Information Management and Communication (IMCOM) · doi:10.1109/imcom48794.2020.9001682 · Cited by 9
Efficient Hamiltonian programming in qubit arrays with nearest-neighbor couplings
Tsunoda, T., Bhole, G., Jones, S. A., Jones, J. A., & Leek, P. (2020) · Physical Review A · doi:10.1103/physreva.102.032405 · Cited by 10
Characterization of Quantum States Based on Creation Complexity
Hu, Z., & Kais, S. (2020) · Advanced Quantum Technologies · doi:10.1002/qute.202000043 · Cited by 10
Perkowski, M. A. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-52482-1_1 · Cited by 10
Noisy, Intermediate-Scale Quantum Computing and Industrial Revolution 4.0
Senekane, M., Maseli, M., & Taele, B. M. (2020) · Lecture notes in electrical engineering · doi:10.1007/978-3-030-48230-5_9 · Cited by 9
Fuzzy measurements and coarse graining in quantum many-body systems
Pineda, C., Davalos, D., Viviescas, C., & Rosado, A. (2021) · Physical Review A · doi:10.1103/physreva.104.042218 · Cited by 8
Adelomou, A. P., Ribé, E. G., & Cardona, X. V. (2020) · Journal of Computer and Communications · doi:10.4236/jcc.2020.811004 · Cited by 8
“Unfortunately, we are still in the NISQ [11] era.”
BackgroundMethodInfluentialCircuit design for clique problem and its implementation on quantum computer
Sanyal, A., Saha, A., Saha, B., & Chakrabarti, A. (2021) · IET Quantum Communication · doi:10.1049/qtc2.12029 · Cited by 14
Statistical approach to quantum phase estimation
Moore, A. J., Wang, Y., Hu, Z., Kais, S., & Weiner, A. M. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac320d · Cited by 13
Delayed-choice causal order and nonclassical correlations
Milz, S., Jurkschat, D., Pollock, F. A., & Modi, K. K. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023028 · Cited by 8
Efficient Classical Simulation and Benchmarking of Quantum Processes in the Weyl Basis
França, D. S., Strelchuk, S., & Studziński, M. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.210502 · Cited by 11
Radio frequency mixing modules for superconducting qubit room temperature control systems
Xu, Y., Huang, G., Santiago, D., & Siddiqi, I. (2021) · Review of Scientific Instruments · doi:10.1063/5.0055906 · Cited by 9
Radio frequency mixing modules for superconducting qubit room temperature control systems.
Xu, Y., Huang, G., Santiago, D., et al. (2021) · eScholarship (California Digital Library) · Cited by 8
Dephasing of Exchange‐Coupled Spins in Quantum Dots for Quantum Computing
Huang, P. (2021) · Advanced Quantum Technologies · doi:10.1002/qute.202100018 · Cited by 12
Fisher Information: A Crucial Tool for NISQ Research
Bharti, K. (2021) · doi:10.22331/qv-2021-10-06-61 · Cited by 8
Quantum enhanced convolutional neural networks for NISQ computers
Deng, D.-L. (2021) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-021-1758-0 · Cited by 9
Noisy Bayesian optimization for variational quantum eigensolvers
Iannelli, G., & Jansen, K. (2022) · International Symposium on Lattice Field Theory (LATTICE) · doi:10.22323/1.396.0251 · Cited by 11
Discriminating Quantum States with Quantum Machine Learning
Quiroga, D., Date, P., & Pooser, R. C. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00088 · Cited by 9
Quanto: optimizing quantum circuits with automatic generation of circuit identities
Pointing, J., Padon, O., Jia, Z., Ma, H., Hirth, A., Palsberg, J., & Aiken, A. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad5b16 · Cited by 31
Quantum search degeneration under amplitude noise in queries to the oracle
Rastegin, A. E., & Shemet, A. M. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03501-0 · Cited by 8
1/ω electric-field noise in surface ion traps from correlated adsorbate dynamics
Foulon, B. L., Ray, K. G., Kim, C.-E., Liu, Y., Rubenstein, B. M., & Lordi, V. (2022) · Physical Review A · doi:10.1103/physreva.105.013107 · Cited by 11
Noise fingerprints in quantum computers: Machine learning software tools
Martina, S., Gherardini, S., Buffoni, L., & Caruso, F. (2022) · Software Impacts · doi:10.1016/j.simpa.2022.100260 · Cited by 14
Shirai, S., Horiba, T., & Hirai, H. (2022) · ACS Omega · doi:10.1021/acsomega.2c01053 · Cited by 12
Reconstructing unknown quantum states using variational layerwise method
Xiao, J., Wen, J., Wei, S., & Long, G. (2022) · Frontiers of Physics · doi:10.1007/s11467-022-1157-2 · Cited by 8
“…to be good solutions to many quantum problems, from solving quantum algebraic systems [21–24] and finding the ground state energy of a chemical system [25– 31] to performing image classification [32, 33] and fitting unknown functions [34] in the noisy intermediate-scale quantum (NISQ) era [35].”
BackgroundCryogenic Characterization and Modeling of 14 nm Bulk FinFET Technology
Chabane, A., Prathapan, M., Mueller, P., et al. (2021) · IEEE European Solid-State Device Research Conference (ESSDERC) · doi:10.1109/essderc53440.2021.9631789 · Cited by 8
Quantum circuit architectures via quantum observable Markov decision process planning
Kimura, T., Shiba, K., Chen, C.-C., Sogabe, M., Sakamoto, K., & Sogabe, T. (2022) · Journal of Physics Communications · doi:10.1088/2399-6528/ac7d39 · Cited by 13
Measure of invertible dynamical maps under convex combinations of noninvertible dynamical maps
Jagadish, V., Srikanth, R., & Petruccione, F. (2022) · Physical Review A · doi:10.1103/physreva.106.012438 · Cited by 11
Representation of the fermionic boundary operator
Akhalwaya, I. Y., He, Y., Lior Horesh, C., Jejjala, V., Kirby, W., Naidoo, K., & Ubaru, S. (2022) · Physical Review A · doi:10.1103/physreva.106.022407 · Cited by 14
Many-body entanglement and topology from uncertainties and measurement-induced modes
Pöyhönen, K., Moghaddam, A. G., & Ojanen, T. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023200 · Cited by 12
Nonunitary gate operations by dissipation engineering
Zapusek, E., Javadi, A., & Reiter, F. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac98dd · Cited by 15
Extracting the lifetime of a synthetic two-level system
Margiani, G., Guerrero, S., Heugel, T. L., Marty, C., Pachlatko, R., Gisler, T., Vukasin, G. D., Kwon, H.-K., Miller, J. M. L., Bousse, N. E., et al. (2022) · Applied Physics Letters · doi:10.1063/5.0121595 · Cited by 18
Benchmarking quantum error-correcting codes on quasi-linear and central-spin processors
Finsterhoelzl, R., & Burkard, G. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/aca21f · Cited by 14
Robust Dynamical Decoupling for the Manipulation of a Spin Network Via a Single Spin
Yang, X., Ge, Y., Zhang, B., & Li, J. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.054075 · Cited by 10
A Study on Quantum Machine Learning for Accurate and Efficient Weather Prediction
Surendiran, B., Dhanasekaran, K., & Tamizhselvi, A. (2022) · International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC) · doi:10.1109/i-smac55078.2022.9987293 · Cited by 11
Optimization of Sensor-Placement on Vehicles using Quantum-Classical Hybrid Methods
Pramanik, S., Vaidya, V., Malviya, G., Sinha, S. K., Salsingikar, S., Chandra, M. G., Sridhar, C. V., Mathais, G., & Navelkar, V. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00131 · Cited by 17
Quantum-Assisted Greedy Algorithms
Ayanzadeh, R., Dorband, J. E., Halem, M., & Finin, T. (2022) · IEEE International Geoscience and Remote Sensing Symposium (IGARSS) · doi:10.1109/igarss46834.2022.9884795 · Cited by 13
Quantum circuits for discrete-time quantum walks with position-dependent coin operator
Nzongani, U., Zylberman, J., Doncecchi, C.-E., Pérez, A., Debbasch, F., & Arnault, P. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03957-8 · Cited by 12
Measuring qubit stability in a gate-based NISQ hardware processor
Aydeniz, K. Y., Parks, Z. P., Nair, A., Gustafson, E., Kemper, A. F., Pooser, R. C., Meurice, Y., & Dreher, P. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03826-4 · Cited by 25
Virtual distillation with noise dilution
Teo, Y. S., Shin, S., Kwon, H., Lee, S.-H., & Jeong, H. (2023) · Physical Review A · doi:10.1103/physreva.107.022608 · Cited by 9
Quantum circuit debugging and sensitivity analysis via local inversions
Calderon-Vargas, F. A., Proctor, T. J., Rudinger, K., & Sarovar, M. (2023) · Quantum · doi:10.22331/q-2023-02-09-921 · Cited by 10
Quantum algorithms for geologic fracture networks
Henderson, J. M., Podzorova, M., Cerezo, M., Golden, J. K., Gleyzer, L., Viswanathan, H., & O’Malley, D. (2023) · Scientific Reports · doi:10.1038/s41598-023-29643-4 · Cited by 15
Calculable lower bounds on the efficiency of universal sets of quantum gates
Słowik, O., & Sawicki, A. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/acbd24 · Cited by 13
Error-mitigated quantum computing of Heisenberg spin chain dynamics
Lötstedt, E., Wang, L., Yoshida, R., Zhang, Y., & Yamanouchi, K. (2023) · Physica Scripta · doi:10.1088/1402-4896/acbcac · Cited by 8
Simulating time evolution on distributed quantum computers
Buessen, F. L., Segal, D., & Khait, I. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.l022003 · Cited by 13
Quantum continual learning of quantum data realizing knowledge backward transfer
Situ, H., Lu, T., Pan, M., & Li, L. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.128779 · Cited by 11
Quantum Walk Search on a Two-dimensional Grid with Extra Edges
Giri, P. R. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-023-05369-x · Cited by 10
Concurrent quantum eigensolver for multiple low-energy eigenstates
Xu, G., Guo, Y., Li, X., Wang, K., Fan, Z., Zhou, Z., Liao, H., & Xiang, T. (2023) · Physical Review A · doi:10.1103/physreva.107.052423 · Cited by 13
TRIM: crossTalk-awaRe qubIt Mapping for multiprogrammed quantum systems
Khadirsharbiyani, S., Sadeghi, M., Zarch, M. E., Kotra, J., & Kandemir, M. (2023) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw59989.2023.00025 · Cited by 10
Noise-robust ground state energy estimates from deep quantum circuits
Vallury, H. J., Jones, M. A., White, G. A. L., Creevey, F. M., Hill, C. D., & Hollenberg, L. C. L. (2023) · Quantum · doi:10.22331/q-2023-09-11-1109 · Cited by 10
Operational Quantum Average-Case Distances
Maciejewski, F. B., Puchała, Z., & Oszmaniec, M. (2023) · Quantum · doi:10.22331/q-2023-09-11-1106 · Cited by 12
程, T. 涛. C., Zhao, R.-S., 王, S. 爽. W., 王, R. 睿. W., & 马, H.-Y. 鸿. M. (2023) · Chinese Physics B · doi:10.1088/1674-1056/ad1926 · Cited by 15
Surace, F. M., & Motrunich, O. I. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010317 · Cited by 9
Quantum Computing in The Cloud - A Systematic Literature Review
Zhahir, A. A., Mohd, S. M., Shuhud, M. I. M., Idrus, B., Zainuddin, H., Jan, N. M., & Wahiddin, M. R. (2024) · International journal of electrical and computer engineering systems · doi:10.32985/ijeces.15.2.7 · Cited by 18
Learning quantum phases via single-qubit disentanglement
An, Z., Cao, C., Xu, C.-Q., & Zhou, D. L. (2024) · Quantum · doi:10.22331/q-2024-07-22-1421 · Cited by 12
Tomesh, T., Allen, N., Dilley, D., & Saleem, Z. H. (2024) · Quantum · doi:10.22331/q-2024-10-04-1493 · Cited by 19
Iteration Complexity of Variational Quantum Algorithms
Kungurtsev, V., Korpas, G., Mareček, J., & Zhu, E. Y. (2024) · Quantum · doi:10.22331/q-2024-10-10-1495 · Cited by 24
Complexity of the steady state of weakly symmetric open quantum lattices
Nigro, D. (2020) · Physical Review A · doi:10.1103/physreva.101.022109 · Cited by 8
Zou, X., Premaratne, S., Rol, M. A., Johri, S., Ostroukh, V., Michalak, D. J., Caudillo, R., Clarke, J. S., DiCarlo, L., & Matsuura, A. Y. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.2965810 · Cited by 10
Quantum Coin Method for Numerical Integration
Shimada, N. H., & Hachisuka, T. (2020) · Computer Graphics Forum · doi:10.1111/cgf.14015 · Cited by 17
Miyagawa, K., Shoji, M., Isobe, H., Yamanaka, S., Kawakami, T., Okumura, M., & Yamaguchi, K. (2020) · Molecular Physics · doi:10.1080/00268976.2020.1760388 · Cited by 9
QML Based Community Detection in the realm of Social Network Analysis
Akbar, S., & Saritha, S. K. (2020) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt49239.2020.9225271 · Cited by 9
Application of the Diamond Gate in Quantum Fourier Transformations and Quantum Machine Learning
Bahnsen, E., Rasmussen, S. E., Loft, N. J. S., & Zinner, N. T. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.024053 · Cited by 8
Exploring quantum perceptron and quantum neural network structures with a teacher-student scheme
Gratsea, A., & Huembeli, P. (2022) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00058-6 · Cited by 16
Genetic Algorithms for Error Mitigation in Quantum Measurement
Acampora, G., Grossi, M., & Vitiello, A. (2021) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec45853.2021.9504796 · Cited by 14
TQEA: Temporal Quantum Error Analysis
Baheri, B., Chen, D., Fang, B., Stein, S. A., Chaudhary, V., Mao, Y., Xu, S., Li, A., & Guan, Q. (2021) · IEEE/IFIP International Conference on Dependable Systems and Networks - Supplemental Volume (DSN-S) · doi:10.1109/dsn-s52858.2021.00034 · Cited by 10
On Post-processing the Results of Quantum Optimizers
Borle, A., & McCarter, J. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-34500-6_16 · Cited by 7
A Depth-Aware Swap Insertion Scheme for the Qubit Mapping ProblemPreprint
Zhang, C., Chen, Y., Jin, Y., Ahn, W., Zhang, Y., & Zhang, E. Z. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.07289 · Cited by 20
Quantum amplitude estimation algorithms on IBM quantum devicesPreprint
Rao, P., Yu, K., Lim, H., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.02102 · Cited by 8
Randomizing multi-product formulas for improved Hamiltonian simulation.Preprint
Faehrmann, P. K., Steudtner, M., Kueng, R., Kieferová, M., & Eisert, J. (2021) · arXiv (Cornell University) · Cited by 7
(2021) · arXiv (Cornell University) · Cited by 8
Digital quantum simulation for screening and confinement in gauge theory with a topological termPreprint
Honda, M., Itou, E., Kikuchi, Y., Nagano, L., & Okuda, T. (2021) · arXiv (Cornell University) · Cited by 7
Entanglement Swapping for Repeater Chains with Finite Memory SizesPreprint
Dai, W., & Towsley, D. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.10994 · Cited by 18
Understanding polaritonic chemistry from ab initio quantum electrodynamicsPreprint
Ruggenthaler, M., Sidler, D., & Rubio, Á. (2022) · Zürcher Hochschule für Angewandte Wissenschaften digital collection (Zurich University of Applied Sciences) · doi:10.48550/arxiv.2211.04241 · Cited by 31
Schuld, M., & Petruccione, F. (2023) · Springer eBooks · doi:10.1007/978-1-4899-7502-7_913-2 · Cited by 10
Navigating the Quantum Computing Threat Landscape for Blockchains: A Comprehensive SurveyPreprint
Khodaiemehr, H., Bagheri, K., & Feng, C. (2023) · doi:10.36227/techrxiv.24136440 · Cited by 8
Local, expressive, quantum-number-preserving VQE ansätze for fermionic systems
Anselmetti, G.-L. R., Wierichs, D., Gogolin, C., & Parrish, R. M. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac2cb3 · Cited by 96
Near term algorithms for linear systems of equations
Pellow-Jarman, A., Sinayskiy, I., Pillay, A. W., & Petruccione, F. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04020-2 · Cited by 14
Quantum Measurement Classification Using Statistical Learning
Utt, Z., Volya, D., & Mishra, P. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3644823 · Cited by 9
Fast elementary gates for universal quantum computation with Kerr parametric oscillator qubits
Kanao, T., & Goto, H. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013192 · Cited by 10
Empirical Learning of Dynamical Decoupling on Quantum Processors
Tong, C., Zhang, H., & Pokharel, B. (2025) · PRX Quantum · doi:10.1103/h7pq-s159 · Cited by 32
Hashim, A., Yuan, M., Gokhale, P., Chen, L., Jünger, C., Fruitwala, N., Xu, Y., Huang, G., Nowrouzi, K., Jiang, L., et al. (2025) · APL Quantum · doi:10.1063/5.0291637 · Cited by 25
Unveiling quantum phase transitions from traps in variational quantum algorithms
Cao, C., Gambetta, F. M., Montanaro, A., & Santos, R. A. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01038-5 · Cited by 38
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.