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,001–3,100 of 8,640
Fermionic simulators for enhanced scalability of variational quantum simulation
Li, Q., Mukhopadhyay, C., & Bayat, A. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043175 · Cited by 13
Benchmarking the Variational Quantum Eigensolver using different quantum hardware
Bentellis, A., Matic-Flierl, A., Mendl, C. B., & Lorenz, J. M. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00065 · Cited by 18
A Deep Learning Model for Multiclass Image Classification Using Quantum CNN
Golchha, R., & Verma, G. K. (2023) · Asia Symposium on Image Processing (ASIP) · doi:10.1109/asip58895.2023.00024 · Cited by 13
Ballinas, E., Montiel, O., Martínez-Vargas, A., & Rodríguez-Cortés, G. (2024) · Axioms · doi:10.3390/axioms13010048 · Cited by 14
Calculating the many-body density of states on a digital quantum computer
Summer, A., Chiaracane, C., Mitchison, M. T., & Goold, J. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013106 · Cited by 19
Markovian noise modelling and parameter extraction framework for quantum devices
Brand, D., Sinayskiy, I., & Petruccione, F. (2024) · Scientific Reports · doi:10.1038/s41598-024-54598-5 · Cited by 22
Experimental demonstration of a high-fidelity virtual two-qubit gate
Singh, A. P., Mitarai, K., Suzuki, Y., Heya, K., Tabuchi, Y., Fujii, K., & Nakamura, Y. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013235 · Cited by 20
Quantum Fuzzy Inference Engine for Particle Accelerator Control
Acampora, G., Grossi, M., Schenk, M., & Schiattarella, R. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3374251 · Cited by 12
Maximizing Entanglement Rates via Efficient Memory Management in Flexible Quantum Switches
Promponas, P., Valls, V., Guha, S., & Tassiulas, L. (2024) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2024.3380097 · Cited by 13
Oumennana, M., Dahbi, Z., & Mansour, M. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04325-w · Cited by 12
Evaluating the Impact of Noise on Variational Quantum Circuits in NISQ Era Devices
Khanal, B., & Rivas, P. (2023) · Congress in Computer Science, Computer Engineering, and Applied Computing (CSCE) · doi:10.1109/csce60160.2023.00272 · Cited by 18
A Comprehensive Review of Data Encoding Techniques for Quantum Machine Learning Problems
Pande, M. B. (2024) · International Conference on Emerging Trends in Information Technology and Engineering (ICETITE) · doi:10.1109/ic-etite58242.2024.10493306 · Cited by 21
Adaptive variational low-rank dynamics for open quantum systems
Gravina, L., & Savona, V. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023072 · Cited by 17
Chen, Q., Du, Y., Jiao, Y., Lu, X., Wu, X., & Zhao, Q. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad420a · Cited by 24
VIOLET: Visual Analytics for Explainable Quantum Neural Networks
Ruan, S., Liang, Z., Guan, Q., Griffin, P., Wen, X., Lin, Y., & Wang, Y. (2024) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2024.3388557 · Cited by 24
Quantum computing and neuroscience for 6G/7G networks: Survey
Glisic, S., & Lorenzo, B. (2024) · Intelligent Systems with Applications · doi:10.1016/j.iswa.2024.200346 · Cited by 19
Periodically driven open quantum systems: Spectral properties and nonequilibrium steady states
Chen, H., Hu, Y.-M., Zhang, W., Kurniawan, M. A., Shao, Y., Chen, X., Prem, A., & Dai, X. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.184309 · Cited by 22
Nanowires: Exponential speedup in quantum computing
Mimona, M. A., Mobarak, M. H., Ahmed, E., Kamal, F., & Hasan, M. (2024) · Heliyon · doi:10.1016/j.heliyon.2024.e31940 · Cited by 16
Measurement-Based Infused Circuits for Variational Quantum Eigensolvers
Chan, A., Shi, Z., Dellantonio, L., Dür, W., & Muschik, C. A. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.240601 · Cited by 35
Nonadiabatic geometric quantum gates with on-demand trajectories
Liang, Y., & Xue, Z. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.064048 · Cited by 17
Quantum Data Encoding Patterns and their Consequences
Gogeissl, M., Safi, H., & Mauerer, W. (2024) · Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications (Q-Data) · doi:10.1145/3665225.3665446 · Cited by 17
Iteration-Free quantum approximate optimization algorithm using neural networks
Amosy, O., Danzig, T., Lev, O., Porat, E., Chechik, G., & Makmal, A. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00159-y · Cited by 31
Trainability Barriers in Low-Depth QAOA Landscapes
Rajakumar, J., Golden, J. K., Bärtschi, A., & Eidenbenz, S. (2024) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/3649153.3649204 · Cited by 22
Shortcut to multipartite entanglement generation: A graph approach to boson subtractions
Chin, S., Kim, Y., & Karczewski, M. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00845-6 · Cited by 16
Universal robust geometric quantum control via geometric trajectory correction
Chen, T., Hu, J., Zhang, C., & Xue, Z. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.014060 · Cited by 14
Dynamically generated decoherence-free subspaces and subsystems on superconducting qubits
Quiroz, G., Pokharel, B., Boen, J., Tewala, L., Tripathi, V., Williams, D., Wu, L.-A., Titum, P., Schultz, K., & Lidar, D. A. (2024) · Reports on Progress in Physics · doi:10.1088/1361-6633/ad6805 · Cited by 27
Resource analysis of quantum algorithms for coarse-grained protein folding models
Linn, H., Lyngfelt, I., García-Álvarez, L., & Johansson, G. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033112 · Cited by 18
Bilayer Crystals of Trapped Ions for Quantum Information Processing
Hawaldar, S., Shahi, P., Carter, A. L., Rey, A. M., Bollinger, J. J., & Shankar, A. (2024) · Physical Review X · doi:10.1103/physrevx.14.031030 · Cited by 18
Leapfrogging Sycamore: harnessing 1432 GPUs for 7× faster quantum random circuit sampling
Zhao, X.-H., Zhong, H.-S., Pan, F., Chen, Z., Fu, R., Su, Z. B., Xie, X., Zhao, C., Zhang, P., Ouyang, W., et al. (2024) · National Science Review · doi:10.1093/nsr/nwae317 · Cited by 35
Architecture decisions in quantum software systems: An empirical study on Stack Exchange and GitHub
Aktar, M. S., Liang, P., Waseem, M., Tahir, A., Ahmad, A., Zhang, B., & Li, Z. (2024) · Information and Software Technology · doi:10.1016/j.infsof.2024.107587 · Cited by 22
Mitigating controller noise in quantum gates using optimal control theory
Aroch, A., Kosloff, R., & Kallush, S. (2024) · Quantum · doi:10.22331/q-2024-09-25-1482 · Cited by 20
Energy-dependent barren plateau in bosonic variational quantum circuits
Zhang, B., & Zhuang, Q. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad80bf · Cited by 22
Dimensionality Reduction for Data Analysis With Quantum Feature Learning
Sihare, S. R. (2024) · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · doi:10.1002/widm.1568 · Cited by 19
PQKELP: Projected Quantum Kernel Embedding based Link Prediction in dynamic networks
Kumar, M., Singh, N., & Biswas, B. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.125944 · Cited by 15
Dudley, T., Plusquellic, J., Tsiropoulou, E. E., Goldberg, J., Stick, D., & Lobser, D. (2025) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2025.3528899 · Cited by 12
Jet discrimination with a quantum complete graph neural network
Chen, Y. A., & Chen, K. F. (2025) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.111.016020 · Cited by 23
Quantum-Embedded Robust Optimization for Resilience-Constrained Unit Commitment
Fu, W., Xie, H., Chen, C., & Bie, Z. (2025) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2025.3534156 · Cited by 26
Implementing Arbitrary Ising Models with a Trapped-Ion Quantum Processor
Lu, Y., Chen, W., Zhang, S., Zhang, K., Zhang, J., Zhang, J.-N., & Kim, K. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.050602 · Cited by 28
Simulating open quantum systems with giant atoms
Chen, G., & Kockum, A. F. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adb2bd · Cited by 23
Barata, J., & Mukherjee, S. (2025) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.111.l031901 · Cited by 24
Orito, T., Kuno, Y., & Ichinose, I. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.054106 · Cited by 16
New perspectives on structural health monitoring using unsupervised quantum machine learning
Alves, V., Gomes, R. F. I., & Cury, A. (2025) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2025.112489 · Cited by 20
Algorithm-oriented qubit mapping for variational quantum algorithms
Ji, Y., Chen, X., Polian, I., & Ban, Y. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.034022 · Cited by 19
Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
Kiss, O., Azad, U., Requena, B., Roggero, A., Wakeham, D., & Arrazola, J. M. (2025) · Quantum · doi:10.22331/q-2025-04-01-1682 · Cited by 31
Quantum Neural Networks Approach for Water Discharge Forecast
Liu, Z., & Bărbulescu, A. (2025) · Applied Sciences · doi:10.3390/app15084119 · Cited by 13
Optimization Strategies in Quantum Machine Learning: A Performance Analysis
Ajmi, N. A. A., & Shoaib, M. (2025) · Applied Sciences · doi:10.3390/app15084493 · Cited by 22
Extracting randomness from magic quantum states
Vairogs, C., & Yan, B. (2025) · Physical Review Research · doi:10.1103/3ttm-vhdt · Cited by 25
Denoising diffusion models with optimized quantum implicit neural networks for image generation
Zhang, J., Che, X., Fan, Y., Peng, S., Chen, G., Ma, Q., & Hu, J. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107875 · Cited by 20
High-Fidelity Electron Spin Gates for Scaling Diamond Quantum Registers
Joas, T., Ferlemann, F., Sailer, R., Vetter, P. J., Zhang, J., Said, R. S., Teraji, T., Onoda, S., Calarco, T., Genov, G. T., et al. (2025) · Physical Review X · doi:10.1103/physrevx.15.021069 · Cited by 37
Belaloui, N. E., Tounsi, A., Khamadja, A. R., Louamri, M. M., Benslama, A., Bernal, D. E., & Rouabah, M. T. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c01657 · Cited by 35
Lu, Y. (2025) · Scientific Reports · doi:10.1038/s41598-025-10512-1 · Cited by 31
Entanglement-induced provable and robust quantum learning advantages
Zhao, H., & Deng, D.-L. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01078-x · Cited by 22
Simulation of Quantum Computers: Review and Acceleration Opportunities
Cicero, A., Maleki, M. A., Azhar, M. W., Kockum, A. F., & Trancoso, P. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3762672 · Cited by 44
Quantum Structure for Modelling Emotion Space of Robots
Yan, F., Iliyasu, A. M., Jiao, S., & Yang, H. (2019) · Applied Sciences · doi:10.3390/app9163351 · Cited by 11
On the Need for Large Quantum Depth
Chia, N.-H., Chung, K.-M., & Lai, C. (2022) · Journal of the ACM · doi:10.1145/3570637 · Cited by 21
Correlation measure equivalence in dynamic causal structures of quantum gravity
Gyöngyösi, L. (2020) · Quantum Engineering · doi:10.1002/que2.30 · Cited by 13
Finding good quantum codes using the Cartan form
Jayashankar, A., Babu, A. M., Ng, H. K., & Mandayam, P. (2020) · Physical Review A · doi:10.1103/physreva.101.042307 · Cited by 14
Quantum algorithms for escaping from saddle points
Zhang, C., Leng, J., & Li, T. (2021) · Quantum · doi:10.22331/q-2021-08-20-529 · Cited by 35
Objective function estimation for solving optimization problems in gate-model quantum computers
Gyöngyösi, L. (2020) · Scientific Reports · doi:10.1038/s41598-020-71007-9 · Cited by 11
Digital quantum simulation framework for energy transport in an open quantum system
Gupta, P., & Chandrashekar, C. M. (2020) · New Journal of Physics · doi:10.1088/1367-2630/abcdc9 · Cited by 16
Glass Substrate Interposer for TSV-integrated Surface Electrode Ion Trap
Zhao, P., Li, H. Y., Lim, Y. D., Tao, J., Seit, W. W., Guidoni, L., & Tan, C. S. (2020) · IEEE Electronics Packaging Technology Conference (EPTC) · doi:10.1109/eptc50525.2020.9315003 · Cited by 11
Physical Computing: Unifying Real Number Computation to Enable Energy Efficient Computing
Hasler, J., & Black, E. D. (2021) · Journal of Low Power Electronics and Applications · doi:10.3390/jlpea11020014 · Cited by 11
A quantum Hopfield associative memory implemented on an actual quantum processor
Miller, N. E., & Mukhopadhyay, S. (2021) · Scientific Reports · doi:10.1038/s41598-021-02866-z · Cited by 14
Invited: Trainable Discrete Feature Embeddings for Quantum Machine Learning
Thumwanit, N., Lortaraprasert, C., & Raymond, R. (2021) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac18074.2021.9586190 · Cited by 11
Madhusudhana, B. H., Scherg, S., Kohlert, T., Bloch, I., & Aidelsburger, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040325 · Cited by 20
Normalized Gradient Descent for Variational Quantum Algorithms
Suzuki, Y., Yano, H., Raymond, R., & Yamamoto, N. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00015 · Cited by 23
Quantum Machine Learning and Fraud Detection
Pierro, A. D., & Incudini, M. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-91631-2_8 · Cited by 15
Variational Quantum Circuit-Based Reinforcement Learning for POMDP and Experimental Implementation
Kimura, T., Shiba, K., Chen, C.-C., Sogabe, M., Sakamoto, K., & Sogabe, T. (2021) · Mathematical Problems in Engineering · doi:10.1155/2021/3511029 · Cited by 12
A quantum genetic algorithm for optimization problems on the Bloch sphere
Amal, R. S., & Ivan, J. S. (2022) · Quantum Information Processing · doi:10.1007/s11128-021-03368-7 · Cited by 15
Development of Quantum Annealer Using Josephson Parametric Oscillators
Yamaji, T., Shirane, M., & Yamamoto, T. (2021) · IEICE Transactions on Electronics · doi:10.1587/transele.2021sep0006 · Cited by 12
New approach of KNN Algorithm in quantum computing based on new design of quantum circuits
Hai, V. T., Chuong, P. H., & Bao, P. T. (2022) · Informatica · doi:10.31449/inf.v46i5.3608 · Cited by 14
Communication Trade Offs in Intermediate Qudit Circuits
Litteken, A., Baker, J. M., & Chong, F. T. (2022) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl52857.2022.00014 · Cited by 15
Automatic depth optimization for a quantum approximate optimization algorithm
Pan, Y., Tong, Y., & Yang, Y. (2022) · Physical Review A · doi:10.1103/physreva.105.032433 · Cited by 18
Entanglement transitivity problems
Tabia, G. N. M., Chen, K.-S., Hsieh, C.-Y., Yin, Y.-C., & Liang, Y.-C. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00616-1 · Cited by 15
Quantum Simulation Using Noisy Unitary Circuits and Measurements
Lunt, O., Richter, J., & Pal, A. (2022) · Quantum science and technology · doi:10.1007/978-3-031-03998-0_10 · Cited by 30
Quantum Information Science: From foundations to new technologies
Soares-Pinto, D. O. (2022) · Physica B Condensed Matter · doi:10.1016/j.physb.2022.414510 · Cited by 14
Circuit implementation of discrete-time quantum walks via the shunt decomposition method
Wing-Bocanegra, A., & Venegas-Andraca, S. E. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03878-6 · Cited by 17
Exploring the optimality of approximate state preparation quantum circuits with a genetic algorithm
Rindell, T., Yenilen, B., Halonen, N., Pönni, A., Tittonen, I. J., & Raasakka, M. (2023) · Physics Letters A · doi:10.1016/j.physleta.2023.128860 · Cited by 17
Halder, S., Patra, C., Mondal, D., & Maitra, R. (2023) · The Journal of Chemical Physics · doi:10.1063/5.0155009 · Cited by 13
The battle of clean and dirty qubits in the era of partial error correction
Bultrini, D., Wang, S., Czarnik, P., Gordon, M. H., Cerezo, M., Coles, P. J., & Cincio, Ł. (2023) · Quantum · doi:10.22331/q-2023-07-13-1060 · Cited by 29
Kabdushev, S., Mun, G. A., Suleimenov, I. E., et al. (2023) · Polymers · doi:10.3390/polym15173578 · Cited by 11
Variational Quantum Linear Solver-based Combination Rules in Dempster–Shafer Theory
Luo, H., Zhou, Q., Li, Z., & Deng, Y. (2023) · Information Fusion · doi:10.1016/j.inffus.2023.102070 · Cited by 16
Fast Equivalence Checking of Quantum Circuits of Clifford Gates
Thanos, D., Coopmans, T. J., & Laarman, A. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-45332-8_10 · Cited by 21
Securing NISQ Quantum Computer Reset Operations Against Higher Energy State Attacks
Xu, C., Chen, J., Mi, A., & Szefer, J. M. (2023) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3576915.3623104 · Cited by 24
A Hybrid Classical Quantum Computing Approach to the Satellite Mission Planning Problem
Quetschlich, N., Koch, V., Burgholzer, L., & Wille, R. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00079 · Cited by 14
Lattice real-time simulations with learned optimal kernels
Alvestad, D., Rothkopf, A., & Sexty, D. (2024) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.109.l031502 · Cited by 26
A hybrid quantum algorithm to detect conical intersections
Koridon, E., Fraxanet, J., Dauphin, A., Visscher, L., Brien, T. E. O. A., & Polla, S. (2024) · Quantum · doi:10.22331/q-2024-02-20-1259 · Cited by 15
Implementation of the Projective Quantum Eigensolver on a Quantum Computer
Misiewicz, J. P., & Evangelista, F. A. (2024) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.3c07429 · Cited by 13
Automated quantum software engineering
Sarkar, A. (2024) · Automated Software Engineering · doi:10.1007/s10515-024-00436-x · Cited by 26
Advances in rock physics for pore pressure prediction: A comprehensive review and future directions
Ogbu, A. D., Iwe, K. A., Ozowe, W., et al. (2024) · Engineering Science & Technology Journal · doi:10.51594/estj.v5i7.1345 · Cited by 11
Markov-chain Monte Carlo method enhanced by a quantum alternating operator ansatz
Nakano, Y., Hakoshima, H., Mitarai, K., & Fujii, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033105 · Cited by 20
Differentiating and Integrating ZX Diagrams with Applications to Quantum Machine Learning
Wang, Q., Yeung, R. W. K., & Koch, M. E. (2024) · Quantum · doi:10.22331/q-2024-10-04-1491 · Cited by 35
Stojanović, V. M. (2019) · Physical Review A · doi:10.1103/physreva.99.012345 · Cited by 12
Quantum probabilistic associative memory architecture
Neto, F. M. D. P., da Silva, A. J., de Oliveira, W. R., & Ludermir, T. B. (2019) · Neurocomputing · doi:10.1016/j.neucom.2019.03.078 · Cited by 13
From Ansätze to Z-Gates: A NASA View of Quantum Computing
Rieffel, E. G., Hadfield, S., Hogg, T., Mandrà, S., Marshall, J., Mossi, G., O’Gorman, B., Plamadeala, E., Tubman, N. M., Venturelli, D., et al. (2019) · Advances in parallel computing · doi:10.3233/apc190010 · Cited by 19
Evaluating the Flexibility of A* for Mapping Quantum Circuits
Zulehner, A., Bauer, H., & Wille, R. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-21500-2_11 · Cited by 16
Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA
Roch, C., Impertro, A., Phan, T., Gabor, T., Feld, S., & Linnhoff–Popien, C. (2020) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc2020.2020.00009 · Cited by 14
On the principles of differentiable quantum programming languages
Zhu, S., Hung, S.-H., Chakrabarti, S., & Wu, X. (2020) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3385412.3386011 · Cited by 24
Quantum walks with quantum chaotic coins: Loschmidt echo, classical limit, and thermalization
Omanakuttan, S., & Lakshminarayan, A. (2021) · Physical review. E · doi:10.1103/physreve.103.012207 · Cited by 11
Atchade-Adelomou, P., Golobardes, E., & Vilasis-Cardona, X. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-61705-9_21 · Cited by 16
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.