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 6,901–7,000 of 8,640
Photonic Quantum Computing: An OverviewPreprint
da Silva, R. P. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4546053
The History of Quantum GamesPreprint
Piispanen, L. J., Morrell, E., Park, S., Pfaffhauser, M., & Kultima, A. (2023) · Aaltodoc (Aalto University) · doi:10.48550/arxiv.2309.01525 · Cited by 1
尚, 瑞., 王, 志., 史, 尚., 李, 嘉., 李, 亚., & 顾, 永. (2023) · SCIENTIA SINICA Terrae · doi:10.1360/n072023-0001
An Optimized Quantum Circuit Representation of Bayesian Networks
Fathallah, W., Amor, N. B., & Leray, P. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-45608-4_13 · Cited by 1
Hamiltonian simulation in the Pauli basis of multi-qubit clusters for condensed matter physics
André, E. L., & Tsirulev, A. N. (2023) · Вестник Российского университета дружбы народов. Серия: Математика, информатика, физика · doi:10.22363/2658-4670-2023-31-3-247-259
Invited: Building Robust Quantum System Software for Technology-Specific Characteristics
Patel, T., & Tiwari, D. (2023) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac56929.2023.10248010
โมเดลควอนตัมโครงข่ายประสาทเทียมสำหรับปัญหาการถดถอย
เหล่าคนดี, ส. (2021) · Chula Digiverse · doi:10.58837/chula.the.2021.957
Shah, A., & Pachisia, T. (2023) · doi:10.36227/techrxiv.24186825
Shah, A., & Pachisia, T. (2023) · doi:10.36227/techrxiv.24186825.v1
Introducing Quantum Variational Circuit for Efficient Management of Common Pool Resources
Shahid, M., & Awais, M. (2023) · IEEE Access · doi:10.1109/access.2023.3322144 · Cited by 2
He, R.-H., Hua, R.-F., Xie, Y.-Y., Ablimit, A., & Wang, Z.-M. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04125-8 · Cited by 1
Investigating quantum many-body systems with tensor networks, machine learning and quantum computers
Kottmann, K. (2022) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-379461 · Cited by 3
Design Method of Meta Operators Based on Equivalence Class Distribution
Shu, G., Fei, Y., Yi, Z., Xu, J., Liu, F., & Shan, Z. (2023) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2620/1/012009
Perspectivas Globais Militares sobre Tecnologias Quânticas
Brito, D. A. P. G., Ferreira, R. P., & Chaves, A. J. (2023) · Aplicações Operacionais em Áreas de Defesa · doi:10.55972/spectrum.v24i1.389 · Cited by 2
A design method for efficient variational quantum models based on specific Pauli axis
Li, B., Li, T., & Li, F. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04127-6
Report on scipost_202307_00042v1
Chen, T., Shen, R., Lee, C. H., et al. (2023) · SciPost Physics · doi:10.21468/scipost.report.7717
Recognizing Good Variational Quantum Circuits with Monte Carlo Tree SearchPreprint
Cai, Z., Chen, J., Xu, K., et al. (2023) · Research Square · doi:10.21203/rs.3.rs-3490986/v1
The Prospect of Quantum Amplitude Estimation Based on the Development of the Quantum VolumePreprint
Hoek, C. R., & de Jong, J. (2023) · Preprints.org · doi:10.20944/preprints202310.2077.v1
PyQBench: A Python library for benchmarking gate-based quantum computers
Jałowiecki, K., Lewandowska, P., & Pawela, Ł. (2023) · SoftwareX · doi:10.1016/j.softx.2023.101558 · Cited by 10
Quantum Classifiers applied to Multi-User Detector in Communications Systems
Dias, J. T., Gonçalves, D., Silva, F. D. A., & Neves, D. C. (2023) · Anais de XXXV Simpósio Brasileiro de Telecomunicações e Processamento de Sinais · doi:10.14209/sbrt.2023.1570916643
Parity-Time Symmetric Holographic Principle
Song, X., & Murch, K. W. (2023) · Entropy · doi:10.3390/e25111523 · Cited by 1
Semantic Communication: A Survey on Research Landscape, Challenges, and Future DirectionsPreprint
Getu, T. M., Kaddoum, G., & Bennis, M. (2023) · doi:10.36227/techrxiv.24527455
Mitigating Coupling Map Constrained Correlated Measurement Errors on Quantum Devices
Robertson, A., & Song, S. L. (2023) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3581784.3607039 · Cited by 2
Gequpi: Quantum Program Improvement with Multi-Objective Genetic ProgrammingPreprint
Gemeinhardt, F., Klikovits, S., & Wimmer, M. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4633722
Robust system software for quantum computing
Patel, T. (2023) · Digital Repository Service (Northeastern University) · doi:10.17760/d20487156
Liu, Z. (2023) · Springer theses · doi:10.1007/978-981-99-6167-2_8
Entanglement in High-Energy Physics: An Overview
Nadir, M. (2023) · IntechOpen eBooks · doi:10.5772/intechopen.1003658 · Cited by 1
Epilog: Grenzen der KI – theoretisch, praktisch, ethisch
Mainzer, K. (2023) · Springer Reference Geisteswissenschaften · doi:10.1007/978-3-658-23715-8_59-1
Robust LS-QSVM Implementation via Efficient Matrix Factorization and Eigenvalue Estimation
Shen, J., & Ying, J. (2023) · Communications in computer and information science · doi:10.1007/978-981-99-8126-7_40
Multi-Programming Mechanism on Near-Term Quantum Computing
Niu, S., & Todri‐Sanial, A. (2023) · Springer eBooks · doi:10.1007/978-3-031-37966-6_2 · Cited by 2
The Panopticon Revisitied Surveillence, Discipline, and the Modern Political Order
AKDUMAN, B. (2023) · Arete Political Philosophy Journal · doi:10.47614/arete.pfd.89
Transversal Injection: Using the Surface Code to Prepare Non-Pauli Eigenstates
Gavriel, J., Herr, D., Shaw, A., Bremner, M. J., Paler, A., & Devitt, S. J. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00105 · Cited by 2
Symmetry Breaking Slows Convergence of the ADAPT Variational Quantum Eigensolver
Bertels, L. W., Grimsley, H. R., Economou, S. E., Barnes, E., & Mayhall, N. J. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10190
Robustness of Quantum Algorithms Against Approximate Data Representations
Los, V., Maksymenko, M., Koch-Janusz, M., Pryyma, Y., & Givhan, R. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10269
Solving Graph Problems with Single-Photons and Linear Optics
Mezher, R., Carvalho, A. F., & Mansfield, S. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.10239 · Cited by 1
Effects of T-Factor on Quantum Annealing Algorithms for Integer Factoring Problem
Liu, Z., Zheng, S., Yan, X., Ping, P., & Wang, L. (2023) · Journal of quantum computing · doi:10.32604/jqc.2023.045572
Tensor Train Optimization of Parameterized Quantum Circuits
Paradezhenko, G. V., Pervishko, A. A., & Yudin, D. (2023) · Journal of Experimental and Theoretical Physics Letters · doi:10.1134/s0021364023603056
Gyawali, G., Ahmed, M., Aspling, E. W., Ellert-Beck, L., & Lawler, M. J. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.235141 · Cited by 2
Entropic property of randomized QAOA circuits
Chernyavskiy, A. Y., Bantysh, B. I., & Bogdanov, Y. I. (2023) · Laser Physics Letters · doi:10.1088/1612-202x/ad12ad · Cited by 3
A Systematic Literature Review on Optimization Techniques for Quantum Computing Compilers
da Rocha, C. V. B., Santos, A. L. D., & Souza, M. A. (2023) · doi:10.5753/wscad_estendido.2023.235804 · Cited by 1
Zulehner, A., & Wille, R. (2023) · Springer eBooks · doi:10.1007/978-3-031-36751-9_1
Zulehner, A., & Wille, R. (2023) · Springer eBooks · doi:10.1007/978-3-031-36751-9_2
Techniques for efficient and secure optical networks
Iqbal, M. (2023) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-398050 · Cited by 1
Hamiltonian Minimization in the NISQ EraPreprint
da Silva, R. P. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4652979
The discussion of the transmission coefficient of one-dimensional double barrier
Li, J. (2023) · Theoretical and Natural Science · doi:10.54254/2753-8818/25/20240952
Supremacy of Quantum Computation in Bioscience: A Technical Review
Hadi, M. R., Mohammed, G., Shnawa, A. H., Adnan, M. M., Jebur, M. A., & Hameed, W. (2023) · International Conference on Engineering Technology and its Applications (IICETA) · doi:10.1109/iiceta57613.2023.10351306 · Cited by 1
Research on a Quantum Machine Learning Approach to Mismatched Filter Design
Xiao, J., Dong, S., & Xia, L. (2023) · International Conference on Communication, Image and Signal Processing (CCISP) · doi:10.1109/ccisp59915.2023.10355822
Kuantum Programlama Açısından Kuantum Derleyicilerin Karşılaştırmalı Analizi ve IBMQ Uygulaması
Karaköse, M., Yetış, H., Küçük, O., Ogdu, C. U., & Yaman, O. (2023) · Adıyaman Üniversitesi Mühendislik Bilimleri Dergisi · doi:10.54365/adyumbd.1334196
Simulating dimensionally reduced 4D Yang-Mills theory on a quantum computer
Butt, N., Draper, P., & Shen, J. (2023) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.108.114510 · Cited by 7
Cloud Quantum Coin-Tossing Gambling
New American Quantum Education Society Operations (NAQESO) 1340 Reynolds Ave. #116-1070, I., & Moreno, J. C. (2023) · International Journal of Applied Sciences and Smart Technologies · doi:10.24071/ijasst.v5i2.6407
Imoto, T., Susa, Y., Kadowaki, T., Miyazaki, R., & Matsuzaki, Y. (2024) · Research Square · doi:10.21203/rs.3.rs-3642364/v1
What is the perception of the Hungarian quantum community regarding the future of quantum computing?
Szatmáry, K. S., & Kozlovszky, M. (2023) · IEEE International Symposium on Computational Intelligence and Informatics (CINTI) · doi:10.1109/cinti59972.2023.10382091
The deterministic pattern matching based on the parameterized quantum circuit
Liu, L., Wu, X.-Y., Xu, C.-Y., Zhang, L., & Wang, C. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-023-00215-9
Size optimization of CNOT circuits on NISQPreprint
Zhang, A., Feng, X., & Xu, S. (2024) · Research Square · doi:10.21203/rs.3.rs-3857079/v1
Efficient quantum circuit contraction using Tensor Decision DiagramsPreprint
López-Oliva, V., Badía, J. M., & Castillo, M. (2024) · Research Square · doi:10.21203/rs.3.rs-3870392/v1
Prjamkov, D., Dremel, K., Lang, T., Semmler, S., Weule, M., Firsching, M., Kasperl, S., & Fuchs, T. O. J. (2024) · e-Journal of Nondestructive Testing · doi:10.58286/29236 · Cited by 1
Energy Calculation of Benzene Ring Based on the Variational Quantum Eigensolver Algorithm
Yang, S., Zhu, Q.-S., Wu, H., Li, X., Shang, X., & Yang, S. L. (2024) · Lecture notes in electrical engineering · doi:10.1007/978-981-99-9243-0_31
Enhancing Cloud Computing Security Through Deep Learning: An Artificial Neural Network Approach
Shaik, S. P. (2021) · INTERNATIONAL RESEARCH JOURNAL OF ENGINEERING AND APPLIED SCIENCES · doi:10.55083/irjeas.2021.v09i04009
Quantum Neural Network model for Token allocation for Course Bidding
Laokondee, S., & Chongstitvatana, P. (2024) · ECTI Transactions on Computer and Information Technology (ECTI-CIT) · doi:10.37936/ecti-cit.2024181.247613
Variational quantum multidimensional scaling algorithm
Zhang, X., Zhang, F., Guo, Y., & Chen, F. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04289-x · Cited by 1
Introducing Reduced-Width QNNs, an AI-Inspired Ansatz Design Pattern
Stein, J., Rohe, T., Nappi, F., Hager, J., Bucher, D., Zorn, M., Kölle, M., & Linnhoff–Popien, C. (2024) · International Conference on Agents and Artificial Intelligence (ICAART) · doi:10.5220/0012449800003636 · Cited by 4
Applying Quantum Computing to the Renewable Energy Stock Exchange to Reduce the Risk of Investment
Chaiboonsri, C., Eakkapun, P., & Thongkaw, B. (2024) · Lecture notes in networks and systems · doi:10.1007/978-981-99-8346-9_38
Realizing quantum imaginary time evolution in experiment
Yuan, X. (2023) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-024-2330-4
Tan, M. T., Wang, Y., & Mitra, A. (2023) · SciPost Physics · doi:10.21468/scipost.report.7617
Quantenalgorithmen zur Optimierung von Produktions- und Logistikprozessen
Klug, F. (2024) · Zeitschrift für wirtschaftlichen Fabrikbetrieb · doi:10.1515/zwf-2024-1026
Report on scipost_202311_00042v1
Schmid, L., Zardini, E., & Pastorello, D. (2024) · SciPost Physics Core · doi:10.21468/scipost.report.8477
Dynamic Model Structure Adjustment to Realize Quantum Continual Learning Based on Quantum Data
Xu, H., & Situ, H. (2024) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp48485.2024.10448379
Hamiltonian-reconstruction distance as a success metric for the variational quantum eigensolver
Moon, L. J. I., Sohoni, M. M., Shimizu, M. A., Viswanathan, P., Zhang, K., Kim, E.-A., & McMahon, P. L. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae528d · Cited by 1
The Role of Threat Intelligence in Enhancing Cybersecurity Posture
Ahmad, M. S., & Haripriya, V. (2024) · International Journal of Innovative Research in Computer and Communication Engineering · doi:10.15680/ijircce.2024.1203061
Analyzing the Temporal Behavior of Noisy Intermediate‐Scale Quantum Nodes and Algorithm Fidelity
Podda, C., Moreau, G. S., Pisani, L., Leoni, L., & Cao, G. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300451
Dabhade, P. N. V. D., Niranjane, P., Deshkar, P. A., Chole, V., Janwe, N. J., & Chaudhari, N. (2024) · Journal of Electrical Systems · doi:10.52783/jes.1792
Vision Towards Quantum Humanities: An Architecture of a Holistic QML Environment
Barzen, J. (2023) · Congress in Computer Science, Computer Engineering, and Applied Computing (CSCE) · doi:10.1109/csce60160.2023.00270
Utilising Dimensionality Reduction for Improved Data Analysis with Quantum Feature LearningPreprint
Sihare, S. R. (2024) · Research Square · doi:10.21203/rs.3.rs-4188384/v1
Efficient Quantum Circuit Simulation by Tensor Network Methods on Modern GPUsPreprint
Pan, F. P., Gu, H., Kuang, L., et al. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2310.03978
Lin, C., Xu, R., & Li, Y. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4793562
Zobov, V. E., & Lundin, A. A. (2023) · Письма в Журнал экспериментальной и теоретической физики · doi:10.31857/s1234567823120091
Noise‐Tailored Constructions for Spin Wigner Function Kernels
Hanks, M., Lee, S., & Kim, M. S. (2024) · Advanced Physics Research · doi:10.1002/apxr.202300124
Modelling Heterogeneous Catalysis using Quantum Computers: An academic and industry perspectivePreprint
Hariharan, S., Kinge, S., & Visscher, L. (2024) · ChemRxiv · doi:10.26434/chemrxiv-2024-d2l1k
Efficient preparation of lossless quantum images based on Gray code
Liu, Y., Cheng, X.-S., Loh, C.-W., & Li, Y. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04369-y
Correr, G. I. (2024) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.76.2024.tde-24042024-083735
Bioinspired Quantum Oracle Circuits for Biomolecular Solutions of the Maximum Cut Problem
Chang, W.-L., Wong, R., Chen, Y. B., Chung, W., Chen, J.-C., & Vasilakos, A. V. (2024) · IEEE Transactions on NanoBioscience · doi:10.1109/tnb.2024.3395420 · Cited by 9
Ying, M. (2024) · Elsevier eBooks · doi:10.1016/b978-0-44-315942-8.00009-5
(2024) · Elsevier eBooks · doi:10.1016/b978-0-44-315942-8.00030-7
Measurement-device-independent verification of quantum states
Xu, X.-Y., Zhen, Y.-Z., Zhou, Q., Hu, S.-M., Wei, J.-H., Yang, N.-Y., Li, L., Liu, N.-L., & Chen, K.-G. (2024) · Physical Review A · doi:10.1103/physreva.109.052607 · Cited by 1
Precise Quantum Angle Generator Designed for Noisy Quantum Devices
Rehm, F., Vallecorsa, S., Borras, K., Krücker, D., Grossi, M., & Varo, V. (2024) · EPJ Web of Conferences · doi:10.1051/epjconf/202429512006
Secret Information Sharing using Multipartite Entanglement in Monty Hall Game
Kaur, H., Shah, K., Swain, D., et al. (2024) · Photonic Network Communications · doi:10.1007/s11107-024-01017-4
Research on Quantum Phase Diagram of t-J Model Based on Machine Learning Tensor Network Algorithm
Li, S., & Wu, Y. (2023) · IEEE International Conference on Advances in Electrical Engineering and Computer Applications (AEECA) · doi:10.1109/aeeca59734.2023.00077
Witnessing entanglement in trapped-ion quantum error correction under realistic noise
Blanco, A., Shähandeh, F., & Bermúdez, A. (2024) · Physical Review A · doi:10.1103/physreva.109.052417 · Cited by 5
Light cone cancellation for variational quantum eigensolver in solving noisy Max-Cut
Lee, X., Yan, X., Xie, N., Saito, Y., Kurosawa, L., Asai, N., Cai, D., & Lau, H. C. (2026) · Scientific Reports · doi:10.1038/s41598-025-31798-1 · Cited by 3
Floquet chiral quantum walk in a quantum computer
Bark, C. B., Kim, Y., & Park, M. J. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.l201117
Low-cost nonlocal Toffoli gate in a linear quantum network topology
Chen, H., Hou, G., & Zhu, C. (2024) · Modern Physics Letters B · doi:10.1142/s0217984924503706
Optimizing control fields for diabatic protocols in the presence of noise
Fernandes, M. E. F., de Lima, E. F., & Castelano, L. K. (2024) · Physical Review A · doi:10.1103/physreva.109.052622
Noise-resilient and resource-efficient hybrid algorithm for robust quantum gap estimation
Lee, W., Myers, N. M., & Scarola, V. W. (2025) · Physical Review A · doi:10.1103/physreva.111.022421 · Cited by 5
Cloud Quanta: Pioneering the Future of Quantum Computing in the Cloud
Kokate, L., & Srikanth (2024) · International Journal of Innovative Research in Science Engineering and Technology · doi:10.15680/ijirset.2024.1305156
Simulation of time-dependent quantum dynamics using quantum computers
Lötstedt, E., Nishi, T., & Yamanouchi, K. (2024) · Advances in atomic, molecular, and optical physics · doi:10.1016/bs.aamop.2024.05.002 · Cited by 1
Simulation of Time-Dependent Quantum Dynamics Using Quantum Computers
Lötstedt, E., & Yamanouchi, K. (2024) · Topics in applied physics · doi:10.1007/978-3-031-55463-6_7
Quantum synchronization: insights and applications to quantum information processing
Shen, Y. (2024) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/175840
A machine learning ride in the physics theme park: from quantum to biophysics
Requena, B. (2024) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-409132
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.