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,201–1,300 of 8,640
Optimizing frequency allocation for fixed-frequency superconducting quantum processors
Morvan, A., Chen, L., Larson, J. M., Santiago, D., & Siddiqi, I. A. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023079 · Cited by 65
Theory of Quantum Games and Quantum Economic Behavior
Ikeda, K., & Aoki, S. (2020) · Quantum Information Processing · doi:10.1007/s11128-021-03378-5 · Cited by 51
Localized Quantum Chemistry on Quantum Computers
Otten, M., Hermes, M. R., Pandharkar, R., Alexeev, Y., Gray, S. K., & Gagliardi, L. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00388 · Cited by 56
Solving hadron structures using the basis light-front quantization approach on quantum computers
Qian, W., Basili, R., Pal, S., Luecke, G. R., & Vary, J. P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043193 · Cited by 55
Sublinear quantum algorithms for training linear and kernel-based classifiersPreprint
Li, T., Chakrabarti, S., & Wu, X. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.02276 · Cited by 91
QASMBench: A Low-level QASM Benchmark Suite for NISQ Evaluation and SimulationPreprint
Li, A., Stein, S., Krishnamoorthy, S., & Ang, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.13018 · Cited by 46
MoG-VQE: Multiobjective genetic variational quantum eigensolver
Сергеевич, Ч. Д., Samarin, A., Игоревич, У. В., Iorsh, I. V., Оганов, А. Р., & Kyriienko, O. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.04424 · Cited by 40
Methods for accelerating geospatial data processing using quantum computers
Henderson, M., Gallina, J., & Brett, M. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00034-6 · Cited by 42
Computationally efficient zero-noise extrapolation for quantum-gate-error mitigation
Pascuzzi, V. R., He, A., Bauer, C. W., de Jong, W. A., & Nachman, B. (2022) · Physical Review A · doi:10.1103/physreva.105.042406 · Cited by 39
The Useful Quantum Computing Techniques for Artificial Intelligence Engineers
Choi, J., Oh, S., & Kim, J. (2020) · 2020 International Conference on Information Networking (ICOIN) · doi:10.1109/icoin48656.2020.9016555 · Cited by 39
“As one of the great steps in future-oriented research on quantum computing, we are now entering the Noisy Intermediate-Scale Quantum (NISQ) era [1].”
Classically Optimal Variational Quantum Algorithms
Wurtz, J., & Love, P. J. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3122568 · Cited by 60
Quantum pixel representations and compression for N-dimensional images
Amankwah, M. G., Camps, D., Bethel, E. W., Beeumen, R. V., & Perciano, T. (2022) · Scientific Reports · doi:10.1038/s41598-022-11024-y · Cited by 50
Quantum advantage with membosonsampling
Gao, J., Wang, X., Zhou, W., Jiao, Z., Ren, R.-J., Fu, Y.-X., Qiao, L., Xu, X.-Y., Zhang, C.-N., Pang, X.-L., et al. (2022) · Chip · doi:10.1016/j.chip.2022.100007 · Cited by 47
Balducci, G. T., Chen, B., Möller, M., Gerritsma, M. I., & Breuker, R. D. (2022) · Frontiers in Mechanical Engineering · doi:10.3389/fmech.2022.914241 · Cited by 64
Coherent control of electron spin qubits in silicon using a global field
Vahapoglu, E., Slack-Smith, J., Leon, R. C. C., Lim, W. H., Hudson, F. E., Day, T., Cifuentes, J. D., Tanttu, T., Yang, C. H., Saraiva, A., et al. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00645-w · Cited by 55
CAFQA: A Classical Simulation Bootstrap for Variational Quantum Algorithms
Ravi, G. S., Gokhale, P., Ding, Y., Kirby, W., Smith, K. N., Baker, J. M., Love, P. J., Hoffmann, H., Brown, K. R., & Chong, F. T. (2022) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3567955.3567958 · Cited by 99
A Quantum Generative Adversarial Network-based Intrusion Detection System
Rahman, M. A., Shahriar, H., Clincy, V. A., Hossain, M. F., & Rahman, M. (2023) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac57700.2023.00280 · Cited by 53
Qian, W., Basili, R., Eshaghian‐Wilner, M. M., Khokhar, A., Luecke, G. R., & Vary, J. P. (2023) · Entropy · doi:10.3390/e25081238 · Cited by 73
Quantum synchronization of a single trapped-ion qubit
Zhang, L., Wang, Z., Wang, Y., Zhang, J., Wu, Z., Jie, J., & Lu, Y. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033209 · Cited by 53
Jahin, M. A., Shovon, M. S. H., Islam, M. S., Shin, J., Mridha, M. F., & Okuyama, Y. (2023) · Scientific Reports · doi:10.1038/s41598-023-45406-7 · Cited by 71
Quantum computing for chemistry and physics applications from a Monte Carlo perspective
Mazzola, G. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0173591 · Cited by 64
Statistical mechanics model for Clifford random tensor networks and monitored quantum circuits
Li, Y., Vasseur, R., Fisher, M. P. A., & Ludwig, A. W. W. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.174307 · Cited by 87
Approximating Many-Body Quantum States with Quantum Circuits and Measurements
Piroli, L., Styliaris, G., & Cirac, J. I. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.230401 · Cited by 94
Quantum adiabatic algorithm design using reinforcement learning
Lin, J., Lai, Z. Y., & Li, X. (2020) · Physical Review A · doi:10.1103/physreva.101.052327 · Cited by 39
Emergent Fine Structure Constant of Quantum Spin Ice Is Large
Pace, S. D., Morampudi, S. C., Moessner, R., & Laumann, C. R. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.117205 · Cited by 53
No-Go Theorems for Quantum Resource Purification: New Approach and Channel Theory
Fang, K., & Liu, Z.-W. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010337 · Cited by 48
Generalized quantum assisted simulator
Haug, T., & Bharti, K. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac83e7 · Cited by 38
Quantitative robustness analysis of quantum programs
S-H, H., Hietala, K., Zhu, S., Ying, M., Hicks, M., & Wu, X. (2019) · OPUS - Open Publications of UTS Scholars (University of Technology Sydney) · Cited by 39
Relaxed Peephole Optimization: A Novel Compiler Optimization for Quantum Circuits
Liu, J., Bello, L., & Zhou, H. (2021) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo51591.2021.9370310 · Cited by 60
Wilson, B. A., Kudyshev, Z. A., Kildishev, A. V., Kais, S., Shalaev, V. M., & Boltasseva, A. (2021) · Applied Physics Reviews · doi:10.1063/5.0060481 · Cited by 39
Topological Two-Dimensional Floquet Lattice on a Single Superconducting Qubit
Malz, D., & Smith, A. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.163602 · Cited by 56
Progress toward favorable landscapes in quantum combinatorial optimization
Lee, J., Magann, A. B., RABITZ, H. A., & Arenz, C. (2021) · Physical Review A · doi:10.1103/physreva.104.032401 · Cited by 55
Adaptive estimation of quantum observables
Shlosberg, A., Jena, A., Mukhopadhyay, P., Haase, J. F., Leditzky, F., & Dellantonio, L. (2023) · Quantum · doi:10.22331/q-2023-01-26-906 · Cited by 67
Symmetry enhanced variational quantum spin eigensolver
Lyu, C., Xu, X., Yung, M., & Bayat, A. (2023) · Quantum · doi:10.22331/q-2023-01-19-899 · Cited by 60
Lyapunov-control-inspired strategies for quantum combinatorial optimization
Magann, A. B., Rudinger, K., Grace, M., & Sarovar, M. (2022) · Physical Review A · doi:10.1103/physreva.106.062414 · Cited by 51
The Dilemma of Quantum Neural Networks
Yang, Q., Wang, X., Du, Y., Wu, X., & Tao, D. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3208313 · Cited by 73
Distribution of Quantum Circuits Over General Quantum Networks
Sundaram, R. G., Gupta, H., & Ramakrishnan, C. R. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00063 · Cited by 57
Mitigating barren plateaus with transfer-learning-inspired parameter initializations
Liu, H., Sun, T.-P., Wu, Y.-C., Han, Y., & Guo, G. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acb58e · Cited by 74
Robin, C., & Savage, M. J. (2023) · Physical Review C · doi:10.1103/physrevc.108.024313 · Cited by 49
Future Potential of Quantum Computing and Simulations in Biological Science
Pal, S., Bhattacharya, M., Dash, S., Lee, S., & Chakraborty, C. (2023) · Molecular Biotechnology · doi:10.1007/s12033-023-00863-3 · Cited by 52
Quantum Network Engineering in the NISQ Age: Principles, Missions, and Challenges
Khalid, U., Rehman, J. U., Paing, S. N., Jung, H., Duong, T. Q., & Shin, H. (2023) · IEEE Network · doi:10.1109/mnet.2023.3328892 · Cited by 41
ResQNets: a residual approach for mitigating barren plateaus in quantum neural networks
Kashif, M., & Al-Kuwari, S. M. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-023-00216-8 · Cited by 67
Sedykh, A., Podapaka, M., Sagingalieva, A., Pinto, K., Pflitsch, M., & Melnikov, A. A. (2024) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ad43b2 · Cited by 84
Quantum variational solving of nonlinear and multidimensional partial differential equations
Sarma, A., Watts, T. W., Moosa, M., Liu, Y., & McMahon, P. L. (2024) · Physical Review A · doi:10.1103/physreva.109.062616 · Cited by 64
The effect of classical optimizers and Ansatz depth on QAOA performance in noisy devices
Pellow-Jarman, A., McFarthing, S., Sinayskiy, I., Park, D. K., Pillay, A. W., & Petruccione, F. (2024) · Scientific Reports · doi:10.1038/s41598-024-66625-6 · Cited by 66
Blockchain and AI: Driving the future of data security and business intelligence
Chowdhury, R. H. (2024) · World Journal of Advanced Research and Reviews · doi:10.30574/wjarr.2024.23.1.2273 · Cited by 88
Chaudhary, S., Budhiraja, I., Chaudhary, R., Kumar, N., Garg, D., & Almuhaideb, A. M. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3464853 · Cited by 46
ADAPT-QSCI: Adaptive Construction of an Input State for Quantum-Selected Configuration Interaction
Nakagawa, Y. O., Kamoshita, M., Mizukami, W., Sudo, S., & Ohnishi, Y. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00846 · Cited by 89
Measuring the Spectral Form Factor in Many-Body Chaotic and Localized Phases of Quantum Processors
Dong, H., Zhang, P., Dağ, C. B., Gao, Y., Wang, N., Deng, J., Zhang, X., Chen, J., Xu, S., Wang, K., et al. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.010402 · Cited by 77
Fujii, K., & Nakajima, K. (2021) · Natural computing series · doi:10.1007/978-981-13-1687-6_18 · Cited by 107
Density Matrix Quantum Circuit Simulation via the BSP Machine on Modern GPU Clusters
Li, A., Subasi, O., Yang, X., & Krishnamoorthy, S. (2020) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41405.2020.00017 · Cited by 62
Constant-depth circuits for dynamic simulations of materials on quantum computers
Oftelie, L. B., Beeumen, R. V., Younis, E., Smith, E., Iancu, C., & de Jong, W. A. (2022) · Materials Theory · doi:10.1186/s41313-022-00043-x · Cited by 53
Counteracting dephasing in Molecular Nanomagnets by optimized qudit encodings
Petiziol, F., Chiesa, A., Wimberger, S., Santini, P. M., & Carretta, S. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00466-3 · Cited by 47
Koridon, E., Yalouz, S., Senjean, B., Buda, F., O’Brien, T. E., & Visscher, L. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033127 · Cited by 50
Multicomponent Unitary Coupled Cluster and Equation-of-Motion for Quantum Computation
Pavošević, F., & Hammes‐Schiffer, S. (2021) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.1c00220 · Cited by 38
Active readout-error mitigation
Hicks, R., Kobrin, B., Bauer, C., & Nachman, B. P. (2022) · Physical Review A · doi:10.1103/physreva.105.012419 · Cited by 49
Practical distributed quantum information processing with LOCCNet
Zhao, X., Zhao, B., Wang, Z., Song, Z., & Wang, X. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00496-x · Cited by 60
Optimized SWAP networks with equivalent circuit averaging for QAOA
Hashim, A., Rines, R., Omole, V., Naik, R., Kreikebaum, J. M., Santiago, D., Chong, F. T., Siddiqi, I. A., & Gokhale, P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033028 · Cited by 54
Generalized Quantum Assisted Simulator
Haug, T., & Bharti, K. (2020) · arXiv · doi:10.48550/arxiv.2011.14737 · Cited by 38
2QAN: a quantum compiler for 2-local qubit hamiltonian simulation algorithms
Lao, L., & Browne, D. E. (2022) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3470496.3527394 · Cited by 81
Hyyppä, E., Kundu, S., Chan, C. F., Gunyhó, A., Hotari, J., Janzso, D., Júlíusson, K., Kiuru, O., Kotilahti, J., Landra, A., et al. (2022) · Nature Communications · doi:10.1038/s41467-022-34614-w · Cited by 60
PQLM - Multilingual Decentralized Portable Quantum Language Model
Li, S. S., Zhang, X., Zhou, S., Shu, H., Liang, R., Liu, H., & Garcia, L. P. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10095215 · Cited by 51
Operator Relaxation and the Optimal Depth of Classical Shadows
Ippoliti, M., Li, Y., Rakovszky, T., & Khemani, V. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.230403 · Cited by 63
Solving the big computing problems in the twenty-first century
Conklin, A. A., & Kumar, S. (2023) · Nature Electronics · doi:10.1038/s41928-023-00985-1 · Cited by 51
Molecular design with automated quantum computing-based deep learning and optimization
Ajagekar, A., & You, F. (2023) · npj Computational Materials · doi:10.1038/s41524-023-01099-0 · Cited by 48
QTN-VQC: an end-to-end learning framework for quantum neural networks
Qi, J., Yang, C.-H. H., & Chen, P. (2023) · Physica Scripta · doi:10.1088/1402-4896/ad14d6 · Cited by 77
Quantum Error Mitigated Classical Shadows
Jnane, H., Steinberg, J., Cai, Z., Nguyen, H. C., & Koczor, B. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.010324 · Cited by 69
A Vision for the Future of Multiscale Modeling
Capone, M., Romanelli, M., Castaldo, D., Parolin, G., Bello, A., Gil, G., & Vanzan, M. (2024) · ACS Physical Chemistry Au · doi:10.1021/acsphyschemau.3c00080 · Cited by 48
Diagnosing non-Hermitian many-body localization and quantum chaos via singular value decomposition
Roccati, F., Balducci, F., Shir, R., & Chenu, A. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.l140201 · Cited by 54
A resource-efficient quantum convolutional neural network
Song, Y., Li, J., Wu, Y., Qin, S., Wen, Q., & Gao, F. (2024) · Frontiers in Physics · doi:10.3389/fphy.2024.1362690 · Cited by 48
Ajagekar, A., & You, F. (2024) · Advances in Applied Energy · doi:10.1016/j.adapen.2024.100179 · Cited by 49
Quantum‐Noise‐Driven Generative Diffusion Models
Parigi, M., Martina, S., & Caruso, F. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300401 · Cited by 67
Fault-tolerant protection of near-term trapped-ion topological qubits under realistic noise sources
Bermudez, A., Xu, X., Gutiérrez, M., Benjamin, S. C., & Müller, M. (2019) · Physical Review A · doi:10.1103/physreva.100.062307 · Cited by 37
An artificial spiking quantum neuron
Kristensen, L. B., Degroote, M., Wittek, P., Aspuru‐Guzik, A., & Zinner, N. T. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00381-7 · Cited by 55
Improved DD-based Equivalence Checking of Quantum Circuits
Burgholzer, L., & Wille, R. (2020) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/asp-dac47756.2020.9045153 · Cited by 47
Operational Quantification of Continuous-Variable Quantum Resources
Regula, B., Lami, L., Ferrari, G., & Takagi, R. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.110403 · Cited by 59
Quantum circuit optimization using quantum Karnaugh map
Bae, J.-H., Alsing, P. M., Ahn, D., & Miller, W. A. (2020) · Scientific Reports · doi:10.1038/s41598-020-72469-7 · Cited by 41
A complete hierarchy for the pure state marginal problem in quantum mechanics
Yu, X., Simnacher, T., Wyderka, N., Nguyen, H. C., & Gühne, O. (2021) · Nature Communications · doi:10.1038/s41467-020-20799-5 · Cited by 76
Quantum Algorithm for Fidelity Estimation
Wang, Q., Zhang, Z., Chen, K., Guan, J., Fang, W. S., Liu, J., & Ying, M. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3203985 · Cited by 83
GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
Willsch, D., Willsch, M., Jin, F., Michielsen, K., & De Raedt, H. (2022) · Computer Physics Communications · doi:10.1016/j.cpc.2022.108411 · Cited by 36
Quantum Algorithms and Simulation for Parallel and Distributed Quantum Computing
Parekh, R., Ricciardi, A., Darwish, A., & DiAdamo, S. (2021) · IEEE/ACM International Workshop on Quantum Computing Software (QCS) · doi:10.1109/qcs54837.2021.00005 · Cited by 73
JigSaw: Boosting Fidelity of NISQ Programs via Measurement Subsetting
Das, P., Tannu, S., & Qureshi, M. (2021) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3466752.3480044 · Cited by 65
Applying the quantum approximate optimization algorithm to the minimum vertex cover problem
Zhang, Y., Mu, X. D., Liu, X., Wang, X., Zhang, X., Li, K., Wu, T., Zhao, D., & Dong, C. (2022) · Applied Soft Computing · doi:10.1016/j.asoc.2022.108554 · Cited by 49
Ising machines with strong bilinear coupling
Heugel, T. L., Zilberberg, O., Marty, C., Chitra, R., & Eichler, A. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013149 · Cited by 47
Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks
Chen, Y., Chen, Y., Lee, C., Zhang, S., & Hsieh, C. (2022) · Nature Machine Intelligence · doi:10.1038/s42256-022-00446-y · Cited by 57
Scaling quantum approximate optimization on near-term hardware
Lotshaw, P. C., Nguyen, T., Santana, A., McCaskey, A., Herrman, R., Ostrowski, J., Siopsis, G., & Humble, T. S. (2022) · Scientific Reports · doi:10.1038/s41598-022-14767-w · Cited by 60
Variational Hamiltonian simulation for translational invariant systems via classical pre-processing
Mansuroglu, R., Eckstein, T., Nützel, L., Wilkinson, S. A., & Hartmann, M. J. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acb1d0 · Cited by 56
Patel, T., Potharaju, A., Li, B., Roy, R. B., & Tiwari, D. (2020) · SC20: International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc41405.2020.00050 · Cited by 37
“But, NISQ machines employ a circuit-based approach toward developing and executing quantum programs, including practical high-performance computing (HPC) problems [6, 24, 36, 48], as compared to the quantum annealing approach which is limited to a subset of problems [22, 42, 43].”
BackgroundMethodInfluentialMulti-level quantum noise spectroscopy
Sung, Y., Vepsäläinen, A. P., Braumüller, J., Yan, F., Wang, J. I.-J., Kjærgaard, M., Winik, R., Krantz, P., Bengtsson, A., Melville, A. J., et al. (2021) · Nature Communications · doi:10.1038/s41467-021-21098-3 · Cited by 52
Chia, N.-H., Gilyén, A., Li, T., Lin, H.-H., Tang, E., & Wang, C. (2022) · Journal of the ACM · doi:10.1145/3549524 · Cited by 94
Urgelles, H., Picazo-Martínez, P., García‐Roger, D., & Monserrat, J. F. (2022) · Sensors · doi:10.3390/s22197570 · Cited by 44
Reference-State Error Mitigation: A Strategy for High Accuracy Quantum Computation of Chemistry
Lolur, P., Skogh, M., Dobrautz, W., Warren, C., Biznárová, J., Osman, A., Tancredi, G., Wendin, G. P., Bylander, J., & Rahm, M. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00807 · Cited by 53
Simulating large-size quantum spin chains on cloud-based superconducting quantum computers
Yu, H., Zhao, Y., & Wei, T.-C. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.013183 · Cited by 59
Quantum Deep Recurrent Reinforcement Learning
Chen, S. Y.-C. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10096981 · Cited by 59
High Dimensional Quantum Machine Learning With Small Quantum Computers
Marshall, S. C., Gyurik, C., & Dunjko, V. (2023) · Quantum · doi:10.22331/q-2023-08-09-1078 · Cited by 61
An expressive ansatz for low-depth quantum approximate optimisation
Vijendran, V., Das, A., Koh, D. E., Assad, S. M., & Lam, P. K. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad200a · Cited by 66
Three Carleman routes to the quantum simulation of classical fluids
Sanavio, C., Scatamacchia, R., de Falco, C., & Sauro Succi, A. (2024) · Physics of Fluids · doi:10.1063/5.0204955 · Cited by 36
Quantum computing for market research
Sáez‐Ortuño, L., Huertas-García, R., Forgas‐Coll, S., Sánchez, J., & Puertas, E. (2024) · Journal of Innovation & Knowledge · doi:10.1016/j.jik.2024.100510 · Cited by 59
Resource-efficient photonic quantum computation with high-dimensional cluster states
Lib, O., & Bromberg, Y. (2024) · Nature Photonics · doi:10.1038/s41566-024-01524-w · Cited by 56
Universal distributed blind quantum computing with solid-state qubits
Wei, Y.-C., Stas, P.-J., Suleymanzade, A., Baranes, G., Machado, F., Huan, Y. Q., Knaut, C. M., Ding, S. W., Merz, M., Knall, E., et al. (2025) · Science · doi:10.1126/science.adu6894 · Cited by 84
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.