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 6,001–6,100 of 8,640
Mooney, G. J., Villanueva, J., Bardhan, B. R., Ghosh, J., Hill, C. D., & Hollenberg, L. C. L. (2026) · Physical Review Research · doi:10.1103/xv79-w3rs · Cited by 4
Symmetry-enhanced counterdiabatic quantum algorithm for qudits
Bottarelli, A., de Andoin, M. G., Chandarana, P., Paul, K., Chen, X., Sanz, M., & Hauke, P. (2025) · Physical Review Research · doi:10.1103/6ldg-3w1f · Cited by 7
AccelerQ: Accelerating Quantum Eigensolvers with Machine Learning on Quantum Simulators
Bensoussan, A., Chachkarova, E., Even-Mendoza, K., Fortz, S., & Lenihan, C. (2025) · Proceedings of the ACM on Programming Languages · doi:10.1145/3763132 · Cited by 1
Hosseiny, S. M., Khabisi, A. P., Seyed‐Yazdi, J., & Norouzi, M. (2025) · International Journal of Theoretical Physics · doi:10.1007/s10773-025-06145-9 · Cited by 1
Toward quantum scaling advantage in approximate optimization
Pawłowski, J., Tarasiuk, P., Tuziemski, J., Pawela, Ł., & Gardas, B. (2026) · Physical Review Applied · doi:10.1103/qcws-8kgm · Cited by 12
Error-mitigated nonorthogonal quantum eigensolver via shadow tomography
Ren, H., Zhang, Y., Billings, W. M., Tomann, R., Tkachenko, N. V., Kang, M., Head‐Gordon, M., & Whaley, K. B. (2026) · Physical Review Research · doi:10.1103/7c5b-3v56 · Cited by 4
Study on quantum thermalization from thermal initial states in a superconducting quantum computer
Edo, M. E., & Wu, L.-A. (2025) · Scientific Reports · doi:10.1038/s41598-025-19553-y · Cited by 13
Optimal and robust error filtration for quantum information processing
Ali, A., Scala, G., & Lupo, C. (2025) · Physical Review A · doi:10.1103/534r-kp3z · Cited by 1
Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic
Basili, R., Qian, W., Sarker, S., Tang, S., Castellino, A., Eshaghian‐Wilner, M. M., Khokhar, A., Luecke, G. R., & Vary, J. P. (2025) · The Journal of Supercomputing · doi:10.1007/s11227-025-07819-1 · Cited by 1
Li, Z.-L., & Zhang, S. (2026) · Physical Review Research · doi:10.1103/4kyq-n8jb · Cited by 14
Švarcmajer, M., Krčmar, T., Šabanović, D., & Lukić, I. (2025) · International Symposium ELMAR (ELMAR) · doi:10.1109/elmar66948.2025.11193746 · Cited by 2
Multiclass portfolio optimization via variational quantum Eigensolver with Dicke state ansatz
Scursulim, J. V. S., Langeloh, G. M., Beltran, V. L., & Brito, S. (2026) · Scientific Reports · doi:10.1038/s41598-026-36333-4 · Cited by 6
Quantum-to-classical transition via single-shot generalized measurements
Xu, Z. (2026) · Physical Review A · doi:10.1103/2md2-nxz3 · Cited by 4
Rebón, J. C., & Delgado, F. (2025) · Entropy · doi:10.3390/e27111089 · Cited by 1
Hwang, S., Shin, H., Seo, H., & Kim, Y. (2025) · Physica Scripta · doi:10.1088/1402-4896/ae1672 · Cited by 1
Blood–brain barrier permeability prediction via novel stacking classical-quantum hybrid model
Akrom, M., Rustad, S., Sutojo, T., Setiadi, D. R. I. M., Dipojono, H. K., Maezono, R., & Kasai, H. (2025) · Computational Toxicology · doi:10.1016/j.comtox.2025.100388 · Cited by 1
Quantum-classical hybrid approach for codon optimization and its practical applications
Chung, Y. K., Lee, D., Lee, J., Kim, J., Park, D. K., & Huh, J. (2025) · Applied Soft Computing · doi:10.1016/j.asoc.2025.114102 · Cited by 4
Sugunapriya, A., & Markkandan, S. (2025) · Scientific Reports · doi:10.1038/s41598-025-22524-y · Cited by 1
Implementation of Quantum Computing Algorithms in Electrical Power System Optimization
Chohan, J. S., Kumar, J., Dixit, K. K., et al. (2025) · Studies in systems, decision and control · doi:10.1007/978-3-031-89771-9_50 · Cited by 1
Aditya, S. (2025) · Physical review B · doi:10.1103/7j6x-74f1 · Cited by 6
Perrier, E., & Aboy, M. (2026) · Perspectives in law, business and innovation · doi:10.1007/978-981-95-8371-3_7 · Cited by 1
Entanglement-cost hierarchies in quantum fragmented mixed states
Sahu, S., Li, Y., & Sala, P. (2026) · Physical Review A · doi:10.1103/wbzt-scvs · Cited by 5
Weighted approximate quantum natural gradient for variational quantum eigensolver
Shi, C., Dunjko, V., & Wang, H. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae3fc8 · Cited by 6
Casalbore, M., Lavagna, L., Rosato, A., & Panella, M. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11228152 · Cited by 3
Position Paper: The Environmental Cost of Deep Learning: A Call for Sustainable AI Practices
Fourati, R. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11228533 · Cited by 4
Pelofske, E., Rams, M. M., Bärtschi, A., Czarnik, P., Braccia, P., Cincio, Ł., & Eidenbenz, S. (2026) · Physical Review Research · doi:10.1103/p2lg-z4kn · Cited by 8
Optimal Fermionic Joint Measurements for Estimating Non-Commuting Majorana Observables
McNulty, D., Calegari, S., & Oszmaniec, M. (2025) · Quantum · doi:10.22331/q-2025-11-17-1914 · Cited by 6
Developing an Agile Process for Quantum Annealing Applications: An Industrial Experience
Marchesi, L., Francesco, M. D., & Marchesi, M. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-12092-2_7 · Cited by 1
Comparative Benchmarking of Utility-Scale Quantum Emulators
Leonteva, A. O., Masella, G., Outteryck, M., Orioli, A. P., & Whitlock, S. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3776567 · Cited by 11
Distributed Entanglement Routing Scheme With Fidelity Guarantee in Quantum Networks
Tan, J., Li, Z., Li, J., Liu, B., & Yu, N. (2025) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2025.3631132 · Cited by 2
Quantum Computing in Healthcare: Exploring Mathematical Aspects, Algorithms and Applications
Singh, R., Nishad, D. K., Chaudhary, A., & Kumar, V. (2025) · Archives of Computational Methods in Engineering · doi:10.1007/s11831-025-10461-y · Cited by 1
Ejima, S., Seki, K., Fauseweh, B., & Yunoki, S. (2025) · Physical Review Research · doi:10.1103/2s2p-kvcx · Cited by 5
Chi, Y., Shi, H., Zheng, W., Cai, H., Zhang, Y., Tan, X., Li, S., Wang, J., Cui, J., Yung, M., et al. (2025) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-025-2779-x · Cited by 3
Hardware-efficient quantum annealing with error mitigation via classical shadow
Yoshida, T., Shingu, Y., Shimada, C., Nikuni, T., Hakoshima, H., & Matsuzaki, Y. (2026) · Physical Review A · doi:10.1103/stb4-wms8
Routing-Aware Placement for Zoned Neutral Atom-based Quantum Computing
Stade, Y., Lin, W.-H., Cong, J., & Wille, R. (2025) · 2025 IEEE/ACM International Conference On Computer Aided Design (ICCAD) · doi:10.1109/iccad66269.2025.11240721 · Cited by 20
Bell-basis quantum computation: A framework for intrinsic verification
Lizama-Pérez, L. A. (2025) · International Journal of Quantum Information · doi:10.1142/s0219749925400064 · Cited by 1
Performance-centric roadmap for building a superconducting quantum computer
Barends, R., & Wilhelm, F. K. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00495-x · Cited by 7
Inference of Maximum Parsimony Phylogenetic Trees with Model‐Based Classical and Quantum Methods
Zhang, J., Chen, Y., Zhou, Y., & Huang, J.-H. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.202500695 · Cited by 4
Sticlet, D., Tetean, R., & Tiuşan, C. (2025) · Physical review. B./Physical review. B · doi:10.1103/wq2b-b9fq · Cited by 1
Biswas, R., Basu, B., & Roy, U. (2025) · IEEE Access · doi:10.1109/access.2025.3638137 · Cited by 1
Hypergraphic Partitioning Framework for Static and Adaptive Quantum Circuits
Cambiucci, W., & Silveira, R. M. (2025) · doi:10.1109/nca67271.2025.00037 · Cited by 1
Quantum Neural Networks for Enhanced Predictive Analytics in Cancer Prognosis
Singh, S., Singla, C., Shelke, N. M., et al. (2025) · International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO) · doi:10.1109/icrito66076.2025.11241603 · Cited by 1
de Keijzer, R., Visser, L., Tse, O. T. C., & Kokkelmans, S. J. J. M. F. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01132-8 · Cited by 5
Fernandez, B. O., Bloot, R., & Moret, M. A. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00215 · Cited by 1
An Adaptive Weighted Qite-Vqe Algorithm for Combinatorial Optimization Problems
Xie, N., Lee, X., Chen, T., Saito, Y., Asai, N., & Cail, D. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00032 · Cited by 1
OrQstrator: An AI-Powered Framework for Advanced Quantum Circuit Optimization
Baird, L., & Moin, A. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10378 · Cited by 1
Application-Driven Benchmarking of the Traveling Salesperson Problem: a Quantum Hardware Deep-Dive
Bentellis, A., Poggel, B., & Lorenz, J. M. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00207 · Cited by 3
Servicing Demands between Multiple Pairs of Nodes on Heterogeneous Quantum Networks
Pandey, A. K., Tamma, B. R., & Rao, M. V. P. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00106 · Cited by 1
QUADRO: A Hybrid Quantum Optimization Framework for Drone Delivery
Holliday, J. B., Blount, D., Nguyen, H. Q., Khan, S. U., & Luu, K. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00229 · Cited by 1
Graph Neural Network-Based Predictor for Optimal Quantum Hardware Selection
Tudisco, A., Volpe, D., Orlandi, G., & Turvani, G. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10339 · Cited by 3
Qubit Health Analytics and Clustering for HPC-Integrated Quantum Processors
Deng, X., Schulz, L. B., & Schulz, M. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10284 · Cited by 2
Accelerating Large-Scale Linear Algebra Using Variational Quantum Imaginary Time Evolution
Aboumrad, W., Zhu, D., Girotto, C., Rouet, F.-H., Jojo, J., Lucas, R. F., Pathak, J., Kaushik, A. P., & Roetteler, M. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00214 · Cited by 4
ScaleQsim: Highly Scalable Quantum Circuit Simulation Framework for Exascale HPC Systems
Kim, C., Sohn, E., Kim, S., Sim, A., Wu, K. J., Tang, H., Son, Y., & Kim, S. (2025) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/3771577 · Cited by 4
Proof-of-concept of a QKD-secured distributed measurement system
Regio, F. L., D’Iorio, M., Angrisani, L., et al. (2025) · doi:10.1109/iceee67194.2025.11261974 · Cited by 1
Fidelity relations in an array of neutral atom qubits: Experimental validation of control noise
van Rensburg, D. J., de Keijzer, R., Venderbosch, R., van der Werf, Y., Mellado, J. D. P., Lous, R. S., Vredenbregt, E. J. D., & Kokkelmans, S. J. J. M. F. (2025) · Physical Review A · doi:10.1103/66zh-yt9d · Cited by 2
Towards a Unified Architectural Representation in HPCQC: Extending Sys-Sage for Quantum Technologies
Mishra, D., Vanecek, S., Echavarria, J., Deng, X., Mete, B., Schulz, L. B., & Schulz, M. (2025) · ISC High Performance (ISC) · doi:10.23919/isc.2025.11017506 · Cited by 2
Quantum Computing Today: A Status Overview
Liu, Y. (2025) · Computer · doi:10.1109/mc.2025.3617743 · Cited by 1
Generative flow-based warm start of the variational quantum eigensolver
Zou, H., Rahm, M., Kockum, A. F., & Olsson, S. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01159-x · Cited by 11
Symmetry checking in band-structure calculations on a noisy quantum computer
Zhang, S., Karim, A., Quiney, H. M., & Usman, M. (2025) · Physical Review Applied · doi:10.1103/vpyb-ynmz · Cited by 2
Adaptive random compiler for Hamiltonian simulation
Fan, Y.-Z., Wu, Y.-X., & Zhang, D.-B. (2025) · Physical Review A · doi:10.1103/4nmq-twj8 · Cited by 1
A quantum machine learning-based predictive analysis of CERN collision events
Tripathi, S. M., Upadhyay, H., & Soni, J. (2025) · Scientific Reports · doi:10.1038/s41598-025-30305-w · Cited by 2
Warm-Starting PCE for Traveling Salesman Problem
do Carmo, R. S., dos Reis, R. G., Silva, S. F. F., Arruda, L. G. E., & Fanchini, F. F. (2025) · Brazilian Journal of Physics · doi:10.1007/s13538-025-01966-9 · Cited by 10
Praba, M., Samhan, A. A. A., Pandi, V. S., et al. (2025) · Asian Conference on Innovation in Technology (ASIANCON) · doi:10.1109/asiancon66527.2025.11281256 · Cited by 1
Comparative studies of optimizer performance in a variational quantum eigensolver
Lü, Q. (2025) · The Journal of Chemical Physics · doi:10.1063/5.0305677 · Cited by 1
Generating three-dimensional genome structures with a variational quantum algorithm
Siciliano, A. J., & Wang, Z. (2025) · Briefings in Bioinformatics · doi:10.1093/bib/bbaf663 · Cited by 1
Belaloui, N. E., Tounsi, A., Khamadja, A. R., Benkadour, H., Louamri, M. M., Benslama, A., & Rouabah, M. T. (2025) · Physica Scripta · doi:10.1088/1402-4896/ae2f3e · Cited by 3
Quantum-Secured File Transfer System
Hiremath, S., Sathish, S., Kashyap, S. S., Fahad, S., & Shashank, S. K. (2025) · International Conference on Computation System and Information Technology for Sustainable Solutions (CSITSS) · doi:10.1109/csitss67709.2025.11295355 · Cited by 1
Dubey, A., Zeybek, Z., & Schmelcher, P. (2025) · Physical review. B./Physical review. B · doi:10.1103/64hd-q4z5 · Cited by 9
Key predictors of student proficiency in quantum computing
Sodagari, S. (2025) · Social Sciences & Humanities Open · doi:10.1016/j.ssaho.2025.101805 · Cited by 1
Supervised Quantum Machine Learning
Monroy-Azpeitia, A., Montiel-Pérez, J. Y., Maldonado-Romo, A., Arvizu-Velazquez, A. A., López-Bonilla, J. L., & Vidal-Beltrán, S. (2025) · Studies in computational intelligence · doi:10.1007/978-3-031-85614-3_10 · Cited by 1
Distributed learning with quantum-classical collaborative management
Du, Z., & Mao, Y. (2025) · Elsevier eBooks · doi:10.1016/b978-0-44-330259-6.00014-1 · Cited by 2
Quantum-Enhanced Software-Defined Networking: A Communication Perspective
Urgelles, H., Nande, S. S., Scotece, D., et al. (2025) · IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infocomwkshps65812.2025.11152794 · Cited by 1
McGarraghy, S., & Venkova, M. (2025) · Springer eBooks · doi:10.1007/978-3-032-00385-0_68 · Cited by 1
Variational Quantum Algorithm for Photonic Crystals(Invited Paper)
Chen, L., Li, X., Su, J., Huang, S., Cai, Z., Yu, Z., Ning, Y., Xiao, Q., Zhang, J., Ma, Q., et al. (2025) · Electromagnetic waves · doi:10.2528/pier25081203 · Cited by 3
Q2SV: A High‐Level Synthesis Approach for State Vector Quantum Simulation
Bennakhi, A., Byrd, G. T., & Franzon, P. D. (2025) · Quantum Engineering · doi:10.1155/que2/9017796 · Cited by 1
Cyberbezpieczeństwo systemu finansowego
Wawrzyniak, D. (2025) · Wroclaw University of Economics and Business eBooks · doi:10.15611/2025.97.9 · Cited by 1
Blind Quantum Computation With Certified Deletion for Quantum Inputs
Quan, J., Wang, Y., Li, Q., & Li, L. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3645605 · Cited by 1
Three-Qubit Encoding in Ytterbium-171 Atoms for Simulating 1+1D Quantum Chromodynamics
Huie, W., Conefrey-Shinozaki, C., Jia, Z., Draper, P., & Covey, J. P. (2026) · PRX Quantum · doi:10.1103/28h7-jl1v · Cited by 11
Quantum Machine Learning for Drug Discovery: Taxonomy, Research Challenges, and the Road Ahead
Duong, Y. H. P., Rizvi, S. M. A., McNiven, B. D. E., Nguyen, T. T., Shin, H., Dobre, O. A., & Duong, T. Q. (2026) · ACM Computing Surveys · doi:10.1145/3785660 · Cited by 7
Bian, J., Liu, T., Ding, M., Lao, Q., Zhang, H., Rao, X., Lu, P., & Luo, L. (2025) · New Journal of Physics · doi:10.1088/1367-2630/ae309f · Cited by 1
Quantum Opacity, Classical Clarity: A Hybrid Approach to Quantum Circuit Obfuscation
Raj, A., & Balachandran, V. (2025) · doi:10.1145/3733817.3762698 · Cited by 4
Kaneda, T., Fujii, K., & Ueda, H. (2025) · Physical Review Research · doi:10.1103/ssrm-kddv · Cited by 3
Quantum Computing for Telecom KPI Optimization: Advantages Over Generative AI
Kumar, A., & Jain, G. (2025) · IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT) · doi:10.1109/conecct65861.2025.11306870 · Cited by 1
QMin: Quantum Circuit Minimization via Gate Fusions for Efficient State Vector Simulation
Xu, L., Sha, E. H. ‐., Song, Y., & Zhuge, Q. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-05028-6 · Cited by 1
Quantum Error Correction and Noise Mitigation
Bhalekar, O. A. (2026) · Springer eBooks · doi:10.1007/978-3-032-10775-6_5 · Cited by 1
Tsai, Y., Liu, Y.-K., & Chen, S. Y.-C. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-13883-5_1 · Cited by 2
An Efficient Quantum Classifier Based on Hamiltonian Representations
Tiblias, F., Schroeder, A. K., Zhang, Y., Gachechiladze, M., & Gurevych, I. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-13883-5_5 · Cited by 3
Distributed photonic variational quantum eigensolver with parameterized weak measurements
Lee, D., Bilash, B., Lee, J., Lim, H., Kim, Y., Lee, S.-W., & Kim, Y.-S. (2026) · npj Quantum Information · doi:10.1038/s41534-025-01163-1 · Cited by 5
QPU Micro-Kernels for Stencil Computation
Markidis, S., Pennati, L., Netzer, G., Pasquale, M., & Peng, I. B. (2026) · International Conference on High Performance Computing in Asia-Pacific Region (HPC Asia) · doi:10.1145/3773656.3773676 · Cited by 1
Beyond mimicry: a framework for evaluating genuine intelligence in artificial systems
Niazi, S. K. (2026) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2025.1686752 · Cited by 1
Shortcuts to adiabaticity designed via time-rescaling follow the same transitionless route
Ferreira, J. L. M., França, Â. F. D. S., Rosas, A., & Bernardo, B. D. L. (2026) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/ae37b0 · Cited by 7
A robust large-period discrete time crystal and its signature in a digital quantum computer
Chen, T., Shen, R., Lee, C. H., Bo, Y. A. N. G., & Bomantara, R. W. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae3851 · Cited by 32
Quantum Self-Organizing Map for Solving the Euclidean Traveling Salesman Problem
Rui, X. U., & Créput, J.-C. (2025) · International Conference on Control, Decision and Information Technologies (CoDIT) · doi:10.1109/codit66093.2025.11321639 · Cited by 1
Malick, R., Murugasamy, P., & R, A. (2025) · 2025 4th International Conference on Automation, Computing and Renewable Systems (ICACRS) · doi:10.1109/icacrs67045.2025.11324437 · Cited by 1
Quantum computing for railway rescheduling: Literature review and future directions
Schuler, A., Waller, S. T., Bassoli, R., & Bešinović, N. (2026) · Transportation Research Interdisciplinary Perspectives · doi:10.1016/j.trip.2026.101868 · Cited by 2
Quantum-secured device-independent global positioning system
Kam, C., & Kuo, E.-J. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00470-6 · Cited by 1
Addressing ecological challenges from a quantum computing perspective
Clenet, M., Dion, M., & Blanchet, F. G. (2026) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.70236 · Cited by 5
Scalable Quantum Computing Approaches for Next-Generation Edge and IoT Devices
Prasant, P., Rao, M. N., Yuvaraju, C., Jeshurun, S. B., Rengaraju, P., & Sravani, M. G. (2025) · International Conference on Future Technologies (ICFT) · doi:10.1109/icft66708.2025.11336574 · Cited by 3
Quantum kernel learning achieves battery prognostics on noisy quantum hardware
Kiani, A. (2026) · Next Materials · doi:10.1016/j.nxmate.2026.101644 · Cited by 4
Quantum Inspired Technique for Cracking RSA
Rijwani, N. K., & Chaurasia, B. K. (2025) · International Conference on Information Systems and Computer Networks (ISCON) · doi:10.1109/iscon65210.2025.11340888 · Cited by 2
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.