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,501–2,600 of 8,640
Kong, W., Sun, Y., Gao, Y., & Ji, Y. (2022) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2022.3209284 · Cited by 17
Variational Quantum Algorithm Applied to Collision Avoidance of Unmanned Aerial Vehicles
Huang, Z., Li, Q., Zhao, J., & Song, M. (2022) · Entropy · doi:10.3390/e24111685 · Cited by 19
Dukalski, M., Rovetta, D., van der Linde, S., Möller, M., Neumann, N. M. P., & Phillipson, F. (2022) · Geophysics · doi:10.1190/geo2022-0253.1 · Cited by 19
Digital Quantum Simulation of the Spin-Boson Model under Markovian Open-System Dynamics
Burger, A., Kwek, L. C., & Poletti, D. (2022) · Entropy · doi:10.3390/e24121766 · Cited by 26
Improved FRQI on superconducting processors and its restrictions in the NISQ era
Geng, A., Moghiseh, A., Redenbach, C., & Schladitz, K. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03838-0 · Cited by 18
Optimization of the memory reset rate of a quantum echo-state network for time sequential tasks
Molteni, R., Destri, C., & Prati, E. (2023) · Physics Letters A · doi:10.1016/j.physleta.2023.128713 · Cited by 19
Neumann, N. M. P., de Heer, P. B. U. L., & Phillipson, F. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03867-9 · Cited by 24
Provenance-Preserving Analysis and Rewrite of Quantum Workflows for Hybrid Quantum Algorithms
Weder, B., Barzen, J., Beisel, M., & Leymann, F. (2023) · SN Computer Science · doi:10.1007/s42979-022-01625-9 · Cited by 25
SimuQ: A Framework for Programming Quantum Hamiltonian Simulation with Analog Compilation
Peng, Y., Young, J., Liu, P., & Wu, X. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3632923 · Cited by 36
Stochastic quantum Krylov protocol with double-factorized Hamiltonians
Stair, N. H., Cortes, C. L., Parrish, R. M., Cohn, J., & Motta, M. (2023) · Physical Review A · doi:10.1103/physreva.107.032414 · Cited by 21
The Imitation Game: Leveraging CopyCats for Robust Native Gate Selection in NISQ Programs
Das, P., Kessler, E., & Shi, Y. (2023) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca56546.2023.10071025 · Cited by 24
Quantum Computing and Machine Learning Algorithms - A Review
Manan, I., Rehman, F. U., Sharif, H., Riaz, N., Atif, M., & Aqeel, M. (2022) · International Conference on Innovations in Computer Science & Software Engineering (ICONICS) · doi:10.1109/iconics56716.2022.10100452 · Cited by 17
Improving the number of T gates and their spread in integer multipliers on quantum computing
Orts, F. J., Filatovas, E., Ortega, G., Sanjuan, J. F., & Garzón, E. M. (2023) · Physical Review A · doi:10.1103/physreva.107.042621 · Cited by 23
Measurement optimization of variational quantum simulation by classical shadow and derandomization
Nakaji, K., Endo, S., Matsuzaki, Y., & Hakoshima, H. (2023) · Quantum · doi:10.22331/q-2023-05-04-995 · Cited by 29
Towards quantum state preparation with materials science: An analytical review
Sood, V., & Chauhan, R. P. (2023) · International Journal of Quantum Chemistry · doi:10.1002/qua.27148 · Cited by 17
Progress and prospects of quantum computing in sustainable development: An analytical review
Sood, V., & Chauhan, R. P. (2023) · Expert Systems · doi:10.1111/exsy.13389 · Cited by 18
Díez-Valle, P., Luis-Hita, J., Hernández-Santana, S., Martínez-García, F., Díaz-Fernández, Á., Andrés, E., García‐Ripoll, J. J., Sánchez-Martínez, E., & Porras, D. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ace474 · Cited by 22
Volumetric Benchmarking of Error Mitigation with Qermit
Cîrstoiu, C., Dilkes, S., Mills, D., Sivarajah, S., & Duncan, R. (2023) · Quantum · doi:10.22331/q-2023-07-13-1059 · Cited by 30
Alarcón, E., Abadal, S., Sebastiano, F., Babaie, M., Charbon, E., Bolívar, P. H., Palesi, M., Blokhina, E., Leipold, D. R., Staszewski, R. B., et al. (2023) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas46773.2023.10181857 · Cited by 28
Automatic Generation of an Efficient Less-Than Oracle for Quantum Amplitude Amplification
Sanchez‐Rivero, J., Talaván, D., García-Alonso, J. M., Ruiz–Cortés, A., & Murillo, J. M. (2023) · IEEE/ACM International Workshop on Quantum Software Engineering (Q-SE) · doi:10.1109/q-se59154.2023.00011 · Cited by 19
A hybrid quantum–classical neural network for learning transferable visual representation
Wang, R., Richerme, P., & Chen, F. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acf1c7 · Cited by 18
Improving the speed of variational quantum algorithms for quantum error correction
Zoratti, F., Palma, G. D., Kiani, B. T., Nguyen, Q. T., Marvian, M., Lloyd, S., & Giovannetti, V. (2023) · Physical Review A · doi:10.1103/physreva.108.022611 · Cited by 19
Encoding-independent optimization problem formulation for quantum computing
Dominguez, F., Unger, J., Traube, M., Mant, B. P., Ertler, C., & Lechner, W. (2023) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2023.1229471 · Cited by 26
On the role of entanglement in qudit-based circuit compression
Gao, X., Appel, P., Friis, N., Ringbauer, M., & Huber, M. (2023) · Quantum · doi:10.22331/q-2023-10-16-1141 · Cited by 26
QASMTrans: A QASM Quantum Transpiler Framework for NISQ Devices
Hua, F., Wang, M., Li, G., Peng, B., Liu, C., Zheng, M., Stein, S., Ding, Y., Zhang, E. Z., Humble, T. S., et al. (2023) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3624062.3624222 · Cited by 33
Review of ansatz designing techniques for variational quantum algorithms
Qin, J. (2023) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2634/1/012043 · Cited by 33
High-fidelity Rydberg controlled-Z gates with optimized pulses
Chang, T. H., Wang, T.-I., Jen, H. H., & Chen, Y.-C. (2023) · New Journal of Physics · doi:10.1088/1367-2630/ad0fa9 · Cited by 23
Quantum Deep Q-Learning with Distributed Prioritized Experience Replay
Chen, S. Y.-C. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10180 · Cited by 27
qgym: A Gym for Training and Benchmarking RL-Based Quantum Compilation
van der Linde, S., de Kok, W., Bontekoe, T., & Feld, S. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10179 · Cited by 19
Closest Lattice Point Decoding for Multimode Gottesman-Kitaev-Preskill Codes
Lin, M., Chamberland, C., & Noh, K. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.040334 · Cited by 24
Extending the variational quantum eigensolver to finite temperatures
Selisko, J., Amsler, M., Hammerschmidt, T., Drautz, R., & Eckl, T. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/ad1340 · Cited by 31
Monte Carlo graph search for quantum circuit optimization
Rosenhahn, B., & Osborne, T. J. (2023) · Physical Review A · doi:10.1103/physreva.108.062615 · Cited by 18
Control of the ZZ coupling between Kerr cat qubits via transmon couplers
Aoki, T., Kanao, T., Goto, H., Kawabata, S., & Masuda, S. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.014030 · Cited by 23
Mitigated barren plateaus in the time-nonlocal optimization of analog quantum-algorithm protocols
Broers, L., & Mathey, L. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013076 · Cited by 25
Efficient Implementation of Discrete-Time Quantum Walks on Quantum Computers
Razzoli, L., Cenedese, G., Bondani, M., & Benenti, G. (2024) · Entropy · doi:10.3390/e26040313 · Cited by 35
Variational quantum algorithms for scanning the complex spectrum of non-Hermitian systems
Xie, X.-D., Xue, Z., & Zhang, D.-B. (2024) · Frontiers of Physics · doi:10.1007/s11467-023-1382-3 · Cited by 26
Roh, J., Oh, S., Lee, D., Joo, C., Park, J., Moon, I., Ro, I., & Kim, J. (2024) · ACS Sustainable Chemistry & Engineering · doi:10.1021/acssuschemeng.3c07496 · Cited by 15
Fitzek, D., Jonsson, R., Dobrautz, W., & Schäfer, C. (2024) · Quantum · doi:10.22331/q-2024-04-09-1313 · Cited by 29
Two-dimensional symmetry-protected topological phases and transitions in open quantum systems
Guo, Y., & Ashida, Y. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.195420 · Cited by 26
Symmetry Breaking in Geometric Quantum Machine Learning in the Presence of Noise
Tüysüz, C., Chang, S. Y., Demidik, M., Jansen, K., Vallecorsa, S., & Grossi, M. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030314 · Cited by 34
Quantum resource estimation for large scale quantum algorithms
Gheorghiu, V., & Mosca, M. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.107480 · Cited by 31
Optimal routing and end-to-end entanglement distribution in quantum networks
Halder, J., Rajabov, A., Bassoli, R., Fitzek, F. H. P., & Fettweis, G. P. (2024) · Scientific Reports · doi:10.1038/s41598-024-70114-1 · Cited by 26
QUSL: Quantum unsupervised image similarity learning with enhanced performance
Yu, L.-H., Li, X., Chen, G., Zhu, Q., Li, H., & Yang, G. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.125112 · Cited by 16
Solving constrained optimization problems via the variational quantum eigensolver with constraints
Le, T. V., & Kekatos, V. (2024) · Physical Review A · doi:10.1103/physreva.110.022430 · Cited by 30
Readout error mitigated quantum state tomography tested on superconducting qubits
Aasen, A. S., Giovanni, A. D., Rotzinger, H., Ustinov, A. V., & Gärttner, M. (2024) · Communications Physics · doi:10.1038/s42005-024-01790-8 · Cited by 28
Sampling Error Analysis in Quantum Krylov Subspace Diagonalization
Lee, G., Lee, D., & Huh, J. (2024) · Quantum · doi:10.22331/q-2024-09-19-1477 · Cited by 47
Quantum machine learning for additive manufacturing process monitoring
Choi, E., Sul, J., Kim, J. E., Hong, S., Gonzalez, B. I., Cembellin, P., & Wang, Y. (2024) · Manufacturing Letters · doi:10.1016/j.mfglet.2024.09.168 · Cited by 24
Quantum neural networks under depolarization noise: exploring white-box attacks and defenses
Winderl, D., Franco, N., & Lorenz, J. M. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00208-6 · Cited by 26
Automatic and Effective Discovery of Quantum Kernels
Incudini, M., Bosco, D. L., Martini, F., Grossi, M., Serra, G., & Pierro, A. D. (2024) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2024.3499993 · Cited by 36
Anticoncentration and State Design of Random Tensor Networks
Lami, G., Nardis, J. D., & Turkeshi, X. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.010401 · Cited by 47
QClusformer: A Quantum Transformer-based Framework for Unsupervised Visual Clustering
Nguyen, X.-B., Nguyen, H.-Q., Chen, S. Y.-C., Khan, S. U., Churchill, H., & Luu, K. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10304 · Cited by 32
Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping
Gresch, A., & Kliesch, M. (2025) · Nature Communications · doi:10.1038/s41467-024-54859-x · Cited by 46
Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
Bakó, B., Glos, A., Salehi, Ö., & Zimborás, Z. (2025) · Quantum · doi:10.22331/q-2025-03-20-1663 · Cited by 44
Wang, S., Wang, P., Li, G., Zhao, S., Zhao, D., Wang, J., Yuan, F., Dou, M., Gu, Y., Wu, Y.-C., et al. (2025) · Science China Information Sciences · doi:10.1007/s11432-024-4185-1 · Cited by 34
The Road to Quantum Computational Supremacy
Calude, C. S., & Calude, E. (2020) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-030-36568-4_22 · Cited by 24
The Classical Capacity of Additive Quantum Queue-Channels
Mandayam, P., Jagannathan, K., & Chatterjee, A. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.3015055 · Cited by 20
Cui, X., Shi, Y., & Yang, J.-C. (2020) · Journal of High Energy Physics · doi:10.1007/jhep08(2020)160 · Cited by 22
Oonishi, K., Tanaka, T., Uno, S., Satoh, T., Meter, R. V., & Kunihiro, N. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3136195 · Cited by 24
Quantum Dimension Reduction for Pattern Recognition in High-Resolution Spatio-Spectral Data
Mahmud, N., Haase-Divine, B., MacGillivray, A., & El‐Araby, E. (2020) · IEEE Transactions on Computers · doi:10.1109/tc.2020.3034883 · Cited by 18
Hillmich, S., Kueng, R., Markov, I. L., & Wille, R. (2021) · Design, Automation, and Test in Europe · doi:10.23919/date51398.2021.9474034 · Cited by 25
Special Session: Noise Characterization and Error Mitigation in Near-Term Quantum Computers
Wood, C. J. (2020) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd50377.2020.00016 · Cited by 27
Page curve from non-Markovianity
Su, K., Zhang, P., & Zhai, H. (2021) · Journal of High Energy Physics · doi:10.1007/jhep06(2021)156 · Cited by 27
Silva, F. F. C., Carvalho, P. M. S., & Ferreira, L. A. F. M. (2021) · Energies · doi:10.3390/en14040830 · Cited by 15
Quantum data hiding with continuous-variable systems
Lami, L. (2021) · Physical Review A · doi:10.1103/physreva.104.052428 · Cited by 28
Fast-forwarding with NISQ processors without feedback loop
Lim, K. H., Haug, T., Kwek, L. C., & Bharti, K. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac2e52 · Cited by 23
Star-topology registers: NMR and quantum information perspectives
Mahesh, T. S., Khurana, D., Krithika, V. R., Sreejith, G. J., & Kumar, C. S. S. (2021) · Journal of Physics Condensed Matter · doi:10.1088/1361-648x/ac0dd3 · Cited by 17
Variational quantum eigensolver for SU( N ) fermions
Consiglio, M., Chetcuti, W. J., Bravo-Prieto, C., Ramos-Calderer, S., Minguzzi, A., Latorre, J. I., Amico, L., & Apollaro, T. J. G. (2022) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ac7016 · Cited by 25
Loop-free tensor networks for high-energy physics
Montangero, S., Rico, E., & Silvi, P. (2021) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0065 · Cited by 30
Quantifying scrambling in quantum neural networks
Garcia, R. J., Bu, K., & Jaffe, A. (2022) · Journal of High Energy Physics · doi:10.1007/jhep03(2022)027 · Cited by 19
Quantum Gaussian filter for exploring ground-state properties
He, M.-Q., Zhang, D.-B., & Wang, Z. D. (2022) · Physical Review A · doi:10.1103/physreva.106.032420 · Cited by 21
Entanglement-assisted concatenated quantum codes
Fan, J., Li, J., Zhou, Y., Hsieh, M.-H., & Poor, H. V. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2202235119 · Cited by 23
Solving Large‐Scale Linear Systems of Equations by a Quantum Hybrid Algorithm
Perelshtein, M. R., Pakhomchik, A. I., Мельников, А. А., Novikov, A. A., Glatz, A., Paraoanu, G. S., Vinokur, V. M., & Lesovik, G. B. (2022) · Annalen der Physik · doi:10.1002/andp.202200082 · Cited by 20
Quantum separability criteria based on realignment moments
Zhang, T., Jing, N., & Fei, S.-M. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03630-6 · Cited by 22
A unified framework of transformations based on the Jordan–Wigner transformation
Li, Q.-S., Liu, H., Wang, Q., Wu, Y.-C., & Guo, G. (2022) · The Journal of Chemical Physics · doi:10.1063/5.0107546 · Cited by 22
Simulations of frustrated Ising Hamiltonians using quantum approximate optimization
Lotshaw, P. C., Xu, H., Khalid, B., Buchs, G., Humble, T. S., & Banerjee, A. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0414 · Cited by 23
Quantum Machine Learning Implementations: Proposals and Experiments
Lamata, L. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300059 · Cited by 21
A Quantum Kernel Learning Approach to Acoustic Modeling for Spoken Command Recognition
Yang, C.-H. H., Li, B., Zhang, Y., Chen, N., Sainath, T. N., Siniscalchi, S. M., & Lee, C. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10095142 · Cited by 18
Randomized adaptive quantum state preparation
Magann, A. B., Economou, S. E., & Arenz, C. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033227 · Cited by 29
Digital-analog quantum computation with arbitrary two-body Hamiltonians
de Andoin, M. G., Sáiz, Á., Pérez-Fernández, P., Lamata, L., Oregi, I., & Sanz, M. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013280 · Cited by 23
Environment-assisted analog quantum search
Novo, L., Chakraborty, S., Mohseni, M., & Omar, Y. (2018) · Physical Review A · doi:10.1103/physreva.98.022316 · Cited by 17
Analytic Filter-Function Derivatives for Quantum Optimal Control
Le, I. N. M., Teske, J. D., Hangleiter, T., Cerfontaine, P., & Bluhm, H. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.024006 · Cited by 18
Neural networks can learn to utilize correlated auxiliary noise
Ahmadzadegan, A., Simidzija, P., Li, M., & Kempf, A. (2021) · Scientific Reports · doi:10.1038/s41598-021-00502-4 · Cited by 17
A Bayesian Approach for Characterizing and Mitigating Gate and Measurement Errors
Zheng, M., Li, A., Terlaky, T., & Yang, X. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3563397 · Cited by 25
Quantum Topological Data Analysis with Linear Depth and Exponential SpeedupPreprint
Ubaru, S., Akhalwaya, I. Y., Squillante, M. S., Clarkson, K. L., & Horesh, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.02811 · Cited by 55
High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
Pelofske, E., Bärtschi, A., Golden, J., & Eidenbenz, S. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00064 · Cited by 15
Fast-Forwarding with NISQ Processors without Feedback Loop
Lim, K. H., Haug, T., Kwek, L. C., & Bharti, K. (2021) · arXiv · doi:10.48550/arxiv.2104.01931 · Cited by 15
A quantum processor based on coherent transport of entangled atom arrays
Bluvstein, D., Levine, H., Semeghini, G., Wang, T. T., Ebadi, S., Kalinowski, M., Keesling, A., Maskara, N., Pichler, H., Greiner, M., et al. (2022) · Nature · doi:10.1038/s41586-022-04592-6 · Cited by 14
“The ability to engineer parallel, programmable operations between desired qubits within a quantum processor is central for building scalable quantum information systems [1, 2].”
Quantum networks using rare-earth ions
Tittel, W., Afzelius, M., Kinos, A., Rippe, L., & Walther, A. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/addd93 · Cited by 40
Robust and optimal control of open quantum systems
Chen, Z.-J., Huang, H., Sun, L., Jie, Q., Zhou, J., Hua, Z., Xu, Y., Wang, W., Guo, G., Zou, C., et al. (2025) · Science Advances · doi:10.1126/sciadv.adr0875 · Cited by 43
Enhancement of harvesting vacuum entanglement in Cosmic String Spacetime
Izquierdo, W. A., Beltrán, J., & Arias, E. (2025) · Journal of High Energy Physics · doi:10.1007/jhep03(2025)049 · Cited by 28
Xu, L., Li, M., Zhang, L., Sun, H. X., & Yao, J. P. (2025) · Physical review. E · doi:10.1103/physreve.111.045305 · Cited by 20
Machine Learning for Custom-Designed Light Emitters in Biomedicine
Afolabi, S. O., Скорб, Е. В., & Shityakov, S. (2025) · Engineering materials · doi:10.1007/978-3-031-88731-4_11 · Cited by 17
Quantum computing and the implementation of precision medicine
Nassir, N., Hashmi, M., Raji, K. G., Jamalalail, B. A., Maksymowsky, A., Scherer, S. W., Alsheikh-Ali, A. A. A., & Uddin, M. J. (2025) · npj Genomic Medicine · doi:10.1038/s41525-025-00537-w · Cited by 31
Modeling Enclosures for Large-Scale Superconducting Quantum Circuits
Spring, P., Tsunoda, T., Vlastakis, B., & Leek, P. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.024061 · Cited by 15
Virtualized Logical Qubits: A 2.5D Architecture for Error-Corrected Quantum Computing
Duckering, C., Baker, J. M., Schuster, D., & Chong, F. T. (2020) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro50266.2020.00026 · Cited by 30
Variational preparation of the thermofield double state of the Sachdev-Ye-Kitaev model
Su, V. P. (2021) · Physical Review A · doi:10.1103/physreva.104.012427 · Cited by 28
Comparing Concepts of Quantum and Classical Neural Network Models for Image Classification Task
Potempa, R., & Porębski, S. (2021) · Lecture notes in networks and systems · doi:10.1007/978-3-030-81523-3_6 · Cited by 24
On the effects of biased quantum random numbers on the initialization of artificial neural networks
Heese, R., Wolter, M., Mücke, S., Franken, L., & Piatkowski, N. (2024) · Machine Learning · doi:10.1007/s10994-023-06490-y · Cited by 22
Global Heisenberg scaling in noisy and practical phase estimation
Hayashi, M., Liu, Z.-W., & Yuan, H. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac5d7e · Cited by 19
Rosa, E. C. R., & de Santiago, R. (2021) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3474224 · Cited by 23
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.