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,801–2,900 of 8,640
Quantum transfer of interacting qubits
Apollaro, T. J. G., Lorenzo, S., Plastina, F., Consiglio, M., & Życzkowski, K. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac86e7 · Cited by 18
Model-Free Deep Recurrent Q-Network Reinforcement Learning for Quantum Circuit Architectures Design
Sogabe, T., Kimura, T., Chen, C.-C., Shiba, K., Kasahara, N., Sogabe, M., & Sakamoto, K. (2022) · Quantum Reports · doi:10.3390/quantum4040027 · Cited by 20
Continuous Quantum Gate Sets and Pulse-Class Meta-Optimization
Preti, F., Calarco, T., & Motzoi, F. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040311 · Cited by 20
Co-Design quantum simulation of nanoscale NMR
Algaba, M. G., Ponce-Martinez, M., Munuera-Javaloy, C., Pina-Canelles, V., Thapa, M., Taketani, B. G., Leib, M., de Vega, I., Casanova, J., & Heimonen, H. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043089 · Cited by 16
Intelligent certification for quantum simulators via machine learning
Xiao, T., Huang, J., Li, H., Fan, J., & Zeng, G. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00649-6 · Cited by 23
Chaotic Image Encryption Based on Boson Sampling
Shi, J., Zhao, T., Wang, Y., Feng, Y., & Wu, J. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202200104 · Cited by 14
Loipersberger, M., Malone, F. D., Welden, A. R., Parrish, R. M., Fox, T., Degroote, M., Kyoseva, E. S., Moll, N., Santagati, R., & Streif, M. (2023) · Chemical Science · doi:10.1039/d2sc05896k · Cited by 20
Enabling Efficient Real-Time Calibration on Cloud Quantum Machines
Liu, Y., Li, Z., Robertson, A., Fu, X., & Song, S. L. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3276970 · Cited by 17
Q-BEEP: Quantum Bayesian Error Mitigation Employing Poisson Modeling over the Hamming Spectrum
Stein, S., Wiebe, N., Ding, Y., Ang, J., & Li, A. (2023) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3579371.3589043 · Cited by 17
Quantum autoencoders for communication-efficient cloud computing
Zhu, Y., Bai, G., Wang, Y., Li, T., & Chiribella, G. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00112-5 · Cited by 18
Kuo, S., Lai, Y.-T., Jiang, Y.-C., Chang, M.-H., Wu, K.-M., Chen, P.-C., Chang, Y., Tong, Y. F., & Chou, Y. (2023) · Genetic and Evolutionary Computation Conference Companion (GECCO Companion) · doi:10.1145/3583133.3596370 · Cited by 15
Variational Quantum‐Neural Hybrid Error Mitigation
Zhang, S., Wan, Z., Hsieh, C., Yao, H., & Zhang, S. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300147 · Cited by 21
Continuous-variable quantum approximate optimization on a programmable photonic quantum processor
Enomoto, Y., Anai, K., Udagawa, K., & Takeda, S. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043005 · Cited by 24
Benchmarking quantum logic operations relative to thresholds for fault tolerance
Hashim, A., Seritan, S., Proctor, T. J., Rudinger, K., Goss, N., Naik, R., Kreikebaum, J. M., Santiago, D., & Siddiqi, I. A. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00764-y · Cited by 38
Error Suppression for Arbitrary-Size Black Box Quantum Operations
Lee, G., Hann, C. T., Puri, S., Girvin, S. M., & Jiang, L. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.190601 · Cited by 24
Depth-Optimal Synthesis of Clifford Circuits with SAT Solvers
Peham, T., Brandl, N., Kueng, R., Wille, R., & Burgholzer, L. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00095 · Cited by 41
The Mathematics of Quantum-Enabled Applications on the D-Wave Quantum Computer
Berwald, J. (2019) · Notices of the American Mathematical Society · doi:10.1090/noti1893 · Cited by 17
A systems perspective of quantum computing
Matsuura, A. Y., Johri, S., & Hogaboam, J. (2019) · Physics Today · doi:10.1063/pt.3.4163 · Cited by 13
Optimizing Quantum Programs Against Decoherence: Delaying Qubits into Quantum Superposition
Zhang, Y., Deng, H., Li, Q., Song, H., & Nie, L. (2019) · International Symposium on Theoretical Aspects of Software Engineering (TASE) · doi:10.1109/tase.2019.000-2 · Cited by 29
Robustness to spontaneous emission of a variational quantum algorithm
Henriet, L. (2020) · Physical Review A · doi:10.1103/physreva.101.012335 · Cited by 13
Trapped Ion Architecture for Multi‐Dimensional Quantum Simulations
Warring, U., Hakelberg, F., Kiefer, P., Wittemer, M., & Schaetz, T. (2020) · Advanced Quantum Technologies · doi:10.1002/qute.201900137 · Cited by 14
Zhou, W., Gao, J., Jiao, Z., Wang, X., Ren, R.-J., Pang, X.-L., Qiao, L., Zhang, C.-N., Yang, T.-H., & Jin, X. (2022) · Applied Physics Reviews · doi:10.1063/5.0066103 · Cited by 17
Survey on Hybrid Classical-Quantum Machine Learning Models
Metawei, M. A., Said, H., Taher, M., Eldeib, H. E. S., & Nassar, S. M. (2020) · International Conference on Communications, Computing, Cybersecurity, and Informatics (CCCI) · doi:10.1109/ccci49893.2020.9256649 · Cited by 21
From Digital Humanities to Quantum Humanities: Potentials and Applications
Barzen, J. (2022) · Springer eBooks · doi:10.1007/978-3-030-95538-0_1 · Cited by 24
Chen, H., & Chen, Y.-N. (2021) · Scientific Reports · doi:10.1038/s41598-021-89400-3 · Cited by 14
Quantum chemistry calculations using energy derivatives on quantum computers
Azad, U., & Singh, H. (2022) · Chemical Physics · doi:10.1016/j.chemphys.2022.111506 · Cited by 24
Many-body localization and the area law in two dimensions
Decker, K. S. C., Kennes, D. M., & Karrasch, C. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.l180201 · Cited by 17
Prime factorization using quantum variational imaginary time evolution
Selvarajan, R., Dixit, V., Cui, S. X., Humble, T. S., & Kais, S. (2021) · Scientific Reports · doi:10.1038/s41598-021-00339-x · Cited by 18
A perspective on superconducting flux qubits
Dmitriev, A. Y., & Astafiev, O. V. (2021) · Applied Physics Letters · doi:10.1063/5.0047690 · Cited by 14
Fast Flux Entangling Gate for Fluxonium Circuits
Chen, Y., Nesterov, K., Manucharyan, V., & Vavilov, M. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.034027 · Cited by 23
Zhang, M., Xie, L., Zhang, Z., Yu, Q., Xi, G., Zhang, H., Liu, F., Zheng, Y., Zheng, Y.-C., & Zhang, S. (2021) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1145/3466752.3480116 · Cited by 28
Singh, S., Alderete, C. H., Balu, R., Monroe, C., Linke, N. M., & Chandrashekar, C. M. (2021) · Physical Review A · doi:10.1103/physreva.104.062401 · Cited by 13
“There is great interest in developing quantum algorithms for potential speedups over conventional computers, and progress is being made in mapping such algorithms to current technology [1,2].”
Control System of Superconducting Quantum Computers
He, Y., Liu, J., Zhao, C., Huang, R., Dai, G., & Chen, W. (2022) · Journal of Superconductivity and Novel Magnetism · doi:10.1007/s10948-021-06104-5 · Cited by 18
Implementation of three efficient 4-digit fault-tolerant quantum carry lookahead adders
Orts, F. J., Ortega, G., Filatovas, E., & Garzón, E. M. (2022) · The Journal of Supercomputing · doi:10.1007/s11227-022-04401-x · Cited by 16
Mangini, S., Maccone, L., & Macchiavello, C. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00151-0 · Cited by 18
Piccolini, M., Nosrati, F., Morandotti, R., & Franco, R. L. (2021) · Open Systems & Information Dynamics · doi:10.1142/s1230161221500207 · Cited by 13
Movassagh, R. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.04681 · Cited by 38
Support Vector Machines on Noisy Intermediate Scale Quantum ComputersPreprint
Yang, J., Awan, A. J., & Vall-Llosera, G. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.11988 · Cited by 13
Portfolio rebalancing experiments using the Quantum Alternating Operator AnsatzPreprint
Hodson, M. J., Ruck, B., Ong, H., Garvin, D., & Dulman, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.05296 · Cited by 101
VQE Method: A Short Survey and Recent DevelopmentsPreprint
Fedorov, D. A., Peng, B., Govind, N., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.08505 · Cited by 13
Variational Quanvolutional Neural Networks with enhanced image encodingPreprint
Mattern, D., Martyniuk, D., Willems, H., Bergmann, F., & Paschke, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.07327 · Cited by 41
SOK: An Evaluation of Quantum Authentication Through Systematic Literature ReviewPreprint
Majumdar, R., & Das, S. (2021) · SSRN Electronic Journal · doi:10.2139/ssrn.3859056 · Cited by 21
Fast Universal Entangling Gate for Superconducting Quantum ComputersPreprint
AbuGhanem, M., Homid, A. H., Hendy, A. S., Obada, A. ‐. F., & Eleuch, H. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4726035 · Cited by 14
Quantum Computing and Visualization: A Disruptive Technological Change Ahead
Bethel, E. W., Amankwah, M. G., Balewski, J., Van Beeumen, R., Camps, D., Huang, D., & Perciano, T. (2023) · IEEE Computer Graphics and Applications · doi:10.1109/mcg.2023.3316932 · Cited by 13
“Present day systems are referred to as Noisy Intermediate Scale Quantum (NISQ) platforms because the quantum state in qubits and gates between them is subject to interference from external sources like heat and energetic particles in the environment [8].”
BackgroundSingh, S., Alderete, C. H., Balu, R., Monroe, C., Linke, N. M., & Chandrashekar, C. M. (2020) · arXiv · doi:10.48550/arxiv.2001.11197 · Cited by 13
Limitations of Local Quantum Algorithms on Random Max-k-XOR and Beyond
Chou, C.-N., Love, P. J., Sandhu, J. S., & Shi, J. (2021) · arXiv · doi:10.48550/arxiv.2108.06049 · Cited by 13
Noise dynamics of quantum annealers: estimating the effective noise using idle qubits
Pelofske, E., Hahn, G., & Djidjev, H. N. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/accbe6 · Cited by 12
NR-QNN: Noise-Resilient Quantum Neural Network
Sajadimanesh, S., Rad, H. A., Faye, J. P. L., & Atoofian, E. (2025) · IEEE Access · doi:10.1109/access.2025.3546956 · Cited by 23
Enhancing quantum support vector machine for healthcare applications using custom feature maps
Bansal, R., Rajput, N. K., & Khanna, M. (2025) · Knowledge-Based Systems · doi:10.1016/j.knosys.2025.113669 · Cited by 18
Quantum generative adversarial network for image generation
Pajuhanfard, M., Pan, Z., & Sheng, V. S. (2025) · The Visual Computer · doi:10.1007/s00371-025-03915-8 · Cited by 17
Four-qubit variational algorithms in silicon photonics with integrated entangled photon sources
Baldazzi, A., Sanna, M., Borghi, M., Azzini, S., & Pavesi, L. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01061-6 · Cited by 21
Liu, H.-T., Chen, B., Zhang, J., Xiao, Y.-X., Li, T., Huang, K., Wang, Z., Li, H., Zhao, K., Xu, Y., et al. (2025) · Physical Review Letters · doi:10.1103/lvb9-pfr3 · Cited by 28
Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching
Daguerre, L., Blume-Kohout, R., Brown, N. C., Hayes, D., & Kim, I. H. (2025) · Physical Review X · doi:10.1103/dck4-x9c2 · Cited by 81
Sukulthanasorn, N., & Terada, K. (2025) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2025.118411 · Cited by 15
State stabilization for gate-model quantum computers
Gyöngyösi, L., & Imre, S. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2397-0 · Cited by 13
Microwave-based arbitrary cphase gates for transmon qubits
Barron, G. S., Calderon-Vargas, F. A., Long, J., Pappas, D. P., & Economou, S. E. (2020) · Physical review. B./Physical review. B · doi:10.1103/physrevb.101.054508 · Cited by 12
Noise detection with spectator qubits and quantum feature engineering
Youssry, A., Paz-Silva, G. A., & Ferrie, C. (2023) · New Journal of Physics · doi:10.1088/1367-2630/ace2e4 · Cited by 21
Quantum neuron with real weights
Monteiro, C. A., Filho, G. I. S., Costa, M. H. J., Neto, F. M. D. P., & de Oliveira, W. R. (2021) · Neural Networks · doi:10.1016/j.neunet.2021.07.034 · Cited by 13
Discriminating Quantum States with Quantum Machine Learning
Quiroga, D., Date, P., & Pooser, R. C. (2021) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc53822.2021.00018 · Cited by 17
Adaptive variational preparation of the Fermi-Hubbard eigenstates
Gyawali, G., & Lawler, M. J. (2022) · Physical Review A · doi:10.1103/physreva.105.012413 · Cited by 19
Abedi, E., Beigi, S., & Taghavi, L. (2023) · Quantum · doi:10.22331/q-2023-04-27-989 · Cited by 29
Deterministic and Entanglement-Efficient Preparation of Amplitude-Encoded Quantum Registers
Gundlapalli, P., & Lee, J. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.024013 · Cited by 21
Transit facility allocation: Hybrid quantum-classical optimization
Gabbassov, E. (2022) · PLoS ONE · doi:10.1371/journal.pone.0274632 · Cited by 18
Koike, T. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0273 · Cited by 23
Quantum transfer learning for image classification
Subbiah, G., Shridevi, S., Asthana, N., Balaji, P., & Vaiyapuri, T. (2022) · TELKOMNIKA (Telecommunication Computing Electronics and Control) · doi:10.12928/telkomnika.v21i1.24103 · Cited by 14
A quantum walks assisted algorithm for peptide and protein folding prediction
Varsamis, G. D., & Karafyllidis, I. G. (2022) · Biosystems · doi:10.1016/j.biosystems.2022.104822 · Cited by 16
Deterministic optimal quantum cloning via a quantum-optical neural network
Stanev, D., Spagnolo, N., & Sciarrino, F. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.013139 · Cited by 15
Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures
Litteken, A., Seifert, L. M., Chadwick, J. D., Nottingham, N., Roy, T., Li, Z., Schuster, D., Chong, F. T., & Baker, J. M. (2023) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3579371.3589106 · Cited by 21
Kovyrshin, A., Skogh, M., Broo, A., Mensa, S., Sahin, E., Crain, J. N., & Tavernelli, I. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0150291 · Cited by 15
A Hybrid Quantum-Classical Algorithm for Multichannel Quantum Scattering of Atoms and Molecules
Xing, X., Cadavid, A. G., Izmaylov, A. F., & Tscherbul, T. V. (2023) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.3c00985 · Cited by 18
Partitioning Quantum Chemistry Simulations with Clifford Circuits
Schleich, P., Boen, J., Cincio, Ł., Anand, A., Kottmann, J. S., Tretiak, S., Dub, P. A., & Aspuru‐Guzik, A. (2023) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c00335 · Cited by 23
Quantum computing to solve scenario-based stochastic time-dependent shortest path routing
Dixit, V. V., Niu, C., Rey, D., Waller, S. T., & Levin, M. W. (2023) · Transportation Letters · doi:10.1080/19427867.2023.2238461 · Cited by 22
QOPTLib: A Quantum Computing Oriented Benchmark for Combinatorial Optimization Problems
Osaba, E., & Villar-Rodríguez, E. (2023) · Springer tracts in nature-inspired computing · doi:10.1007/978-981-99-3970-1_4 · Cited by 24
Functional completeness of planar Rydberg blockade structures
Stastny, S., Büchler, H. P., & Lang, N. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.085138 · Cited by 15
Boosting quantum amplitude exponentially in variational quantum algorithms
Kyaw, T. H., Soley, M. B., Allen, B., Bergold, P., Sun, C., Batista, V. S., & Aspuru‐Guzik, A. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acf4ba · Cited by 21
iQuantum: A Case for Modeling and Simulation of Quantum Computing Environments
Nguyen, H. T., Usman, M., & Buyya, R. (2023) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw59989.2023.00013 · Cited by 24
Quantum and Quantum-Inspired Stereographic K Nearest-Neighbour Clustering
Jasso, A. V., Modi, A., Ferrara, R., Nötzel, J., Deppe, C., Schaedler, M., & Fung, F. (2023) · Entropy · doi:10.3390/e25091361 · Cited by 16
Nonnegative/Binary matrix factorization for image classification using quantum annealing
Asaoka, H., & Kudo, K. (2023) · Scientific Reports · doi:10.1038/s41598-023-43729-z · Cited by 14
Stochastic Operator Variance: An Observable to Diagnose Noise and Scrambling
Martínez-Azcona, P., Kundu, A., del Campo, A., & Chenu, A. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.160202 · Cited by 19
Rehman, J. U., Al-Hraishawi, H., & Chatzinotas, S. (2023) · International Conference on Communications · doi:10.1109/icc45041.2023.10279239 · Cited by 16
QPause: Quantum-Resistant Password-Protected Data Outsourcing for Cloud Storage
Jiang, J., Wang, D., & Zhang, G. (2023) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2023.3331000 · Cited by 14
A multi-classification classifier based on variational quantum computation
Zhou, J., Li, D., Tan, Y., Yang, X., Zheng, Y., & Liu, X. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04151-6 · Cited by 19
A hybrid quantum-classical approach for inference on restricted Boltzmann machines
Kālis, M., Locāns, A., Šikovs, R., Naseri, H., & Ambainis, A. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00135-y · Cited by 12
Carisch, C., Romito, A., & Zilberberg, O. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.l042031 · Cited by 23
Hybrid Quantum-Classical Multilevel Approach for Maximum Cuts on Graphs
Angone, A., Liu, X., Shaydulin, R., & Safro, I. (2023) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec58863.2023.10363584 · Cited by 26
VarSaw: Application-tailored Measurement Error Mitigation for Variational Quantum Algorithms
Dangwal, S., Ravi, G. S., Das, P., Smith, K. N., Baker, J. M., & Chong, F. T. (2023) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3623278.3624764 · Cited by 27
Scalable approach to quantum simulation via projection-based embedding
Ralli, A., de la Bastida, M. W., & Coveney, P. V. (2024) · Physical Review A · doi:10.1103/physreva.109.022418 · Cited by 26
Brenes, M., Min, B., Anto-Sztrikacs, N., Bar‐Gill, N., & Segal, D. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0207028 · Cited by 21
Natural Orbitals and Sparsity of Quantum Mutual Information
Ratini, L., Capecci, C., & Guidoni, L. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.3c01325 · Cited by 18
Physically Motivated Improvements of Variational Quantum Eigensolvers
Vaquero-Sabater, N., Carreras, A., Orús, R., Mayhall, N. J., & Casanova, D. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c00329 · Cited by 12
Low-depth Clifford circuits approximately solve MaxCut
Muñoz-Arias, M. H., Kourtis, S., & Blais, A. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023294 · Cited by 21
Quantum computing for nuclear physics
Savage, M. J. (2024) · EPJ Web of Conferences · doi:10.1051/epjconf/202429601025 · Cited by 16
Desdentado, E., Calero, C., Moraga, M. Á., Serrano, M., & García, F. O. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112165 · Cited by 23
Quantum support vector data description for anomaly detection
Oh, H., & Park, D. K. (2024) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ad6be8 · Cited by 28
Quantum Computational Intelligence Techniques: A Scientometric Mapping
Arora, M., & Gupta, K. (2024) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-024-10183-7 · Cited by 19
Investigating the Effect of Noise on the Training Performance of Hybrid Quantum Neural Networks
Kashif, M., Sychiuco, E., & Shafique, M. (2024) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn60899.2024.10651363 · Cited by 22
HyQ2: A Hybrid Quantum Neural Network for NextG Vulnerability Detection
Peng, Y., Li, X., Liang, Z., & Wang, Y. N. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3481280 · Cited by 19
The role of data embedding in equivariant quantum convolutional neural networks
Das, S., Martina, S., & Caruso, F. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00215-7 · Cited by 18
Quantum Circuits of AES with a Low-Depth Linear Layer and a New Structure
Shi, H., & Feng, X. (2024) · Lecture notes in computer science · doi:10.1007/978-981-96-0944-4_12 · Cited by 17
Quantum Gated Recurrent Neural Networks
Li, Y., Wang, Z., Xing, R., Shao, C., Shi, S., Li, J., Zhong, G., & Gu, Y. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3519605 · Cited by 25
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.