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 3,901–4,000 of 8,640
A universal quantum circuit design for periodical functions
Li, J., & Kais, S. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac2cb4 · Cited by 11
Zhao, P., Li, H. Y., Tao, J., Lim, Y. D., Seit, W. W., Guidoni, L., & Tan, C. S. (2021) · IEEE Electronic Components and Technology Conference (ECTC) · doi:10.1109/ectc32696.2021.00054 · Cited by 8
Analysis of a hybrid quantum network for classification tasks
Hellstern, G. (2021) · IET Quantum Communication · doi:10.1049/qtc2.12017 · Cited by 13
Conversion of Gaussian states under incoherent Gaussian operations
Du, S., & Bai, Z. (2022) · Physical Review A · doi:10.1103/physreva.105.022412 · Cited by 8
Hirai, H., & Koh, S. (2022) · Chemical Physics · doi:10.1016/j.chemphys.2022.111460 · Cited by 8
Lowering the T-depth of Quantum Circuits via Logic Network Optimization
Häner, T., & Soeken, M. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3501334 · Cited by 23
Chen, H. (2022) · Scientific Reports · doi:10.1038/s41598-022-06891-4 · Cited by 8
( 3+1 )-dimensional Schwinger pair production with quantum computers
Xu, B., & Wei Xue, B. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.106.116007 · Cited by 7
Quantum Circuit Template Matching Optimization Method for Constrained Connectivity
Gao, X., Guan, Z., Feng, S., & Jiang, Y. (2023) · Axioms · doi:10.3390/axioms12070687 · Cited by 9
Paler, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.02417 · Cited by 13
Experimental Challenges of Implementing Quantum Phase Estimation Algorithms on IBM Quantum ComputerPreprint
Mohammadbagherpoor, H., Oh, Y.-H., Singh, A., Yu, X., & Rindos, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.07605 · Cited by 22
Verified Optimization in a Quantum Intermediate RepresentationPreprint
Hietala, K., Rand, R., Hung, S.-H., Wu, X., & Hicks, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.06319 · Cited by 25
Convolution filter embedded quantum gate autoencoderPreprint
Shiba, K., Sakamoto, K., Yamaguchi, K., Malla, D. B., & Sogabe, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.01196 · Cited by 7
Lower Bounds for Parallel Quantum CountingPreprint
Burchard, P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.04555 · Cited by 22
Balanced k-Means Clustering on an Adiabatic Quantum ComputerPreprint
Arthur, D., & Date, P. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.04419 · Cited by 7
Martinis, J. M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.06137 · Cited by 7
Hardware Efficient Quantum Search AlgorithmPreprint
Liu, J., & Zhou, H. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.14196 · Cited by 16
Learning to measure: adaptive informationally complete POVMs for near-term quantum algorithmsPreprint
García-Pérez, G., Rossi, M. A. C., Sokolov, B., Tacchino, F., Barkoutsos, P. K., Mazzola, G., Tavernelli, I., & Maniscalco, S. (2021) · arXiv (Cornell University) · Cited by 7
Quantum technologies for climate change: Preliminary assessmentPreprint
Berger, C., Paolo, A. D., Forrest, T., Hadfield, S., Sawaya, N. P. D., Stęchły, M., & Thibault, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.05362 · Cited by 70
Robust and Resource-Efficient Quantum Circuit ApproximationPreprint
Patel, T., Younis, E., Iancu, C., de Jong, W. A., & Tiwari, D. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.12714 · Cited by 19
Quantum Computing for Healthcare: A ReviewPreprint
Qayyum, A., Rasool, R. U., Ahmad, H. F., Rafique, W., Qadir, J., & Anwar, Z. (2023) · doi:10.36227/techrxiv.17198702.v4 · Cited by 15
Quantum Optimization Algorithms in Operations Research: Methods, Applications, and ImplicationsPreprint
Klug, F. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4854668 · Cited by 25
Quantum-Machine-Assisted Drug Discovery: Survey and PerspectivePreprint
Zhou, Y., Karemore, G., Li, W., Liang, Z., Žitnik, M., Chong, F. T., Liu, J., & Fu, T. (2024) · Preprints.org · doi:10.20944/preprints202408.1950.v1 · Cited by 11
Quantum Computing: A Concise Introduction
Lund, B. D., & Shahriar, S. (2025) · Encyclopedia · doi:10.3390/encyclopedia5040173 · Cited by 11
Quantum Computing in Civil Engineering: Potentials and Limitations
Ploennigs, J., Berger, M., Mevissen, M., & Smarsly, K. (2025) · Lecture Notes in Civil Engineering · doi:10.1007/978-3-031-87364-5_2 · Cited by 7
2022 Roadmap on integrated quantum photonics
Moody, G., Sorger, V. J., Blumenthal, D. J., Juodawlkis, P. W., Loh, W., Sorace-Agaskar, C., Jones, A. E., Balram, K. C., Matthews, J. C. F., Laing, A., et al. (2022) · Journal of Physics: Photonics · doi:10.1088/2515-7647/ac1ef4 · Cited by 6
Superconducting Circuit Companion—an Introduction with Worked Examples
Rasmussen, S. E., Christensen, K. S., Pedersen, S. P., Kristensen, L. B., Bækkegaard, T., Loft, N. J. S., & Zinner, N. T. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040204 · Cited by 186
Quantum approximate optimization for hard problems in linear algebra
Borle, A., Elfving, V. E., & Lomonaco, S. J. (2021) · SciPost Physics Core · doi:10.21468/scipostphyscore.4.4.031 · Cited by 42
Feedback-Based Steering for Quantum State Preparation
Volya, D., Pan, Z., & Mishra, P. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00148 · Cited by 6
Decomposition Algorithm of an Arbitrary Pauli Exponential Through a Quantum Circuit
Mansky, M. B., Puigvert, V. R., Castillo, S. L., & Linnhoff–Popien, C. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00056 · Cited by 19
Quantum Fourier Transform‐Based Arithmetic Logic Unit on a Quantum Processor
Çakmak, S., Kurt, M., & Gençten, A. (2023) · Annalen der Physik · doi:10.1002/andp.202300457 · Cited by 10
Solfanelli, A., Ruffo, S., Succi, S., & Defenu, N. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013311 · Cited by 10
Towards Two Bloch Sphere Representation of Pure Two-Qubit States and Unitaries
Filatov, S., & Auzinsh, M. P. (2024) · Entropy · doi:10.3390/e26040280 · Cited by 15
Reduced-order modeling on a near-term quantum computer
Asztalos, K. J., Steijl, R., & Maulik, R. (2024) · Journal of Computational Physics · doi:10.1016/j.jcp.2024.113070 · Cited by 13
Exploring the features of quanvolutional neural networks for improved image classification
Hai, V. T., Le, L. H., & Pham, T. B. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00166-z · Cited by 6
Yao, Q., Ji, Q., Li, X., Zhang, Y., Chen, X., Ju, M., Liu, J., & Wang, J. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.4c01445 · Cited by 7
Bae, J., Yoo, G., Nakamura, S., Ohnishi, S., & Kim, D. S. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04458-y · Cited by 7
Han, Q., Wang, J., & Cui, Y. (2024) · The Computer Journal · doi:10.1093/comjnl/bxae062 · Cited by 10
Synthetic data generation with hybrid quantum-classical models for the financial sector
Pires, O. M., Neto, M. Q. N., Silva, Y. A. C., da Silva, M. H. F., Galvão, L. Q., & Albino, A. S. (2024) · The European Physical Journal B · doi:10.1140/epjb/s10051-024-00786-1 · Cited by 13
Quantum error mitigation by layerwise Richardson extrapolation
Russo, V., & Mari, A. (2024) · Physical Review A · doi:10.1103/physreva.110.062420 · Cited by 17
GraFeyn: Efficient Parallel Sparse Simulation of Quantum Circuits
Westrick, S., Liu, P., Kang, B., McDonald, C., Rainey, M., Xu, M., Arora, J., Ding, Y., & Acar, U. A. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00132 · Cited by 14
Demonstrating quantum error mitigation on logical qubits
Zhang, A., Xie, H., Gao, Y., Yang, J., Bao, Z., Zhu, Z., Chen, J., Wang, N., Zhang, C., Zhong, J., et al. (2025) · Nature Communications · doi:10.1038/s41467-025-67768-4 · Cited by 53
Time-Optimal Transfer of the Quantum State in Long Qubit Arrays
Stepanenko, A. A., Chernova, K. S., & Gorlach, M. A. (2025) · Physical Review Letters · doi:10.1103/mxrq-7rl4 · Cited by 15
Monzón-Verona, J. M., García–Alonso, S., & Santana-Martín, F. J. (2025) · Sensors · doi:10.3390/s25041277 · Cited by 6
Digit quantum simulation of a fermion field in an expanding universe
Gong, J.-Q., & Yang, J.-C. (2025) · Physical review. D/Physical review. D. · doi:10.1103/btfs-m58w · Cited by 8
Ciaramelletti, C., Beseda, M., Consiglio, M., Lepori, L., Apollaro, T. J. G., & Paganelli, S. (2025) · Physical Review A · doi:10.1103/physreva.111.022437 · Cited by 18
An Overview of Quantum Machine Learning Research in China
Li, L., Zhang, X., Cui, Z., Xu, W., Xu, X., Wang, J., & Shu, R. (2025) · Applied Sciences · doi:10.3390/app15052555 · Cited by 9
Ďuriška, M., Miháliková, I., & Friák, M. (2025) · Physica Scripta · doi:10.1088/1402-4896/adbb29 · Cited by 9
Quantum Circuit Synthesis Using Fuzzy-Logic-Assisted Genetic Algorithms
Islam, I., Jha, V., Thomas, S., Egan, K. F., Nobel, A., Kim, S., Chaudhary, M., Ogundele, S., Kneidel, D., Phillips, B., et al. (2025) · Algorithms · doi:10.3390/a18040178 · Cited by 11
Zhang, S., Zhou, Y., Qin, Z., Li, R., Du, C., Xiao, Z., & Zhang, Y. (2025) · Physical Review A · doi:10.1103/physreva.111.052403 · Cited by 11
Cryogenic Evaluation of a Digital-to-Analog Converter for a Trapped-Ion Quantum Computer
Meyer, A., Ritter, P. J., Neumann, M., Toth, P., Halama, S., Repp, J., Brandl, M., Hampel, B., Schilling, M., & Іссаков, В. (2025) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2025.3571087 · Cited by 8
Fidelity-enhanced variational quantum optimal control
de Keijzer, R., Visser, L., Tse, O. T. C., & Kokkelmans, S. J. J. M. F. (2025) · Physical Review A · doi:10.1103/9ksj-wqrx · Cited by 12
Comprehensive Review of Metrics and Measurements of Quantum Systems
Soubra, H., Elsayed, H., Elbrolosy, Y., Adel, Y., & Attia, Z. (2025) · Metrics · doi:10.3390/metrics2020009 · Cited by 11
Evaluating Mutation Techniques in Genetic-Algorithm-Based Quantum Circuit Synthesis
Kölle, M., Bintener, T., Zorn, M., Stenzel, G., Sünkel, L., Gabor, T., & Linnhoff–Popien, C. (2025) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3712256.3726402 · Cited by 14
Quantum Circuit Construction and Optimization through Hybrid Evolutionary Algorithms
Sünkel, L., Altmann, P. J., Kölle, M., Stenzel, G., Gabor, T., & Linnhoff–Popien, C. (2025) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/3712256.3726392 · Cited by 8
QSimPy: A learning-centric simulation framework for quantum cloud resource management
Nguyen, H. T., Usman, M., & Buyya, R. (2025) · Elsevier eBooks · doi:10.1016/b978-0-443-29096-1.00012-x · Cited by 16
Mukhanbet, A., & Daribayev, B. (2025) · Computation · doi:10.3390/computation13080185 · Cited by 14
BenchQC: A Benchmarking Toolkit for Quantum Computation
Pollard, N., & Choudhary, K. K. (2025) · Journal of Computational Chemistry · doi:10.1002/jcc.70202 · Cited by 10
Dong, Q., Gao, X.-E., Liu, Z., Li, H., Wen, J., & Zheng, C. (2025) · Entropy · doi:10.3390/e27080836 · Cited by 9
On the Baltimore Light RailLink into the quantum future
Domino, K., Doucet, E., Robertson, R., Gardas, B., & Deffner, S. (2025) · Scientific Reports · doi:10.1038/s41598-025-15545-0 · Cited by 12
Dell’Anna, F., Gómez-Lurbe, R., Pérez, A., & Ercolessi, E. (2025) · Physical Review A · doi:10.1103/62wx-tvk5 · Cited by 12
Sebastiano, F. (2025) · IEEE Solid-State Circuits Magazine · doi:10.1109/mssc.2025.3581166 · Cited by 11
Universal quantum control with dynamical correction
Jin, Z.-Y., & Jing, J. (2025) · Physical Review A · doi:10.1103/vfrs-fyzw · Cited by 6
Shirai, S., Tseng, S.-Y., Iwakiri, H., Horiba, T., Hirai, H., & Koh, S. (2025) · ACS Omega · doi:10.1021/acsomega.5c03371 · Cited by 10
Scalability challenges in variational quantum optimization under stochastic noise
Bärligea, A., Poggel, B., & Lorenz, J. M. (2025) · Physical Review A · doi:10.1103/rgyh-8xw8 · Cited by 19
Quantum error correction near the coding theoretical bound
Komoto, D., & Kasai, K. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01090-1 · Cited by 28
Contextual ethical framework for artificial intelligence in the management of cultural heritage
Shaikhon, A. M. H. (2025) · STAR Science & Technology of Archaeological Research · doi:10.1080/20548923.2025.2564519 · Cited by 10
Khan, M., Amin, F., Din, M. U., Abid, M. A., Díez, I. D. L. T., Montero, E. C., & Noya, I. D. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07959-4 · Cited by 7
Average topological phase in a disordered Rydberg atom array
Yue, Z.-P., Mao, Y.-F., Liang, X., Hua, Z.-X., Ge, P., Chao, Y.-X., Li, K., Chen, J., Tey, M. K., Xu, Y., et al. (2026) · Nature Physics · doi:10.1038/s41567-026-03271-x · Cited by 29
Quantum dynamics simulation of the advection-diffusion equation
Alipanah, H., Zhang, F., Yao, Y.-X., Thompson, R., Nguyen, N., Liu, J., Givi, P., McDermott, B. J., & Mendoza-Arenas, J. J. (2025) · Physical Review Research · doi:10.1103/ndc3-bdwt · Cited by 19
Quantum mechanics in drug design: Progress, challenges, and future frontiers
Niazi, S. K. (2025) · Communicative & Integrative Biology · doi:10.1080/19420889.2025.2603140 · Cited by 11
Quantum computing: foundations, algorithms, and emerging applications
Raseena, V. (2025) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2025.1723319 · Cited by 13
Initial-State Dependent Optimization of Controlled Gate Operations with Quantum Computer
Jang, W., Terashi, K., Saito, M., Bauer, C., Nachman, B. P., Iiyama, Y., Okubo, R., & Sawada, R. (2022) · Quantum · doi:10.22331/q-2022-09-08-798 · Cited by 10
Quantum Noise in the Flow of Time: A Temporal Study of the Noise in Quantum Computers
Baheri, B., Guan, Q., Chaudhary, V., & Li, A. (2022) · IEEE International On-Line Testing Symposium (IOLTS) · doi:10.1109/iolts56730.2022.9897404 · Cited by 12
On the learnability of quantum state fidelity
Amer, N. E., Gomaa, W. E., Kimura, K. R., Ueda, K., & El-Mahdy, A. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00149-8 · Cited by 11
Fujii, T., Komuro, K., Okudaira, Y., & Sawada, M. (2023) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.92.044001 · Cited by 8
Bespoke pulse design for robust rapid two-qubit gates with trapped ions
Vedaie, S. S., Paez, E. J., Nguyen, N. H., Linke, N. M., & Sanders, B. C. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023098 · Cited by 8
Modeling noise in global Mølmer-Sørensen interactions applied to quantum approximate optimization
Lotshaw, P. C., Battles, K. D., Gard, B., Buchs, G., Humble, T. S., & Herold, C. D. (2023) · Physical Review A · doi:10.1103/physreva.107.062406 · Cited by 11
Continuous Variational Quantum Algorithms for Time Series
Guo, M., Weng, Y., Lili, Y., & Lai, Y. C. (2023) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn54540.2023.10191609 · Cited by 9
Hybrid noise protection of logical qubits for universal quantum computation
Wang, Z.-M., Ren, F.-H., Byrd, M., & Wu, L.-A. (2023) · Physical Review A · doi:10.1103/physreva.108.022607 · Cited by 7
Investigating Imperfect Cloning for Extending Quantum Communication Capabilities
Iqbal, M., Velasco, L., Costa, N. M. S., Napoli, A., Pedro, J., & Ruiz, M. (2023) · Sensors · doi:10.3390/s23187891 · Cited by 6
Variational Quantum Approach for the Multiple Traveling Salesman Problem Optimisation
Spyridis, Y., Gkelias, A., & Argyriou, V. (2023) · International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT) · doi:10.1109/dcoss-iot58021.2023.00064 · Cited by 7
A quantum feature selection framework via ground state preparation
Wang, L., Chen, Z., Le, F.-Y., Yu, Z.-Q., Xue, C., Zhuang, X., Yan, Q. Y., Yang, Y., Wu, Y.-C., & Guo, G. (2023) · Physica Scripta · doi:10.1088/1402-4896/ad0184 · Cited by 6
A progressive predictor-based quantum architecture search with active learning
Deng, M., He, Z., Zheng, S., Zhou, Y., Zhang, F., & Situ, H. (2023) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-023-04537-6 · Cited by 8
Quantum Power Flow: Revolutionizing Power Systems Analysis
Samaila, B., & Sekar, C. (2023) · SciWaveBulletin · doi:10.61925/swb.2023.1201 · Cited by 6
REDiP: Ranked Entanglement Distribution Protocol for the Quantum Internet
Bacciottini, L., Lenzini, L., Mingozzi, E., & Anastasi, G. (2023) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2023.3345166 · Cited by 8
Digital Footprints and the Battle for Data Sovereignty: Digital Privacy, Security, and Ownership
Sharma, I., & Aggarwal, A. (2024) · Advances in human and social aspects of technology book series · doi:10.4018/979-8-3693-3253-5.ch005 · Cited by 9
Variational Phase Estimation with Variational Fast Forwarding
Filip, M.-A., Ramo, D. M., & Fitzpatrick, N. (2024) · Quantum · doi:10.22331/q-2024-03-13-1278 · Cited by 10
A Review of Quantum Machine Learning for Image Classification
Li, Q., Huang, Z., Yang, H., & Song, M. (2023) · International Conference on Intelligent Management and Software Engineering (IMSE) · doi:10.1109/imse61332.2023.00021 · Cited by 7
Quantum computing for simulation of fluid dynamics
Sanavio, C., & Succi, S. (2024) · IntechOpen eBooks · doi:10.5772/intechopen.1005242 · Cited by 15
Deterministic generation of highly squeezed GKP states in ultracold atoms
Kendell, H. C. P., Ferranti, G., & Weidner, C. A. (2024) · APL Quantum · doi:10.1063/5.0197119 · Cited by 13
Calibration and Performance Evaluation of a Superconducting Quantum Processor in an HPC Center
Deng, X., Pogorzalek, S., Vigneau, F., Yang, P., Schulz, M., & Schulz, L. B. (2024) · ISC High Performance (ISC) · doi:10.23919/isc.2024.10528924 · Cited by 6
de Andrade, M. G., Navas, J., Guha, S., Montaño, I., Raymer, M. G., Smith, B. J., & Towsley, D. (2024) · IEEE Network · doi:10.1109/mnet.2024.3403805 · Cited by 19
Shuffle-QUDIO: accelerate distributed VQE with trainability enhancement and measurement reduction
Qian, Y., Du, Y., & Tao, D. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00167-y · Cited by 10
Jiang, H. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3656428 · Cited by 14
Near-term quantum algorithm for solving the MaxCut problem with fewer quantum resources
Xiumei, Z., Li, Y., Li, J., Wang, S., Wang, S., Qin, S., & Gao, F. (2024) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2024.129951 · Cited by 9
Compact and classically preprocessed data-loading quantum circuit as a quantum random access memory
Duan, B., & Hsieh, C. (2024) · Physical Review A · doi:10.1103/physreva.110.012616 · Cited by 9
Quantum Technologies for Space and Aerial Vehicles
Landers, V. S. (2024) · Space Law and Policy · doi:10.1007/978-3-031-62228-1_4 · Cited by 7
QuTracer: Mitigating Quantum Gate and Measurement Errors by Tracing Subsets of Qubits
Li, P., Liu, J., Gonzales, A., Saleem, Z. H., Zhou, H., & Hovland, P. (2024) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca59077.2024.00018 · Cited by 19
ReLAQA: Reinforcement Learning-Based Autonomous Quantum Agent for Quantum Applications
Alomari, A., & Kumar, S. (2024) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2024.3437335 · Cited by 14
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.