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,501–6,600 of 8,640
Simulation and randomized measurement of topological phase on a trapped-ion quantum computer
Ahn, C.-E., & Cho, G. Y. (2022) · Journal of the Korean Physical Society · doi:10.1007/s40042-022-00536-5 · Cited by 1
Compiling Single Round QCCP-X Quantum Circuits by Genetic Algorithm
Arufe, L., Rasconi, R., Oddi, A., et al. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-06527-9_9 · Cited by 1
Local Stochastic Factored Gradient Descent for Distributed Quantum State Tomography
Kim, J. L., Toghani, M. T., Uribe, C. A., & Kyrillidis, A. (2022) · IEEE Control Systems Letters · doi:10.1109/lcsys.2022.3186693 · Cited by 5
Learning Based Hardware-Centric Quantum Circuit Generation
Schalkers, M. A., & Möller, M. (2022) · Communications in computer and information science · doi:10.1007/978-3-031-06668-9_22 · Cited by 1
High Quality Quasinormal Modes of Phononic Crystals for Quantum Acoustodynamics
Bolgar, A. N., Sanduleanu, S. V., Strelnikov, A. S., et al. (2022) · Journal of Low Temperature Physics · doi:10.1007/s10909-022-02871-0 · Cited by 1
Extraktion und Analyse von Schlüsselwörtern in einer Literaturrecherche zu Quantum Computing
Copurkuyu, M., & Barton, T. (2022) · doi:10.30844/akwi_2022_16 · Cited by 1
Research progress of integrated optical quantum computing
Zhou, W., Wang, Y., Weng, W.-K., & Jin, X. (2022) · Acta Physica Sinica · doi:10.7498/aps.71.20221782 · Cited by 3
Challenges and opportunities of quantum-computational chemistry
Li, Z., Liu, J., Shen, X., & Gao, F. (2022) · Scientia Sinica Chimica · doi:10.1360/ssc-2022-0222 · Cited by 1
Adaptive stabilization of quantum circuits executed on unstable devices
Dasgupta, S., & Humble, T. S. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00102 · Cited by 1
Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry
Gowrishankar, M., Wright, J., Claudino, D., Lotshaw, P. C., Nguyen, T., McCaskey, A., & Humble, T. S. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00128 · Cited by 2
Circuit connectivity boosts by quantum-classical-quantum interfaces
Wiersema, R., Guerini, L., Carrasquilla, J., & Aolita, L. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043221 · Cited by 6
Code-Based Cryptography: A Comparative Study of Key Sizes
Singh, M. K. (2023) · Communications in computer and information science · doi:10.1007/978-3-031-25088-0_32 · Cited by 2
(2021) · NTT technical review · doi:10.53829/ntr202105fa4 · Cited by 1
Time versus Hardware: Reducing Qubit Counts with a (Surface Code) Data BusPreprint
Herr, D., Paler, A., Devitt, S. J., & Nori, F. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.08117 · Cited by 7
Knuth-Bendix Completion Algorithm and Shuffle Algebras For Compiling NISQ CircuitsPreprint
Dridi, R., Alghassi, H., & TAYUR, S. R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.00129 · Cited by 1
Really Small Shoe Boxes - On Realistic Quantum Resource EstimationPreprint
Paler, A., Herr, D., & Devitt, S. J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.08104 · Cited by 1
Towards a Pattern Language for Quantum AlgorithmsPreprint
Leymann, F. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.03082 · Cited by 4
Machine Learning Kernel Method from a Quantum Generative ModelPreprint
Sadowski, P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.05103 · Cited by 2
Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic SynthesisPreprint
Jiang, J., Sun, X., Teng, S., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.05087 · Cited by 1
Quantum Error Correction: Decoders for the Toric Code
Leijenhorst, N. (2019) · Research Repository (Delft University of Technology) · Cited by 1
Fairness evaluation during the conceptual design of heat grids with quantum annealersPreprint
Loh, K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.09929 · Cited by 1
Reducing computations in quantum walk algorithmsPreprint
Shakeel, A. (2019) · arXiv (Cornell University) · Cited by 1
Singh, S., Alderete, C. H., Balu, R., Monroe, C. R., Linke, N. M., & Chandrashekar, C. M. (2020) · arXiv (Cornell University) · Cited by 2
State conversion and resource measures in general quantum resource theoriesPreprint
Kuroiwa, K., & Yamasaki, H. (2020) · arXiv (Cornell University) · Cited by 1
Quantum-Assisted Graph Clustering and Quadratic Unconstrained D-ary OptimisationPreprint
Pramanik, S., & Chandra, M. G. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.02608 · Cited by 9
Practical numerical integration on NISQ devicesPreprint
Yu, K., Lim, H., & Rao, P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.05739 · Cited by 1
Gabor, T., Sünkel, L., Ritz, F., Phan, T., Belzner, L., Roch, C., Feld, S., & Linnhoff–Popien, C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.14035 · Cited by 4
Xia, R., & Kais, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.08451 · Cited by 1
Tangible Reduction of Sample Complexity with Large Classical Samples and Small Quantum SystemPreprint
Song, W., Wieśniak, M., Liu, N., Pawłowski, M., Lee, J., Kim, J., & Bang, J. (2019) · arXiv (Cornell University) · Cited by 1
Efficient 2D Tensor Network Simulation of Quantum SystemsPreprint
Pang, Y., Hao, T., Dugad, A., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.15234 · Cited by 1
Two-Dimensional Quantum Walk of Correlated Photons
Jiao, Z.-Q., Gao, J., Zhou, W.-H., Wang, X.-W., Ren, R.-J., Xu, X.-Y., Qiao, L.-F., & Jin, X.-M. (2020) · arXiv · doi:10.48550/arxiv.2007.06554
Basani, J. R., & Bhattacherjee, A. B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.10927 · Cited by 1
Graphical Calculi and their Conjecture SynthesisPreprint
Miller-Bakewell, H. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.03914 · Cited by 1
Improving the Quantum Approximate Optimization Algorithm with postselectionPreprint
Boulebnane, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.05425 · Cited by 3
Laplacian Eigenmaps with variational circuits: a quantum embedding of graph dataPreprint
Thabet, S., & Hullo, J.-F. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.05128 · Cited by 6
Sampling and the complexity of nature
Hangleiter, D. (2020) · arXiv (Cornell University) · doi:10.17169/refubium-28790 · Cited by 10
Quantum Amplitude ArithmeticPreprint
Wang, S., Wang, Z., Cui, G., Fan, L., Shi, S., Shang, R., Li, W., Wei, Z., & Gu, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.11056 · Cited by 4
Design and application of high-speed and high-precision CV gate on IBM Q OpenPulse system.Preprint
Oomura, S., Satoh, T., Sugawara, M., & Yamamoto, N. (2021) · arXiv (Cornell University) · Cited by 2
DisQ: A Novel Quantum Output State Classification Method on IBM Quantum Computers using OpenPulsePreprint
Patel, T., & Tiwari, D. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.01153 · Cited by 6
Sampling electronic structure QUBOs with Ocean and Mukai solversPreprint
Teplukhin, A., Kendrick, B. K., Mniszewski, S. M., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.01225 · Cited by 1
A Parameterised Quantum Circuit Approach to Point Set Matching.Preprint
Noormandipour, M., & Wang, H. (2021) · arXiv (Cornell University) · Cited by 1
A Noise-Aware Qubit Mapping Algorithm Evaluated via Qubit Interaction-Graph CriteriaPreprint
Steinberg, M., Feld, S., Almudéver, C. G., Marthaler, M., & Reiner, J.-M. (2021) · arXiv (Cornell University) · Cited by 1
Maritime Just-in-time navigation with Quantum algorithmsPreprint
Imrecke, M., Klos, F., Mergenthaler, W., Nowak, M., & Wueschner, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.07978 · Cited by 4
Error Mitigation in Quantum Computers through Instruction SchedulingPreprint
Smith, K. N., Ravi, G. S., Murali, P., Baker, J. M., Earnest, N., Javadi-Abhari, A., & Chong, F. T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.01760 · Cited by 11
Quantum Advantage with Shallow Circuits Under Arbitrary Corruption
Hasegawa, A., & Gall, F. L. (2021) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.48550/arxiv.2105.00603 · Cited by 5
Quantum Simulations of the Non-Unitary Time Evolution and Applications to Neutral-Kaon OscillationsPreprint
Chen, Y., Ma, Y., & Zhou, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.04765 · Cited by 4
The quantum condition spacePreprint
Hu, Z., & Kais, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.05713 · Cited by 1
Quantum Alphatron.Preprint
Rebentrost, P., Sántha, M., & Yang, S. (2021) · arXiv (Cornell University) · Cited by 1
Zhang, M., Xie, L., Zhang, Z., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.08671 · Cited by 1
Machine learning for quantum physics and quantum physics for machine learning
Huembeli, P. (2021) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-348901 · Cited by 1
Insights from an adaptive variational wave function study of the Fermi-Hubbard ModelPreprint
Gyawali, G., & Lawler, M. J. (2021) · arXiv (Cornell University) · Cited by 1
Nuwa: A Quantum Circuit Transpiler Based on a Finite-Horizon Heuristic for Placement and RoutingPreprint
Ren, S., Chen, K., Ghadermarzy, N., Nguyen, B., Huang, Y., & Ronagh, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.00592 · Cited by 3
Kawaguchi, H. (2022) · Research Square · doi:10.21203/rs.3.rs-1264829/v1 · Cited by 1
Error mitigation in variational quantum eigensolvers using probabilistic machine learningPreprint
Rogers, J., Bhattacharyya, G., Frank, M. S., Jiang, T., Ove Christiansen, A., Yao, Y., & Lanatà, N. (2021) · arXiv (Cornell University) · Cited by 1
Optimization of Quantum Algorithm Protocols without Barren PlateausPreprint
Broers, L., & Mathey, L. (2021) · arXiv (Cornell University) · Cited by 2
Unsupervised Learning of Symmetry Protected Topological Phase TransitionsPreprint
Kuo, E.-J., & Dehghani, H. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.08747 · Cited by 1
Limitations of Local Quantum Algorithms on Maximum Cuts of Sparse Hypergraphs and Beyond.Preprint
Chou, C.-N., Love, P. J., Sandhu, J. S., & Jonathan Jingsheng, S. H. I. (2021) · arXiv (Cornell University) · Cited by 1
Matrix-Completion Quantum State TomographyPreprint
Farooq, A., Rehman, J. U., & Shin, H. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.11071 · Cited by 1
Performance of Grover's search algorithm with diagonalizable collective noisesPreprint
Pan, M., Xiong, T., & Zheng, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.12219 · Cited by 1
Moussa, C., Wang, H., Bäck, T., et al. (2022) · Research Square · doi:10.21203/rs.3.rs-1407056/v1 · Cited by 1
Psitrum: An Open Source Simulator for Universal Quantum ComputersPreprint
Alghadeer, M., Aldawsari, E., Selvarajan, R., Al-Utaibi, K. A., Kais, S., & Alharbi, F. H. (2022) · Research Square · doi:10.21203/rs.3.rs-1483765/v1 · Cited by 1
Policy Gradients using Variational Quantum CircuitsPreprint
Sequeira, A., Santos, L. P., & Barbosa, L. S. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2203.10591 · Cited by 2
Barima, O. (2020) · doi:10.36227/techrxiv.13377674 · Cited by 1
Hybrid Quantum-Classical Neural Networks for Text ClassificationPreprint
Baronia, D. (2021) · doi:10.36227/techrxiv.13488420 · Cited by 1
HARNESSING OPTOMECHANICAL INTERACTIONS: FROM TRAPPING ORGANISMS TO ENTANGLING NANOSPHERES
Brandão, I. (2021) · doi:10.17771/pucrio.acad.53441 · Cited by 1
Quantum Approach to Satellite Image Data Compression and AnalysisPreprint
Majji, S. R., Chalumuri, A., & Manoj, B. S. B. S. (2022) · doi:10.36227/techrxiv.21397227 · Cited by 1
On quantum computing and geometry optimizationPreprint
Malik, A. J., & Verma, C. S. (2023) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2023.03.16.532929 · Cited by 2
PyQBench: a Python library for benchmarking gate-based quantum computersPreprint
Jałowiecki, K., Lewandowska, P., & Pawela, Ł. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2304.00045 · Cited by 1
Improving Quantum-to-Classical Data Decoding using Optimized Quantum Wavelet TransformPreprint
Jeng, M., Islam, I., Levy, D., et al. (2023) · Research Square · doi:10.21203/rs.3.rs-2763569/v1 · Cited by 1
Revolutionizing Computing: A Comprehensive Introduction to Quantum ComputingPreprint
Jerbi, D. (2023) · doi:10.36227/techrxiv.22710361 · Cited by 1
Realization of Multi-Valued Logic Using Optical Quantum Computing
Choe, S. (2023) · PDXScholar (Portland State University) · doi:10.15760/etd.8192 · Cited by 1
Ramouthar, R., & Şeker, H. (2023) · doi:10.14293/pr2199.000251.v1 · Cited by 2
From Quantum Computing to Quantum-inspired Computation for Neuromorphic Advancement – A SurveyPreprint
Jha, R. K. (2023) · doi:10.36227/techrxiv.24053250 · Cited by 7
Micro- and Nanoelectronics - 2023
(2023) · LCC MAKS Press eBooks · doi:10.29003/m3563.icmne-2023 · Cited by 2
Formalization of Quantum Intermediate Representations for Code SafetyPreprint
Luo, J., & Zhao, J. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4598726 · Cited by 1
Efficient preparation of the AKLT State with Measurement-based Imaginary Time EvolutionPreprint
Chen, T., & Byrnes, T. (2023) · Research Square · doi:10.21203/rs.3.rs-3453292/v1 · Cited by 1
Omnisolver: An extensible interface to Ising spin–glass and QUBO solvers
Jałowiecki, K., & Pawela, Ł. (2023) · SoftwareX · doi:10.1016/j.softx.2023.101559 · Cited by 4
A meta-trained generator for quantum architecture searchPreprint
He, Z., Chen, C., Situ, H., et al. (2024) · Research Square · doi:10.21203/rs.3.rs-3798393/v1 · Cited by 1
Bopardikar, S., Montoya, M., Decoodt, P., Pulido, J. G. L., & Sierra-Sosa, D. (2024) · Research Square · doi:10.21203/rs.3.rs-3922115/v1 · Cited by 1
Information Processing at The Speed of LightPreprint
AbuGhanem, M. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4748781 · Cited by 1
Discrete Optimization: A Quantum Revolution?Preprint
Creemers, S., & Armas, L. F. P. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4769749 · Cited by 1
Hybrid genetic optimisation for quantum feature map design.
Pellow-Jarman, R. (2024) · ResearchSpace (University of KwaZulu-Natal) · doi:10.29086/10413/22903
Revolutionizing Quantum Computing: Essence-Units and Energy States as Fundamental Programming UnitsPreprint
Rybalov, A., & Naich, M. (2024) · Preprints.org · doi:10.20944/preprints202405.0633.v1 · Cited by 1
Barren Plateaus Induced by the Dimension of QuditsPreprint
Friedrich, L., Farias, T. D. S., & Maziero, J. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4834601 · Cited by 1
EP-PQM: Efficient parametric Probabilistic Quantum Memory With Fewer Qubits and Gates
Khan, M. (2024) · doi:10.32920/26052517 · Cited by 1
Arukala, H. (2024) · ISU Red - Research and eData (Illinois State University) · doi:10.30707/etd2024.20240618063947766023.999996 · Cited by 2
Enabling Large-Scale and High-Precision Fluid Simulations on Near-Term Quantum ComputersPreprint
Chen, Z., Ma, T.-Y., Ye, C.-C., et al. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4870898 · Cited by 1
The Hyper-Torus Universe Model—A New Paradigm for Understanding RealityPreprint
McCammon, C. R. (2024) · Preprints.org · doi:10.20944/preprints202406.0674.v2
Quantum Computation Approach for Nanotechnology‐Based Targeted Drug Delivery Systems
Ojha, S., Mishra, S., Anand, A., Singh, A., & Gupta, P. (2024) · Wiley eBooks · doi:10.1002/9781394159338.ch6 · Cited by 3
Rybalov, A., & Naich, M. (2024) · Preprints.org · doi:10.20944/preprints202405.0633.v2
Enhancing Quantum Machine Learning Performance via Transfer Learning TechniquesPreprint
Zeynali, A., & Bakhshi, Z. (2024) · Research Square · doi:10.21203/rs.3.rs-4773157/v1 · Cited by 1
Modern Approaches and Implications Toward Industry 4.0
Shukla, B. K., Tripathi, A., Bharti, G., Parashar, B., Bhardwaj, N., Gupta, A., & Verma, S. (2024) · Wiley eBooks · doi:10.1002/9781394242641.ch8 · Cited by 4
Classical-Quantum Hybrid Models
Terno, D. R. (2024) · Elsevier eBooks · doi:10.1016/b978-0-323-95703-8.00105-1 · Cited by 15
Mayukha, S., & Vadivel, R. (2025) · Wiley eBooks · doi:10.1002/9781394242399.ch13 · Cited by 1
Unsupervised Quantum Anomaly Detection on Noisy Quantum ProcessorsPreprint
Pranjić, D., Kunst, P., Knäble, F., Kutzias, D., Klau, D., Tutschku, C., Simon, L., Kraus, M., & Abedi, A. (2025) · Research Square · doi:10.21203/rs.3.rs-6303530/v1 · Cited by 2
Integrating Quantum Computing with AI: A Perspective on Time Series ForecastingPreprint
Chou, Y.-C. (2025) · Qeios · doi:10.32388/itvfhf.3 · Cited by 1
Lantyer, V. H. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5218548 · Cited by 2
Ngaihlian, D. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5252534 · Cited by 3
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.