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,301–3,400 of 8,640
Applying Hybrid Quantum LSTM for Indoor Localization Based on RSSI
Chien, S. F., Chieng, D. H. T., Chen, S. Y.-C., Zarakovitis, C. C., Lim, H. S., & Xu, Y. H. (2024) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp48485.2024.10447032 · Cited by 9
Noise-induced shallow circuits and the absence of barren plateaus
Mele, A. A., Angrisani, A., Ghosh, S., Khatri, S., Eisert, J., França, D. S., & Quek, Y. (2026) · Nature Physics · doi:10.1038/s41567-026-03245-z · Cited by 98
Benchmarking Quantum Generative Learning: A Study on Scalability and Noise Resilience using QUARK
Kiwit, F. J., Wolf, M. A., Marso, M., Ross, P., Lorenz, J. M., Riofrío, C. A., & Luckow, A. (2024) · Künstliche Intell. · doi:10.1007/s13218-024-00864-7 · Cited by 14
Exploring shallow-depth boson sampling: Toward a scalable quantum advantage
Go, B., Oh, C., Jiang, L., & Jeong, H. (2024) · Physical Review A · doi:10.1103/physreva.109.052613 · Cited by 17
Robust quantum federated learning with noise
Chen, L., Yan, L., & Zhang, S. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad4df2 · Cited by 17
Ji, Y., & Polian, I. (2024) · Entropy · doi:10.3390/e26070586 · Cited by 16
Doggen, E. V. H., Gornyi, I. V., & Mirlin, A. D. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.224203 · Cited by 10
Mitigating Errors on Superconducting Quantum Processors Through Fuzzy Clustering
Ahmad, H. G., Schiattarella, R., Mastrovito, P., Chiatto, A., Levochkina, A., Esposito, M., Montemurro, D., Pepe, G. P., Bruno, A., Tafuri, F., et al. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300400 · Cited by 13
A Representative Framework for Implementing Quantum Finite Automata on Real Devices
Khadieva, A., Salehi, Ö., & Yakaryılmaz, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-63742-1_12 · Cited by 9
Coherent Erbium Spin Defects in Colloidal Nanocrystal Hosts
Wong, J., Onizhuk, M., Nagura, J., Thind, A. S., Bindra, J. K., Wicker, C., Grant, G. D., Zhang, Y., Niklas, J., Poluektov, O. G., et al. (2024) · ACS Nano · doi:10.1021/acsnano.4c04083 · Cited by 10
Li, Y., Hao, X., Liu, G., Shang, R., & Jiao, L. (2024) · Memetic Computing · doi:10.1007/s12293-024-00417-3 · Cited by 13
Scalable simulation of nonequilibrium quantum dynamics via classically optimized unitary circuits
Causer, L., Jung, F., Mitra, A., Pollmann, F., & Gammon-Smith, A. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033062 · Cited by 18
Entanglement structure detection via computer vision
Li, R., Du, J., Qin, Z., Zhang, S., Du, C., Zhou, Y., & Xiao, Z. (2024) · Physical Review A · doi:10.1103/physreva.110.012448 · Cited by 14
Fault-Tolerant Operation of Bosonic Qubits with Discrete-Variable Ancillae
Xu, Q., Zeng, P., Xu, D., & Jiang, L. (2024) · Physical Review X · doi:10.1103/physrevx.14.031016 · Cited by 25
A Mutual-Influence-Aware Heuristic Method for Quantum Circuit Mapping
Ye, K., Dai, S., Guo, B., Shen, Y., Liu, C., Bi, K., Chen, F., Hu, Y., & Zhao, M. (2024) · IEEE Transactions on Computers · doi:10.1109/tc.2024.3441825 · Cited by 10
Joshi, M., Mishra, M. K., & Karthikeyan, S. (2024) · International Journal of Theoretical Physics · doi:10.1007/s10773-024-05751-3 · Cited by 13
Quantum-classical separations in shallow-circuit-based learning with and without noises
Zhang, Z., Gong, W., Li, W., & Deng, D.-L. (2024) · Communications Physics · doi:10.1038/s42005-024-01783-7 · Cited by 16
Continuous evolution for efficient quantum architecture search
Ma, Q., Hao, C., Yang, X., Qian, L., Zhang, H., Si, N., Xu, M., & Qu, D. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00265-7 · Cited by 16
Advancing Quantum Computing with Formal Methods
Quist, A.-J., Mei, J., Coopmans, T. J., & Laarman, A. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-71177-0_25 · Cited by 14
Hybrid quantum-classical computation for automatic guided vehicles scheduling
Śmierzchalski, T., Pawłowski, J., Przybysz, A., Pawela, Ł., Puchała, Z., Koniorczyk, M., Gardas, B., Deffner, S., & Domino, K. (2024) · Scientific Reports · doi:10.1038/s41598-024-72101-y · Cited by 21
Multimodal Deep Representation Learning for Quantum Cross-Platform Verification
Qian, Y., Du, Y., He, Z., Hsieh, M.-H., & Tao, D. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.130601 · Cited by 24
Optimized continuous dynamical decoupling via differential geometry and machine learning
Morazotti, N. A. D. C., da Silva, A. H., Audi, G., Fanchini, F. F., & Napolitano, R. D. J. (2024) · Physical Review A · doi:10.1103/physreva.110.042601 · Cited by 13
Non-Markovian noise mitigation in quantum teleportation: enhancing fidelity and entanglement
Zhang, H., Han, X., Zhang, G., Li, L., Cheng, L., Wang, J., Zhang, Y., Xia, Y., & Xia, C. (2024) · Scientific Reports · doi:10.1038/s41598-024-74702-z · Cited by 17
Patra, C., Mukherjee, D., Halder, S., Mondal, D., & Maitra, R. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0229137 · Cited by 12
Cryogenic quantum computer control signal generation using high-electron-mobility transistors
Ferraris, A., Cha, E., Müeller, P. R., Moselund, K. E., & Zota, C. B. (2024) · Communications Engineering · doi:10.1038/s44172-024-00293-2 · Cited by 12
Spatially resolved random telegraph fluctuations of a single trap at the Si/SiO 2 interface
Cowie, M., Constantinou, P., Curson, N. J., et al. (2024) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2404456121 · Cited by 9
Minerva: Enhancing Quantum Network Performance for High-Fidelity Multimedia Transmission
Li, T., Zhao, Z., & Yin, J. (2024) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/3664647.3681142 · Cited by 9
Construction of perfect tensors using biunimodular vectors
Rather, S. A. (2024) · Quantum · doi:10.22331/q-2024-11-20-1528 · Cited by 18
A Hybrid Quantum Solver for the Lorenz System
Hafshejani, S. F., Gaur, D. R., Dasgupta, A., Benkoczi, R. R., Gosala, N. R., & Iorio, A. (2024) · Entropy · doi:10.3390/e26121009 · Cited by 13
Optimization of Reinforcement Learning Using Quantum Computation
Ravish, R., Bhat, N. R., Nandakumar, N., Sagar, S., Sunil, & Honnavalli, P. B. (2024) · IEEE Access · doi:10.1109/access.2024.3506656 · Cited by 12
Quantum phase transition detection via quantum support vector machine
Wang, Y., & Cao, L. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad985f · Cited by 14
Pexe, G. E. L., Rattighieri, L. A. M., Malvezzi, A. L., & Fanchini, F. F. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.110.224422 · Cited by 19
Atlas: Hierarchical Partitioning for Quantum Circuit Simulation on GPUs
Xu, M., Cao, S., Miao, X., Acar, U. A., & Jia, Z. (2024) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41406.2024.00087 · Cited by 20
Strategies for implementing quantum error correction in molecular rotation
Furey, B. J., Wu, Z., Isaza-Monsalve, M., Walser, S., Mattivi, E., Nardi, R., & Schindler, P. (2024) · Quantum · doi:10.22331/q-2024-12-27-1578 · Cited by 14
Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation
LaRacuente, N. D., Smith, K. N., Imany, P., Silverman, K. L., & Chong, F. T. (2025) · Quantum · doi:10.22331/q-2025-01-08-1581 · Cited by 52
Ganguli, M., Aditya, S., & Sen, D. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.045411 · Cited by 20
Hype or Heuristic? Quantum Reinforcement Learning for Join Order Optimisation
Franz, M., Winker, T., Groppe, S., & Mauerer, W. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00055 · Cited by 21
Circuit knitting facing exponential sampling-overhead scaling bounded by entanglement cost
Jing, M., Zhu, C., & Wang, X. (2025) · Physical Review A · doi:10.1103/physreva.111.012433 · Cited by 22
On hybrid quanvolutional neural networks optimization
Ceschini, A., Carbone, A., Sebastianelli, A., Panella, M., & Saux, B. L. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00241-z · Cited by 18
Enhanced feature encoding and classification on distributed quantum hardware
Moretti, R., Giachero, A., Radescu, V. A. M., & Grossi, M. (2025) · Machine Learning Science and Technology · doi:10.1088/2632-2153/adb4bc · Cited by 16
Strong-to-weak symmetry breaking and entanglement transitions
Chen, L., Sun, N. G., & Zhang, P. (2025) · Physical review. B./Physical review. B · doi:10.1103/physrevb.111.l060304 · Cited by 25
Peng, B., Su, Y., Claudino, D., Kowalski, K., Low, G. H., & Roetteler, M. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adbf42 · Cited by 31
Efficient strategies for reducing sampling error in quantum Krylov subspace diagonalization
Lee, G., Choi, S., Huh, J., & Izmaylov, A. F. (2025) · Digital Discovery · doi:10.1039/d4dd00321g · Cited by 20
Playing Nonlocal Games across a Topological Phase Transition on a Quantum Computer
Hart, O., Stephen, D. T., Williamson, D. J., Foss‐Feig, M., & Nandkishore, R. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.130602 · Cited by 17
LHQNN: sequential and non-sequential layered hybrid quantum neural networks for image classification
Kabir, M., Kaosar, M. G., Laga, H., & Sohel, F. A. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00279-z · Cited by 13
An implementation of the finite element method in hybrid classical/quantum computers
Arora, A., Ward, B. M., & Oskay, C. (2025) · Finite Elements in Analysis and Design · doi:10.1016/j.finel.2025.104354 · Cited by 27
Diffusion-inspired quantum noise mitigation in parameterized quantum circuits
Nguyen, H.-Q., Nguyen, X.-B., Chen, S. Y.-C., Churchill, H., Borys, N. J., Khan, S. U., & Luu, K. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00276-2 · Cited by 23
Architectural patterns for designing quantum artificial intelligence systems
Klymenko, M. V., Hoang, T., Xu, X., Xing, Z., Usman, M., Lu, Q., & Zhu, L. (2025) · Journal of Systems and Software · doi:10.1016/j.jss.2025.112456 · Cited by 27
Quantum Reinforcement Learning for Cognitive Radio-Assisted UAV Traffic Offloading
He, Y., Huang, C., Yu, F. R., Liu, Z., & Zhou, G. (2025) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2025.3563372 · Cited by 12
Ma, Y., Wang, W., Mu, X., Cai, W., Hua, Z., Pan, X., Deng, D., Wu, R.-B., Zou, C., Wang, L., et al. (2025) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-025-2620-6 · Cited by 10
Shallow implementation of quantum fingerprinting with application to quantum finite automata
Ziatdinov, M., Khadieva, A., & Khadiev, K. R. (2025) · Frontiers in Computer Science · doi:10.3389/fcomp.2025.1519212 · Cited by 12
Bio-inspired cryptography based on proteinoid assemblies
Mougkogiannis, P., Ghadafi, E., & Adamatzky, A. (2025) · PLoS ONE · doi:10.1371/journal.pone.0324761 · Cited by 13
Mixed-state topological order parameters for symmetry-protected fermion matter
Huang, Z.-M., & Diehl, S. (2025) · Physical Review Research · doi:10.1103/h1qg-96kw · Cited by 20
Security Attacks Abusing Pulse-Level Quantum Circuits
Xu, C., & Szefer, J. M. (2025) · Springer eBooks · doi:10.1007/978-3-032-09303-5_11 · Cited by 30
Parallel structure of hybrid quantum–classical neural networks for image classification
Xu, Z., Hu, Y., Yang, T., Cai, P., Shen, K., Lv, B., Chen, S., Wang, J., Zhu, Y., Wu, Z., et al. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04813-7 · Cited by 13
Real-time scattering processes with continuous-variable quantum computers
Abel, S., Spannowsky, M., & Williams, S. (2025) · Physical Review A · doi:10.1103/q36d-w649 · Cited by 32
Chen, K., Burt, F., Yu, S., Liu, C.-Y., Hsieh, M.-H., & Leung, K. K. (2025) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas56072.2025.11043411 · Cited by 20
Many-body enhancement of energy storage in a waveguide QED quantum battery
Tirone, S., Andolina, G. M., Calajò, G., Giovannetti, V., & Rossini, D. (2025) · Physical Review A · doi:10.1103/c4hd-8vfj · Cited by 13
Huang, X., Xu, F., Zhu, W., Yao, L., He, J., Su, J., Zhao, W., & Hu, H. (2025) · BMC Medical Imaging · doi:10.1186/s12880-025-01813-y · Cited by 17
Dynamic roles and temporal evolution in innovation ecosystems: A case study of quantum technologies
Roshani, S. (2025) · Technological Forecasting and Social Change · doi:10.1016/j.techfore.2025.124281 · Cited by 11
A hybrid quantum neural network for split learning
Cowlessur, H., Thapa, C., Alpcan, T., & Camtepe, S. A. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00295-z · Cited by 20
Seifollahi, F., & Singh, C. (2025) · European Journal of Physics · doi:10.1088/1361-6404/ae0200 · Cited by 19
Pruned-ADAPT-VQE: Compacting Molecular Ansätze by Removing Irrelevant Operators
Vaquero-Sabater, N., Carreras, A., & Casanova, D. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c00535 · Cited by 26
Computation and machine learning for materials: Past, present, and future perspectives
Alosious, S., Jiang, M., & Luo, T. (2025) · MRS Bulletin · doi:10.1557/s43577-025-00959-y · Cited by 17
Akahoshi, Y., Toshio, R., Fujisaki, J., Oshima, H., Sato, S., & Fujii, K. (2025) · PRX Quantum · doi:10.1103/93zr-1ykb · Cited by 49
Really Small Shoe Boxes: On Realistic Quantum Resource Estimation
Paler, A., Herr, D., & Devitt, S. J. (2019) · Computer · doi:10.1109/mc.2019.2908621 · Cited by 10
Theory of quantum gravity information processing
Gyöngyösi, L., & Imre, S. (2019) · Quantum Engineering · doi:10.1002/que2.23 · Cited by 15
Measuring the Capabilities of Quantum Computers
Proctor, T. J., Rudinger, K., Nielsen, E., Young, K. C., & Blume-Kohout, R. (2021) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.5281/zenodo.5197499 · Cited by 13
A New Qubits Mapping Mechanism for Multi-programming Quantum Computing
Dou, X., & Liu, L. (2020) · International Conference on Parallel Architectures and Compilation Techniques (PACT) · doi:10.1145/3410463.3414659 · Cited by 19
Optical demonstration of quantum fault-tolerant threshold
Sun, K., Hao, Z.-Y., Wang, Y., Li, J.-K., Xu, X.-Y., Xu, J., Han, Y., Li, C., & Guo, G. (2022) · Light Science & Applications · doi:10.1038/s41377-022-00891-9 · Cited by 12
Quantum simulation of cosmic inflation
Liu, J., & Li, Y.-Z. (2021) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.104.086013 · Cited by 16
Training Hybrid Classical-Quantum Classifiers via Stochastic Variational Optimization
Nikoloska, I., & Simeone, O. (2022) · IEEE Signal Processing Letters · doi:10.1109/lsp.2022.3164852 · Cited by 13
Koh, D. E., Wang, G., Johnson, P. D., & Cao, Y. (2022) · Journal of Mathematical Physics · doi:10.1063/5.0042433 · Cited by 24
Quantum Computing Applications in Future Colliders
Gray, H. M., & Terashi, K. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.864823 · Cited by 18
Unsupervised learning of interacting topological and symmetry-breaking phase transitions
Kuo, E.-J., & Dehghani, H. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.235136 · Cited by 15
Quantum Fourier Convolutional Network
Shen, F., & Liu, J. (2023) · ACM Transactions on Multimedia Computing Communications and Applications · doi:10.1145/3514249 · Cited by 25
Yoshikawa, T., Takanashi, T., & Nakai, H. (2022) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.2c00602 · Cited by 14
Computing graph edit distance on quantum devices
Incudini, M., Tarocco, F., Mengoni, R., Pierro, A. D., & Mandarino, A. (2022) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00077-x · Cited by 12
Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms
Cortes, C. L., DePrince, A. E., & Gray, S. K. (2022) · Physical Review A · doi:10.1103/physreva.106.042409 · Cited by 16
Parameterized Two‐Qubit Gates for Enhanced Variational Quantum Eigensolver
Rasmussen, S. E., & Zinner, N. T. (2022) · Annalen der Physik · doi:10.1002/andp.202200338 · Cited by 12
Adaptive Compilation of Multi-Level Quantum Operations
Mato, K., Ringbauer, M., Hillmich, S., & Wille, R. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00070 · Cited by 18
Cavallaro, G., Riedel, M., Lippert, T., & Michielsen, K. F. L. (2022) · IEEE International Geoscience and Remote Sensing Symposium (IGARSS) · doi:10.1109/igarss46834.2022.9883225 · Cited by 10
Synergies Between Operations Research and Quantum Information Science
Parekh, O. (2023) · INFORMS journal on computing · doi:10.1287/ijoc.2023.1268 · Cited by 14
High-accuracy Hamiltonian learning via delocalized quantum state evolutions
Rattacaso, D., Passarelli, G., & Lucignano, P. (2023) · Quantum · doi:10.22331/q-2023-01-26-905 · Cited by 10
Recent progress in bio-voltage memristors working with ultralow voltage of biological amplitude
Fu, T., Fu, S., & Yao, J. (2023) · Nanoscale · doi:10.1039/d2nr06773k · Cited by 10
Simulating Majorana zero modes on a noisy quantum processor
Sung, K. J., Rančić, M. J., Lanes, O., & Bronn, N. T. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acb796 · Cited by 17
Schwinger model on an interval: Analytic results and DMRG
Okuda, T. (2023) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.107.054506 · Cited by 9
Characterization of variational quantum algorithms using free fermions
Matos, G., Self, C. N., Papić, Z., Meichanetzidis, K., & Dreyer, H. (2023) · Quantum · doi:10.22331/q-2023-03-30-966 · Cited by 25
Kawaguchi, H. (2023) · PLoS ONE · doi:10.1371/journal.pone.0283933 · Cited by 11
Information recoverability of noisy quantum states
Zhao, X., Zhao, B., Xia, Z., & Wang, X. (2023) · Quantum · doi:10.22331/q-2023-04-13-978 · Cited by 17
Quantum Similarity Testing with Convolutional Neural Networks
Wu, Y., Zhu, Y., Bai, G., Wang, Y., & Chiribella, G. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.210601 · Cited by 28
O’Meara, C., Fernández-Campoamor, M., Cortiana, G., & Bernabé-Moreno, J. (2023) · IEEE Conference on Technologies for Sustainability · doi:10.1109/sustech57309.2023.10129617 · Cited by 15
Measurement-based quantum simulation of Abelian lattice gauge theories
Sukeno, H., & Okuda, T. (2023) · SciPost Physics · doi:10.21468/scipostphys.14.5.129 · Cited by 15
Gavriel, J., Herr, D., Shaw, A., Bremner, M. J., Paler, A., & Devitt, S. J. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.033019 · Cited by 17
Efe, A. (2023) · Bilişim Teknolojileri Dergisi · doi:10.17671/gazibtd.1190670 · Cited by 11
Robustness of controlled Hamiltonian approaches to unitary quantum gates
Carolan, E., Çakmak, B., & Campbell, S. (2023) · Physical Review A · doi:10.1103/physreva.108.022423 · Cited by 9
SiGe Qubit Biasing with a Cryogenic CMOS DAC at mK Temperature
Schreckenberg, L., Otten, R., Vliex, P., Xue, R., Tu, J., Seidler, I., Trellenkamp, S., Schreiber, L. R., Bluhm, H., & van Waasen, S. (2023) · European Solid-State Circuits Conference (ESSCIRC) · doi:10.1109/esscirc59616.2023.10268801 · Cited by 9
Neural Networks with Variational Quantum Circuits
Rizvi, S. M. A., Ulum, M. S., Asif, N., & Shin, H. (2023) · Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering · doi:10.1007/978-3-031-47359-3_15 · Cited by 15
Machine Learning based Noise Characterization and Correction on Neutral Atoms NISQ Devices
Canonici, E., Martina, S., Mengoni, R., Ottaviani, D., & Caruso, F. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300192 · Cited by 19
The power of one clean qubit in supervised machine learning
Karimi, M., Javadi-Abhari, A., Simon, C., & Ghobadi, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-46497-y · 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.