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,501–4,600 of 8,640
Quantum architecture search with neural predictor based on ZX-calculus
Li, S., Tsukayama, D., Shirakashi, J., Shibuya, T., & Imai, H. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00410-w · Cited by 10
Quantum fuzzy logic for edge detection: A demonstration on NISQ hardware
Nunziata, G., Crisci, S., Gregorio, G. D., Schiattarella, R., Acampora, G., Coraggio, L., & Itaco, N. (2025) · Applied Soft Computing · doi:10.1016/j.asoc.2025.113866 · Cited by 5
Carcass and meat quality and innovation in fresh meat industry
Kongsro, J., Skramstad, T. E. B., & Alvseike, O. A. (2025) · Meat Science · doi:10.1016/j.meatsci.2025.109960 · Cited by 4
Improving qubit reduction for molecular simulations with randomized orbital sampling
Darmawan, Y. A., Fauzi, A. D., Sarwono, Y. P., & Zhang, R. Q. (2025) · AAPPS bulletin · doi:10.1007/s43673-025-00167-5 · Cited by 6
Stacking the odds: full-stack quantum system design space exploration
Safi, H., Bandić, M., Niedermeier, C. A., Almudéver, C. G., Feld, S., & Mauerer, W. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00413-7 · Cited by 7
Guo, Y., Ding, K., & Yang, S. (2025) · Reports on Progress in Physics · doi:10.1088/1361-6633/ae199b · Cited by 25
Large-Scale Efficient Molecule Geometry Optimization with Hybrid Quantum–Classical Computing
Hao, Y., Ding, Q.-M., Wang, X., & Yuan, X. (2026) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c01435 · Cited by 9
Katırcı, R., Aasim, M., Aadil, F., & Chohan, R. T. (2025) · BMC Plant Biology · doi:10.1186/s12870-025-07555-x · Cited by 4
Shen, R., Chen, T., Yang, B., Zhong, Y., & Lee, C. H. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01122-w · Cited by 28
Olushola, A., & Meenakshi, S. P. (2025) · Frontiers in Blockchain · doi:10.3389/fbloc.2025.1713637 · Cited by 8
General, Efficient, and Robust Hamiltonian Engineering
Baßler, P., Heinrich, M., & Kliesch, M. (2025) · PRX Quantum · doi:10.1103/9yxv-tdqr · Cited by 9
Constructing Optimal Noise Channels for Enhanced Robustness in Quantum Machine Learning
Winderl, D., Franco, N., & Lorenz, J. M. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00174 · Cited by 5
Efficient quantum simulation of non-adiabatic molecular dynamics with precise electronic structure
Li, T., Zeng, Y., Ding, Q.-M., Huo, Z., Xu, X., Ren, J., Tang, D., Cai, X., & Yuan, X. (2026) · Digital Discovery · doi:10.1039/d5dd00433k · Cited by 5
Machine learning non-Markovian two-level quantum noise spectroscopy
Scarpetta, J. M., Reina, J. H., & Hjorth-Jensen, M. (2025) · Physical Review Research · doi:10.1103/2lzl-vpjd · Cited by 6
Comparison of variational quantum eigensolvers in light nuclei
Carrasco-Codina, M., Costa, E., Romero, A. M., Menéndez, J., & Rios, A. (2025) · Physical Review C · doi:10.1103/17n2-xh6k · Cited by 18
Adaptive Job Scheduling in Quantum Clouds Using Reinforcement Learning
Luo, W., Zhao, J., Zhan, T., & Guan, Q. (2025) · Proceedings of the International Conference on Parallel Processing · doi:10.1145/3754598.3754641 · Cited by 17
Key Quantum Algorithms: Shor’s, Grover’s, and Applications
Upoma, K. S. H., & Bhalekar, O. A. (2026) · Springer eBooks · doi:10.1007/978-3-032-10775-6_4 · Cited by 4
de Lima, A. M., Teixeira, E. S., Silva, E. D. R. D. A., & Longo, R. L. (2026) · Journal of Computational Chemistry · doi:10.1002/jcc.70289 · Cited by 5
Efficient compilation of quantum circuits using multi-qubit gates
Nemirovsky, J., Chuchem, M., & Shapira, Y. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae36cc · Cited by 17
The Grover Dilemma and Three Fundamental Barriers to Oracle-Based Quantum Search Algorithms
Liu, Y. (2026) · Journal of Quantum Information Science · doi:10.4236/jqis.2026.161002 · Cited by 5
Toward next-generation machine learning and deep learning for spatial omics
Zirem, Y., Fournier, I., & Salzet, M. (2026) · Briefings in Bioinformatics · doi:10.1093/bib/bbag131 · Cited by 6
Fingerprinting Quantum Computer Equipment
Morris, J., Abedin, A., Xu, C., & Szefer, J. M. (2023) · ACM Great Lakes Symposium on VLSI (GLSVLSI) · doi:10.1145/3583781.3590247 · Cited by 10
Calculation of partition function of Ising model on quantum computer
Laba, H. P., & Tkachuk, V. M. (2023) · Physics Letters A · doi:10.1016/j.physleta.2023.129213 · Cited by 4
Routing Strategy for Distributed Quantum Circuit based on Optimized Gate Transmission Direction
Chen, Z., Chen, X., Jiang, Y., Cheng, X., & Guan, Z. (2023) · International Journal of Theoretical Physics · doi:10.1007/s10773-023-05489-4 · Cited by 4
A Substrate Scheduler for Compiling Arbitrary Fault-Tolerant Graph States
Liu, S., Benchasattabuse, N., Morgan, D. Q., Hajdušek, M., Devitt, S. J., & Meter, R. V. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00101 · Cited by 13
Computing electronic correlation energies using linear depth quantum circuits
Chee, C. H., Mak, A. M., Leykam, D., Barkoutsos, P. K., & Angelakis, D. G. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad1f3a · Cited by 7
Hamilton-Jacobi-Bellman equations for Rydberg-blockade processes
Fromonteil, C., Tricarico, R., Cesa, F., & Pichler, H. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033333 · Cited by 17
Quantum circuit optimization of an integer divider
Orts, F. J., Paulavičius, R., & Filatovas, E. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112091 · Cited by 11
Holonomic swap and controlled-swap gates of neutral atoms via selective Rydberg pumping
Sun, C., Chen, X. Y., Mu, W. L., Wang, G. C., You, J.-B., & Shao, X. Q. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00246-w · Cited by 6
Wang, A., Zhang, J., & Zou, S. (2024) · AIP Advances · doi:10.1063/5.0207981 · Cited by 4
Towards Continuous Development for Quantum Programming in Decentralized IoT environments
Kourtis, M., Tcholtchev, N., Gheorghe-Pop, I.-D., et al. (2024) · Procedia Computer Science · doi:10.1016/j.procs.2024.05.190 · Cited by 4
Error mitigation in variational quantum eigensolvers using tailored probabilistic machine learning
Jiang, T., Rogers, J., Frank, M. S., Christiansen, O., Yao, Y., & Lanatà, N. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033069 · Cited by 23
A Layerwise-Multi-Angle Approach to Fine-Tuning the Quantum Approximate Optimization Algorithm
Lavagna, L., Ceschini, A., Rosato, A., & Panella, M. (2024) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn60899.2024.10650075 · Cited by 6
Quantum-inspired clustering with light
Varga, J. J. M., Bermejo, P., Pellicer-Guridi, R., Orús, R., & Molina‐Terriza, G. (2024) · Scientific Reports · doi:10.1038/s41598-024-73053-z · Cited by 5
Shadow Simulation of Quantum Processes
Zhao, X., Wang, X., & Chiribella, G. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.120804 · Cited by 8
Tolstobrov, A., Kadyrmetov, S., Fedorov, G., Sanduleanu, S. V., Lubsanov, V. B., Kalacheva, D. A., Bolgar, A. N., Dmitriev, A. Y., Korostylev, E. V., Tikhonov, K. S., et al. (2024) · Radiophysics and Quantum Electronics · doi:10.1007/s11141-024-10342-7 · Cited by 4
Gong, C., Wen, Z.-Y., Deng, Y.-W., Zhou, N., & Zeng, Q.-W. (2024) · Laser Physics Letters · doi:10.1088/1612-202x/ad8742 · Cited by 6
Error filtration for quantum sensing via interferometry
Huang, Z., & Lupo, C. (2024) · Physical Review A · doi:10.1103/physreva.110.052431 · Cited by 4
Simulation of a Rohksar–Kivelson ladder on a NISQ device
Gupta, S., Javanmard, Y., Osborne, T. J., & Santos, L. (2024) · Scientific Reports · doi:10.1038/s41598-024-79480-2 · Cited by 5
Lu, B.-H., Wang, P., Chen, Z., Liu, H., Sun, T., Duan, P., Wu, Y.-C., & Guo, G. (2024) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2024.3507580 · Cited by 9
Accurate numerical simulations of open quantum systems using spectral tensor trains
Grimm, R. T., & Eaves, J. D. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0228873 · Cited by 9
Chiatto, A., Alizadeh, A., Acampora, G., et al. (2024) · Advances in intelligent systems and computing · doi:10.1007/978-3-031-78857-4_23 · Cited by 4
One-Time Compilation of Device-Level Instructions for Quantum Subroutines
Dalvi, A. S., Whitlow, J., D’Onofrio, M., Riesebos, L., Chen, T., Phiri, S., Brown, K. R., & Baker, J. M. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00107 · Cited by 11
Quantum Circuit Complexity as a Physical Observable
Nye, L. (2025) · Journal of Applied Mathematics and Physics · doi:10.4236/jamp.2025.131004 · Cited by 4
Joint Wire Cutting with Non‐Maximally Entangled States
Bechtold, M., Barzen, J., Leymann, F., Mandl, A., & Truger, F. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202400555 · Cited by 7
Low-fidelity entanglement distillation with FIMAX
Popp, C., Sutter, T. C., & Hiesmayr, B. C. (2025) · International Journal of Quantum Information · doi:10.1142/s0219749925500170 · Cited by 6
A Power Monitoring Framework of a Post-quantum Cryptography Web Server
Castiglione, A., Loia, V., & Volpe, A. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-1548-3_15 · Cited by 4
Barletta, V. S., Caivano, D., Pal, A., Scalera, M., & Martin, M. A. S. (2025) · Journal of Software Evolution and Process · doi:10.1002/smr.70005 · Cited by 7
Chen, Z., Guan, Z., 赵, S. 书. Z., et al. (2025) · Chinese Physics B · doi:10.1088/1674-1056/adbada · Cited by 4
Quantum Computing and Nuclear Fusion
Ramesh, S. (2025) · Springer eBooks · doi:10.1007/978-3-031-84185-9_2 · Cited by 4
Saini, R., Mani, A., Prasad, M. S., Bhattacharyya, S., & Platoš, J. (2025) · IEEE Access · doi:10.1109/access.2025.3554690 · Cited by 9
Engineering tunable decoherence-free subspaces with collective atom-cavity interactions
Vaecairn, L. H. C., Reilly, J., Wilson, J. D., Jäger, S. B., & Holland, M. (2025) · Physical Review A · doi:10.1103/physreva.111.033718 · Cited by 4
Llorens, S., González, W., Sentís, G., et al. (2025) · Quantum · doi:10.22331/q-2025-04-03-1687 · Cited by 4
Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization
Nakada, H., Tanahashi, K., & Tanaka, S. (2025) · IEEE Access · doi:10.1109/access.2025.3563960 · Cited by 7
Lins, I. D., Araújo, L. M. M., Maior, C. B. S., Teixeira, E. S., Bezerra, P. T. L., Moura, M. J. D. C., & Droguett, E. L. (2025) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2025.111153 · Cited by 5
Rauch, J., Rontani, D., & Vialle, S. (2025) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2025.103431 · Cited by 4
Quantum Computing: Opportunities and Threats for Cybersecurity
Mummadi, S., & Fathima, S. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-1370-2.ch022 · Cited by 4
Kanasugi, S., Hidaka, Y., Nakagawa, Y. O., Tsutsui, S., Matsumoto, N., Maruyama, K., Oshima, H., & Sato, S. (2025) · Physical Review Research · doi:10.1103/kb94-tf7t · Cited by 8
Wang, K., & Li, X. (2025) · Physical Review A · doi:10.1103/db4q-8ny9 · Cited by 11
Balancing communication overhead and accuracy in compression integration: a survey
Yang, A., Liu, J., Yang, B., Mo, Z., & Li, K. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07451-z · Cited by 9
Quantum parallel information exchange (QPIE) hybrid network with transfer learning
Guo, Z., Khan, A., Sheng, V. S., Jabeen, S., & Pan, Z. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ade89f · Cited by 9
Quantum computing of Hückel molecular orbitals of linear polyenes
Ato, Y., Tachikawa, Y., Yoshida, R., Lötstedt, E., & Yamanouchi, K. (2025) · Chemical Physics Letters · doi:10.1016/j.cplett.2025.142276 · Cited by 4
A systematic review of strategic approaches and applications in quantum computing
Sharma, N. V., & Saxena, V. (2025) · Optical and Quantum Electronics · doi:10.1007/s11082-025-08364-0 · Cited by 5
Neural Quantum Embedding via Deterministic Quantum Computation with One Qubit
Liu, H., Hur, T., Zhang, S., Che, L., Long, X., Wang, X., Huang, K., Fan, Y.-A., Zheng, Y., Feng, Y., et al. (2025) · Physical Review Letters · doi:10.1103/y8wr-yml4 · Cited by 15
Quantum approaches for inference and decision-making in quantum multi-agent frameworks
Shi, H. J., Zhang, M., Chen, H., Han, J., & Hu, D. (2025) · The European Physical Journal Special Topics · doi:10.1140/epjs/s11734-025-01874-8 · Cited by 4
VAE-QWGAN: addressing mode collapse in quantum GANs via autoencoding priors
Thomas, A. M., Youel, H., & Jose, S. T. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00314-z · Cited by 16
Noisy quantum trees: infinite protection without correction
Yadavalli, S. A., & Marvian, I. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00961-x · Cited by 11
Mohammadipour, P., & Li, X. (2025) · Quantum · doi:10.22331/q-2025-11-14-1909 · Cited by 25
Contextual quantum neural networks for stock price prediction
Mourya, S., Leipold, H., & Adhikari, B. (2026) · Scientific Reports · doi:10.1038/s41598-025-34413-5 · Cited by 19
Zwanenburg, M. F. S., Singh, S., Huang, E. Y., Yilmaz, F., Stefanski, T. V., Hu, J., Kumaravadivel, P., & Andersen, C. K. (2025) · Physical Review Research · doi:10.1103/z62h-kcnh · Cited by 14
SWAP-less implementation of quantum algorithms
Klaver, B., Rombouts, S. M. A., Fellner, M., Messinger, A., Ender, K., Ludwig, K., & Lechner, W. (2025) · Physical Review A · doi:10.1103/2wzk-fnhx · Cited by 15
Cutting is All You Need: Execution of Large-Scale Quantum Neural Networks on Limited-Qubit Devices
Marchisio, A., Sychiuco, E., Kashif, M., & Shafique, M. (2025) · IEEE International Conference on Quantum Artificial Intelligence (QAI) · doi:10.1109/qai63978.2025.00058 · Cited by 22
Efficient Algorithms for Quantum Hashing
Zinnatullin, I., & Khadiev, K. R. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-15641-9_21 · Cited by 5
Quantum gates by resonantly driving many-body eigenstates, with a focus on Polychronakos’ model
Groenland, K., & Schoutens, K. (2019) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/ab25e2 · Cited by 5
Iizuka, S., Asai, H., Kato, K., Hattori, J., Fukuda, K., & Mori, T. (2020) · Applied Physics Express · doi:10.35848/1882-0786/abc469 · Cited by 4
Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits
Koch, D., Samodurov, M., Projansky, A. M., & Alsing, P. M. (2022) · International Journal of Quantum Information · doi:10.1142/s021974992150043x · Cited by 11
Composable Programming of Hybrid Workflows for Quantum Simulation
Nguyen, T., Oftelie, L. B., Lyakh, D. I., McCaskey, A., Leyton‐Ortega, V., Pooser, R. C., Elwasif, W. R., Humble, T. S., & de Jong, W. A. (2021) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c52384.2021.00028 · Cited by 5
Kuantum Kriptolojisi ve Siber Güvenlik
Çelik, S. (2021) · Bilişim Teknolojileri Dergisi · doi:10.17671/gazibtd.733309 · Cited by 5
From Classical to Quantum: A Review of Recent Progress in Reinforcement Learning
Kashyap, K., Lalit, Shah, D., & Gautam, L. (2021) · International Conference for Emerging Technology (INCET) · doi:10.1109/incet51464.2021.9456218 · Cited by 6
Entropy analysis of the discrete-time quantum walk under bit-flip noise channel
Ishak, N. I., Muniandy, S. V., & Chong, W. Y. (2021) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2021.126371 · Cited by 18
Quantum State Preparation for the Schwinger Model
Pederiva, G., Bazavov, A., Henke, B., Hostetler, L., Lee, D., Lin, H.-W., & Shindler, A. (2022) · International Symposium on Lattice Field Theory (LATTICE) · doi:10.22323/1.396.0047 · Cited by 14
QuOp_MPI: A framework for parallel simulation of quantum variational algorithms
Matwiejew, E., & Wang, J. B. (2022) · Journal of Computational Science · doi:10.1016/j.jocs.2022.101711 · Cited by 10
Parallel Quantum Computation Approach for Quantum Deep Learning and Classical-Quantum Models
Payares, E., & Martínez-Santos, J. C. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2090/1/012171 · Cited by 4
Quantum Computing for Dealing with Inaccurate Knowledge Related to the Certainty Factors Model
Moret‐Bonillo, V., Magaz-Romero, S., & Mosqueira-Rey, E. (2022) · Mathematics · doi:10.3390/math10020189 · Cited by 6
Exploring different Formulations of non-Abelian Lattice Gauge Theories for Hamiltonian simulation
Raychowdhury, I., Davoudi, Z., & Shaw, A. (2022) · International Symposium on Lattice Field Theory (LATTICE) · doi:10.22323/1.396.0277 · Cited by 4
Near-optimal circuit mapping with reduced search paths on IBM quantum architectures
Chhangte, L., & Chakrabarty, A. (2022) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2022.104637 · Cited by 4
SSQEM: Semi-Supervised Quantum Error Mitigation
Sayar, A., Arslan, Ş. S., & Çakar, T. E. (2022) · International Conference on Computer Science and Engineering (UBMK) · doi:10.1109/ubmk55850.2022.9919474 · Cited by 6
Towards Quantum Control with Advanced Quantum Computing: A Perspective
Ding, Y., Ban, Y., & Chen, X. (2022) · Entropy · doi:10.3390/e24121743 · Cited by 5
A QCNN Algorithm Deployed on A Quantum Computer
Chen, X., Jiang, B., Wu, Y., & Ye, Y. (2022) · International Conference on Computing, Communication, Perception and Quantum Technology (CCPQT) · doi:10.1109/ccpqt56151.2022.00074 · Cited by 6
Patel, T., Silver, D., & Tiwari, D. (2022) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1109/sc41404.2022.00020 · Cited by 12
Hybrid Number Systems: Application for Calculations in Galois Fields
Suleimenov, I. E., Vitulyova, Y. S., & Bakirov, A. S. (2022) · doi:10.1109/accc58361.2022.00028 · Cited by 4
Non-Hermitian ground-state-searching algorithm enhanced by a variational toolbox
Chen, Y., Zhang, S., Hsieh, C., & Zhang, S. (2023) · Physical Review A · doi:10.1103/physreva.107.042418 · Cited by 8
Implementation of Handwritten Character Recognition using Quanvolutional Neural Network
Patil, A. P., Pandey, S., Kasat, N. D., Modi, S., Raj, S., & Kulkarni, R. (2022) · IEEE North Karnataka Subsection Flagship International Conference (NKCon) · doi:10.1109/nkcon56289.2022.10126600 · Cited by 4
CoolMomentum mitigating local minima in variational quantum eigensolvers
Tsukayama, D., Shirakashi, J., & Imai, H. (2023) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/acea0a · Cited by 4
NISQ-Ready Community Detection Based on Separation-Node Identification
Stein, J., Ott, D., Nüßlein, J., Bucher, D., Schönfeld, M., & Feld, S. (2023) · Mathematics · doi:10.3390/math11153323 · Cited by 5
Patel, A. (2023) · Journal of the Indian Institute of Science · doi:10.1007/s41745-023-00406-4 · Cited by 8
Execution of a quantum algorithm for calculating energies of some quantum mechanical systems
Chaganti, S. K., Kesari, A. S., & Chowdhury, C. (2023) · Chemical Physics · doi:10.1016/j.chemphys.2023.112082 · Cited by 4
Knowledge Graphs: Semantics, Machine Learning, and Languages
Acosta Maribel, P. S., Silvio, P., Sahar, V., Anna-Lisa, G., Tassilo, P., & Jan-Christoph, K. (2023) · Studies on the semantic web · doi:10.3233/ssw56 · Cited by 4
Many-body control with reinforcement learning and tensor networks
Lü, Y., & Ran, S.-J. (2023) · Nature Machine Intelligence · doi:10.1038/s42256-023-00732-3 · Cited by 6
Maximizing Local Rewards on Multi-Agent Quantum Games through Gradient-Based Learning Strategies
Silva, A., Zabaleta, O. G., & Arizmendi, C. M. (2023) · Entropy · doi:10.3390/e25111484 · Cited by 4
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.