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 301–400 of 8,640
Single-photon detection and cryogenic reconfigurability in lithium niobate nanophotonic circuits
Lomonte, E., Wolff, M. A., Beutel, F., Ferrari, S., Schuck, C., Pernice, W. H. P., & Lenzini, F. (2021) · Nature Communications · doi:10.1038/s41467-021-27205-8 · Cited by 163
Present landscape of quantum computing
Hassija, V., Chamola, V., Saxena, V., Chanana, V., Parashari, P., Mumtaz, S., & Guizani, M. (2020) · IET Quantum Communication · doi:10.1049/iet-qtc.2020.0027 · Cited by 188
Suppression of Crosstalk in Superconducting Qubits Using Dynamical Decoupling
Tripathi, V., Chen, H., Khezri, M., Yip, K.-W., Levenson-Falk, E. M., & Lidar, D. A. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.024068 · Cited by 134
At the Dawn of Generative AI Era: A Tutorial-cum-Survey on New Frontiers in 6G Wireless Intelligence
Celik, A., & Eltawil, A. M. (2024) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2024.3362271 · Cited by 196
Hubregtsen, T., Pichlmeier, J., Stecher, P., & Bertels, K. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00038-w · Cited by 135
Towards analog quantum simulations of lattice gauge theories with trapped ions
Davoudi, Z., Hafezi, M., Monroe, C. R., Pagano, G., Seif, A., & Shaw, A. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023015 · Cited by 165
Unfolding quantum computer readout noise
Nachman, B., Urbanek, M., de Jong, W. A., & Bauer, C. W. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00309-7 · Cited by 135
Chen, S., Yu, W., Zeng, P., & Flammia, S. T. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030348 · Cited by 230
SU(2) hadrons on a quantum computer via a variational approach
Atas, Y. Y., Zhang, J., Lewis, R., Jahanpour, A., Haase, J. F., & Muschik, C. A. (2021) · Nature Communications · doi:10.1038/s41467-021-26825-4 · Cited by 235
Time-Optimal Two- and Three-Qubit Gates for Rydberg Atoms
Jandura, S., & Pupillo, G. (2022) · Quantum · doi:10.22331/q-2022-05-13-712 · Cited by 149
Hardware Efficient Quantum Simulation of Non-Abelian Gauge Theories with Qudits on Rydberg Platforms
González-Cuadra, D., Zache, T. V., Carrasco, J. A., Kraus, B., & Zoller, P. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.160501 · Cited by 196
Logical-qubit operations in an error-detecting surface code
(2021) · doi:10.1038/s41567-021-01423-9 · Cited by 141
Detector tomography on IBM quantum computers and mitigation of an imperfect measurement
Chen, Y., Farahzad, M., Yoo, S., & Wei, T.-C. (2019) · Physical Review A · doi:10.1103/physreva.100.052315 · Cited by 132
Full-state quantum circuit simulation by using data compression
Wu, X.-C., Di, S., Dasgupta, E. M., Cappello, F., Finkel, H., Alexeev, Y., & Chong, F. T. (2019) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3295500.3356155 · Cited by 180
Martinis, J. M. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00431-0 · Cited by 133
Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
Luo, X.-Z., Liu, J.-G., Zhang, P., & Wang, L. (2020) · Quantum · doi:10.22331/q-2020-10-11-341 · Cited by 157
“Given the limitations of near-term noisy intermediate-scale quantum circuits [1], it is advantageous to treat Xiu-Zhe Luo: rogerluo.rl18@gmail.com Jin-Guo Liu: cacate0129@iphy.ac.cn quantum devices as co-processors and compliment their abilities with classical computing resources.”
Reinforcement Learning with Quantum Variational Circuit
Lockwood, O., & Si, M. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v16i1.7437 · Cited by 240
SupermarQ: A Scalable Quantum Benchmark Suite
Tomesh, T., Gokhale, P., Omole, V., Ravi, G. S., Smith, K. N., Viszlai, J., Wu, X.-C., Hardavellas, N., Martonosi, M. R., & Chong, F. T. (2022) · 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca53966.2022.00050 · Cited by 139
On-demand entanglement of molecules in a reconfigurable optical tweezer array
Holland, C. M., Lu, Y., & Cheuk, L. W. (2023) · Science · doi:10.1126/science.adf4272 · Cited by 253
Drug design on quantum computers
(2024) · doi:10.1038/s41567-024-02411-5 · Cited by 132
McKenna, T. P., Witmer, J. D., Patel, R. N., Jiang, W., Van Laer, R., Arrangoiz-Arriola, P., Wollack, E. A., Herrmann, J. F., & Safavi-Naeini, A. H. (2020) · Optica · doi:10.1364/optica.397235 · Cited by 130
“In contrast, superconducting qubits [12, 13], a leading technology for near-term NISQ era quantum information processing [14], operate at microwave frequencies in the few gigahertz range and are not readily addressable with light.”
BackgroundSilicon Carbide Photonics Bridging Quantum Technology
Castelletto, S., Peruzzo, A., Bonato, C., Johnson, B. C., Radulaski, M., Ou, H., Kaiser, F., & Wrachtrup, J. (2022) · ACS Photonics · doi:10.1021/acsphotonics.1c01775 · Cited by 146
Full-stack, real-system quantum computer studies: architectural comparisons and design insights
Murali, P., Linke, N. M., Martonosi, M., Abhari, A. J., Nguyen, N. H., & Alderete, C. H. (2019) · Proceedings of the 46th International Symposium on Computer Architecture · doi:10.1145/3307650.3322273 · Cited by 128
“This scale is typically too small to implement quantum error correction, but if used efficiently these machines may have promising applications in various domains [52] and can pave the way towards practical QC.”
BackgroundHaase, J. F., Dellantonio, L., Celi, A., Paulson, D., Kan, A., Jansen, K., & Muschik, C. A. (2021) · Quantum · doi:10.22331/q-2021-02-04-393 · Cited by 215
Simulating 2D Effects in Lattice Gauge Theories on a Quantum Computer
Paulson, D., Dellantonio, L., Haase, J. F., Celi, A., Kan, A., Jena, A., Kokail, C., van Bijnen, R., Jansen, K., Zoller, P., et al. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030334 · Cited by 178
High-fidelity qutrit entangling gates for superconducting circuits
Goss, N., Morvan, A., Marinelli, B., Mitchell, B. K., Nguyen, L. B., Naik, R. K., Chen, L., Jünger, C., Kreikebaum, J. M., Santiago, D. I., et al. (2022) · Nature Communications · doi:10.1038/s41467-022-34851-z · Cited by 129
Measurements of Quantum Hamiltonians with Locally-Biased Classical Shadows
Hadfield, C., Bravyi, S., Raymond, R., & Mezzacapo, A. (2020) · arXiv · doi:10.48550/arxiv.2006.15788 · Cited by 129
Machine learning of high dimensional data on a noisy quantum processor
Peters, E., Caldeira, J., Ho, A., Leichenauer, S., Mohseni, M., Neven, H., Spentzouris, P., Strain, D., & Perdue, G. N. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00498-9 · Cited by 127
Benchmarking the quantum approximate optimization algorithm
Willsch, M., Willsch, D., Jin, F., De Raedt, H., & Michielsen, K. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02692-8 · Cited by 128
Completely Positive Divisibility Does Not Mean Markovianity
Milz, S., Kim, M. S., Pollock, F. A., & Modi, K. K. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.040401 · Cited by 161
Quantum Algorithm for High Energy Physics Simulations
Nachman, B. P., Provasoli, D., de Jong, W. A., & Bauer, C. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.062001 · Cited by 191
Experimental error mitigation via symmetry verification in a variational quantum eigensolver
Sagastizabal, R., Bonet-Monroig, X., Singh, M., Rol, M. A., Bultink, C. C., Fu, X., Price, C. H., Ostroukh, V. P., Muthusubramanian, N., Bruno, A., et al. (2019) · Physical Review A · doi:10.1103/physreva.100.010302 · Cited by 126
Search for efficient formulations for Hamiltonian simulation of non-Abelian lattice gauge theories
Davoudi, Z., Raychowdhury, I., & Shaw, A. (2021) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.104.074505 · Cited by 175
Noisy intermediate-scale quantum computers
Cheng, B., Deng, X., Gu, X. Q., He, Y., Hu, G., Huang, P., Li, J., Lin, B., Lu, D., Lu, Y., et al. (2023) · Frontiers of Physics · doi:10.1007/s11467-022-1249-z · Cited by 182
Hybrid Quantum-Classical Convolutional Neural Network Model for Image Classification
Fan, F., Shi, Y., Guggemos, T., & Zhu, X. X. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3312170 · Cited by 193
Capacity and Quantum Geometry of Parametrized Quantum Circuits
Haug, T., Bharti, K., & Kim, M. S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040309 · Cited by 127
Decoding quantum errors with subspace expansions
McClean, J. R., Jiang, Z., Rubin, N. C., Babbush, R., & Neven, H. (2020) · Nature Communications · doi:10.1038/s41467-020-14341-w · Cited by 126
Adaptive Variational Quantum Dynamics Simulations
Yao, Y.-X., Gomes, N., Zhang, F., Wang, C.-Z., Ho, K.-M., Iadecola, T., & Orth, P. P. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030307 · Cited by 184
Quantum Computing 40 Years Later
Preskill, J. P. (2023) · CRC Press eBooks · doi:10.1201/9781003358817-7 · Cited by 190
Self-citationTensorCircuit: a Quantum Software Framework for the NISQ Era
Zhang, S., Allcock, J., Wan, Z., Liu, S., Sun, J., Yu, H., Yang, X.-H., Qiu, J., Ye, Z., Chen, Y., et al. (2023) · Quantum · doi:10.22331/q-2023-02-02-912 · Cited by 209
Barren Plateaus Preclude Learning Scramblers
Holmes, Z., Arrasmith, A., Yan, B., Coles, P. J., Albrecht, A., & Sornborger, A. T. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.190501 · Cited by 125
“[22] John Preskill, “Quantum Computing in the NISQ era and beyond,” Quantum 2, 79 (2018).”
BackgroundA Case for Multi-Programming Quantum Computers
Das, P., Tannu, S. S., Nair, P. J., & Qureshi, M. (2019) · Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3352460.3358287 · Cited by 123
Mugel, S., Kuchkovsky, C., Sánchez, E., Fernández-Lorenzo, S., Luis-Hita, J., Lizaso, E., & Orús, R. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013006 · Cited by 124
Variational quantum algorithm for the Poisson equation
Liu, H., Wu, Y., Wan, L., Pan, S., Qin, S., Gao, F., & Wen, Q. (2021) · Physical Review A · doi:10.1103/physreva.104.022418 · Cited by 168
Quantum Information and Algorithms for Correlated Quantum Matter
Head-Marsden, K., Flick, J., Ciccarino, C. J., & Narang, P. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.0c00620 · Cited by 156
Barren plateaus preclude learning scramblers
Holmes, Z., Arrasmith, A., Yan, B., Coles, P. J., Albrecht, A., & Sornborger, A. T. (2020) · arXiv · doi:10.48550/arxiv.2009.14808 · Cited by 125
Establishing the quantum supremacy frontier with a 281 Pflop/s simulation
Villalonga, B., Lyakh, D., Boixo, S., Neven, H., Humble, T. S., Biswas, R., Rieffel, E. G., Ho, A., & Mandrà, S. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab7eeb · Cited by 124
Quantum Computing and Simulations for Energy Applications: Review and Perspective
Paudel, H. P., Syamlal, M., Crawford, S. E., Lee, Y., Shugayev, R., Lu, P., Ohodnicki, P. R., Mollot, D., & Duan, Y. (2022) · ACS Engineering Au · doi:10.1021/acsengineeringau.1c00033 · Cited by 191
An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
Kübler, J. M., Arrasmith, A., Cincio, L., & Coles, P. J. (2020) · Quantum · doi:10.22331/q-2020-05-11-263 · Cited by 141
Continuous-variable quantum computing in the quantum optical frequency comb
Pfister, O. (2020) · Journal of Physics B: Atomic, Molecular and Optical Physics · doi:10.1088/1361-6455/ab526f · Cited by 123
Fisher Information in Noisy Intermediate-Scale Quantum Applications
Meyer, J. J. (2021) · Quantum · doi:10.22331/q-2021-09-09-539 · Cited by 213
Piroli, L., Styliaris, G., & Cirac, J. I. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.220503 · Cited by 211
Rath, M., & Date, H. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00285-3 · Cited by 243
Quantum simulations of hadron dynamics in the Schwinger model using 112 qubits
Farrell, R. C., Illa, M., Ciavarella, A. N., & Savage, M. J. (2024) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.109.114510 · Cited by 246
A tweezer array with 6,100 highly coherent atomic qubits
Manetsch, H. J., Nomura, G., Bataille, E., Lv, X., Leung, K. H., & Endres, M. (2025) · Nature · doi:10.1038/s41586-025-09641-4 · Cited by 491
Harrow, A. W., & Napp, J. C. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.140502 · Cited by 121
“t or stochastic mirror descent algorithms. 1 Introduction 1.1 Variational hybrid quantum-classical algorithms As quantum computing enters the era of Noisy Intermediate-Scale Quantum (NISQ) technology [Pre18], a research effort has developed which aims to understand the capabilities and limitations of quantum computing…”
MethodInfluentialMeasurement reduction in variational quantum algorithms
Zhao, A., Tranter, A., Kirby, W. M., Ung, S. F., Miyake, A., & Love, P. J. (2020) · Physical Review A · doi:10.1103/physreva.101.062322 · Cited by 121
Reducing Qubit Requirements for Quantum Simulations Using Molecular Point Group Symmetries
Setia, K., Chen, R., Rice, J. E., Mezzacapo, A., Pistoia, M., & Whitfield, J. D. (2020) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.0c00113 · Cited by 121
QNLP in Practice: Running Compositional Models of Meaning on a Quantum Computer
Lorenz, R., Pearson, A., Meichanetzidis, K., Kartsaklis, D., & Coecke, B. (2023) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.14329 · Cited by 221
Materials challenges for trapped-ion quantum computers
Brown, K. R., Chiaverini, J., Sage, J. M., & Häffner, H. (2021) · Nature Reviews Materials · doi:10.1038/s41578-021-00292-1 · Cited by 120
Hierarchy of Topological Order From Finite-Depth Unitaries, Measurement, and Feedforward
Tantivasadakarn, N., Vishwanath, A., & Verresen, R. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.020339 · Cited by 220
Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
Gonthier, J. F., Radin, M. D., Buda, C., Doskocil, E. J., Abuan, C. M., & Romero, J. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033154 · Cited by 120
“The next milestone, and arguably the most pressing one [5], is finding a practical quantum advantage with noisy intermediate-scale quantum (NISQ) devices [6], that is, running an algorithm on a NISQ device that provides an improved solution for a commercially relevant task.”
BackgroundAsymptotic improvements to quantum circuits via qutrits
Gokhale, P., Baker, J. M., Duckering, C., Brown, N. C., Brown, K. R., & Chong, F. T. (2019) · Proceedings of the 46th International Symposium on Computer Architecture · doi:10.1145/3307650.3322253 · Cited by 120
“While early research efforts focused on longer-term systems employing full error correction to execute large instances of algorithms like Shor factoring [3] and Grover search [4], recent work has focused on NISQ (Noisy Intermediate Scale Quantum) computation [5].”
Measurement-induced entanglement transitions in many-body localized systems
Lunt, O., & Pal, A. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043072 · Cited by 155
Security Considerations for Internet of Things: A Survey
Jurcut, A., Niculcea, T., Ranaweera, P., & Le-Khac, N.-A. (2020) · SN Computer Science · doi:10.1007/s42979-020-00201-3 · Cited by 119
Localization and Mitigation of Loss in Niobium Superconducting Circuits
Altoé, M. V. P., Banerjee, A., Berk, C., Hajr, A., Schwartzberg, A., Song, C., Alghadeer, M., Aloni, S., Elowson, M. J., Kreikebaum, J. M., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020312 · Cited by 119
Gao, D., Fan, D., Zha, C., Bei, J., Cai, G., Cai, J., Cao, S., Chen, F., Jiang, C., Chen, K. Y., et al. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.090601 · Cited by 272
Extending the computational reach of a noisy superconducting quantum processorPreprint
Kandala, A., Temme, K., Corcoles, A. D., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.04492 · Cited by 119
Error-protected qubits in a silicon photonic chip
Vigliar, C., Paesani, S., Ding, Y., Adcock, J. C., Wang, J., Morley-Short, S., Bacco, D., Oxenløwe, L. K., Thompson, M. G., Rarity, J. G., et al. (2021) · Nature Physics · doi:10.1038/s41567-021-01333-w · Cited by 118
“While rudimentary quantum computers can now solve abstract tasks that are intractable to classical computers [1–3], a general purpose quantum computer will require error-correcting schemes to protect information as it is processed in a useful quantum algorithm [4, 5].”
Background(2019) · doi:10.1145/3297858.3304018 · Cited by 118
Krotov: A Python implementation of Krotov's method for quantum optimal control
Goerz, M. H., Basilewitsch, D., Gago-Encinas, F., Krauss, M. G., Horn, K. P., Reich, D. M., & Koch, C. P. (2019) · SciPost Physics · doi:10.21468/scipostphys.7.6.080 · Cited by 174
Quantifying magic for multi-qubit operations
Seddon, J. R., & Campbell, E. T. (2019) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2019.0251 · Cited by 168
Quantum computing models for artificial neural networks
Mangini, S., Tacchino, F., Gerace, D., Bajoni, D., & Macchiavello, C. (2021) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/134/10002 · Cited by 159
Mitigating Measurement Errors in Quantum Computers by Exploiting State-Dependent Bias
Tannu, S. S., & Qureshi, M. K. (2019) · Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture · doi:10.1145/3352460.3358265 · Cited by 118
Applications of near-term photonic quantum computers: software and algorithms
Bromley, T. R., Arrazola, J. M., Jahangiri, S., Izaac, J., Quesada, N., Gran, A. D., Schuld, M., Swinarton, J., Zabaneh, Z., & Killoran, N. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8504 · Cited by 128
Bongard, J., & Levin, M. (2021) · Frontiers in Ecology and Evolution · doi:10.3389/fevo.2021.650726 · Cited by 114
Liu, Y., Liu, X., Li, F., Fu, H., Yang, Y., Song, J., Zhao, P., Wang, Z., Peng, D., Chen, H., et al. (2021) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3458817.3487399 · Cited by 209
Neutral atom quantum computing hardware: performance and end-user perspective
Wintersperger, K., Dommert, F., Ehmer, T., Hoursanov, A., Klepsch, J., Mauerer, W., Reuber, G., Strohm, T., Yin, M., & Luber, S. (2023) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-023-00190-1 · Cited by 117
Orbital optimized unitary coupled cluster theory for quantum computer
Mizukami, W., Mitarai, K., Nakagawa, Y. O., Yamamoto, T., Yan, T., & Ohnishi, Y.-Y. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033421 · Cited by 116
Quantum reservoir computing with a single nonlinear oscillator
Govia, L. C. G., Ribeill, G. J., Rowlands, G. E., Krovi, H., & Ohki, T. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013077 · Cited by 159
Measurements of Quantum Hamiltonians with Locally-Biased Classical Shadows
Hadfield, C., Bravyi, S., Raymond, R., & Mezzacapo, A. (2022) · Communications in Mathematical Physics · doi:10.1007/s00220-022-04343-8 · Cited by 117
Magann, A. B., Arenz, C., Grace, M. D., Ho, T.-S., Kosut, R. L., McClean, J. R., Rabitz, H. A., & Sarovar, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010101 · Cited by 116
Achieving a quantum smart workforce
Aiello, C. D., Awschalom, D. D., Bernien, H., Brower, T., Brown, K. R., Brun, T. A., Caram, J. R., Chitambar, E., Di Felice, R., Edmonds, K. M., et al. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/abfa64 · Cited by 115
Optimization of quantum circuit mapping using gate transformation and commutation
Itoko, T., Raymond, R., Imamichi, T., & Matsuo, A. (2020) · Integration · doi:10.1016/j.vlsi.2019.10.004 · Cited by 102
Machine Learning Algorithms in Quantum Computing: A Survey
Ramezani, S. B., Sommers, A., Manchukonda, H. K., Rahimi, S., & Amirlatifi, A. (2020) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn48605.2020.9207714 · Cited by 186
Heim, B., Soeken, M., Marshall, S., Granade, C., Roetteler, M., Geller, A., Troyer, M., & Svore, K. M. (2020) · Nature Reviews Physics · doi:10.1038/s42254-020-00245-7 · Cited by 159
Quantum Generative Models for Small Molecule Drug Discovery
Li, J., Topaloglu, R. O., & Ghosh, S. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3104804 · Cited by 119
The Dawn of Quantum Natural Language Processing
Sipio, R. D., Huang, J.-H., Chen, S. Y.-C., Mangini, S., & Worring, M. (2022) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp43922.2022.9747675 · Cited by 172
Midcircuit Operations Using the omg Architecture in Neutral Atom Arrays
Lis, J. W., Senoo, A., McGrew, W. F., Rönchen, F., Jenkins, A., & Kaufman, A. M. (2023) · Physical Review X · doi:10.1103/physrevx.13.041035 · Cited by 113
“In many NISQ-era experiments, these operations bookend an experiment, e.g., in a finite-depth quantum circuit, studying a many-body Hamiltonian for quantum simulation, or integrating a phase from a signal Hamiltonian for metrology [2,3].”
MethodA verified optimizer for Quantum circuits
Hietala, K., Rand, R., Hung, S.-H., Wu, X., & Hicks, M. (2021) · Proceedings of the ACM on Programming Languages · doi:10.1145/3434318 · Cited by 209
Fractal, Logarithmic, and Volume-Law Entangled Nonthermal Steady States via Spacetime Duality
Ippoliti, M., Rakovszky, T., & Khemani, V. (2022) · Physical Review X · doi:10.1103/physrevx.12.011045 · Cited by 147
Baum, Y., Amico, M., Howell, S., Hush, M., Liuzzi, M., Mundada, P., Merkh, T., Carvalho, A. R. R., & Biercuk, M. J. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040324 · Cited by 116
Digital quantum simulation of Floquet symmetry-protected topological phases
Zhang, X., Jiang, W., Deng, J., Wang, K., Chen, J., Zhang, P., Ren, W., Dong, H., Xu, S., Gao, Y. Q., et al. (2022) · Nature · doi:10.1038/s41586-022-04854-3 · Cited by 183
Measuring the Rényi entropy of a two-site Fermi-Hubbard model on a trapped ion quantum computer
Linke, N. M., Johri, S., Figgatt, C., Landsman, K. A., Matsuura, A. Y., & Monroe, C. (2018) · Physical Review A · doi:10.1103/physreva.98.052334 · Cited by 112
Crossing a topological phase transition with a quantum computer
Smith, A., Jobst, B., Green, A. G., & Pollmann, F. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.l022020 · Cited by 111
Quantum transfer learning for breast cancer detection
Azevedo, V., Silva, C., & Dutra, I. (2022) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00062-4 · Cited by 131
Phase transitions in random circuit sampling
Morvan, A., Villalonga, B., Mi, X., Mandrà, S., Bengtsson, A., Klimov, P. V., Chen, Z., Hong, S., Erickson, C., Drozdov, I., et al. (2024) · Nature · doi:10.1038/s41586-024-07998-6 · Cited by 354
A variational toolbox for quantum multi-parameter estimation
Meyer, J. J., Borregaard, J., & Eisert, J. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00425-y · Cited by 111
Efficient Measure for the Expressivity of Variational Quantum Algorithms
Du, Y., Tu, Z., Yuan, X., & Tao, D. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.080506 · Cited by 194
Probabilistic computing using Cu0.1Te0.9/HfO2/Pt diffusive memristors
Woo, K. S., Kim, J., Han, J., Kim, W., Jang, Y. H., & Hwang, C. S. (2022) · Nature Communications · doi:10.1038/s41467-022-33455-x · Cited by 152
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.