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 4,901–5,000 of 8,640
Random quantum circuits with time-reversal symmetry
Khanna, K., Kumar, A., Vasseur, R., & Ludwig, A. W. W. (2025) · Physical Review Research · doi:10.1103/4bgj-p2jk · Cited by 11
Breaking global symmetries with locality-preserving operations
Mazzoni, M., Capizzi, L., & Piroli, L. (2025) · Physical Review Research · doi:10.1103/gcjj-88j6 · Cited by 11
Xu, Y., Li, Z., Han, X., & Luo, R. (2025) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2025.111115 · Cited by 4
Jin, X. Y., Parrott, Z., Cicak, K., Kotler, S., Lecocq, F., Teufel, J., Aumentado, J., Kapit, E., & Simmonds, R. W. (2025) · Physical Review Applied · doi:10.1103/kmls-lgp5 · Cited by 24
Environment-induced transitions in many-body quantum teleportation
Zhou, S., Zhang, P., & Zf, Y. (2025) · Physical Review Research · doi:10.1103/j6j6-b3x8 · Cited by 9
Halab, K., Marzoug, N., Meslouhi, O. E., Elassad, Z. E. A., & Akhloufi, M. A. (2025) · Big Data and Cognitive Computing · doi:10.3390/bdcc10010012 · Cited by 3
Fermion Quantum Criticality far from Equilibrium
Mittal, R., Zander, T., Lang, J., & Diehl, S. (2026) · Physical Review X · doi:10.1103/nj2d-l6pz · Cited by 5
Quantum generative modeling for financial time series with temporal correlations
Dechant, D., Schwander, E., Drooge, L. V., Moussa, C., Garlaschelli, D., Dunjko, V., & Tura, J. (2026) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ae39a2 · Cited by 10
It's-A-Me, Quantum Mario: Scalable Quantum Reinforcement Learning with Multi-Chip Ensembles
Park, J., Tseng, H.-A., Yoo, S., Chen, S. Y.-C., & Cha, J. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00063 · Cited by 6
Thivyarathi, R. C., Pandi, V. S., Jubran, A. M., Bhardwaj, N., Jayalakshmi, D., & Dinesh, M. (2025) · International Conference on Smart Structures and Systems (ICSSS) · doi:10.1109/icsss66939.2025.11346156 · Cited by 3
Yohan, Irkham, Kurnia, I., Fransisca, N., Adisyahputra, & Hartati, Y. W. (2026) · Sensing and Bio-Sensing Research · doi:10.1016/j.sbsr.2026.100970 · Cited by 4
Komarsofla, M. K., & Kiani, A. (2026) · Journal of Energy Storage · doi:10.1016/j.est.2026.120939 · Cited by 11
Quantum Machine Learning in Medical Image Analysis: From Diagnostics to Surgery Planning
Sar, A., Kumar, A., Roy, S., Kaushish, A., Choudhury, T., Minakshi, Alqahtani, S. H., & Abraham, A. (2026) · IEEE Access · doi:10.1109/access.2026.3663498 · Cited by 7
Quantum circuit for implementing AES S-box with low costs
Chen, H.-N., Cai, B., Gao, F., & Lin, S. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05083-7 · Cited by 7
Chowdary, K. A. S. K. R., & Janani, T. (2026) · Applied Soft Computing · doi:10.1016/j.asoc.2026.114856 · Cited by 4
Slow growth of quantum nonstabilizerness in disorder-free Stark many-body localization
Li, H.-Z., Zhang, Y.-R., Zhao, Y.-J., Huang, X., & Zhong, J. (2026) · Physical review. B./Physical review. B · doi:10.1103/195d-r5j3 · Cited by 12
A Review of Formal Methods in Quantum-Circuit Verification
Govindankutty, A. (2026) · Electronics · doi:10.3390/electronics15051125 · Cited by 4
Quantum machine learning: A comprehensive survey of models, challenges, and future directions
Nadeem, L., Khokhar, A. M., Shaikh, M. F., et al. (2026) · Theoretical Computer Science · doi:10.1016/j.tcs.2026.115923 · Cited by 3
Khan, T. M., Haq, Q. E. U., Iqbal, S., & Soomro, T. A. (2026) · Engineering Applications of Artificial Intelligence · doi:10.1016/j.engappai.2026.114526 · Cited by 8
Quantum machine learning for industry 5.0: Fundamental, applications and research challenges
Ahmed, Z., Kakarla, J. H. H., Hazra, A., & Gurusamy, M. (2026) · Computer Science Review · doi:10.1016/j.cosrev.2026.100976 · Cited by 5
Quantum-Enhanced Cross-Attention for Multi-Modal Image-Text Retrieval
Rajaram, G., & Narayanan, M. S. (2026) · IEEE International Conference on Emerging Computing and Intelligent Technologies (ICoECIT) · doi:10.1109/icoecit68303.2026.11497070 · Cited by 3
Quantum-secured distributed measurement systems for critical infrastructures operations
Angrisani, L., D’Arco, M., D’Iorio, M., & Regio, F. L. (2026) · Measurement · doi:10.1016/j.measurement.2026.121738 · Cited by 3
Nonstabilizerness and Error Resilience in Noisy Quantum Circuits
Trigueros, F. B., & Guzmán, J. A. M. (2026) · Physical Review Letters · doi:10.1103/cbjz-x45n · Cited by 29
Antiflatness and nonlocal nonstabilizerness in two-particle scattering processes
Robin, C., & Savage, M. J. (2026) · Physical review. D/Physical review. D. · doi:10.1103/hvft-hk9p · Cited by 30
Wang, X., Feng, X., Funcke, L., Hartung, T., Jansen, K., Kühn, S., Polykratis, G., & Stornati, P. (2022) · International Symposium on Lattice Field Theory (LATTICE) · doi:10.22323/1.396.0603 · Cited by 4
Quantum Annealing in the NISQ Era: Railway Conflict Management
Domino, K., Koniorczyk, M., Krawiec, K., Jałowiecki, K., Deffner, S., & Gardas, B. (2023) · Entropy · doi:10.3390/e25020191 · Cited by 40
Optimized Quantum Program Execution Ordering to Mitigate Errors in Simulations of Quantum Systems
Tomesh, T., Gui, K., Gokhale, P., Shi, Y., Chong, F. T., Martonosi, M., & Suchara, M. (2021) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc53822.2021.00013 · Cited by 15
Design and Analysis of a Scalable and Efficient Quantum Circuit for LWE Matrix Arithmetic
Lu, C., Banerjee, U., & Basu, K. (2022) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd56317.2022.00026 · Cited by 3
Frame Synchronization for Quantum Key Distribution Systems
Mantey, S. T., Ramos, M. F., Silva, N. A., et al. (2022) · Globecom · doi:10.1109/globecom48099.2022.10000815 · Cited by 3
Variational quantum simulation of the critical Ising model with symmetry averaging
Sewell, T. J., Bao, N., & Jordan, S. P. (2023) · Physical Review A · doi:10.1103/physreva.107.042620 · Cited by 6
Degeneration of the Grover search algorithm with depolarization in the oracle-box wires
Rastegin, A. E., & Shemet, A. M. (2023) · Modern Physics Letters A · doi:10.1142/s021773232350030x · Cited by 3
Xu, L., & Freericks, J. K. (2023) · Symmetry · doi:10.3390/sym15071429 · Cited by 6
Isolated zero mode in a quantum computer from a duality twist
Samanta, S., Wang, D. S., Rahmani, A., & Mitra, A. (2025) · Quantum · doi:10.22331/q-2025-12-30-1957 · Cited by 8
Synergic quantum generative machine learning
Bartkiewicz, K., Tulewicz, P., Roik, J., & Lemr, K. (2023) · Scientific Reports · doi:10.1038/s41598-023-40137-1 · Cited by 9
Implementing CRYSTALS Kyber and Dilithium in Intel SGX Secure Enclaves
Pratiwi, N., Firmansyah, M., & Ezerman, M. F. (2023) · IEEE International Conference on Cryptography, Informatics, and Cybersecurity (ICoCICs) · doi:10.1109/icocics58778.2023.10277539 · Cited by 3
Quantum Deep Hyperspectral Satellite Remote Sensing
Lin, C.-H., & Chen, Y.-Y. (2023) · IEEE International Geoscience and Remote Sensing Symposium (IGARSS) · doi:10.1109/igarss52108.2023.10282472 · Cited by 4
Practical Applications of Quantum Computing
El‐Araby, E., Chaudhary, M., Islam, I., Levy, D., Kneidel, D., Jeng, M., Nobel, A., & Jha, V. (2023) · IntechOpen eBooks · doi:10.5772/intechopen.1003033 · Cited by 3
Variational Quantum Computation Integer Factorization Algorithm
Zhang, X., & Zhang, F. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-023-05473-y · Cited by 4
The Stability of Matrix Multiplicative Weights Dynamics in Quantum Games
Lotidis, K., Mertikopoulos, P., & Bambos, N. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10384169 · Cited by 3
QPLEX: Realizing the Integration of Quantum Computing into Combinatorial Optimization Software
Giraldo, J., Ossorio, J., Villegas, N. M., Tamura, G., & Stege, U. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00118 · Cited by 5
Random projection using random quantum circuits
Kumaran, K., Sajjan, M., Oh, S., & Kais, S. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013010 · Cited by 8
Information scrambling and entanglement in quantum approximate optimization algorithm circuits
Qian, C., Zhuang, W.-F., Guo, R.-C., Hu, M., & Liu, D. E. (2024) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-023-04801-9 · Cited by 4
Spatial inversion symmetry breaking of vortex current in a biased-ladder superfluid
Huang, W., & Yao, Y. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013037 · Cited by 3
Optimal Clifford Initial States for Ising Hamiltonians
Bhattacharyya, B., & Ravi, G. S. (2023) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc60800.2023.10386971 · Cited by 9
Intermediate qutrit-assisted Toffoli gate decomposition with quantum error correction
Majumdar, R., Saha, A., Chakrabarti, A., & Sur‐Kolay, S. (2024) · Quantum Information Processing · doi:10.1007/s11128-023-04251-3 · Cited by 4
Probabilistic tensor optimization of quantum circuits for the max−k−cut problem
Paradezhenko, G. V., Pervishko, A. A., & Yudin, D. (2024) · Physical Review A · doi:10.1103/physreva.109.012436 · Cited by 4
Dynamic Transitive Closure-based Static Analysis through the Lens of Quantum Search
Ren, J., Sui, Y., Cheng, X. Y., Feng, Y., & Zhao, J. (2024) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3644389 · Cited by 5
A simplified Mølmer–Sørensen gate for the trapped ion quantum computer
Azuma, H. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad2da0 · Cited by 5
Twisty-puzzle-inspired approach to Clifford synthesis
Bao, N., & Hartnett, G. S. (2024) · Physical Review A · doi:10.1103/physreva.109.032409 · Cited by 9
Multiple classical noise mitigation by multiobjective robust quantum optimal control
Shao, B., Yang, X., Liu, R., Zhai, Y., Lu, D., Xin, T., & Li, J. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.034042 · Cited by 9
Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state
Guba, Z., Finta, I., Budai, Á., Farkas, L., Zimborás, Z., & Pályi, A. (2024) · Quantum · doi:10.22331/q-2024-04-30-1324 · Cited by 4
Sakurai, R., Backhouse, O. J., Booth, G. H., Mizukami, W., & Shinaoka, H. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023110 · Cited by 5
Optimal compression of constrained quantum time evolution
Tepaske, M. S. J., Luitz, D. J., & Hahn, D. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.205134 · Cited by 8
Non‐Markovian Cost Function for Quantum Error Mitigation
Ahn, D., & Park, B. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300138 · Cited by 6
QM-DLA: an efficient qubit mapping method based on dynamic look-ahead strategy
Liu, H., Zhang, B., Zhu, Y., Yang, H., & Zhao, B. (2024) · Scientific Reports · doi:10.1038/s41598-024-64061-0 · Cited by 5
Zhang, Y., & Dziarmaga, J. (2024) · Physical review. B./Physical review. B · doi:10.1103/physrevb.109.235124 · Cited by 7
Estimating Coherent Contributions to the Error Profile Using Cycle Error Reconstruction
Carignan-Dugas, A., Ranu, S. K., & Dreher, P. (2024) · Quantum · doi:10.22331/q-2024-06-13-1367 · Cited by 11
Advance Quanvolutional Layers in Quantum Classical Hybrid Neural Networks for Image Processing
Singhal, P., & Joshi, P. (2024) · International Conference on Control, Automation and Robotics (ICCAR) · doi:10.1109/iccar61844.2024.10569440 · Cited by 3
Adaptive diversity-based quantum circuit architecture search
Huang, Y., Jin, S., Zeng, B., & Shao, Q. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033033 · Cited by 11
Optimizing Supply Chain Efficiency and Transparency Through Quantum Computing Technologies
Jain, V. K., & Mitra, A. (2024) · Advances in logistics, operations, and management science book series · doi:10.4018/979-8-3693-4107-0.ch016 · Cited by 4
Liu, W., Li, Y.-Z., Yin, H.-W., Wang, Z.-R., & Wu, J. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00259-5 · Cited by 3
Universal framework for simultaneous tomography of quantum states and SPAM noise
Jayakumar, A., Chessa, S., Coffrin, C., Lokhov, A. Y., Vuffray, M., & Misra, S. (2024) · Quantum · doi:10.22331/q-2024-07-30-1426 · Cited by 16
Kuo, S., Hua, C.-Y., Hsu, E.-T., et al. (2024) · Proceedings of ... IEEE International Conference on Fuzzy Systems · doi:10.1109/fuzz-ieee60900.2024.10612170 · Cited by 3
Kaushik, P., Vu, N., Yeung, C., Sorak, N., Khazaei, P., Cabral, D. G. A., Allen, B., Venkatesh, V., Boyle, L. K., Batista, V. S., et al. (2024) · IEEE Integrated STEM Education Conference (ISEC) · doi:10.1109/isec61299.2024.10665296 · Cited by 3
Cambiucci, W., Silveira, R. M., & Ruggiero, W. V. (2024) · doi:10.5753/wqunets.2024.2857 · Cited by 4
Quantum Tunneling: From Theory to Error‐Mitigated Quantum Simulation
Catrina, S., & Băicoianu, A. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202400163 · Cited by 3
Gulania, S., Gray, S. K., Alexeev, Y., Peng, B., & Govind, N. (2024) · Electronic Structure · doi:10.1088/2516-1075/ad839b · Cited by 5
Research Versus Practice in Quantum Software Engineering: Experiences From Credit Scoring Use Case
Liimatta, P., Taipale, P., Halunen, K., Heinosaari, T., Mikkonen, T., & Stirbu, V. (2024) · IEEE Software · doi:10.1109/ms.2024.3427168 · Cited by 3
Vandelli, M., Lignarolo, A., Cavazzoni, C., & Dragoni, D. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04560-1 · Cited by 6
QUBO formulation for aircraft load optimization
Gatti, L., Sotelo, R., Orihuela, J.-D., Gibert, D., D’ambrosio, R., & Fuidio, F. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04569-6 · Cited by 4
Yang, Y., Yang, R., & Xu, X. (2024) · Physical Review A · doi:10.1103/physreva.110.042623 · Cited by 4
Bouchmal, O., Cimoli, B., Stabile, R., Olmos, J. J. V., Hernández-Chulde, C., Martínez, R., Casellas, R., & Monroy, I. T. (2024) · Photonics · doi:10.3390/photonics11111023 · Cited by 5
Quantum Machine Learning Compiler for Hybrid Quantum-Classical Models
Srinidhi, S. K., Vishal, K. S., Shashank, U. S., & Belwal, M. (2024) · International Conference on Computing, Communication and Networking Technologies (ICCCNT) · doi:10.1109/icccnt61001.2024.10725839 · Cited by 3
A dynamic semi-quantum private comparison protocol for size relations
Ye, C., Chen, X., & Li, J. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad8e9b · Cited by 3
Exploring the Potential of Dynamic Quantum Circuit for Improving Device Scalability
Kole, A., Datta, K., & Drechsler, R. (2024) · IEEE International System-on-Chip Conference (SOCC) · doi:10.1109/socc62300.2024.10737830 · Cited by 3
Simulating quantum chaos on a quantum computer
Anand, A. K., Srivastava, S., Gangopadhyay, S., & Ghose, S. (2024) · Scientific Reports · doi:10.1038/s41598-024-76448-0 · Cited by 15
A quantum-search-based multi-classifier for image recognition
Liu, L., Wu, X., Zhang, L., & Wang, C. (2024) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-024-2488-5 · Cited by 3
Simulation of the 1d XY model on a quantum computer
Farreras, M., & Cervera-Lierta, A. (2025) · SciPost Physics Lecture Notes · doi:10.21468/scipostphyslectnotes.95 · Cited by 8
Sarcopenia risk prediction and feature selection by using quantum machine learning algorithms
Ullah, U., Maheshwari, D., Castillo-Olea, C., & García-Zapirain, B. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00218-4 · Cited by 3
Generalized phase estimation in noisy quantum gates
Ragazzi, G., Cavazzoni, S., Bordone, P., & Paris, M. G. A. (2024) · Physical Review A · doi:10.1103/physreva.110.052425 · Cited by 4
Proximal quantum control of spin and spin ensemble with localized control field from skyrmions
Chowdhury, M. F. F., Niknam, M., Rajib, M. M., Bouchard, L., & Atulasimha, J. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.064077 · Cited by 6
Assessing the Role of Communication in Scalable Multi-Core Quantum Architectures
Palesi, M., Russo, E., Patti, D., Ascia, G., & Catania, V. (2024) · IEEE International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC) · doi:10.1109/mcsoc64144.2024.00085 · Cited by 7
Flexible Type-Based Resource Estimation in Quantum Circuit Description Languages
Colledan, A., & Lago, U. D. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3704883 · Cited by 17
Cut&Shoot: Cutting & Distributing Quantum Circuits Across Multiple NISQ Computers
Bisicchia, G., Bocci, A., García-Alonso, J. M., Murillo, J. M., & Brogi, A. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10276 · Cited by 14
Benchmarking Optimizers for Qumode State Preparation with Variational Quantum Algorithms
Kan, S., Palma, M., Du, Z., Stein, S. A., Liu, C., Chen, J., Li, A., & Mao, Y. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00182 · Cited by 11
Evolutionary-enhanced quantum supervised learning model
Simen, A., Bloot, R., Pires, O. M., & Nascimento, E. G. S. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-024-06875-3 · Cited by 5
Bharti, S., Lo, D. C.-T., & Shi, Y. (2024) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata62323.2024.10826002 · Cited by 3
The AI and Quantum Era: Transforming Project Management Practices
Aliyev, A. (2025) · Journal of Future Artificial Intelligence and Technologies · doi:10.62411/faith.3048-3719-59 · Cited by 8
Sampling electronic Fock states using determinant quantum Monte Carlo
Ding, S., Li, S., & Wang, Y. (2025) · Communications Physics · doi:10.1038/s42005-025-01963-z · Cited by 6
Deterministic quantum partial search for target states with proportion 1/16
Ye, S.-M., & Wang, Y.-L. (2025) · Physics Letters A · doi:10.1016/j.physleta.2025.130325 · Cited by 3
Time Series Forecasting Using Quantum Machine Learning Algorithms
Latheef, F. N., & Rubell Marion Lincy, G. (2025) · Algorithms for intelligent systems · doi:10.1007/978-981-97-6957-5_16 · Cited by 4
Application of large language models to quantum state simulation
Zhou, S., Chen, R., An, Z., Zhang, C., & Hou, S. (2025) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-024-2598-y · Cited by 18
Predicting three-dimensional chaotic systems with four qubit quantum systems
Steinegger, J., & Rath, C. W. (2025) · Scientific Reports · doi:10.1038/s41598-025-87768-0 · Cited by 11
Programming an optical lattice interferometer
Seifert, L. M., Colussi, V. E., Perlin, M. A., Gokhale, P., & Chong, F. T. (2025) · Materials Today Quantum · doi:10.1016/j.mtquan.2025.100026 · Cited by 3
Cylindrical and Möbius Quantum Codes for Asymmetric Pauli Errors
Valentini, L., Forlivesi, D., & Chiani, M. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3546769 · Cited by 6
Atom-Mediated Deterministic Generation and Stitching of Photonic Graph States
Aqua, Z., & Dayan, B. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.010340 · Cited by 11
Quantum Differential Privacy in the Local Model
Angrisani, A., & Kashefi, E. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3552671 · Cited by 21
Tarocco, F., Materia, D., Ratini, L., & Guidoni, L. (2025) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/adc4a1 · Cited by 5
Learning Robust Observable to Address Noise in Quantum Machine Learning
Khanal, B., & Rivas, P. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-85884-0_4 · Cited by 6
Learning equivariant maps with variational quantum circuits
Bradshaw, Z. P., Evans, E. N., Cook, M., & LaBorde, M. L. (2025) · Physical Review Applied · doi:10.1103/physrevapplied.23.044007 · Cited by 7
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.