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,201–2,300 of 8,640
Distinguishing noisy boson sampling from classical simulations
Shchesnovich, V. S. (2021) · Quantum · doi:10.22331/q-2021-03-29-423 · Cited by 29
Quantum CNOT Circuits Synthesis for NISQ Architectures Using the Syndrome Decoding Problem
de Brugière, T. G., Baboulin, M., Valiron, B., Martiel, S., & Allouche, C. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-52482-1_11 · Cited by 18
Quantum Fan-out: Circuit Optimizations and Technology Modeling
Gokhale, P., Koretsky, S., Huang, S., Majumder, S., Drucker, A., Brown, K. R., & Chong, F. T. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00045 · Cited by 40
Analog-Quantum Feature Mapping for Machine-Learning Applications
Noori, M., Vedaie, S. S., Singh, I., Crawford, D., Oberoi, J. S., Sanders, B. C., & Zahedinejad, E. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.034034 · Cited by 22
Effect of chaos on the simulation of quantum critical phenomena in analog quantum simulators
Chinni, K., Poggi, P. M., & Deutsch, I. H. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033145 · Cited by 20
Low-rank density-matrix evolution for noisy quantum circuits
Chen, Y.-T., Farquhar, C., & Parrish, R. M. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00392-4 · Cited by 31
Equivalence Checking of Dynamic Quantum Circuits
Hong, X., Feng, Y., Li, S., & Ying, M. (2022) · International Conference on Computer Aided Design · doi:10.1145/3508352.3549479 · Cited by 36
Nonnormal Hamiltonian dynamics in quantum systems and its realization on quantum computers
Ōkuma, N., & Nakagawa, Y. O. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.054304 · Cited by 24
Ultrastrong Tunable Coupler Between Superconducting LC Resonators
Miyanaga, T., Tomonaga, A., Ito, H., Mukai, H., & Tsai, J. S. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.064041 · Cited by 23
Mitigating Crosstalk-Induced Qubit Readout Error with Shallow-Neural-Network Discrimination
Duan, P., Chen, Z., Zhou, Q., Kong, W., Zhang, H.-F., & Guo, G. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.024063 · Cited by 22
Optimal Mapping for Near-Term Quantum Architectures based on Rydberg Atoms
Brandhofer, S., Polian, I., & Büchler, H. P. (2021) · International Conference on Computer Aided Design · doi:10.1109/iccad51958.2021.9643490 · Cited by 27
Experimental Demonstration of Gaussian Boson Sampling with Displacement
Thekkadath, G., Sempere-Llagostera, S., Bell, B. A., Patel, R. B., Kim, M. S., & Walmsley, I. A. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020336 · Cited by 22
Short Paper: Device- and Locality-Specific Fingerprinting of Shared NISQ Quantum Computers
Mi, A., Deng, S., & Szefer, J. M. (2021) · Hardware and Architectural Support for Security and Privacy · doi:10.1145/3505253.3505261 · Cited by 31
Quantum error correction of spin quantum memories in diamond under a zero magnetic field
Nakazato, T., Reyes, R., Imaike, N., Matsuda, K., Tsurumoto, K., Sekiguchi, Y., & Kosaka, H. (2022) · Communications Physics · doi:10.1038/s42005-022-00875-6 · Cited by 21
Ballinas, E., & Montiel, O. (2022) · Soft Computing · doi:10.1007/s00500-022-07460-7 · Cited by 22
AGP-based unitary coupled cluster theory for quantum computers
Khamoshi, A., Chen, G. P., Evangelista, F. A., & Scuseria, G. E. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac93ae · Cited by 25
Quantum receiver enhanced by adaptive learning
Cui, C., Horrocks, W., Hao, S., Guha, S., Peyghambarian, N. N., Zhuang, Q., & Zhang, Z. (2022) · Light Science & Applications · doi:10.1038/s41377-022-01039-5 · Cited by 18
Surface Passivation of Niobium Superconducting Quantum Circuits Using Self-Assembled Monolayers
Alghadeer, M., Banerjee, A., Hajr, A., Hussein, H., Fariborzi, H., & Rao, S. G. (2022) · ACS Applied Materials & Interfaces · doi:10.1021/acsami.2c15667 · Cited by 21
Optimization of Richardson extrapolation for quantum error mitigation
Krebsbach, M., Trauzettel, B., & Calzona, A. (2022) · Physical Review A · doi:10.1103/physreva.106.062436 · Cited by 39
Optimization of CNOT circuits on limited-connectivity architecture
Wu, B., He, X., Yang, S., Shou, L., Tian, G., Zhang, J., & Sun, X. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.013065 · Cited by 45
Implementation of Quantum Deep Reinforcement Learning Using Variational Quantum Circuits
Lokes, S., Mahenthar, C. S. J., Kumaran, S. P., Sathyaprakash, P., & Vaithiyashankar, J. (2022) · International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT) · doi:10.1109/tqcebt54229.2022.10041479 · Cited by 23
Entanglement negativity in a fermionic chain with dissipative defects: exact results
Caceffo, F., & Alba, V. (2023) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/acb429 · Cited by 22
Arias, D., de Guzmán, I. G., Rodríguez, M., Terres-Escudero, E. B., Sanz, B., de la Puerta, J. G., Pastor-López, I., Zubillaga, A., & Bringas, P. G. (2023) · Neurocomputing · doi:10.1016/j.neucom.2023.03.060 · Cited by 22
Optimizing Quantum Federated Learning Based on Federated Quantum Natural Gradient Descent
Qi, J., Zhang, X.-L., & Tejedor, J. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10094634 · Cited by 30
Efficient controlled quantum broadcast protocol using 6n-qubit cluster state in noisy channels
Mafi, Y., Kazemikhah, P., Ahmadkhaniha, A., Aghababa, H., & Kolahdouz, M. (2023) · Optical and Quantum Electronics · doi:10.1007/s11082-023-04928-0 · Cited by 18
TenCirChem: An Efficient Quantum Computational Chemistry Package for the NISQ Era
Li, W., Allcock, J., Cheng, L., Zhang, S., Chen, Y., Mailoa, J. P., Shuai, Z., & Zhang, S. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00319 · Cited by 30
A chip-scale polarization-spatial-momentum quantum SWAP gate in silicon nanophotonics
Cheng, X., Chang, K.-C., Xie, Z., Sarihan, M. C., Lee, Y. S., Li, Y., Xu, X., Vinod, A. K., Kocaman, S., Yu, M., et al. (2023) · Nature Photonics · doi:10.1038/s41566-023-01224-x · Cited by 25
Leong, F. Y., Koh, D. E., Ewe, W.-B., & Kong, J. F. (2023) · International Journal of Numerical Methods for Heat & Fluid Flow · doi:10.1108/hff-05-2023-0265 · Cited by 32
Classical splitting of parametrized quantum circuits
Tüysüz, C., Clemente, G., Crippa, A., Hartung, T., Kühn, S., & Jansen, K. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00118-z · Cited by 37
Digital sovereignty, digital infrastructures, and quantum horizons
Gordon, G. (2023) · AI & Society · doi:10.1007/s00146-023-01729-7 · Cited by 48
Quantivine: A Visualization Approach for Large-scale Quantum Circuit Representation and Analysis
Wen, Z., Liu, Y., Tan, S., Chen, J., Zhu, M., Han, D., Yin, J., Xu, M., & Chen, W. (2023) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2023.3327148 · Cited by 29
Simple Sentiment Analysis Ansatz for Sentiment Classification in Quantum Natural Language Processing
Ruskanda, F. Z., Abiwardani, M. R., Syafalni, I., Larasati, H. T., & Mulyawan, R. (2023) · IEEE Access · doi:10.1109/access.2023.3327873 · Cited by 27
Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation
Tomesh, T., Saleem, Z. H., Perlin, M. A., Gokhale, P., Suchara, M., & Martonosi, M. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00009 · Cited by 81
Implementing two-qubit gates at the quantum speed limit
Howard, J. E., Lidiak, A., Jameson, C., Basyildiz, B., Clark, K., Zhao, T., Bal, M., Long, J., Pappas, D. P., Singh, M., et al. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043194 · Cited by 27
Quantum computing in drug discovery
Srivastava, R. (2023) · Information System and Smart City · doi:10.59400/issc.v3i1.294 · Cited by 25
Variational quantum algorithm for ergotropy estimation in quantum many-body batteries
Hoang, D. T., Metz, F., Thomasen, A. M. D., Anh-Tai, T. D., Busch, T., & Fogarty, T. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013038 · Cited by 29
Activation of metrologically useful genuine multipartite entanglement
Trényi, R., Lukács, Á., Horodecki, P., Horodecki, R., Vértesi, T., & Tóth, G. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad1e93 · Cited by 29
Trade-offs between precision and fluctuations in charging finite-dimensional quantum batteries
Bakhshinezhad, P., Jablonski, B. R., Binder, F. C., & Friis, N. (2024) · Physical review. E · doi:10.1103/physreve.109.014131 · Cited by 27
Nuclear scattering via quantum computing
Wang, P., Du, W., Wei, Z., & Vary, J. P. (2024) · Physical Review C · doi:10.1103/physrevc.109.064623 · Cited by 22
Extending echo state property for quantum reservoir computing
Kobayashi, S., Tran, Q. H., & Nakajima, K. (2024) · Physical review. E · doi:10.1103/physreve.110.024207 · Cited by 38
Quantum Computing: Exploring Superposition and Entanglement for Cutting-Edge Applications
Parmar, S. J., Parmar, V. R., Verma, J. P. V., Roy, S., & Bhattacharya, P. (2023) · International Conference on Security of Information and Networks (SIN) · doi:10.1109/sin60469.2023.10474803 · Cited by 25
Atomic Quantum Technologies for Quantum Matter and Fundamental Physics Applications
Malo, J. Y., Lepori, L., Gentini, L., & Chiofalo, M. L. (2024) · Technologies · doi:10.3390/technologies12050064 · Cited by 32
Higher-Form Symmetries under Weak Measurement
Su, K., Myerson-Jain, N. E., Wang, C., Jian, C., & Xu, C. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.200402 · Cited by 32
Classical chaos in quantum computers
Börner, S.-D., Berke, C., Divincenzo, D. P., Trebst, S., & Altland, A. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033128 · Cited by 29
Rahman, M. A., Akter, M. S., Miller, E., Timofti, B., Shahriar, H., Masum, M., & Wu, F. (2024) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac61105.2024.00144 · Cited by 25
Quantum Denoising Diffusion Models
Kölle, M., Stenzel, G., Stein, J., Zielinski, S., Ommer, B., & Linnhoff–Popien, C. (2024) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw62656.2024.00023 · Cited by 51
Graph algorithms with neutral atom quantum processors
Dalyac, C., Leclerc, L., Vignoli, L., Djellabi, M., Coelho, W. D. S., Alves, B. X. R., Dareau, A., Dreon, D., Elfving, V. E., Signoles, A., et al. (2024) · The European Physical Journal A · doi:10.1140/epja/s10050-024-01385-5 · Cited by 43
Entanglement membrane in exactly solvable lattice models
Rampp, M. A., Rather, S. A., & Claeys, P. W. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033271 · Cited by 30
Feedback-based quantum algorithms for ground state preparation
Larsen, J. B., Grace, M., Baczewski, A., & Magann, A. B. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033336 · Cited by 29
Quantum algorithms for scientific computing
Au-Yeung, R., Camino, B., Rathore, O., & Kendon, V. M. (2024) · Reports on Progress in Physics · doi:10.1088/1361-6633/ad85f0 · Cited by 44
Entanglement-Enabled Advantage for Learning a Bosonic Random Displacement Channel
Oh, C., Chen, S., Wong, Y., Zhou, S., Huang, H.-Y., Nielsen, J. A. H., Liu, Z., Neergaard-Nielsen, J. S., Andersen, U. L., Jiang, L., et al. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.230604 · Cited by 53
Self-citationImpact of decoherence on the fidelity of quantum gates leaving the computational subspace
Abad, T., Schattner, Y., Kockum, A. F., & Johansson, G. (2025) · Quantum · doi:10.22331/q-2025-04-03-1684 · Cited by 41
Gyöngyösi, L., & Imre, S. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0006 · Cited by 40
Chalumuri, A., Kune, R., & Manoj, B. S. (2020) · Procedia Computer Science · doi:10.1016/j.procs.2020.04.061 · Cited by 21
Explicit Lower Bounds on Strong Quantum Simulation
Huang, C., Newman, M., & Szegedy, M. (2020) · IEEE Transactions on Information Theory · doi:10.1109/tit.2020.3004427 · Cited by 51
Bylaska, E. J., Song, D., Bauman, N. P., Kowalski, K., Claudino, D., & Humble, T. S. (2021) · Frontiers in Chemistry · doi:10.3389/fchem.2021.603019 · Cited by 21
Implementation of a quantum transfer learning approach to image splicing detection
Gokhale, A., Pande, M. B., & Pramod, D. (2020) · International Journal of Quantum Information · doi:10.1142/s0219749920500240 · Cited by 18
Quantum simulations with multiphoton Fock states
Sturges, T. J., McDermott, T. C., Buraczewski, A., Clements, W. R., Renema, J. J., Nam, S. W., Gerrits, T., Lita, A., Kolthammer, W. S., Eckstein, A., et al. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00427-w · Cited by 34
Simulating noisy variational quantum eigensolver with local noise models
Zeng, J., Wu, Z., Cao, C., Zhang, C., Hou, S., Xu, P., & Zeng, B. (2021) · Quantum Engineering · doi:10.1002/que2.77 · Cited by 31
Post-Hartree–Fock method in quantum chemistry for quantum computer
Shikano, Y., Watanabe, H. C., Nakanishi, K. M., & Ohnishi, Y. (2021) · The European Physical Journal Special Topics · doi:10.1140/epjs/s11734-021-00087-z · Cited by 29
Tomography of Qubit States and Implementation of Quantum Algorithms by Unipolar Pulses
Bastrakova, M. V., Klenov, N. V., & Михайлович, С. А. (2020) · Journal of Experimental and Theoretical Physics · doi:10.1134/s1063776120090137 · Cited by 17
Investigation of Noise Effects for Different Quantum Computing Architectures in IBM-Q at NISQ Level
Yetış, H., & Karaköse, M. (2021) · doi:10.1109/it51528.2021.9390130 · Cited by 23
Single-Qubit Fidelity Assessment of Quantum Annealing Hardware
Nelson, J., Vuffray, M., Lokhov, A. Y., & Coffrin, C. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3092710 · Cited by 27
Automated Quantum Hardware Selection for Quantum Workflows
Weder, B., Barzen, J., Leymann, F., & Salm, M. (2021) · Electronics · doi:10.3390/electronics10080984 · Cited by 23
Parity Quantum Optimization: Benchmarks
FELLNER, M. J., Ender, K., ter Hoeven, R., & Lechner, W. (2023) · Quantum · doi:10.22331/q-2023-03-17-952 · Cited by 34
Quantum Circuit Learning with Error Backpropagation Algorithm and Experimental Implementation
Watabe, M., Shiba, K., Chen, C.-C., Sogabe, M., Sakamoto, K., & Sogabe, T. (2021) · Quantum Reports · doi:10.3390/quantum3020021 · Cited by 22
A Quantum Interpretation of Bunched Logic & Quantum Separation Logic
Zhou, L., Barthe, G., Hsu, J., Ying, M., & Yu, N. (2021) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics52264.2021.9470673 · Cited by 39
Weak dissipation for high-fidelity qubit-state preparation and measurement
Ransford, A., Roman, C., Dellaert, T., McMillin, P., & Campbell, W. C. (2021) · Physical Review A · doi:10.1103/physreva.104.l060402 · Cited by 24
Experimental study on the quantum search algorithm over structured datasets using IBMQ experience
Das, K., & Sadhu, A. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2022.01.012 · Cited by 19
Protecting local and global symmetries in simulating (1+1)D non-Abelian gauge theories
Mathew, E., & Raychowdhury, I. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.106.054510 · Cited by 29
Q# and NWChem: Tools for Scalable Quantum Chemistry on Quantum ComputersPreprint
Low, G. H., Bauman, N. P., Granade, C., Peng, B., Wiebe, N., Bylaska, E. J., Wecker, D., Krishnamoorthy, S., Roetteler, M., Kowalski, K., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.01131 · Cited by 33
Study of Decoherence in Quantum Computers: A Circuit-Design PerspectivePreprint
Saki, A. A., Alam, M., & Ghosh, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.04323 · Cited by 31
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum ComputersPreprint
Murali, P., Baker, J. M., Abhari, A. J., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.11054 · Cited by 18
Dementia Prediction Applying Variational Quantum ClassifierPreprint
Sierra-Sosa, D., Arcila-Moreno, J. D., García-Zapirain, B., Castillo-Olea, C., & Elmaghraby, A. S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.08653 · Cited by 31
On the learnability of quantum neural networksPreprint
Du, Y., Hsieh, M.-H., Liu, T., You, S., & Tao, D. (2020) · Research Square · doi:10.21203/rs.3.rs-80242/v1 · Cited by 18
Efficient calculation of gradients in classical simulations of variational quantum algorithmsPreprint
Jones, T., & Gacon, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.02823 · Cited by 93
Towards simulating 2D effects in lattice gauge theories on a quantum computer
Paulson, D., Dellantonio, L., Haase, J. F., et al. (2020) · UWSpace (University of Waterloo) · doi:10.48550/arxiv.2008.09252 · Cited by 18
Quantum Diffusion ModelsPreprint
Cacioppo, A., Colantonio, L., Bordoni, S., & Giagu, S. (2023) · Research Square · doi:10.21203/rs.3.rs-3688288/v1 · Cited by 56
Error mitigation enables PET radiomic cancer characterization on quantum computers
Moradi, S., Spielvogel, C. P., Krajnc, D., Brandner, C., Hillmich, S., Wille, R., Traub‐Weidinger, T., Li, X., Hacker, M., Drexler, W., et al. (2023) · European Journal of Nuclear Medicine and Molecular Imaging · doi:10.1007/s00259-023-06362-6 · Cited by 21
Proof-of-work consensus by quantum sampling
Singh, D., Muraleedharan, G., Fu, B., Cheng, C.-M., Newton, N. R., Rohde, P. P., & Brennen, G. K. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adae2b · Cited by 26
Beyond unital noise in variational quantum algorithms: noise-induced barren plateaus and limit sets
Singkanipa, P., & Lidar, D. A. (2025) · Quantum · doi:10.22331/q-2025-01-30-1617 · Cited by 48
Theory of optical spin-polarization of axial divacancy and nitrogen-vacancy defects in 4H-SiC
Bian, G., Thiering, G., & Gali, Á. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013320 · Cited by 23
Impact of Noise on the Resilience and the Security of Quantum Computing
Saki, A. A., Alam, M., & Ghosh, S. (2021) · International Symposium on Quality Electronic Design (ISQED) · doi:10.1109/isqed51717.2021.9424258 · Cited by 28
O’Brien, T. E., Ioffe, L. B., Su, Y., Fushman, D., Neven, H., Babbush, R., & Smelyanskiy, V. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.030345 · Cited by 35
Hybrid quantum-classical heuristic for the bin packing problem
de Andoin, M. G., Osaba, E., Oregi, I., Villar-Rodríguez, E., & Sanz, M. (2022) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3520304.3533986 · Cited by 29
Qurzon: A Prototype for a Divide and Conquer-Based Quantum Compiler for Distributed Quantum Systems
Chatterjee, T., Das, A., Mohtashim, S. I., Saha, A., & Chakrabarti, A. (2022) · SN Computer Science · doi:10.1007/s42979-022-01207-9 · Cited by 21
Tao, Y., Zeng, X., Fan, Y., Liu, J., Li, Z., & Yang, J. (2022) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.2c01738 · Cited by 24
Quantum–Classical Image Processing for Scene Classification
Chalumuri, A., Kune, R., Kannan, S., & Manoj, B. S. (2022) · IEEE Sensors Letters · doi:10.1109/lsens.2022.3173253 · Cited by 22
Quantum Circuit Evolution on NISQ Devices
Franken, L., Georgiev, B., Mücke, S., Wolter, M., Heese, R., Bauckhage, C., & Piatkowski, N. (2022) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec55065.2022.9870269 · Cited by 40
Yordanov, Y. S., Barnes, C. H. W., & Arvidsson-Shukur, D. R. M. (2022) · Physical Review A · doi:10.1103/physreva.106.032434 · Cited by 28
Variational solutions to fermion-to-qubit mappings in two spatial dimensions
Nys, J., & Carleo, G. (2022) · Quantum · doi:10.22331/q-2022-10-13-833 · Cited by 21
Control and mitigation of microwave crosstalk effect with superconducting qubits
Wang, R., Zhao, P., Jin, Y., & Yu, H. (2022) · Applied Physics Letters · doi:10.1063/5.0115393 · Cited by 29
Quantum Approach to Image Data Encoding and Compression
Majji, S. R., Chalumuri, A., & Manoj, B. S. (2023) · IEEE Sensors Letters · doi:10.1109/lsens.2023.3239749 · Cited by 27
Safe reinforcement learning under temporal logic with reward design and quantum action selection
Cai, M., Xiao, S., Li, J., & Kan, Z. (2023) · Scientific Reports · doi:10.1038/s41598-023-28582-4 · Cited by 32
Variational Quantum Optimization of Nonlocality in Noisy Quantum Networks
Doolittle, B., Bromley, R. T., Killoran, N., & Chitambar, E. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3243849 · Cited by 28
An open-source modular framework for quantum computing
Carrazza, S., Efthymiou, S., Lazzarin, M., & Pasquale, A. (2023) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2438/1/012148 · Cited by 24
Optimized mitigation of random-telegraph-noise dephasing by spectator-qubit sensing and control
Song, H., Chantasri, A., Tonekaboni, B., & Wiseman, H. M. (2023) · Physical Review A · doi:10.1103/physreva.107.l030601 · Cited by 23
Universal compilation for quantum state tomography
Hai, V. T., & Ho, L. B. (2023) · Scientific Reports · doi:10.1038/s41598-023-30983-4 · Cited by 21
Estimating Quantum Hamiltonians via Joint Measurements of Noisy Noncommuting Observables
McNulty, D., Maciejewski, F. B., & Oszmaniec, M. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.100801 · Cited by 28
Importance sampling for stochastic quantum simulations
Kiss, O., Grossi, M., & Roggero, A. (2023) · Quantum · doi:10.22331/q-2023-04-13-977 · Cited by 38
Metadata
- Authors
- Preskill, J.
- Affiliations
- California Institute of Technology (US)
- Corresponding author
- Preskill, John
- ORCID
- Preskill, John
- Venue
- Quantum
- Published
- 2018-08-06
- Volume
- 2
- Pages
- 79
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2781738013
- Cited by
- 8,830
- References
- 82
- Citations by year
- 2026: 1366 · 2025: 1674 · 2024: 1435 · 2023: 1263 · 2022: 1053 · 2021: 1014 · 2020: 638 · 2019: 322 · 2018: 59
- FWCI
- 286.68
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- CaltechAUTHORS (California Institute of Technology) (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University) (cc-by)
- Bulletin of the American Physical Society
- Funders
- National Science Foundation
- U.S. Department of Energy
- Simons Foundation
- Intelligence Advanced Research Projects Activity
- Institute for Quantum Information and Matter, California Institute of Technology
- Kavli Institute for Theoretical Physics, University of California, Santa Barbara
- Army Research Office
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- NISQ devices, fault-tolerant quantum computing, quantum advantage, quantum computing hardware
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol and qwen3.8-omni-flash).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.