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 1,901–2,000 of 8,640
Dynamics of entangled networks of the quantum Internet
Gyöngyösi, L. (2020) · Scientific Reports · doi:10.1038/s41598-020-68498-x · Cited by 24
Comparison of quantum-walk implementations on noisy intermediate-scale quantum computers
Γεωργόπουλος, Κ., Emary, C., & Zuliani, P. (2021) · Physical Review A · doi:10.1103/physreva.103.022408 · Cited by 28
Benchmarking Quantum Annealing Against “Hard” Instances of the Bipartite Matching Problem
Vert, D., Sirdey, R., & Louise, S. (2021) · SN Computer Science · doi:10.1007/s42979-021-00483-1 · Cited by 33
Quantum supremacy and random circuits
Movassagh, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.06210 · Cited by 23
QuGAN: A Generative Adversarial Network Through Quantum StatesPreprint
Stein, S. A., Baheri, B., Chen, D., Mao, Y., Guan, Q., Li, A., Fang, B., & Xu, S. (2020) · arXiv (Cornell University) · Cited by 26
Experimental Quantum Embedding for Machine Learning
Gianani, I., Mastroserio, I., Buffoni, L., Bruno, N., Donati, L., Cimini, V., Barbieri, M., Cataliotti, F. S., & Caruso, F. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202100140 · Cited by 23
Decision Diagrams for Quantum Computing
Wille, R., Hillmich, S., & Burgholzer, L. (2022) · Springer eBooks · doi:10.1007/978-3-031-15699-1_1 · Cited by 39
Kanno, K., Kohda, M., Imai, R., Koh, S., Mitarai, K., Mizukami, W., & Nakagawa, Y. O. (2026) · Physical Review Research · doi:10.1103/dmn4-snfx · Cited by 207
Machine learning assisted construction of a shallow depth dynamic ansatz for noisy quantum hardware
Halder, S., Dey, A., Shrikhande, C., & Maitra, R. (2024) · Chemical Science · doi:10.1039/d3sc05807g · Cited by 29
Hilbert Space Delocalization under Random Unitary Circuits
Turkeshi, X., & Sierant, P. (2024) · Entropy · doi:10.3390/e26060471 · Cited by 39
A hybrid framework for estimating nonlinear functions of quantum states
Zhou, Y., & Liu, Z. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00846-5 · Cited by 57
Quantum computing of reacting flows via Hamiltonian simulation
Zhen Hua, L. U., & Yang, Y. (2024) · Proceedings of the Combustion Institute · doi:10.1016/j.proci.2024.105440 · Cited by 39
Quantum-Enhanced Support Vector Machine for Large-Scale Multi-class Stellar Classification
Chen, K., Xu, X., Makhanov, H., Chung, H.-H., & Liu, C.-Y. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-5609-4_12 · Cited by 35
Xiao, Y., Yang, L., Shu, C., Chew, S. C., Khoo, B. C., Cui, Y., & Liu, Y. Y. (2024) · Physics of Fluids · doi:10.1063/5.0226232 · Cited by 38
Schwerdt, D., Peleg, L., Shapira, Y., Priel, N., Florshaim, Y., Gross, A., Zalic, A., Afek, G., Akerman, N., Stern, A., et al. (2024) · Physical Review X · doi:10.1103/physrevx.14.041017 · Cited by 47
Testing and Debugging Quantum Programs: The Road to 2030
Ramalho, N. C. L., de Souza, H. A., & Chaim, M. L. (2025) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3715106 · Cited by 69
Entanglement-Controlled Quantum Federated Learning
Park, S., Lee, H., Jung, S., Park, J., Bennis, M., & Kim, J. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3540103 · Cited by 28
Chen, K., Li, T.-Y., Wang, Y.-Y., See, S. C. W., Wang, C., Wille, R., Chen, N.-Y., Yang, A.-C., & Lin, C.-Y. (2025) · Machine Learning Science and Technology · doi:10.1088/2632-2153/adb4ba · Cited by 50
Efficient Magic State Distillation by Zero-Level Distillation
(2025) · doi:10.1103/thxx-njr6 · Cited by 22
Topology-driven quantum architecture search framework
Su, J., Fan, J., Wu, S., Li, G., Qin, S., & Gao, F. (2025) · Science China Information Sciences · doi:10.1007/s11432-024-4486-x · Cited by 39
Ballester, R., Cerquides, J., & Artiles, L. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00292-2 · Cited by 45
Equivalence Checking of Sequential Quantum Circuits
Wang, Q., Li, R., & Ying, M. (2021) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2021.3117506 · Cited by 26
Variationally scheduled quantum simulation
Matsuura, S., Buck, S., Senicourt, V., & Zaribafiyan, A. (2021) · Physical Review A · doi:10.1103/physreva.103.052435 · Cited by 30
Quantum inverse iteration algorithm for programmable quantum simulators
Kyriienko, O. (2025) · Figshare · Cited by 27
TSV-integrated surface electrode ion trap for scalable quantum information processing
Zhao, P., Likforman, J. P., Li, H. Y., Tao, J., Henner, T., Lim, Y. D., Seit, W. W., Tan, C. S., & Guidoni, L. (2021) · Applied Physics Letters · doi:10.1063/5.0042531 · Cited by 31
Quantum DevOps: Towards Reliable and Applicable NISQ Quantum Computing
Gheorghe-Pop, I.-D., Tcholtchev, N., Ritter, T., & Hauswirth, M. (2020) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/gcwkshps50303.2020.9367411 · Cited by 46
On Double Full-Stack Communication-Enabled Architectures for Multicore Quantum Computers
Rodrigo, S., Abadal, S., Alarcón, E., Bandić, M., van Someren, H., & Almudéver, C. G. (2021) · IEEE Micro · doi:10.1109/mm.2021.3092706 · Cited by 32
Achieving fault tolerance against amplitude-damping noise
Jayashankar, A., My, L. D. H., Ng, H. K., & Mandayam, P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023034 · Cited by 27
Quantum circuit engineering for correcting coherent noise
Ahsan, M., Naqvi, S. A. Z., & Anwer, H. (2022) · Physical Review A · doi:10.1103/physreva.105.022428 · Cited by 22
“Noise cancellation adds to the repertoire of schemes designed to counter errors in Near Term Noisy Intermediate Scale Quantum (NISQ) computers [37].”
BackgroundRepresentation of binary classification trees with binary features by quantum circuits
Heese, R., Bickert, P., & Niederle, A. E. (2022) · Quantum · doi:10.22331/q-2022-03-30-676 · Cited by 24
Towards a variational Jordan–Lee–Preskill quantum algorithm
Liu, J., Li, Z., Zheng, H., Yuan, X., & Sun, J. (2022) · Machine Learning Science and Technology · doi:10.1088/2632-2153/aca06b · Cited by 39
A Quantum Convolutional Neural Network for Image Classification
Lü, Y., Gao, Q. Z., Lü, J., OGORZAŁEK, M. J., & Zheng, J. Y. (2021) · Chinese Control Conference (CCC) · doi:10.23919/ccc52363.2021.9550027 · Cited by 38
Cryogenic Characterization and Modeling of 14 nm Bulk FinFET Technology
Chabane, A., Prathapan, M., Müeller, P. R., et al. (2021) · Proceedings of ESSCIRC · doi:10.1109/esscirc53450.2021.9567802 · Cited by 22
Experimental Bayesian Calibration of Trapped-Ion Entangling Operations
Gerster, L., Martínez-García, F., Hrmo, P., van Mourik, M. W., Wilhelm, B., Vodola, D., Müller, M., Blatt, R., Schindler, P., & Monz, T. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020350 · Cited by 33
Chemistry beyond the Hartree–Fock energy via quantum computed moments
Jones, M. A., Vallury, H. J., Hill, C. D., & Hollenberg, L. C. L. (2022) · Scientific Reports · doi:10.1038/s41598-022-12324-z · Cited by 36
Variational counterdiabatic driving of the Hubbard model for ground-state preparation
Xie, Q., Seki, K., & Yunoki, S. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.106.155153 · Cited by 33
Silver, D., Patel, T., & Tiwari, D. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i8.20807 · Cited by 43
Noise-Aware Quantum Circuit Simulation With Decision Diagrams
Grurl, T., Fus, J., & Wille, R. (2022) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2022.3182628 · Cited by 34
The basics of quantum computing for chemists
Claudino, D. (2022) · International Journal of Quantum Chemistry · doi:10.1002/qua.26990 · Cited by 31
D-NISQ: A reference model for Distributed Noisy Intermediate-Scale Quantum computers
Acampora, G., Martino, F. D., Massa, A. A., Schiattarella, R., & Vitiello, A. (2022) · Information Fusion · doi:10.1016/j.inffus.2022.08.003 · Cited by 27
A fast and scalable qubit-mapping method for noisy intermediate-scale quantum computers
Park, S., Kim, D., Kweon, M., Sim, J., & Kang, S. (2022) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3489517.3530402 · Cited by 27
Demonstrating Quantum Advantage in Hybrid Quantum Neural Networks for Model Capacity
Kashif, M., & Al-Kuwari, S. M. (2022) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc57508.2022.00011 · Cited by 31
Supporting quantum technologies with an ultralow-loss silicon photonics platform
Cherchi, M., Bera, A., Kemppinen, A., Nissilä, J., Tappura, K., Caputo, M., Lehtimäki, L., Lehtinen, J. S., Govenius, J., Hassinen, T., et al. (2023) · Advanced Photonics Nexus · doi:10.1117/1.apn.2.2.024002 · Cited by 25
Efficient variational synthesis of quantum circuits with coherent multi-start optimization
Nemkov, N. A., Kiktenko, E. O., Luchnikov, I. A., & Fedorov, A. K. (2023) · Quantum · doi:10.22331/q-2023-05-04-993 · Cited by 34
Circuits of space and time quantum channels
Kos, P., & Styliaris, G. (2023) · Quantum · doi:10.22331/q-2023-05-24-1020 · Cited by 34
Fast quantum transfer mediated by topological domain walls
Zurita, J., Creffield, C. E., & Platero, G. (2023) · Quantum · doi:10.22331/q-2023-06-22-1043 · Cited by 33
Noise-Resilient Phase Estimation with Randomized Compiling
Gu, Y., Ma, Y., Forcellini, N., & Liu, D. E. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.250601 · Cited by 38
Scaling up Superconducting Quantum Computers With Cryogenic RF-Photonics
Joshi, S., & Moazeni, S. (2023) · Journal of Lightwave Technology · doi:10.1109/jlt.2023.3311806 · Cited by 32
Mean-Field Approximate Optimization Algorithm
Misra-Spieldenner, A., Bode, T., Schuhmacher, P., Stollenwerk, T., Bagrets, D., & Wilhelm, F. K. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.030335 · Cited by 36
Adaptive Quantum State Tomography with Active Learning
Lange, H., Kebrič, M., Buser, M., Schollwöck, U., Grusdt, F., & Bohrdt, A. (2023) · Quantum · doi:10.22331/q-2023-10-09-1129 · Cited by 53
A variational quantum algorithm-based numerical method for solving potential and Stokes flows
Liu, Y. Y., Chen, Z., Shu, C., Rebentrost, P., Liu, Y., Chew, S. C., Khoo, B. C., & Cui, Y. (2023) · Ocean Engineering · doi:10.1016/j.oceaneng.2023.116494 · Cited by 37
Pfeffer, P., Heyder, F., & Schumacher, J. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043242 · Cited by 44
Cruz, P. M. Q., & Murta, B. (2024) · APL Quantum · doi:10.1063/5.0187026 · Cited by 39
Alloun, Y., Azzaz, M. S., & Kifouche, A. (2024) · Multimedia Tools and Applications · doi:10.1007/s11042-024-19136-5 · Cited by 22
Group-theoretic error mitigation enabled by classical shadows and symmetries
Zhao, A., & Miyake, A. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00854-5 · Cited by 50
Classical benchmarking of Gaussian Boson Sampling on the Titan supercomputer
Gupt, B., Arrazola, J. M., Quesada, N., & Bromley, T. R. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02713-6 · Cited by 20
The role of South African researchers in intercontinental collaboration
Kozma, C. A., & Calero‐Medina, C. (2019) · Scientometrics · doi:10.1007/s11192-019-03230-9 · Cited by 22
Efficient Quantum Error Correction of Dephasing Induced by a Common Fluctuator
Layden, D., Chen, M., & Cappellaro, P. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.020504 · Cited by 30
Collective optimization for variational quantum eigensolvers
Zhang, D.-B., & Yin, T. (2020) · Physical Review A · doi:10.1103/physreva.101.032311 · Cited by 24
Quantifying the Sensitivity to Errors in Analog Quantum Simulation
Poggi, P. M., Lysne, N., Kuper, K. W., Deutsch, I., & Jessen, P. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020308 · Cited by 43
Quantum search for scaled hash function preimages
Ramos-Calderer, S., Bellini, E., Latorre, J. I., Manzano, M., & Mateu, V. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03118-9 · Cited by 24
TILT: Achieving Higher Fidelity on a Trapped-Ion Linear-Tape Quantum Computing Architecture
Wu, X.-C., Debroy, D. M., Ding, Y., Baker, J. M., Alexeev, Y., Brown, K. R., & Chong, F. T. (2021) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca51647.2021.00023 · Cited by 44
Multi-qubit correction for quantum annealers
Ayanzadeh, R., Dorband, J. E., Halem, M., & Finin, T. (2021) · Scientific Reports · doi:10.1038/s41598-021-95482-w · Cited by 34
K-Means Clustering on Noisy Intermediate Scale Quantum ComputersPreprint
Khan, S. U., Awan, A. J., & Vall-llosera, G. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.12183 · Cited by 22
Entangled Datasets for Quantum Machine LearningPreprint
Schatzki, L., Arrasmith, A., Coles, P. J., & Cerezo, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.03400 · Cited by 96
Enhanced connectivity of quantum hardware with digital-analog control
Galicia, A., Ramon, B., Solano, E., & Sanz, M. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033103 · Cited by 22
“These problems characterize the so-called noise intermediate-scale quantum (NISQ) devices [13], quantum chips comprising 50–100 qubits, which are still affected by significant noise.”
BackgroundReducing the Amount of Single‐Qubit Rotations in VQE and Related Algorithms
Rasmussen, S. E., Loft, N. J. S., Bækkegaard, T., Kues, M., & Zinner, N. T. (2020) · Advanced Quantum Technologies · doi:10.1002/qute.202000063 · Cited by 22
Sparse Quantum State Preparation for Strongly Correlated Systems
Feniou, C., Adjoua, O., Claudon, B., Zylberman, J., Giner, E., & Piquemal, J. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.3c03159 · Cited by 37
Multilevel Leapfrogging Initialization Strategy for Quantum Approximate Optimization Algorithm
Ni, X., Cai, B., Liu, H., Qin, S., Gao, F., & Wen, Q. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300419 · Cited by 30
Matsakos, T., & Nield, S. (2024) · Quantum · doi:10.22331/q-2024-04-04-1306 · Cited by 41
Li, X., Xu, H., Wang, J., Tang, L.-Z., Zhang, D.-W., Yang, C., Su, T., Wang, C., Mi, Z., Sun, W., et al. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.l042038 · Cited by 29
Training robust and generalizable quantum models
Berberich, J., Fink, D., Pranjić, D., Tutschku, C., & Holm, C. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043326 · Cited by 49
A quantum inspired machine learning approach for multimodal Parkinson’s disease screening
Vatsavai, D., Iyer, A., & Nair, A. A. (2025) · Scientific Reports · doi:10.1038/s41598-025-95315-0 · Cited by 21
Harnessing quantum extreme learning machines for image classification
Lorenzis, A. D., Casado, M. P., Estarellas, M. P., Gullo, N. L., Lux, T., Plastina, F., Riera, A., & Settino, J. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.044024 · Cited by 43
Desdentado, E., Calero, C., Moraga, M. Á., & García, F. O. (2025) · Computing · doi:10.1007/s00607-025-01459-2 · Cited by 30
Stochastic noise can be helpful for variational quantum algorithms
Liu, J., Wilde, F., Mele, A. A., Jin, X., Jiang, L., & Eisert, J. (2025) · Physical Review A · doi:10.1103/physreva.111.052441 · Cited by 73
Classical simulations of noisy variational quantum circuits
Fontana, E., Rudolph, M. S., Duncan, R., Rungger, I., & Cîrstoiu, C. (2025) · npj Quantum Information · doi:10.1038/s41534-024-00955-1 · Cited by 143
Quantum Measurement for Quantum Chemistry on a Quantum Computer
Patel, S., Jayakumar, P., Yen, T.-C., & Izmaylov, A. F. (2025) · Chemical Reviews · doi:10.1021/acs.chemrev.5c00055 · Cited by 50
Quantum Machine Learning: Towards Hybrid Quantum-Classical Vision Models
Rizvi, S. M. A., Paracha, U. I., Khalid, U., Lee, K., & Shin, H. (2025) · Mathematics · doi:10.3390/math13162645 · Cited by 34
Quantum Inspire: QuTech’s platform for co-development and collaboration in quantum computing
Last, T., Samkharadze, N., Eendebak, P. T., Versluis, R., Xue, X., Sammak, A., Brousse, D., Loh, K., Polinder, H., Scappucci, G., et al. (2020) · SPIE Novel Patterning Technologies · doi:10.1117/12.2551853 · Cited by 21
Photo-Triggered Logic Circuits Assembled on Integrated Illuminants and Resonant Nanowires
Li, Q., Jiang, C., Bi, S., Asare‐Yeboah, K., He, Z., & Liu, Y. (2020) · ACS Applied Materials & Interfaces · doi:10.1021/acsami.0c12256 · Cited by 21
Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates
Duckering, C., Baker, J. M., Litteken, A., & Chong, F. T. (2021) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3445814.3446718 · Cited by 42
Diagnosis of information scrambling from Hamiltonian evolution under decoherence
Hayata, T., Hidaka, Y., & Kikuchi, Y. (2021) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.104.074518 · Cited by 26
Efficient entanglement distillation for quantum channels with polarization mode dispersion
Ruan, L., Kirby, B. T., Brodsky, M., & Win, M. Z. (2021) · Physical Review A · doi:10.1103/physreva.103.032425 · Cited by 23
Symmetry-Induced Error Filtering in a Photonic Lieb Lattice
Chang, Y.-J., Lu, Y., Wang, Y., Xu, X.-Y., Zhou, W.-H., Cui, W.-H., Wang, X., Gao, J., Qiao, L., & Jin, X. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.110501 · Cited by 22
Generic detection-based error mitigation using quantum autoencoders
Zhang, X., Kong, W., Farooq, M. U., Yung, M., Guo, G., & Wang, X. (2021) · Physical Review A · doi:10.1103/physreva.103.l040403 · Cited by 33
Approximate optimization, sampling, and spin-glass droplet discovery with tensor networks
Rams, M. M., Mohseni, M., Eppens, D., Jałowiecki, K., & Gardas, B. (2021) · Physical review. E · doi:10.1103/physreve.104.025308 · Cited by 41
Characterizing correlation within multipartite quantum systems via local randomized measurements
Liu, Z., Zeng, P., Zhou, Y., & Gu, M. (2022) · Physical Review A · doi:10.1103/physreva.105.022407 · Cited by 25
Efficient noise mitigation technique for quantum computing
Shaib, A., Naim, M. H., Fouda, M. E., Kanj, R. N., & Kurdahi, F. J. (2023) · Scientific Reports · doi:10.1038/s41598-023-30510-5 · Cited by 35
Trotter Errors from Dynamical Structural Instabilities of Floquet Maps in Quantum Simulation
Chinni, K., Muñoz-Arias, M. H., Deutsch, I., & Poggi, P. M. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010351 · Cited by 34
Suppressing Coherent Two-Qubit Errors via Dynamical Decoupling
Qiu, J., Zhou, Y., Hu, C.-K., Yuan, J., Zhang, L., Chu, J., Huang, W., Liu, W., Luo, K., Ni, Z., et al. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.054047 · Cited by 20
Identification of Different Types of High-Frequency Defects in Superconducting Qubits
Abdurakhimov, L. V., Mahboob, I., Toida, H., Kakuyanagi, K., Matsuzaki, Y., & Saito, S. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040332 · Cited by 34
Relation between quantum coherence and quantum entanglement in quantum measurements
Kim, H.-J., & Lee, S. (2022) · Physical Review A · doi:10.1103/physreva.106.022401 · Cited by 26
Unsupervised detection of decoupled subspaces: Many-body scars and beyond
Szołdra, T., Sierant, P., Lewenstein, M., & Zakrzewski, J. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.224205 · Cited by 29
A Quantum Planner for Robot Motion
Chella, A., Gaglio, S., Pilato, G., Vella, F., & Zammuto, S. (2022) · Mathematics · doi:10.3390/math10142475 · Cited by 29
Approximating the quantum approximate optimization algorithm with digital-analog interactions
Headley, D., Müller, T., Martin, A., Solano, E., Sanz, M., & Wilhelm, F. K. (2022) · Physical Review A · doi:10.1103/physreva.106.042446 · Cited by 35
VACSEN : A V isualization A pproa c h for Noi s e Awaren e ss in Qua n tum Computing
Ruan, S., Wang, Y., Jiang, W., Mao, Y., & Guan, Q. (2022) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2022.3209455 · Cited by 42
Quantum Computing Methods for Supply Chain Management
Jiang, H., Shen, Z. M., & Liu, J. (2022) · IEEE/ACM Symposium on Edge Computing (SEC) · doi:10.1109/sec54971.2022.00059 · Cited by 27
Finite-size criticality in fully connected spin models on superconducting quantum hardware
Grossi, M., Kiss, O., Luca, F. D., Zollo, C., Gremese, I., & Mandarino, A. (2023) · Physical review. E · doi:10.1103/physreve.107.024113 · Cited by 30
Timing-Aware Qubit Mapping and Gate Scheduling Adapted to Neutral Atom Quantum Computing
Li, Y., Zhang, Y., Chen, M., Li, X., & Xu, P. (2023) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2023.3261244 · Cited by 34
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.