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,601–6,700 of 8,640
Quantum Accounting: Challenges, Future Outlook, and RecommendationsPreprint
mulla, H. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5324442 · Cited by 1
Hangun, B., Eyecioglu, O., Ali, M., Altun, O., & Kayışlı, K. (2026) · Quantum Information Processing · doi:10.21203/rs.3.rs-9475883/v1 · Cited by 3
“QuantumIrrigation” – a new quantum computing python package for irrigation demand assessment
Neupane, A., & Samadi, V. S. (2025) · Smart Agricultural Technology · doi:10.1016/j.atech.2025.101523 · Cited by 5
Sang, S., Hour, L., & Han, Y. (2025) · Research Square · doi:10.21203/rs.3.rs-7364412/v1 · Cited by 1
Securing Quantum Computer Reset with One-Time Pads
Xu, C., Sikora, J., & Szefer, J. M. (2025) · doi:10.1145/3733825.3765278
Scaling Hybrid Quantum--HPC Applications with the Quantum Framework
Chundury, S., Shehata, A., Kim, S., Meena, M. G., Lu, C., Gottiparthi, K. C., Pérez, E. A. C., Mueller, F., & Suh, I. (2025) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3731599.3767553 · Cited by 10
Xu, L., Sha, E. H. ‐., Cui, X.-B., & Zhuge, Q. (2025) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3712285.3759789 · Cited by 6
Czuba, M., Holzer, P., & Oo, H. Z. Y. (2026) · Research Square · doi:10.21203/rs.3.rs-9115478/v1 · Cited by 1
Algorithmic Error Mitigation Scheme for Current Quantum Processors
Suchsland, P., Tacchino, F., Fischer, M. H., Neupert, T., Barkoutsos, P. K., & Tavernelli, I. (2020) · arXiv · doi:10.48550/arxiv.2008.10914 · Cited by 1
A dissymmetric [Gd2] coordination molecular dimer hosting six addressable spin qubits
Luis, F., Alonso, P. J., Roubeau, O., Velasco, V., Zueco, D., Aguilà, D., Martínez, J. I., Barrios, L. A., & Aromı́, G. (2020) · Communications Chemistry · doi:10.1038/s42004-020-00422-w · Cited by 60
A quantum strategy to compute the jet quenching parameter $$\hat{q}$$
Barata, J., & Salgado, C. A. (2021) · The European Physical Journal C · doi:10.1140/epjc/s10052-021-09674-9 · Cited by 40
Optimal Quantum Spatial Search with One-Dimensional Long-Range Interactions
Lewis, D., Benhemou, A., Feinstein, N., Banchi, L., & Bose, S. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.240502 · Cited by 21
Robust entanglement by continuous dynamical decoupling of the J-coupling interaction
Valahu, C. H., Lawrence, A. M., Weidt, S., & Hensinger, W. K. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac320e · Cited by 7
Integration and Evaluation of Quantum Accelerators for Data-Driven User Functions
Hubregtsen, T., Segler, C., Pichlmeier, J., Sarkar, A., Gabor, T., & Bertels, K. (2020) · International Symposium on Quality Electronic Design (ISQED) · doi:10.1109/isqed48828.2020.9137029 · Cited by 6
Resonant Coupling Parameter Estimation with Superconducting Qubits
Béjanin, J. H., Earnest, C. T., Sanders, Y. R., & Mariantoni, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040343 · Cited by 8
Simulating Quantum Circuits by Shuffling PaulisPreprint
Rall, P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.05404
Wrangling Rogues: Managing Experimental Post-Moore ArchitecturesPreprint
Powell, W., Riedy, J., Young, J., & Conte, T. M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.06334
Improved Quantum Circuits with Qudits and Dirty Ancillae
Gokhale, P., Baker, J. M., & Chong, F. T. (2018) · IEEE/ACM International Symposium on Microarchitecture (MICRO)
Device-independent certification of quantum resources
Šupić, I. (2018) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-122708
Towards Solid-State Spin Based, High-Fidelity Quantum Computation
Kleißler, F. (2018) · eDiss (Georg-August-Universität Göttingen) · doi:10.53846/goediss-7168
Making Quantum Computing Open: Lessons from Open-Source ProjectsPreprint
Shaydulin, R., Thomas, C., & Rodeghero, P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.00991
Characterizing large-scale quantum devices
Wallman, J. J., & Emerson, J. (2019) · Quantum Information and Measurement (QIM) · doi:10.1364/qim.2019.s3b.2
Nash embedding: a road map to realizing quantum hardware
Khan, F. S. (2019) · Digitale Welt · doi:10.1007/s42354-019-0241-4
Estimation and uncertainty quantification for the output from quantum simulatorsPreprint
Bennink, R. S., Jasra, A., Law, K. J. H., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.02964
Zobov, V. E., & Pichkovskiy, I. S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.01135
Topology in Quantum Information
Martín, L. O. (2019) · Springer theses · doi:10.1007/978-3-030-23649-6_2
Silva, M. P. D., & Johnson, B. (2019)
Towards Memory Access Optimization in Quantum Computing
Nascimento, M., Ávila, A., Reisen, R., & Pilla, M. L. (2019) · European Society for Fuzzy Logic and Technology Conference · doi:10.2991/eusflat-19.2019.65
Adiabatic Quantum Kitchen Sinks for Learning Kernels Using Randomized FeaturesPreprint
Noori, M., Vedaie, S. S., Singh, I., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.08131
Subsystem-based Approach to Scalable Quantum Optimal ControlPreprint
Li, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.02061 · Cited by 3
Quantum Coin Method for Numerical IntegrationPreprint
Shimada, N., & Hachisuka, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.00263
Contextuality and Ontological Models: A Tale of Desire and Disappointment
Lillystone, P. (2019) · UWSpace (University of Waterloo)
Quantum algorithmic techniques for fault-tolerant quantum computers
Kieferová, M. (2020) · Macquarie University · doi:10.25949/19431368 · Cited by 2
Quantum Circuit Parameters Learning with Gradient Descent Using BackpropagationPreprint
Watabe, M., Shiba, K., Sogabe, M., Sakamoto, K., & Sogabe, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.14266 · Cited by 16
Quantum-Inspired Computing: Can it be a Microscopic Computing Model of the Brain?Preprint
Katayama, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.10508
NISQ computing for decision making under uncertaintyPreprint
Naus, H. W. L. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.06167
Time in quantum mechanics: A fresh look on quantum hydrodynamics and quantum trajectoriesPreprint
Schild, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.13033 · Cited by 1
Quantum computation for early universe cosmology
Kaufman, A., Sundy, D., & McGuigan, M. (2019) · New York Scientific Data Summit (NYSDS) · doi:10.1109/nysds.2019.8909801 · Cited by 2
Quantum feedback for measurement and controlPreprint
Martin, L. S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.09766 · Cited by 5
Higher Rank Matricial Ranges and Hybrid Quantum Error CorrectionPreprint
Kribs, D. W., Cao, N., Li, C.-K., Poon, Y., Zeng, B., & Nelson, M. I. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.12744
Quantum dimension test using the uncertainty principlePreprint
Chao, R., & Reichardt, B. W. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.12432 · Cited by 2
Efficient Qubit Routing for a Globally Connected Trapped Ion Quantum Computer
Webber, M., Herbert, S., Weidt, S., & Hensinger, W. K. (2020) · Advanced Quantum Technologies · doi:10.1002/qute.202000027 · Cited by 23
AccQOC: Accelerating Quantum Optimal Control Based Pulse GenerationPreprint
Cheng, J., Deng, H., & Qian, X. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.00376
Quantum Algorithms with Applications to Simulating Physical Systems
Chowdhury, A. C. N. (2019) · UNM’s Digital Repository (University of New Mexico)
Superconducting Parametric Oscillators for Quantum Annealing
Shirane, M., & Yamamoto, T. (2020) · Vacuum and Surface Science · doi:10.1380/vss.63.112
Reaction: Can We Grow a Quantum Processor?
Marchenkov, A. N. (2020) · Chem · doi:10.1016/j.chempr.2020.03.018
Noise Analysis of Quantum Approximate Optimization Algorithm on Weighted MAX-CUT
Priyadarshi, L., & Azad, U. (2019) · IEEE Conference on Information and Communication Technology (CICT) · doi:10.1109/cict48419.2019.9066254
Applying Bayesian Techniques to the Optimization of Parameterized Quantum Circuits
Rattew, A. G. (2020) · Open Scholarship Institutional Repository (Washington University in St. Louis) · doi:10.7936/0p21-hp84 · Cited by 1
Classical and Quantum Data Interaction in Programming Languages: A Runtime ArchitecturePreprint
Rosa, E. C. R., & de Santiago, R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.00131
Enterprise Security: Modern Challenges and Emerging Measures
Shukla, M., Tupsamudre, H., & Lodha, S. (2020) · Advances in e-business research series · doi:10.4018/978-1-7998-0108-5.ch008 · Cited by 1
Applications of the Quantum Kernel Method on a Superconducting Quantum Processor
Peters, E. (2020) · UWSpace (University of Waterloo)
Bell inequality violation on small NISQ computersPreprint
Naus, H. W. L., & Polinder, H. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.13794
Quantum comparator circuit on superconducting quantum computer
Benchasattabuse, N. (2019) · Chula Digiverse · doi:10.58837/chula.the.2019.156 · Cited by 1
Quantum Gaussian Processes for Data-Driven Design of Metamaterials
Kuś, G. (2019) · Research Repository (Delft University of Technology)
Development of Fast Quantum Algorithms
Tani, S., & Takahashi, Y. (2020) · IEICE ESS FUNDAMENTALS REVIEW · doi:10.1587/essfr.14.1_15
Singh, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.02682
Parts of Speech Tagging in NLP: Runtime Optimization with Quantum Formulation and ZX CalculusPreprint
Bishwas, A. K., Mani, A., & Palade, V. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.10328 · Cited by 1
Investigating Hammock Networks on IBM Q
Hoară, S., Beiu, R.-M., & Beiu, V. C. (2020) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-53651-0_5
Hodson, M. J., Ruck, B., Ong, H., Dulman, S., & Garvin, D. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.09505 · Cited by 1
Lin, C., Yang, G., & Wu, J. (2020) · IEEE International Conference on Artificial Intelligence and Computer Applications (ICAICA) · doi:10.1109/icaica50127.2020.9182439 · Cited by 1
Optimization of chemical reaction path via molecular geometry generation using quantum circuitsPreprint
Kanno, S. (2020) · arXiv (Cornell University)
On the Theory of Modern Quantum Algorithms.Preprint
Biamonte, J. (2020) · arXiv (Cornell University)
Bethe ansatz on a quantum computer?
Nepomechie, R. I. (2021) · Quantum Information and Computation · doi:10.26421/qic21.3-4-4 · Cited by 25
Quantum Bayesian Decision-Making
de Oliveira, M., & Barbosa, L. S. (2021) · Foundations of Science · doi:10.1007/s10699-021-09781-6 · Cited by 10
Memory-Equipped Quantum Architectures: The Power of Random Access
Baker, J. M., Schuster, D., & Chong, F. T. (2020) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1145/3410463.3414644 · Cited by 2
From Practice to Theory: The “Bright Illumination” Attack on Quantum Key Distribution Systems
Liss, R., & Mor, T. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-63000-3_7
Characterize noise correlation and enhance coherence via qubit motionPreprint
Han, J., Li, Z., Zhang, J.-N., Xu, H., Linghu, K., Li, Y., Li, C., Chen, M., Yang, Z., Wang, J., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.14052
Testing of flag-based fault-tolerance on IBM quantum devicesPreprint
Lanka, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.03224
Sensitivity to Imperfections of Analog Quantum Simulation on Atomic Qudits
Lysne, N. (2020) · UA Campus Repository (The University of Arizona)
Imperfections Lower the Simulation Cost of Quantum Computers
Tura, J. (2020) · Physics · doi:10.1103/physics.13.183
A silicon photonics processor for error-protected measurement-based quantum computing
Vigliar, C., Paesani, S., Ding, Y., Adcock, J. C., Wang, J., Morley-Short, S., Bacco, D., Oxenløwe, L. K., Thompson, M. G., Rarity, J., et al. (2020) · Frontiers in Optics · doi:10.1364/fio.2020.fth1c.3
Quantum Advantage with Timestamp MembosonsamplingPreprint
Gao, J., Wang, X., Zhou, W., Jiao, Z., Ren, R.-J., Fu, Y.-X., Qiao, L., Xu, X.-Y., Zhang, C.-N., Pang, X.-L., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.03967 · Cited by 5
Hybrid Quantum Systems with Solid State Spins in Diamond.
Lekavicius, I. (2020) · Scholars' Bank (University of Oregon)
Imagining the Future of Quantum Computing
DeBenedictis, E. P. (2020) · IFIP advances in information and communication technology · doi:10.1007/978-3-030-64246-4_6 · Cited by 4
Baranov, V. V., Malibashev, A. V., & Tsygulev, I. N. (2020) · International Multi-Conference on Industrial Engineering and Modern Technologies (FarEastCon) · doi:10.1109/fareastcon50210.2020.9271650
Relaxation times do not capture logical qubit dynamics
Pal, A. K., Schindler, P., Erhard, A., Rivas, ́., Martin-Delgado, M.-A., Blatt, R., Monz, T., & Müller, M. (2022) · Quantum · doi:10.22331/q-2022-01-24-632 · Cited by 16
QuPAA: Exploiting Parallel and Adaptive Architecture to Scale up Quantum Computing
Fu, Y., Sun, Y., & Li, T. (2020) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd50377.2020.00037
Spectral Transfer Tensor Method for Non-Markovian Noise CharacterizationPreprint
Chen, Y., Zheng, Y.-C., Zhang, S., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.10094
Quantum ComputationPreprint
Bishnoi, B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.02799 · Cited by 7
Robust Dynamical Decoupling for the Manipulation of a Spin Network via a Single SpinPreprint
Yang, X., Ge, Y., Zhang, B., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.03976
Advanced code-based electronic digital signature scheme
Кузнецов, О., Кіян, А., & Кузнецова, Т. (2020) · Computer Science and Cybersecurity · doi:10.26565/2519-2310-2020-1-05
Teleportation of the Bell States on IBM Q Computers Under Their Hardware Errors
Gerdt, V. P., & Kotkova, E. A. (2020) · Communications in computer and information science · doi:10.1007/978-3-030-66242-4_11
Quantum stochastic modelling and tensor networks
Yang, C. (2020) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/144661
Variational Quantum Eigensolvers Applied to Problems in High Energy Physics
Ferguson, R. (2021) · UWSpace (University of Waterloo) · Cited by 1
Quantum Computing and Programming
Bassoli, R., Boche, H., Deppe, C., Ferrara, R., Fitzek, F. H. P., Janßen, G., & Saeedinaeeni, S. (2020) · Foundations in signal processing, communications and networking · doi:10.1007/978-3-030-62938-0_3
Barak, B. (2021) · Nature Physics · doi:10.1038/s41567-020-01126-7
Proper Cost Hamiltonian Design for Combinatorial Optimization Problems: A Boolean Function Approach
Choi, J., Oh, S., Park, S., Kim, J., & Kim, J. (2021) · International Conference on Information Networking · doi:10.1109/icoin50884.2021.9333931 · Cited by 3
Star-topology Registers: NMR and Quantum Information PerspectivesPreprint
Mahesh, T. S., Khurana, D., Krithika, V. R., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.05203
Special-Purpose Quantum Processor DesignPreprint
Lu, B.-H., Wu, Y.-C., Kong, W., Zhou, Q., & Guo, G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.01228
A Quantum Interpretation of Bunched Logic for Quantum Separation LogicPreprint
Zhou, L., Barthe, G., Hsu, J., Ying, M., & Yu, N. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.00329 · Cited by 5
Entanglement Diagnostics for Efficient Quantum ComputationPreprint
Kim, J., & Oz, Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.12534
Zobov, V. E., & Pichkovskiy, I. S. (2019) · Siberian Journal of Physics · doi:10.25205/2541-9447-2019-14-1-5-16
Classical Computation in the Quantum World
Huang, J. (2019) · Deep Blue (University of Michigan)
Quantum Computation for Predicting Solids-state Material PropertiesPreprint
Choudhary, K. K. (2021) · arXiv (Cornell University)
A Parallel Tensor Network Contraction Algorithm and Its Applications in Quantum Computation
Zhang, F. (2020) · Deep Blue (University of Michigan) · Cited by 1
Quantum Algorithms in CyberneticsPreprint
Nikolov, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.05952 · Cited by 1
Proposal for practical multidimensional quantum networks
Bacco, D., Bulmer, J. F. F., Erhard, M., Huber, M., & Paesani, S. (2021) · Physical Review A · doi:10.1103/physreva.104.052618 · Cited by 32
Variational Quantum Algorithms for Euclidean Discrepancy and Covariate-BalancingPreprint
Lebl, J., & Shakeel, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.09090
Logical Abstractions for Noisy Variational Quantum Algorithm SimulationPreprint
Huang, Y., Holtzen, S., Millstein, T. D., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.17226
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.