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 7,401–7,500 of 8,640
Time-frequency-correlated native ccz gates in superconducting circuits
Wang, C., Wang, W., Fei, Y., Fan, Z., Zhao, H., Mage, Y., & Shan, Z. (2026) · Physical Review Applied · doi:10.1103/9st1-wvdl · Cited by 2
Adaptive Quantum Kernel Optimization for Scalable and Noise-Resilient Nonlinear Pattern RecognitionPreprint
Hakim, A. N. (2025) · Research Square · doi:10.21203/rs.3.rs-8055313/v1
Ho, M., Khoo, J. Y., Mak, A. M., & Carrazza, S. (2026) · Quantum Science and Technology · doi:10.1088/2058-9565/ae6a1c · Cited by 1
Fault-tolerant encoding of logical qudits in spin systems
Lim, S. (2026) · Physical Review A · doi:10.1103/n28j-r8bg · Cited by 2
Leveraging Quantum Machine Learning for Precision Nutrient Management in Sustainable Crop Production
Ghosh, S., & Raj, R. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-3957-3.ch004
Solanki, S., Pandey, V., & Verma, V. (2025) · IGI Global eBooks · doi:10.4018/979-8-3373-3957-3.ch007
Quantum Optimization of Currency Arbitrage via Graph-Informed Entanglement Strategies
Moreign, V., & Chan, M. (2025) · ACM International Conference on AI in Finance (ICAIF) · doi:10.1145/3768292.3770352
Optimisation of Variational Quantum Classifier by Controlling Feature map and Ansatz RepetitionsPreprint
Rahman, S. U., & Yousaf, S. (2025) · Research Square · doi:10.21203/rs.3.rs-8053203/v1 · Cited by 1
Quantum Approaches for Degree-Constrained Minimum Spanning Tree Computation
do Carmo, R. S., Santana, M. C. S., Fanchini, F. F., da Costa, K. A. P., Rosalem, W. S., & Papa, J. P. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11228458
Integrated Time Domain Multiplexer for Superconducting Qubit Control at Millikelvin Temperatures
Wirth, V., Breun, S., Löffler, J., et al. (2025) · European Microwave Integrated Circuits Conference · doi:10.23919/eumic65284.2025.11234375
Evolutionary Weight Optimization for Variational Quantum Classifiers
Costa, M., & Neto, F. M. D. P. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11227638
Novel Quantum Approaches to Hyperdimensional Computing for Neural Networks
Lavagna, L., Ceschini, A., Rosato, A., et al. (2025) · doi:10.1109/ijcnn64981.2025.11229083
Position Paper: Quantum Neural Networks - A Paradigm Shift in AI or a Theoretical Promise?
Kashif, M., & Shafique, M. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11227994 · Cited by 6
Hybrid and hardware-oriented approaches for quantum diffusion models
Cacioppo, A., Colantonio, L., Bordoni, S., & Giagu, S. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11227283
Using Topology-Aware Reinforcement Learning to Synthesize Quantum Linear Reversible Circuits
Acampora, G., Cuzzocrea, A., Lapegna, M., Schiattarella, R., & Vitiello, A. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11227556
Girolamo, A. D., Facchi, P., Rabl, P., Pascazio, S., Lupo, C., & Magnifico, G. (2025) · Physical Review Research · doi:10.1103/x7x4-kn4n · Cited by 2
Ghobadi, M. Z., & Afsaneh, E. (2025) · medRxiv · doi:10.1101/2025.11.16.25340339 · Cited by 1
Controlling quantum chaos via Parrondo strategies on noisy intermediate-scale quantum hardware
Rath, A. M., Panda, D. K., & Benjamin, C. (2025) · Physical review. E · doi:10.1103/m89r-2dy5 · Cited by 1
Noise-Robust Quantum Generative Models for Distribution Learning and Efficient Data LoadingPreprint
Mandusia, A. K. (2025) · Research Square · doi:10.21203/rs.3.rs-8001093/v1
Dy-Part: A Dynamic, Noise-Aware Scheduler for Optimizing Hybrid Quantum-Classical AlgorithmsPreprint
Ansari, M. Q. (2025) · Research Square · doi:10.21203/rs.3.rs-8041248/v1
Distributed Quantum NISQ Systems
Papachristou, C., & Wolff, F. (2025) · IEEE National Aerospace and Electronics Conference (NAECON) · doi:10.1109/naecon65708.2025.11235326
Steane and Iceberg Code Implementations on Toffoli Gates
Riffel, C., Robertson, R., Slodov, M., & Hendrickson, P. (2025) · IEEE National Aerospace and Electronics Conference (NAECON) · doi:10.1109/naecon65708.2025.11235387 · Cited by 2
Information Storage and Transmission under Markovian Noise
Singh, S., & Datta, N. (2026) · PRX Quantum · doi:10.1103/8rnj-667b · Cited by 12
Utility-Scale Quantum State Preparation: Classical Training using Pauli Path Simulation
Lin, C.-J., Gharibyan, H., & Su, V. P. (2026) · Quantum · doi:10.22331/q-2026-03-09-2014 · Cited by 13
Distributed quantum generalized benders decomposition for unit commitment problems
Gao, F., Huang, D., Zhao, Z., Dai, W., Yang, M., Gao, Q., & Pan, Y. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04977-2 · Cited by 3
Petalcorin, M. I. R., & Vega, M. A. R. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.11.15.688570
Sharma, S., Sharma, L., & Gandhi, T. K. (2025) · Computer Methods and Programs in Biomedicine · doi:10.1016/j.cmpb.2025.109175 · Cited by 3
Zhao, Y., Li, K., Guo, Z., & Zhang, J. (2025) · doi:10.1109/iccad66269.2025.11240780
Kumari, M., Ray, K., Mallik, S., & Li, A. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-95-1069-6_23
Galvão, L. Q., Rosa, A. C. P., Moret, M. A., & Cruz, C. (2025) · Physical review. E · doi:10.1103/z126-zcq6 · Cited by 2
Gregorio, G. D., Lucia, C. D., Martone, A., et al. (2025) · EPJ Web of Conferences · doi:10.1051/epjconf/202534201008
Hussain, A., Li, S., Akbar, W., et al. (2025) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2025.3635719
On Finite-Blocklength Noisy Classical-Quantum Channel Coding With Amplitude Damping Errors
Havas, T., Lin, H.-Y., Rosnes, E., & Lai, C. (2025) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw62417.2025.11240474 · Cited by 1
Wehbe, A., AlKhatib, S., & Ahmad, A. (2025) · Physica Scripta · doi:10.1088/1402-4896/ae22a2
Zhang, J., Che, X., Peng, S., Chen, G., Ma, Q., Fan, B., & Hu, J. (2025) · Applied Soft Computing · doi:10.1016/j.asoc.2025.114273 · Cited by 2
A Detailed Survey and Analysis of Recent Advancements in Quantum Compiler Optimization Techniques
Vaikar, P., & Potgantwar, A. D. (2025) · Lecture notes in networks and systems · doi:10.1007/978-981-96-8043-6_52
Hu, S., Li, X., Ruan, B., & Liu, Z. (2025) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2025.131155 · Cited by 6
Exact quantum capacity of decohering channels in arbitrary dimensions
Roofeh, S., & Karimipour, V. (2025) · Physical Review A · doi:10.1103/s124-z299 · Cited by 1
Markovian heat engine boosted by quantum coherence
Cuenca-Montenegro, F., Herrera, M., & Reina, J. H. (2026) · Physical Review A · doi:10.1103/hpkj-srj6
Miki, G., & 都倉, 康. (2026) · Physical Review A · doi:10.1103/vv11-n11b · Cited by 1
Adaptive quantum optimization algorithms for programmable atom-cavity systems
Luo, Y., Li, X., & Lin, J. H. (2025) · Physical Review A · doi:10.1103/515w-htjp · Cited by 2
Aljuaydi, F., Jaradat, E. K., & Alotaibi, A. M. (2025) · Modern Physics Letters A · doi:10.1142/s0217732325502116
Bao, D., Zhao, Z., Zhou, Y., Xu, Q., Huang, R., & Tan, X. (2025) · Physical Review A · doi:10.1103/w3zz-xps6 · Cited by 1
Cainelli, M., & Kurashige, Y. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c01443
Automated design and performance optimization of efficient n-bit quantum comparator circuits
Mermoul, R., Slimani, A., & Benslama, A. (2025) · Physica Scripta · doi:10.1088/1402-4896/ae2546
Optimising Quantum Algorithm Schemes According to the Topology of Quantum Computers
Keibas, G., & Petkevičius, L. (2025) · IEEE Workshop on Advances in Information, Electronic and Electrical Engineering (AIEEE) · doi:10.1109/aieee66149.2025.11050773 · Cited by 1
Jha, N., Parakh, A., & Subramaniam, M. (2026) · Cryptologia · doi:10.1080/01611194.2025.2596885 · Cited by 7
QSEA: Quantum Self‐Supervised Learning with Entanglement Augmentation
Li, L., Ni, X., Li, J., Qin, S., & Gao, F. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500530 · Cited by 3
Do mixed states exhibit deep thermalisation?
Sherry, A., & Roy, S. (2025) · Physical review. B./Physical review. B · doi:10.1103/x397-3nk5 · Cited by 5
A Conceptual Study on Quantum Simulation–based Optimization System for Soil–Microbe Interaction
DaiHwan, L., & HyunHo, H. (2025) · The Journal of Korean Institute of Information Technology · doi:10.14801/jkiit.2025.23.11.275
Quantum Patches for Efficient Learning
Ban, T. Q., Luong, C., & Mengel, S. A. (2025) · Lecture notes in computer science · doi:10.1007/978-981-95-4957-3_8
Argon Ion Treatment of Multi-Material Layered Surface-Electrode Traps for Noise Mitigation
Palani, D., Hasse, F., Kiefer, P., Boeckling, F., Stick, D., Hite, D. A., Warring, U., & Schaetz, T. (2025) · Entropy · doi:10.3390/e27121208
Krishnakumar, R. (2025) · Springer eBooks · doi:10.1007/978-3-031-90727-2_10
Optimal Qubit Reuse for Quantum Computation with Gate Reordering and Eager Measurement
Yu, W., Chen, T.-F., Chan, Y., Jiang, J.-H. R., Chiou, D.-W., & Chang, Y. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00067
Evaluation of Distimation's Real-World Performance on a Superconducting Quantum Computer
Yokomori, H., Koyama, M., Benchasattabuse, N., Hajdušek, M., Nagayama, S., & Meter, R. V. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00116
Scalable Hardware Maturity Probe for Quantum Accelerators via Harmonic Analysis of QAOA
Onah, C., & Michielsen, K. F. L. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10337 · Cited by 1
Towards Efficient Hybrid Quantum-Classical Learning Models
McCollum, A., Bogaraju, S. V., McLaughlin, J. A., et al. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10494
Compiler Design for Hardware Specific Decomposition Optimizations, Tailored to Diamond NV Centers
de Ronde, F., Wong, S., & Feld, S. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00095
Noise-Aware Quantum Annealing for State Estimation in Power Systems
Tran, Q.-B., & Dinh, T. N. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00212
Towards Hybrid Spatial Structure Rendering Models Using Quantum Orthographic Ray Casting
Zhang, Z. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00261
Flowing Through Hilbert Space: Quantum-Enhanced Generative Models for Lattice Field Theory
Martinez, J. R. R., & Delgado, A. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00266
Benchmarking Adaptive Genetic Pulse-Level Optimization on Standard Quantum Algorithms
Aguilar-Calvo, W., & Núñez-Corrales, S. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10330
Kojima, R., Kamoshita, M., & Kanno, K. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00250 · Cited by 5
Schrödinger's Toolbox: Exploring the Quantum Rowhammer Attack
Campbell, D. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10299
Monte Carlo Qudit Stabilizer Sampling with Pauli Frames
Kabir, A., & Huang, Y. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10358
Distributed Quantum Computation for General Quantum Operations
Marrafon, T. G., & Soeda, A. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10403
CHSH Violations Using Dynamic Circuits
Waring, J.-B., Père, C., & Beux, S. L. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00263 · Cited by 3
Quantum Entrepreneurship Lab: Training a Future Workforce for the Quantum Industry
Sander, A., Cercola, R., Capogrosso, A., Filipp, S., Jobst, B., Mendl, C. B., Pollmann, F., Trummer, C., Welpe, I. M., Werninghaus, M., et al. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.20550 · Cited by 3
Parity-Based Quantum Error Mitigation
Hodges, T. M. W., Wang, D., Samanta, S., & Ferenczi, A. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10386
Enhancing Quantum Software Development Process with Experiment Tracking
Gamage, M., Kinanen, O., Muff, J., et al. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10361
Chung, M. T., Gambo, Y. J., Mete, B., To, X.-T. M., Krötz, F., Staudacher, K., Letras, M., Deng, X., Vavilala, M., Raoofy, A., et al. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.20530 · Cited by 1
Distinguishing Quantum Software Bugs from Hardware Noise: A Statistical Approach
Virani, A., Devraj, Suresh, A., Zhang, L., & Rao, M. V. P. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00096 · Cited by 5
Practical Scalability of LuGo: Benchmarking the HHL Algorithm Using an Enhanced QPE Algorithm
Lu, C., Meena, M. G., Georgiadou, A., Gottiparthi, K. C., Sandoval, M., Pérez, E. A. C., Lin, P. T., Suh, I., Kim, S., & Baroni, A. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00029 · Cited by 1
Towards Efficient Verification of Computation in Quantum Devices
Li, K., Yan, P., Jiang, H., & Yu, N. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00147
Poudel, P. S., Sugisaki, K., Hajdušek, M., & Meter, R. V. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00248
Quantum Software Security Challenges Within Shared Quantum Computing Environments
Ovaskainen, S., Haghparast, M., & Mikkonen, T. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.10296 · Cited by 2
Enhancing the Clique Local Decoder to Correct Length-2 Space Errors in the Surface Code
Jia, Z., Veerapaneni, S., & Ravi, G. S. (2025) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce65121.2025.00072
Meller, M., Szeremi, V., & Brown, O. T. (2025) · Quantum · doi:10.22331/q-2025-12-02-1927 · Cited by 5
Quantum Generative Adversarial Network for Network Traffic Prediction
Cui, Y., Qi, H., Wang, H., et al. (2025) · doi:10.1109/iscipt67144.2025.11265712
Reinforcement Learning for Quantum Phase Estimation Using Deep Q-Network
Sundharess, B., Vikash Krishna, R., Gopika, S. S., Sinha, S., Donald, A. C., & Paul, A. (2025) · IEEE Madhya Pradesh Section Conference (MPCON) · doi:10.1109/mpcon66082.2025.11256566
Afaq, M. (2025) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2025.3639435
Three Birds with One Stone: Improving Performance, Convergence, and System Throughput with NEST
Huo, Y., Quiroga, D., Kyrillidis, A., & Patel, T. (2025) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/3771580 · Cited by 2
Anchor: Reducing Temporal and Spatial Output Performance Variability on Quantum Computers
Huo, Y., Leeds, D., Ludmir, J., DiBrita, N. S., & Patel, T. (2025) · Proceedings of the ACM on Measurement and Analysis of Computing Systems · doi:10.1145/3771562 · Cited by 2
Anderson, D. Z., Chomaz, P., Takeuchi, S., Arakawa, Y., Baba, Y., Benson, O. J., Soderberg, K.-A., Diamanti, E., Elkouss, D., Fujii, K., et al. (2026) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/ae271a
QuLoRa: A Classical-Quantum Hybrid Solution for Securing Long Range Communication
Pawar, R., Ali, S., Pushpa, R., Rai, S., & Kiran, K. (2025) · International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT) · doi:10.1109/icumt67815.2025.11268623
Huang, H., Thomas, L. G., Usman, M., Rahman, R., & Jamieson, D. N. (2025) · Advanced Quantum Technologies · doi:10.1002/qute.202500675
Computing a Sparse Approximate Inverse on Quantum Annealing Machines
Suresh, S., & Suresh, K. (2025) · Journal of Computing and Information Science in Engineering · doi:10.1115/1.4070578 · Cited by 2
A Review of Quantum Supremacy in QUBO-Based Applications
Ryou, A., Kim, K., & Jun, K. (2025) · IEEE International Conference on Consumer Electronics-Asia (ICCE-Asia) · doi:10.1109/icce-asia67487.2025.11263592
Chaplart, T. B. (2025) · Research Square · doi:10.21203/rs.3.rs-7400540/v1
Thermal Weight Determination and Interstate Coupling in State-Averaged ADAPT-VQE
Grimsley, H. R., & Evangelista, F. A. (2025) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c01313
Applications of Gaussian Boson Sampling to Solve Some Chemistry Problems
Novir, S. B. (2025) · Quantum Reports · doi:10.3390/quantum7040056 · Cited by 1
Design and Analysis of Planar Surface and Perfect Quantum Error Correction Codes
Al-Hinai, M., & Asif, H. M. (2025) · IEEE Asia Pacific Conference on Wireless and Mobile (APWiMob) · doi:10.1109/apwimob67231.2025.11269136
Budiutama, G., Daimon, S., Nishi, H., Kaneko, R., Ohtsuki, T., & Matsushita, Y. (2025) · Physical Review A · doi:10.1103/vyr3-h9hq
Efficient Simulation of Nontrivial Dissipative Spin Chains via Stochastic Unraveling
Pocklington, A., & Clerk, A. A. (2025) · PRX Quantum · doi:10.1103/vptq-xy6h · Cited by 7
Roushan, P., & Martin, L. S. (2025) · Science · doi:10.1126/science.adt1732
Djordjević, I. B. (2025) · Elsevier eBooks · doi:10.1016/b978-0-443-40568-6.00006-9
Haukisalmi, A., Ramos, D. P., Raasakka, M., Marchesin, A., Ylinen, L., & Tittonen, I. J. (2025) · Physical Review Research · doi:10.1103/x9t3-64wm · Cited by 1
Superior resilience to poisoning and amenability to unlearning in quantum machine learning
Chen, Y., & Zhang, S. (2026) · Nature Communications · doi:10.1038/s41467-026-70420-4 · Cited by 11
Testing and Learning Structured Quantum Hamiltonians
Arunachalam, S., Dutt, A., & Gutiérrez, F. E. (2025) · Communications in Mathematical Physics · doi:10.1007/s00220-025-05517-w
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.