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 2,601–2,700 of 8,640
Shirai, N., Kubo, K., Mitarai, K., & Fujii, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033179 · Cited by 50
Tomography of time-dependent quantum Hamiltonians with machine learning
Han, C.-D., Glaz, B. J., Haile, M., & Lai, Y. (2021) · Physical Review A · doi:10.1103/physreva.104.062404 · Cited by 19
Progress toward practical quantum cryptanalysis by variational quantum cloning
Coyle, B., Doosti, M., Kashefi, E., & Kumar, N. (2022) · Physical Review A · doi:10.1103/physreva.105.042604 · Cited by 21
Approximating Decision Diagrams for Quantum Circuit Simulation
Hillmich, S., Zulehner, A., Kueng, R., Markov, I. L., & Wille, R. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3530776 · Cited by 18
SnuQS: scaling quantum circuit simulation using storage devices
Park, D., Kim, H., Kim, J.-P., Kim, T., & Lee, J. (2022) · International Conference on Supercomputing · doi:10.1145/3524059.3532375 · Cited by 24
Configurable Readout Error Mitigation in Quantum Workflows
Beisel, M., Barzen, J., Leymann, F., Truger, F., Weder, B., & Yussupov, V. (2022) · Electronics · doi:10.3390/electronics11192983 · Cited by 19
Ishiyama, Y., Nagai, R., Mieda, S., Takei, Y., Minato, Y., & Natsume, Y. (2022) · Scientific Reports · doi:10.1038/s41598-022-22940-4 · Cited by 22
How Quantum Computing-Friendly Multispectral Data can be?
Gupta, M. K., Beseda, M., & Gawron, P. (2022) · IEEE International Geoscience and Remote Sensing Symposium (IGARSS) · doi:10.1109/igarss46834.2022.9883676 · Cited by 30
Quantum Circuit Implementation of Multi-Dimensional Non-Linear Lattice Models
Steijl, R. (2022) · Applied Sciences · doi:10.3390/app13010529 · Cited by 21
QuCNN: A Quantum Convolutional Neural Network with Entanglement Based Backpropagation
Stein, S., Mao, Y., Ang, J., & Li, A. (2022) · IEEE/ACM Symposium on Edge Computing (SEC) · doi:10.1109/sec54971.2022.00054 · Cited by 18
Noise effects on purity and quantum entanglement in terms of physical implementability
Guo, Y., & Yang, S. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00680-1 · Cited by 27
Restoring broken symmetries using quantum search “oracles”
Guzman, E. A. R., & Lacroix, D. (2023) · Physical Review C · doi:10.1103/physrevc.107.034310 · Cited by 17
Efficient quantum simulation of electron-phonon systems by variational basis state encoder
Li, W., Ren, J., Huai, S., Cai, T., Shuai, Z., & Zhang, S. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023046 · Cited by 19
Rank of a tensor and quantum entanglement
Bruzda, W., Friedland, S., & Życzkowski, K. (2023) · Linear and Multilinear Algebra · doi:10.1080/03081087.2023.2211717 · Cited by 41
Spin-motion coupling in a circular-Rydberg-state quantum simulator: Case of two atoms
Méhaignerie, P., Sayrin, C., Raimond, J. M., Brune, M., & Roux, G. (2023) · Physical Review A · doi:10.1103/physreva.107.063106 · Cited by 22
Quantum Uncertainty Principles for Measurements with Interventions
Xiao, Y., Yang, Y., Wang, X., Liu, Q., & Gu, M. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.240201 · Cited by 29
Müller-Rigat, G., Srivastava, A. K., Kurdziałek, S., Rajchel-Mieldzioć, G., Lewenstein, M., & Frérot, I. (2023) · Quantum · doi:10.22331/q-2023-10-24-1152 · Cited by 22
Critical behavior of the Ising model by preparing the thermal state on a quantum computer
Wang, X., Feng, X., Hartung, T., Jansen, K., & Stornati, P. (2023) · Physical Review A · doi:10.1103/physreva.108.022612 · Cited by 22
Recommending Solution Paths for Solving Optimization Problems with Quantum Computing
Poggel, B., Quetschlich, N., Burgholzer, L., Wille, R., & Lorenz, J. M. (2023) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw59989.2023.00017 · Cited by 22
Accurate and efficient calculations of Hellmann–Feynman forces for quantum computation
Lai, J., Fan, Y., Fu, Q., Li, Z., & Yang, J. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0167444 · Cited by 15
Hybrid quantum-classical convolutional neural network for phytoplankton classification
Shi, S., Wang, Z., Shang, R., Li, Y., Li, J., Zhong, G., & Gu, Y. (2023) · Frontiers in Marine Science · doi:10.3389/fmars.2023.1158548 · Cited by 16
Quantum circuit compilation and hybrid computation using Pauli-based computation
Peres, F. C. R., & Galvão, E. F. (2023) · Quantum · doi:10.22331/q-2023-10-03-1126 · Cited by 33
Automated Generation of Shuttling Sequences for a Linear Segmented Ion Trap Quantum Computer
Durandau, J., Wagner, J., Mailhot, F., Brunet, C.-A., Schmidt‐Kaler, F., Poschinger, U., & Bérubé-Lauzière, Y. (2023) · Quantum · doi:10.22331/q-2023-11-08-1175 · Cited by 28
Restoring symmetries in quantum computing using Classical Shadows
Guzman, E. A. R., & Denis Lacroix, A. (2024) · The European Physical Journal A · doi:10.1140/epja/s10050-024-01314-6 · Cited by 18
Designing quantum blockchain system integrated with 6G network
Saini, R. K., Bera, A., Behera, B. K., Ahmed, E. A., Jamjoom, M. M., & Farouk, A. (2023) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2023.101847 · Cited by 21
Peixoto, M. C., Castro, N. F., Romão, M. C., Oliveira, M. G. J., & Ochoa, I. (2023) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2023.1268852 · Cited by 19
Variational quantum algorithms for simulation of Lindblad dynamics
Watad, T., & Lindner, N. H. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ad17d8 · Cited by 24
Venkatesh, K., Naik, K. J., & Shankar, A. (2024) · Multimedia Tools and Applications · doi:10.1007/s11042-023-17992-1 · Cited by 22
Controlling NMR spin systems for quantum computation
Jones, J. A. (2024) · Progress in Nuclear Magnetic Resonance Spectroscopy · doi:10.1016/j.pnmrs.2024.02.002 · Cited by 37
Overhead-constrained circuit knitting for variational quantum dynamics
Gentinetta, G., Metz, F., & Carleo, G. (2024) · Quantum · doi:10.22331/q-2024-03-21-1296 · Cited by 35
Schulz, S., Willsch, D., & Michielsen, K. F. L. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013312 · Cited by 18
Entanglement-variational hardware-efficient ansatz for eigensolvers
Wang, X., Qi, B., Wang, Y., & Dong, D. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.034059 · Cited by 23
Rao, X. (2024) · Physics of Fluids · doi:10.1063/5.0201739 · Cited by 24
Quantum Davidson algorithm for excited states
Tkachenko, N. V., Cincio, Ł., Boldyrev, A. I., Tretiak, S., Dub, P. A., & Zhang, Y. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad3a97 · Cited by 57
Gülbahar, B. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3383101 · Cited by 22
Secure Delegated Variational Quantum Algorithms
Li, Q., Quan, J., Shi, J., Zhang, S., & Li, X. (2024) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2024.3391690 · Cited by 23
Neural-shadow quantum state tomography
Wei, V., Coish, W. A., Ronagh, P., & Muschik, C. A. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023250 · Cited by 25
Real-time quantum dynamics of thermal states with neural thermofields
Nys, J., Denis, Z., & Carleo, G. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.235120 · Cited by 32
Learning Quantum Hamiltonians at Any Temperature in Polynomial Time
Bakshi, A., Liu, A., Moitra, A., & Tang, E. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649619 · Cited by 58
Quantum trajectory entanglement in various unravelings of Markovian dynamics
Vovk, T., & Pichler, H. (2024) · Physical Review A · doi:10.1103/physreva.110.012207 · Cited by 23
Adiabatic quantum imaginary time evolution
Hejazi, K., Motta, M., & Chan, G. K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033084 · Cited by 22
Many-Body Entropies and Entanglement from Polynomially Many Local Measurements
Vermersch, B., Ljubotina, M., Cirac, J. I., Zoller, P., Serbyn, M., & Piroli, L. (2024) · Physical Review X · doi:10.1103/physrevx.14.031035 · Cited by 42
Zhou, Z.-Y., Qiu, J.-T., & Zhang, D.-J. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.l032048 · Cited by 20
Wulff, A., Chen, B., Steinberg, M., Tang, Y., Möller, M., & Feld, S. (2024) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2024.117380 · Cited by 22
Zhang, Y., Gopalakrishnan, S., & Styliaris, G. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040304 · Cited by 33
Feedback-based quantum algorithm inspired by counterdiabatic driving
Malla, R. K., Sukeno, H., Yu, H., Wei, T.-C., Weichselbaum, A., & Konik, R. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043068 · Cited by 24
Quantum Computing Through the Lens of Control: A Tutorial Introduction
Berberich, J., & Fink, D. (2024) · IEEE Control Systems · doi:10.1109/mcs.2024.3466448 · Cited by 29
Stade, Y., Schmid, L., Burgholzer, L., & Wille, R. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00098 · Cited by 33
Monitored long-range interacting systems: spin-wave theory for quantum trajectories
Li, Z., Delmonte, A., Turkeshi, X., & Fazio, R. (2025) · Nature Communications · doi:10.1038/s41467-025-59557-w · Cited by 25
Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus
Riu, J., Nogué, J., Vilaplana, G., García-Sáez, A., & Estarellas, M. P. (2025) · Quantum · doi:10.22331/q-2025-05-28-1758 · Cited by 48
Toward Large-Scale Distributed Quantum Long Short-Term Memory with Modular Quantum Computers
Chen, K., Chen, S. Y.-C., Liu, C.-Y., & Leung, K. K. (2025) · International Wireless Communications and Mobile Computing Conference (IWCMC) · doi:10.1109/iwcmc65282.2025.11059527 · Cited by 18
Witteveen, F., Scholz, V. B., Swingle, B. G., & Walter, M. (2021) · Communications in Mathematical Physics · doi:10.1007/s00220-021-04274-w · Cited by 21
Generalized Physics-Informed Learning through Language-Wide Differentiable Programming
Rackauckas, C. (2020) · DSpace@MIT (Massachusetts Institute of Technology) · doi:10.6084/m9.figshare.12751934 · Cited by 33
Dyke, J. S. V., Kandel, Y. P., Qiao, H., Nichol, J. M., Economou, S. E., & Barnes, E. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.103.245303 · Cited by 18
Exploring the Potential Benefits of Alternative Quantum Computing Architectures
Deb, A., Dueck, G. W., & Wille, R. (2020) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2020.3032072 · Cited by 16
Neveu, P., Clarke, J., Vanner, M. R., & Verhagen, E. (2021) · New Journal of Physics · doi:10.1088/1367-2630/abe1e4 · Cited by 16
Salm, M., Barzen, J., Leymann, F., & Weder, B. (2020) · doi:10.1145/3412451.3428498 · Cited by 21
How to enhance quantum generative adversarial learning of noisy information
Braccia, P., Caruso, F., & Banchi, L. (2021) · New Journal of Physics · doi:10.1088/1367-2630/abf798 · Cited by 24
From observations to complexity of quantum states via unsupervised learning
Schmitt, M., & Lenarčič, Z. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.l041110 · Cited by 24
Fast spin-valley-based quantum gates in Si with micromagnets
Huang, P., & Hu, X. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00500-4 · Cited by 26
Practical verification protocols for analog quantum simulators
Shaffer, R., Megidish, E., Broz, J., Chen, W.-T., & Häffner, H. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00380-8 · Cited by 33
Practical verification protocols for analog quantum simulators
Shaffer, R., Megidish, E., Broz, J., Chen, W., & Häffner, H. (2021) · eScholarship (California Digital Library) · Cited by 14
Sample-Efficient Adaptive Calibration of Quantum Networks Using Bayesian Optimization
Cortes, C. L., Lefebvre, P., Lauk, N., Davis, M. J., Sinclair, N. E., Gray, S. K., & Oblak, D. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.034067 · Cited by 22
Measuring trajectories of environmental noise
Szańkowski, P. (2021) · Physical Review A · doi:10.1103/physreva.104.022202 · Cited by 14
Brandhofer, S., Devitt, S. J., Wellens, T., & Polian, I. (2021) · IEEE VLSI Test Symposium (VTS) · doi:10.1109/vts50974.2021.9441047 · Cited by 24
One-shot quantum error correction of classical and quantum information
Nakata, Y., Wakakuwa, E., & Yamasaki, H. (2021) · Physical Review A · doi:10.1103/physreva.104.012408 · Cited by 18
Scalable estimation of pure multi-qubit states
Pereira, L., Zambrano, L., & Delgado, A. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00565-9 · Cited by 20
Mitigating errors by quantum verification and postselection
Mezher, R., Mills, J. K., & Kashefi, E. (2022) · Physical Review A · doi:10.1103/physreva.105.052608 · Cited by 17
Computationally Efficient Quantum Expectation with Extended Bell Measurements
Kondo, R., Sato, Y., Koide, S., Kajita, S., & Takamatsu, H. (2022) · Quantum · doi:10.22331/q-2022-04-13-688 · Cited by 18
Molecular dynamics on quantum annealers
Gaidai, I., Babikov, D., Teplukhin, A., Kendrick, B. K., Mniszewski, S. M., Zhang, Y., Tretiak, S., & Dub, P. A. (2022) · Scientific Reports · doi:10.1038/s41598-022-21163-x · Cited by 16
Recent Developments in Quantum‐Circuit Refrigeration
Mörstedt, T., Viitanen, A. J., Vadimov, V., Sevriuk, V., Partanen, M., Hyyppä, E., Catelani, G., Silveri, M., Tan, K. Y., & Möttönen, M. (2022) · Annalen der Physik · doi:10.1002/andp.202100543 · Cited by 19
Besserve, P., & Ayral, T. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.115108 · Cited by 27
Nonlocal correlations in noisy multiqubit systems simulated using matrix product operators
Landa, H., & Misguich, G. (2023) · SciPost Physics Core · doi:10.21468/scipostphyscore.6.2.037 · Cited by 21
Reducing Circuit Depth in Adaptive Variational Quantum Algorithms via Effective Hamiltonian Theories
Liu, J., Li, Z., & Yang, J. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00341 · Cited by 19
Quantum prospects for hybrid thin-film lithium niobate on silicon photonics
Adcock, J. C., & Ding, Y. (2022) · Frontiers of Optoelectronics · doi:10.1007/s12200-022-00006-7 · Cited by 15
Quantum-machine-learning channel discrimination
Kardashin, A., Vlasova, A. V., Pervishko, A. A., Yudin, D., & Biamonte, J. (2022) · Physical Review A · doi:10.1103/physreva.106.032409 · Cited by 19
Control Implemented on Quantum Computers: Effects of Noise, Nondeterminism, and Entanglement
Nieman, K., Rangan, K. K., & Durand, H. (2022) · Industrial & Engineering Chemistry Research · doi:10.1021/acs.iecr.2c00454 · Cited by 15
TimeStitch: Exploiting Slack to Mitigate Decoherence in Quantum Circuits
Smith, K. N., Ravi, G. S., Murali, P., Baker, J. M., Earnest, N., Javadi-Abhari, A., & Chong, F. T. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3548778 · Cited by 62
Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs
Liu, J., Zhou, L., Barthe, G., & Ying, M. (2022) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1145/3531130.3533327 · Cited by 20
Muñoz-Moller, A. D., Pereira, L., Zambrano, L., Cortés-Vega, J., & Delgado, A. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.024048 · Cited by 19
Beyond one-axis twisting: Simultaneous spin-momentum squeezing
Wilson, J. D., Jäger, S. B., Reilly, J., Shankar, A., Chiofalo, M. L., & Holland, M. (2022) · Physical Review A · doi:10.1103/physreva.106.043711 · Cited by 15
Simulating scalar field theories on quantum computers with limited resources
Li, A. C. Y., Macridin, A., Mrenna, S., & Spentzouris, P. (2023) · Physical Review A · doi:10.1103/physreva.107.032603 · Cited by 25
Variational approach to quantum state tomography based on maximal entropy formalism
Gupta, R., Sajjan, M., Levine, R. D., & Kais, S. (2022) · Physical Chemistry Chemical Physics · doi:10.1039/d2cp04493e · Cited by 19
Entanglement-based observables for quantum impurities
Stocker, L., Sack, S. H., Ferguson, M. S., & Zilberberg, O. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043177 · Cited by 14
Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm
Dupont, M., Didier, N., Hodson, M. J., Moore, J. E., & Reagor, M. J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040339 · Cited by 26
Dynamical mean-field theory for the Hubbard-Holstein model on a quantum device
Backes, S., Murakami, Y., 酒井, 志., & Arita, R. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.165155 · Cited by 26
Khalid, I., Weidner, C. A., JONCKHEERE, E. A., Shermer, S., & Langbein, F. C. (2023) · Physical Review A · doi:10.1103/physreva.107.032606 · Cited by 17
Jarzynski-like equality of nonequilibrium information production based on quantum cross-entropy
Sone, A., Yamamoto, N., Holdsworth, T., & Narang, P. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023039 · Cited by 14
Optimizing Parameterized Quantum Circuits With Free-Axis Single-Qubit Gates
Watanabe, H. C., Raymond, R., Ohnishi, Y., Kaminishi, E., & Sugawara, M. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3286411 · Cited by 20
Field test of quantum key distribution over aerial fiber based on simple and stable modulation
tang, Y.-L., Xie, Z.-L., Zhou, C., Zhang, D., Xu, M.-L., Sun, J., Sun, D., Xu, Y.-X., Wang, L., Ma, Y., et al. (2023) · Optics Express · doi:10.1364/oe.494318 · Cited by 16
Accelerated quantum circuit Monte Carlo simulation for heavy quark thermalization
Du, X., & Qian, W. (2024) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.109.076025 · Cited by 18
Clifford recompilation for faster classical simulation of quantum circuits
Qassim, H., Wallman, J. J., & Emerson, J. (2019) · Quantum · doi:10.22331/q-2019-08-05-170 · Cited by 27
Holmes, A. A., Ding, Y., Javadi-Abhari, A., Franklin, D. M., Martonosi, M., & Chong, F. T. (2019) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2019.02.007 · Cited by 22
Enhanced Multiqubit Phase Estimation in Noisy Environments by Local Encoding
Proietti, M., Ringbauer, M., Graffitti, F., Barrow, P., Pickston, A., Kundys, D. O., Cavalcanti, D., Aolita, L., Chaves, R., & Fedrizzi, A. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.180503 · Cited by 12
Sugisaki, K., Nakazawa, S., Toyota, K., Sato, K., Shiomi, D., & Takui, T. (2019) · Physical Chemistry Chemical Physics · doi:10.1039/c9cp02546d · Cited by 13
Mitigation of Decoherence-Induced Quantum-Bit Errors and Quantum-Gate Errors Using Steane’s Code
Cane, R., Chandra, D., Ng, S. X., & Hanzo, L. (2020) · IEEE Access · doi:10.1109/access.2020.2991802 · Cited by 14
A quantum interior-point predictor-corrector algorithm for linear programming
Casares, P. A. M., & Martín Delgado, M. Á. (2020) · Docta Complutense (Universidad Complutense de Madrid) · Cited by 14
A stochastic quantum program synthesis framework based on Bayesian optimization
Xiao, Y., Nazarian, S., & Bogdan, P. (2021) · Scientific Reports · doi:10.1038/s41598-021-91035-3 · Cited by 19
QuantumCircuitOpt: An Open-source Framework for Provably Optimal Quantum Circuit Design
Nagarajan, H., Lockwood, O., & Coffrin, C. (2021) · IEEE/ACM International Workshop on Quantum Computing Software (QCS) · doi:10.1109/qcs54837.2021.00010 · Cited by 35
Optimizing Parameterized Quantum Circuits with Free-Axis Selection
Watanabe, H. C., Raymond, R., Ohnishi, Y., Kaminishi, E., & Sugawara, M. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00026 · Cited by 27
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.