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,701–3,800 of 8,640
Ground-state-energy calculation for the water molecule on a superconducting quantum processor
Jones, M. A., Vallury, H. J., & Hollenberg, L. C. L. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.064017 · Cited by 15
Dodin, A., Tscherbul, T. V., & Brumer, P. W. (2024) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.4c01621 · Cited by 7
Cui, Z., Jin, S., Sone, A., & Wang, X. (2024) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-024-2391-8 · Cited by 11
Efficient Encodings of the Travelling Salesperson Problem for Variational Quantum Algorithms
Schnaus, M., Palackal, L., Poggel, B., Runge, X., Ehm, H., Lorenz, J. M., & Mendl, C. B. (2024) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw62656.2024.00022 · Cited by 20
Martens, J., Kumara, I., Nucci, D. D., Pecorelli, F., Monsieur, G., Tamburri, D. A., & van den Heuvel, W. (2024) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2024.3493600 · Cited by 10
Problem-tailored Simulation of Energy Transport on Noisy Quantum Computers
Chen, I.-C., Pollock, K., Yao, Y., Orth, P. P., & Iadecola, T. (2024) · Quantum · doi:10.22331/q-2024-12-03-1545 · Cited by 9
Crognaletti, G., Bartolomeo, G. D., Vischi, M., & Viteritti, L. L. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad9be3 · Cited by 12
Quantum computer error structure probed by quantum error correction syndrome measurements
Gicev, S., Hollenberg, L. C. L., & Usman, M. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043249 · Cited by 20
Hybrid Quantum Deep Learning With Superpixel Encoding for Earth Observation Data Classification
Fan, F., Shi, Y., Guggemos, T., & Zhu, X. X. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2024.3518108 · Cited by 10
Designing fast quantum gates using optimal control with a reinforcement-learning ansatz
Sarma, B., & Hartmann, M. J. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.014015 · Cited by 10
An on-demand Resource Allocation Algorithm for a Quantum Network Hub and its Performance Analysis
Gauthier, S., Vasantam, T., & Vardoyan, G. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00204 · Cited by 8
Real World Application of Quantum-Classical Optimization for Production Scheduling
Awasthi, A., Kraus, N., Krellner, F., & Zambrano, D. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10285 · Cited by 15
QRLaXAI: quantum representation learning and explainable AI
Don, A. K. K., & Khalil, I. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00253-9 · Cited by 21
Kiser, M., Beuerle, M., & Šimkovic, F. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c01280 · Cited by 14
Hybrid Framework for Medical Image Classification: Integrating Quantum DE and Deep Learning
Dixit, A., Mani, A., & Gorbachev, S. V. (2024) · IEEE International Conference on Intelligent Signal Processing and Effective Communication Technologies (INSPECT) · doi:10.1109/inspect63485.2024.10896054 · Cited by 10
A hybrid qubit encoding: splitting Fock space into Fermionic and Bosonic subspaces
Santos, F. J. D. A., & Kottmann, J. S. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adbdee · Cited by 13
Quantum Federated Learning for Metaverse: Analysis, Design, and Implementation
Gurung, D., Pokhrel, S. R., & Li, G. (2025) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2025.3552307 · Cited by 27
Chatterjee, A., Rappaport, S., Giri, A., Johri, S., Proctor, T. J., Neira, D. E. B., Sathe, P., & Lubinski, T. (2025) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2025.3558090 · Cited by 21
Protocols and trade-offs of quantum state purification
Yao, H., Chen, Y.-A., Huang, E., Chen, K., Fu, H., & Wang, X. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/add17e · Cited by 24
Geometric correspondence of noisy quantum dynamics and universal robust quantum gates
Hai, Y.-J., Song, Y., Li, J., Zeng, J., & Deng, X. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.054002 · Cited by 21
Leveraging AI and ML for Enhanced Efficiency and Innovation in Manufacturing
Subrahmanyam, S. (2025) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-0442-7.ch021 · Cited by 7
QENN: breast cancer prediction using quantum-enhanced neural network
Dixit, V., & Rajkumar, K. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07331-6 · Cited by 7
Layer-Wise Security Framework and Analysis for the Quantum Internet
Yang, Z., Ghubaish, A., Jain, R. K., Al‐Fuqaha, A., Erbad, A., Kompella, R., Shapourian, H., & Nejabati, R. (2025) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2025.3568063 · Cited by 13
Nonvariational ADAPT algorithm for quantum simulations
Tang, H. L., Chen, Y., Biswas, P., Magann, A. B., Arenz, C., & Economou, S. E. (2025) · Physical Review Research · doi:10.1103/x8g1-7h1k · Cited by 16
QIoT: IoT Architectures in Quantum Computing Era
Alipour, M. (2025) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c65153.2025.00044 · Cited by 10
Quantum Artificial Intelligence: Unlocking the Future of Technology
Rajathi, G. I., Priya, L. R., Fernando, A. V., Vedhapriyavadhana, R., Sasindharan, S., & Mohanalin, J. (2025) · International Conference on Next Generation Communication & Information Processing (INCIP) · doi:10.1109/incip64058.2025.11019935 · Cited by 9
Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
Zhou, H., Duckering, C., Zhao, C., Bluvstein, D., Cain, M., Kubica, A., Wang, S.-T., & Lukin, M. D. (2025) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/3695053.3731039 · Cited by 75
Variational Quantum Regression Application in Modeling Monthly River Discharge
Liu, Z., & Bărbulescu, A. (2025) · Water · doi:10.3390/w17121836 · Cited by 8
Slysz, M., Grodzki, Ł., Rydlichowski, P., Siera, D., Kurowski, K., Waligóra, G., & Węglarz, J. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107934 · Cited by 11
Zappin, J., Stalnaker, T., Chaparro, O., & Poshyvanyk, D. (2025) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1109/icse55347.2025.00137 · Cited by 21
Toward quantum advantage with photonic state injection
Monbroussou, L., Mamon, E. Z., Thomas, H., Yacoub, V., Chabaud, U., & Kashefi, E. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.033051 · Cited by 25
ResQ: A hybrid classical-quantum model for efficient breast cancer image classification
Guha, D., Kuiry, S., Mitra, S., Bhattacharyya, S., & Das, N. (2025) · Applied Soft Computing · doi:10.1016/j.asoc.2025.113631 · Cited by 15
Revythi, M., & Κούκιου, Γ. (2025) · Machine Learning and Knowledge Extraction · doi:10.3390/make7030075 · Cited by 17
Quantum integration in swin transformer mitigates overfitting in breast cancer screening
Xie, Z., Yang, X., Zhang, S., Yang, J., Zhu, Y., Zhang, A., Sun, H., Dai, Q., Li, L., Liu, H., et al. (2025) · Scientific Reports · doi:10.1038/s41598-025-17075-1 · Cited by 8
Crippa, A., Romiti, S., Funcke, L., Jansen, K., Kühn, S., Stornati, P., & Urbach, C. (2025) · Communications Physics · doi:10.1038/s42005-025-02243-6 · Cited by 25
Gradient-descent methods for fast quantum state tomography
Gaikwad, A., Torres, M. S., Ahmed, S., & Kockum, A. F. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ae0baa · Cited by 23
Quantum Machine Learning for Detecting Known Cyber-Attacks in IoT Networks
Sudhakar, P., Ratnagiri, D., Bhargavi, C., Chittibabulu, S., Satyanarayana, G., & Mohammad, A. (2025) · International Conference on Inventive Systems and Control (ICISC) · doi:10.1109/icisc65841.2025.11188431 · Cited by 8
Quantum Computing for Genomics: Conceptual Challenges and Practical Perspectives
Maurizio, A., & Mazzola, G. (2025) · PRX Life · doi:10.1103/h49j-bsc6 · Cited by 23
A Survey of Quantum Deep Reinforcement Learning for Resource Allocation in Future Wireless Networks
Astiti, N. M. E. P., & Lee, B. M. (2025) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2025.3638435 · Cited by 18
Classical interfaces for controlling cryogenic quantum computing technologies
Brennan, J. C., Barbosa, J., Li, C., Ahmad, M., Imroze, F., Rose, C., Karar, W., Stanley, M., Heidari, H., Ridler, N., et al. (2025) · APL Quantum · doi:10.1063/5.0273490 · Cited by 23
TeleSABRE: Heuristic Layout Synthesis in Multi-Core Quantum Systems with Teleport Interconnect
Russo, E., Vinciguerra, E., Palesi, M., Patti, D., Ascia, G., & Catania, V. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00086 · Cited by 13
Terahertz 2D coherent spectroscopy for probing and controlling multicorrelations in quantum matter
Huang, C., Mootz, M., Luo, L., Perakis, I. E., & Wang, J. (2026) · Nature Reviews Physics · doi:10.1038/s42254-025-00917-2 · Cited by 12
Simulating fluid vortex interactions on a superconducting quantum processor
Wang, Z., Zhong, J., Wang, K., Zhu, Z., Bao, Z., Zhu, C., Zhao, W., Zhao, Y., Yang, Y., Song, C., et al. (2026) · Nature Communications · doi:10.1038/s41467-026-69168-8 · Cited by 15
Jawad, A., Stefan-Henningsen, E., & Kiani, A. (2026) · Next research. · doi:10.1016/j.nexres.2026.101532 · Cited by 15
Efficient two-qubit pulse sequences beyond CNOT
Zeuch, D., & Bonesteel, N. E. (2020) · Physical review. B./Physical review. B · doi:10.1103/physrevb.102.075311 · Cited by 11
Experimental cryptographic verification for near-term quantum cloud computing
Chen, X., Cheng, B., Li, Z., Nie, X., Yu, N., Yung, M., & Peng, X. (2020) · 中国科学通报:英文版 · doi:10.1016/j.scib.2020.08.013 · Cited by 16
Error-Divisible Two-Qubit Gates
Pérez, D. R., Varosy, P., Li, Z., Roy, T., Kapit, E., & Schuster, D. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.024043 · Cited by 14
Huang, Z., You, X., Alyanak, U., Romanenko, A., Grassellino, A., & Zhu, S. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.l061001 · Cited by 7
Realization of the Hadamard gate based on superposition of the composite solitons
Uthayakumar, T., & Khawaja, U. A. (2022) · Physics Letters A · doi:10.1016/j.physleta.2022.128451 · Cited by 7
Numerical simulations of noisy quantum circuits for computational chemistry
Wright, J., Gowrishankar, M., Claudino, D., Lotshaw, P. C., Nguyen, T., McCaskey, A., & Humble, T. S. (2022) · Materials Theory · doi:10.1186/s41313-022-00047-7 · Cited by 13
NISQ-Friendly Non-Linear Activation Functions for Quantum Neural Networks
Sajadimanesh, S., Faye, J. P. L., & Atoofian, E. (2022) · IEEE International Conference on Networking, Architecture and Storage (NAS) · doi:10.1109/nas55553.2022.9925456 · Cited by 8
SEQUENT: Towards Traceable Quantum Machine Learning Using Sequential Quantum Enhanced Training
Altmann, P. J., Sünkel, L., Stein, J., Müller, T., Roch, C., & Linnhoff–Popien, C. (2023) · International Conference on Agents and Artificial Intelligence (ICAART) · doi:10.5220/0011772400003393 · Cited by 14
Qian, Y., Guan, Z., Zheng, S., & Feng, S. (2023) · Entropy · doi:10.3390/e25030465 · Cited by 9
Performance of Grover’s search algorithm with diagonalizable collective noises
Pan, M., Xiong, T., & Zheng, S. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03994-3 · Cited by 8
Frequency–modulated qubits in a dissipative cavity: entanglement dynamics and protection
Nourmandipour, A., & Mortezapour, A. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03992-5 · Cited by 7
Parametrized Constant-Depth Quantum Neuron
de Carvalho, J. H. A., & Neto, F. M. D. P. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3290535 · Cited by 10
Flat-band quantum communication induced by disorder
Almeida, G. M. A., Dutra, R. F., Souza, A. M. C., Lyra, M. L., & de Moura, F. A. B. F. (2023) · Physical Review A · doi:10.1103/physreva.108.022407 · Cited by 8
Efficient variational quantum circuit structure for correlated topological phases
Sun, R.-Y., Shirakawa, T., & Yunoki, S. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.075127 · Cited by 17
HQ-Sim: High-performance State Vector Simulation of Quantum Circuits on Heterogeneous HPC Systems
Zhang, B., Fang, B., Guan, Q., Li, A., & Tao, D. (2023) · doi:10.1145/3588983.3596679 · Cited by 7
Multipartite entanglement and quantum error identification in D -dimensional cluster states
Sudevan, S., Azses, D., Torre, E. G. D., Sela, E., & Das, S. (2023) · Physical Review A · doi:10.1103/physreva.108.022426 · Cited by 8
Application of Quantum Genetic Algorithms to Network Signal Setting Design
Acampora, G., Chiatto, A., Luca, S. D., Pace, R. D., Massa, A. A., Schiattarella, R., & Vitiello, A. (2023) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec53210.2023.10254158 · Cited by 9
Characterizing arbitrary quantum networks in the noisy intermediate-scale quantum era
Xu, Z. (2023) · Physical Review A · doi:10.1103/physreva.108.l040201 · Cited by 8
An approach of a quantum-inspired document ranking algorithm by using feature selection methodology
Bhagawati, R., & Subramanian, T. (2023) · International Journal of Information Technology · doi:10.1007/s41870-023-01543-w · Cited by 9
Continuous-Variable Quantum Computation in Circuit QED
Pan, X., Song, P., & Gao, Y. Y. (2023) · Chinese Physics Letters · doi:10.1088/0256-307x/40/11/110303 · Cited by 8
Zhao, R.-S., 马, H.-Y. 鸿. M., 程, T. 涛. C., 王, S. 爽. W., & Fan, X. (2023) · Chinese Physics B · doi:10.1088/1674-1056/ad02e7 · Cited by 8
QREChem: quantum resource estimation software for chemistry applications
Otten, M., Kang, B., Fedorov, D. A., Lee, J., Benali, A., Habib, S., Gray, S. K., & Alexeev, Y. (2023) · Frontiers in Quantum Science and Technology · doi:10.3389/frqst.2023.1232624 · Cited by 14
Variational Methods in Optical Quantum Machine Learning
Simonetti, M., Perri, D., & Gervasi, O. (2023) · IEEE Access · doi:10.1109/access.2023.3335625 · Cited by 8
Towards Fidelity-Optimal Qubit Mapping on NISQ Computers
Khandavilli, S., Palanisamy, I., Nguyen, M. V., Le, T. V., Nguyen, T. N., & Dinh, T. N. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00019 · Cited by 9
Wolf, M.-O., Ewen, T., & Turkalj, I. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00070 · Cited by 10
Full State Quantum Circuit Simulation Beyond Memory Limit
Zhao, Y., Chen, Y., Li, H., Wang, Y., Chang, K., Wang, B., Li, B., & Han, Y. (2023) · doi:10.1109/iccad57390.2023.10323666 · Cited by 8
Fault-Tolerant Coding for Entanglement-Assisted Communication
Belzig, P., Christandl, M., & Müller‐Hermes, A. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3354319 · Cited by 16
Perturbative variational quantum algorithms for material simulations
Liu, J., Li, Z., & Yang, J. (2024) · Electronic Structure · doi:10.1088/2516-1075/ad2277 · Cited by 9
Lattice Hamiltonians and stray interactions within quantum processors
Xu, X., Manabputra, Vignes, C., Ansari, M. H., & Martinis, J. M. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.064030 · Cited by 16
Dynamical subset sampling of quantum error-correcting protocols
Heußen, S., Winter, D., Rispler, M., & Müller, M. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013177 · Cited by 19
Quantum radio astronomy: Data encodings and quantum image processing
Brunet, T., Tolley, E., Corda, S., Ilic, R., Broekema, P. C., & Kneib, J. (2024) · Astronomy and Computing · doi:10.1016/j.ascom.2024.100796 · Cited by 16
Quantum density estimation with density matrices: Application to quantum anomaly detection
Useche, D. H., Bustos-Brinez, O. A., Gallego-Mejia, J. A., & Gonzalez, F. A. (2024) · Physical Review A · doi:10.1103/physreva.109.032418 · Cited by 12
Spanning Tree Matching Decoder for Quantum Surface Codes
Forlivesi, D., Valentini, L., & Chiani, M. (2024) · IEEE Communications Letters · doi:10.1109/lcomm.2024.3396882 · Cited by 13
Hardware-efficient and fast three-qubit gate in superconducting quantum circuits
Li, X., Tao, Z., Yi, K., Luo, K., Zhang, L., Zhou, Y., Liu, S., Yan, T., Chen, Y., & Yu, D. (2024) · Frontiers of Physics · doi:10.1007/s11467-024-1405-8 · Cited by 10
Two-dimensional coherent spectrum of high-spin models via a quantum computing approach
Mootz, M., Orth, P. P., Huang, C., Luo, L., Wang, J., & Yao, Y. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad57ea · Cited by 11
Quantum model regression for generating fuzzy numbers in adiabatic quantum computing
Anjaria, K. (2024) · Information Sciences · doi:10.1016/j.ins.2024.121018 · Cited by 7
Generalized hydrodynamics of integrable quantum circuits
Hübner, F., Vernier, E., & Piroli, L. (2025) · SciPost Physics · doi:10.21468/scipostphys.18.4.135 · Cited by 16
Hayden-Preskill recovery in chaotic and integrable unitary circuit dynamics
Rampp, M. A., & Claeys, P. W. (2024) · Quantum · doi:10.22331/q-2024-08-08-1434 · Cited by 18
Deep-learning-based quantum algorithms for solving nonlinear partial differential equations
Mouton, L., Reiter, F., Chen, Y., & Rebentrost, P. (2024) · Physical Review A · doi:10.1103/physreva.110.022612 · Cited by 14
Quantum Lattice Enumeration in Limited Depth
Bindel, N., Bonnetain, X., Tiepelt, M., & Virdia, F. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-68391-6_3 · Cited by 11
REVOLUTIONIZING DATA PROCESSING: ADVANCED CLOUD COMPUTING AND AI SYNERGY FOR IOT INNOVATION
(2024) · International Research Journal of Modernization in Engineering Technology and Science · doi:10.56726/irjmets4578 · Cited by 10
Ji, Y., Koenig, K. F., & Polian, I. (2024) · Physical Review A · doi:10.1103/physreva.110.032421 · Cited by 12
Mapping quantum circuits to shallow-depth measurement patterns based on graph states
Kaldenbach, T. N., & Heller, M. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad802b · Cited by 23
Souto, R. S., & Aguado, R. (2024) · Lecture notes in physics · doi:10.1007/978-3-031-55657-9_3 · Cited by 39
Quantum Equation-of-Motion Method with Single, Double, and Triple Excitations
Zheng, Y., Sun, Z., Liu, J., Fan, Y., Li, Z., & Yang, J. (2024) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.4c01071 · Cited by 11
Effects of X X catalysts on quantum annealing spectra with perturbative crossings
Feinstein, N., Fry-Bouriaux, L., Bose, S., & Warburton, P. A. (2024) · Physical Review A · doi:10.1103/physreva.110.042609 · Cited by 23
Tuli, E. A., Lee, J., & Kim, D. (2024) · Scientific Reports · doi:10.1038/s41598-024-74213-x · Cited by 8
Analytical results for the quantum alternating operator ansatz with Grover mixer
Bridi, G. A., & Marquezino, F. D. L. (2024) · Physical Review A · doi:10.1103/physreva.110.052409 · Cited by 17
Open quantum dynamics with variational non-Gaussian states and the truncated Wigner approximation
Bond, L. J., Gerritsen, B., Minář, J., Young, J. T., Schachenmayer, J., & Safavi-Naini, A. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0226268 · Cited by 9
Surf-Deformer: Mitigating Dynamic Defects on Surface Code via Adaptive Deformation
Yin, K., Fang, X., Humble, T. S., Li, A., Shi, Y., & Ding, Y. (2024) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro61859.2024.00061 · Cited by 18
Quantum optimization with linear Ising penalty functions for customer data science
Mirkarimi, P., Shukla, I., Hoyle, D. C., Williams, R., & Chancellor, N. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043241 · Cited by 20
Efficient quantum algorithm for lattice protein folding
Wang, Y., & Zhou, X. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ada08e · Cited by 13
Discrete optimization: A quantum revolution?
Creemers, S., & Armas, L. F. P. (2024) · European Journal of Operational Research · doi:10.1016/j.ejor.2024.12.016 · Cited by 12
PARALLAX: A Compiler for Neutral Atom Quantum Computers under Hardware Constraints
Ludmir, J., & Patel, T. (2024) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41406.2024.00079 · Cited by 26
Quantum neural compressive sensing for ghost imaging
Zhai, X., Xiao, T., Huang, J., Fan, J., & Zeng, G. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.014018 · Cited by 12
Arai, D., Okada, K. N., Nakano, Y., Mitarai, K., & Fujii, K. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013035 · Cited by 18
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.