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,701–6,800 of 8,640
Gaussian Boson Sampling Complexity
Tanggara, A. (2021) · ANU Open Research (Australian National University) · doi:10.25911/j9r5-e059
Modelling Markovian light-matter interactions for quantum optical devices in the solid statePreprint
Wein, S. C. (2021) · arXiv (Cornell University) · doi:10.11575/prism/38687 · Cited by 8
When to Build Quantum Software?Preprint
Misra, J., Kaulgud, V., Kaslay, R., & Podder, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.09117 · Cited by 3
A Small-Gain Theorem for Discrete-Time Convergent Systems and Its ApplicationsPreprint
Chen, J., & Nurdin, H. I. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.02376
Nelson, M. I. (2021) · The Atrium (University of Guelph) · doi:10.26421/qic19.1-2-5
Computational and Theoretical Insights into Multi-Body Quantum Systems
Stasiuk, A. (2021) · UWSpace (University of Waterloo) · Cited by 1
Resource-efficient encoding algorithm for variational bosonic quantum simulationsPreprint
Majland, M., & Zinner, N. T. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.11886 · Cited by 5
QuaSiMo: A composable library to program hybrid workflows for quantum simulation
Nguyen, T., Oftelie, L. B., Lotshaw, P. C., Lyakh, D. I., McCaskey, A., Leyton‐Ortega, V., Pooser, R. C., Elwasif, W. R., Humble, T. S., & de Jong, W. A. (2021) · IET Quantum Communication · doi:10.1049/qtc2.12024 · Cited by 7
Aspects of Quantum Information and AdS/CFT Duality
Balushi, A. A. (2021) · UWSpace (University of Waterloo)
A Quantum Approach to Neural Networks
Ansari, P. A., Shaikh, A., Shaikh, F., & Sayed, F. (2021) · International Journal of Advanced Research in Science Communication and Technology · doi:10.48175/ijarsct-1129
Lin, C., Yang, G., & Song, X. (2021) · arXiv (Cornell University)
Towards a NISQ Algorithm to Simulate Hermitian Matrix ExponentiationPreprint
Li, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.13610
EVA: a quantum Exponential Value Approximation algorithmPreprint
Alonso-Linaje, G., & Atchade-Adelomou, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.08731 · Cited by 8
Benchmarks and Controls for Optimization with Quantum Annealing
Grant, E. (2020) · Cited by 2
Li, Y., Wang, W., Fei, Y., Meng, X., Wang, H., Duan, Q.-H., & Ma, Z. (2021) · Research Square · doi:10.21203/rs.3.rs-583001/v1
Large-scale quantum hybrid solution for linear systems of equationsPreprint
Perelshtein, M. R., Pakhomchik, A. I., Melnikov, A. A., Novikov, A. A., Glatz, A., Paraoanu, G. S., Vinokur, V. M., & Lesovik, G. B. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.12770 · Cited by 12
Visualization tools: for the OpenQL compiler
van der Meer, T. (2021) · Research Repository (Delft University of Technology)
Superconductivity and Non-Classical Long-Range Order on a Quantum ComputerPreprint
Sager-Smith, L. M., & Mazziotti, D. A. (2021) · arXiv (Cornell University)
Fault-Tolerant Logical Operators in Quantum Error-Correcting Codes
Webster, P. (2021) · The Sydney eScholarship Repository (The University of Sydney)
String Comparison on a Quantum Computer Using Hamming DistancePreprint
Khan, M., & Miranskyy, A. V. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.16173 · Cited by 4
Variational Quantum Eigensolver and Its Applications
Matsuo, A. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-79837-6_2 · Cited by 1
Josephson circuits for protected quantum bits
Lu, W.-S. (2021) · doi:10.7282/t3-sc2f-xx77 · Cited by 1
MDE4QAI: Towards Model-Driven Engineering for Quantum Artificial IntelligencePreprint
Moin, A., Challenger, M., Badii, A., & Günnemann, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.06708 · Cited by 14
Quantum generative models for data generation
Sun, T., Wu, Y.-C., & Guo, G. (2021) · Acta Physica Sinica · doi:10.7498/aps.70.20210930 · Cited by 2
A Quantum Convolutional Neural Network for Image ClassificationPreprint
Lü, Y., Gao, Q. Z., Lü, J., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.03630
Puchała, Z., Korzekwa, K., Salazar, R., Horodecki, P., & Życzkowski, K. (2021) · Physical Review A · doi:10.1103/physreva.104.052611 · Cited by 19
Fast suppression of classification error in variational quantum circuitsPreprint
Zhang, B., & Zhuang, Q. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.08026
Advantages and learning for quantum modelling
Liu, Q. (2021) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/152073
Clustering and enhanced classification using a hybrid quantum autoencoder
Srikumar, M., Hill, C. D., & Hollenberg, L. C. L. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac3c53 · Cited by 38
Conclusion and Research Direction
Sapv, T., Bera, D., Maitra, A., & Maitra, S. (2021) · SpringerBriefs in computer science · doi:10.1007/978-981-16-3061-3_5
Dou, T., Zhou, Z., Wang, K., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.08171
Sugisaki, K., Kato, T., Minato, Y., Okuwaki, K., & Mochizuki, Y. (2021) · doi:10.33774/chemrxiv-2021-w7n78
Quantum State Tomography as a Bilevel Problem, Utilizing I-Q Plane DataPreprint
Korpas, G., & Mareček, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.03448
Experimental verification of group non-membership in optical circuits
Sun, K., Zhang, Z., Meng, F., Cheng, B., Cao, Z., Xu, J., Yung, M., Li, C., & Guo, G. (2021) · Photonics Research · doi:10.1364/prj.427897
Single photon detection and manipulation in photonic integrated circuits
Yanikgonul, S. (2021) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/151499
Seetharam, K., & DeMarco, M. (2021) · MIT Science Policy Review · doi:10.38105/spr.lcbqc1igt5
Cao, X. (2021) · D-Scholarship@Pitt (University of Pittsburgh) · Cited by 2
Comment on the Quantum Supremacy Claim by GooglePreprint
Reddy, A., Perez-García, B., da Silva, A. J., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.13862
Leveraging Quantum State Information for Dynamic Assertions and Static Compiler Optimizations.
Liu, J. (2021) · NCSU Libraries Repository (North Carolina State University Libraries)
The Effect of Noise on the Performance of Variational Algorithms for Quantum Chemistry
Saib, W., Wallden, P., & Akhalwaya, I. Y. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00020 · Cited by 19
QSSA: an SSA-based IR for Quantum computing
Peduri, A., Bhat, S., & Grosser, T. (2022) · ACM SIGPLAN International Conference on Compiler Construction (CC) · doi:10.1145/3497776.3517772 · Cited by 10
Observation of a symmetry-protected topological time crystal with superconducting qubitsPreprint
Zhang, X., Jiang, W., Deng, J., Wang, K., Chen, J., Zhang, P., Ren, W., Dong, H., Xu, S., Gao, Y. Q., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.05577 · Cited by 6
Applications of Entanglement and Nonlocality
Gangopadhyay, S. (2021) · UWSpace (University of Waterloo)
A loop Quantum Approximate Optimization Algorithm with Hamiltonian updatingPreprint
Duan, F.-G., & Zhang, D.-B. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.11350
Quantum Circuit OscillatorPreprint
Delgado, A. (2021) · doi:10.36227/techrxiv.16566717.v1
Shallow Trotter circuits fulfil error-resilient quantum simulation of imaginary timePreprint
Huo, M., & Li, Y. (2021) · arXiv (Cornell University)
Blank, C., & Petruccione, F. (2021) · Digitale Welt · doi:10.1007/s42354-021-0403-z
Feasible Architecture for Quantum Fully Convolutional NetworksPreprint
Chen, Y., Hu, W., & Li, X. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.01771 · Cited by 3
Low-Depth Unitary Coupled Cluster Theory for Quantum ComputationPreprint
Chen, J., Cheng, H., & Freericks, J. K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.14134
Investigating the Use of Machine Learning Techniques in a Random Physical System
Stamatiou, G. T., & Magoutis, K. (2021) · Communications in computer and information science · doi:10.1007/978-3-030-87568-8_7
Classifying quantum circuits with qubit functional configurations.Preprint
Hu, Z., & Kais, S. (2021) · arXiv (Cornell University)
Gustafson, E., Holzman, B., Kowalkowski, J., Lamm, H., Li, A. C. Y., Perdue, G., Boixo, S., Isakov, S. V., Martin, O., Thomson, R., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.07482 · Cited by 23
Provable quantum computational advantage with the cyclic cluster statePreprint
Daniel, A. K., Zhu, Y., Alderete, C. H., Buchemmavari, V., Green, A., Nguyen, N. H., Thurtell, T. G., Zhao, A., Linke, N. M., & Miyake, A. (2021) · arXiv (Cornell University)
Partial orbits of quantum gates and full three-particle entanglement
Holik, F., Losada, M., Freytes, H., Plastino, A. R., & Sergioli, G. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03261-3
Learning quantum dynamics with latent neural ODEsPreprint
Choi, M. S. S., Flam-Shepherd, D., Kyaw, T. H., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.10721
Cybersecurity for Quantum ComputingPreprint
Kilber, N., Kaestle, D., & Wagner, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.14701 · Cited by 31
Gocho, S., Nakamura, H., Kanno, S., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.14448
Quantum Circuits in Additive Hilbert SpacePreprint
Mondada, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.01211 · Cited by 1
Gentini, L., Cuccoli, A., & Banchi, L. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.034025 · Cited by 1
Hybrid Quantum-Classical Neural Networks for Text ClassificationPreprint
Baronia, D. (2021) · doi:10.36227/techrxiv.13488420.v1 · Cited by 4
Optimized fermionic SWAP networks with equivalent circuit averaging for QAOAPreprint
Hashim, A., Rines, R., Omole, V., Naik, R., Kreikebaum, J. M., Santiago, D., Chong, F. T., Siddiqi, I. A., & Gokhale, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.04572 · Cited by 1
Chemistry beyond the Hartree-Fock limit via quantum computed momentsPreprint
Jones, M. A., Vallury, H. J., Hill, C. D., & Hollenberg, L. C. L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.08132
Noise-Tolerant Object Ranging with a Time- and Polarization-Correlated Photon Pair SourcePreprint
Kuniyil, H., Ozel, H., Yılmaz, H., et al. (2021) · arXiv (Cornell University)
Quantum Model-DiscoveryPreprint
Heim, N., Ghosh, A., Kyriienko, O., & Elfving, V. E. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.06376 · Cited by 25
Alternative Paradigms of ComputationPreprint
Gasarch, W. I., Hayes, N., Kaplitz, E., & Regli, W. C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.08916 · Cited by 1
Quantum Heaviside Eigen SolverPreprint
Sun, Z.-Z., & Su, G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.08288
Building scalable variational circuit training for machine learning tasks
Hamilton, K. E., Lynn, E., Kharazi, T., Morris, T., Bennink, R. S., & Pooser, R. C. (2021) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18074.2021.9586171
QECV: Quantum Error Correction VerificationPreprint
Wu, A., Li, G., Zhang, H., Guerreschi, G. G., Xie, Y., & Ding, Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.13728 · Cited by 21
Drori, J. C., Yordanov, Y. S., Ferrus, T., Applegate, M. J., & Barnes, C. H. W. (2021) · Physical Review A · doi:10.1103/physreva.104.052619 · Cited by 1
Observing many-body entanglement and topology through measurement-induced modes.Preprint
Pöyhönen, K., Moghaddam, A. G., & Ojanen, T. (2021) · arXiv (Cornell University)
Benchmarking Small-Scale Quantum Devices on Computing Graph Edit DistancePreprint
Incudini, M., Tarocco, F., Mengoni, R., Pierro, A. D., & Mandarino, A. (2021) · arXiv (Cornell University)
An Architecture for Meeting Quality-of-Service Requirements in Multi-User Quantum NetworksPreprint
Skrzypczyk, M., & Wehner, S. (2021) · arXiv (Cornell University) · doi:10.34894/5eogaf · Cited by 32
Hartung, T., Funcke, L., Jansen, K., Kühn, S., Schneider, M., & Stornati, P. (2022) · International Symposium on Lattice Field Theory (LATTICE) · doi:10.22323/1.396.0575 · Cited by 2
Quantum Computing for Dealing with Inaccurate Knowledge using the Certainty Factors ModelPreprint
Moret‐Bonillo, V., Magaz-Romero, S., & Mosqueira-Rey, E. (2021) · Preprints.org · doi:10.20944/preprints202112.0240.v1
An improved recipe for error detection
Kjærgaard, M. (2021) · Nature Physics · doi:10.1038/s41567-021-01450-6
Quantum inference protocol : from origination to application
Ho, M. (2021) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/153399
Compare the Similarity between Two Quantum ImagesPreprint
Liu, Y., Qi, Z.-D., & Liu, Q. (2021) · Research Square · doi:10.21203/rs.3.rs-1187866/v1
Report on scipost_202106_00008v2
Borle, A., Elfving, V. E., & Lomonaco, S. J. (2021) · SciPost Physics Core · doi:10.21468/scipost.report.3619
Quantum Computing for Designing Behavioural Model and Quantum Machine Learning on a Humanoid Robot
Viertel, J., & Aburaia, M. (2021) · Annals of DAAAM for ... & proceedings of the ... International DAAAM Symposium · doi:10.2507/32nd.daaam.proceedings.085
Report on scipost_202104_00033v1
Witteveen, F., & Walter, M. (2021) · SciPost Physics · doi:10.21468/scipost.report.2891
Jornada de Atualização em Informática 2019
de Publicações, D., Rosário, D., Mota, M., Silva, M., Musse, S. R., Kon, F., Portugal, R., Marquezino, F., Fazenda, Á., Stringhini, D., et al. (2019) · doi:10.5753/sbc.471.7
The Quantum Computer – A Future Subject of Media Studies?Preprint
Ernst, C., Schröter, J., & Warnke, M. (2021) · MediArXiv (OSF Preprints) · doi:10.33767/osf.io/9frgd
Alba, V. (2021) · SciPost Physics · doi:10.21468/scipost.report.3057
A Variational Quantum Algorithm for Ordered SVD
Ryu, J.-Y., Jung, J., Lee, J.-Y., Gwon, Y., & Rhee, J. K. (2021) · Globecom · doi:10.1109/globecom46510.2021.9685404
Quantum Circuit OscillatorPreprint
Delgado, A. (2021) · doi:10.36227/techrxiv.16566717
2D Nearest Neighbor Optimization Method Based on Constrained Programming
Zhou, L., Guo, B., & Lin, C. (2021) · International Conference on Computer, Internet of Things and Control Engineering (CITCE) · doi:10.1109/citce54390.2021.00012
Vitale, V., Elben, A., Kueng, R., et al. (2022) · SciPost Physics · doi:10.21468/scipost.report.4315
Vitale, V., Elben, A., Kueng, R., et al. (2022) · SciPost Physics · doi:10.21468/scipost.report.4497
Murta, B., & Fernández-Rossier, J. (2022) · Physical review. E · doi:10.1103/physreve.105.l062101 · Cited by 6
Quantum thermodynamic methods to purify a qubit on a quantum processing unit
Solfanelli, A., Santini, A., & Campisi, M. (2022) · AVS Quantum Science · doi:10.1116/5.0091121
Stancil, D. D., & Byrd, G. T. (2022) · Wiley eBooks · doi:10.1002/9781119750758.biblio
VAQEM: A Variational Approach to Quantum Error Mitigation
Ravi, G. S., Smith, K. N., Gokhale, P., Mari, A., Earnest, N., Javadi-Abhari, A., & Chong, F. T. (2022) · Unicam Scientific Publications (University of Camerino) · doi:10.1109/hpca53966.2022.00029 · Cited by 49
Spin-photon interfaces in diamond and SIC systems
Mu, Z. (2022) · DR-NTU (Nanyang Technological University) · doi:10.32657/10356/156199
Witteveen, F., & Walter, M. (2020) · SciPost Physics · doi:10.21468/scipost.report.2277
Report on scipost_202106_00008v1
Borle, A., Elfving, V. E., & Lomonaco, S. J. (2021) · SciPost Physics Core · doi:10.21468/scipost.report.3307
Goerz, M. H., Basilewitsch, D., Gago-Encinas, F., et al. (2019) · SciPost Physics · doi:10.21468/scipost.report.1237
Strathearn, A. (2020) · Springer theses · doi:10.1007/978-3-030-54975-6_1
Ho, W. W., & Hsieh, T. H. (2019) · SciPost Physics · doi:10.21468/scipost.report.804
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.