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,801–7,900 of 8,640
Redefining Customer Experience Journeys With Quantum AI
Kumar, P., Dhar, S., Murmu, S., Khan, F., & Bose, M. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-4347-1.ch012
Sharma, S., & Singh, S. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-4347-1.ch014
Manoharan, G., & Kumar, S. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-4347-1.ch002
Lozano-Crisóstomo, N., González-Galicia, M. A., ıa-Melgarejo, J. C. G., et al. (2026) · Journal of Lightwave Technology · doi:10.1109/jlt.2026.3674437
Raj, P., Ashraf, S. M., Kherani, A. A., & Lall, B. (2025) · IEEE International Conference on Advanced Networks and Telecommunications Systems · doi:10.1109/ants66931.2025.11430161
Training-Free Quantum Architecture Search Under Realistic Noise via Expressibility-Guided Evolution
Mousavi, S., Mousavi, S., Pettersson, P., & Daneshtalab, M. (2026) · Entropy · doi:10.3390/e28030330 · Cited by 2
Noise-Resilient Quantum Aggregation on NISQ for Federated ADAS Learning
Kabgere, C. P., & Sudarshan, T. S. B. (2025) · IEEE Women in Technology Conference (WINTECHCON) · doi:10.1109/wintechcon66724.2025.11429891 · Cited by 1
Future of Cloud Computing in IT Infrastructure
Alnajim, R. Y. (2025) · International Conference on Computer and Applications (ICCA) · doi:10.1109/icca66035.2025.11430884
Q-Net: Quantum Entanglement-Based Post-Internet ArchitecturePreprint
Moknak, S., Kamnan, P., Chamtakhu, N., et al. (2026) · doi:10.5281/zenodo.19065066
Günel, T., & Kara, K. (2026) · Acta Infologica · doi:10.26650/acin.1799569
Quantum Heuristic Approach to Vehicle Routing Problem
Kim, J. S., Lee, D., & Ahn, C. W. (2026) · Mathematics · doi:10.3390/math14061026
Accrediting outputs of noisy all-optical quantum circuits
Liu, J., Chen, X., Xu, L., & Zhang, L. (2026) · Chinese Optics Letters · doi:10.3788/col202624.042701 · Cited by 1
Cheng, T., Zeng, J., & Yang, M. (2026) · The Journal of Chemical Physics · doi:10.1063/5.0313584
Optimal Dependency-Aware Qubit Reuse for Scheduled Quantum Circuits
Liu, P.-W., Zhan, K.-X., & Kuo, J.-J. (2025) · Globecom · doi:10.1109/globecom59602.2025.11431734
Quantum algorithms for scheduling problems: a survey
Werner, T., & Ullinger, F. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00494-y · Cited by 7
Hybrid Classical–Quantum Learning for Job Failure Prediction in Distributed Cloud Systems
Afaq, M., Kaleem, Z., Ibrahim, M., et al. (2026) · International Conference on Advanced Communications Technology (ICACT) · doi:10.23919/icact68090.2026.11431388
QMDUC: quantum multi-channel data uploading convolution for image classification
Qi, H., Wang, S., Wang, H., Gani, A., & Por, L. Y. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae5579 · Cited by 1
Bozpolat, S. A., & Salehi, Ö. (2026) · International Journal of Advances in Engineering and Pure Sciences · doi:10.7240/jeps.1752589
Megala, S., Ragukumar, P., & Khare, N. (2026) · EPJ Web of Conferences · doi:10.1051/epjconf/202636001014
Qubit Measurement Visualization in Default, Single and Multiple-Qubit System using Qiskit
Pandey, R. D., & Porwal, R. (2026) · EPJ Web of Conferences · doi:10.1051/epjconf/202636001028 · Cited by 1
Performance of Qutrit QAOA Algorithm with Fixed Parameters under Noise
Чернявский, А. Ю., Bantysh, B. I., & Bogdanov, Y. I. (2025) · Russian Microelectronics · doi:10.1134/s1063739725601596
Jagannathan, S. K., Thomas Abraham, J. V., Yogesh, C., & Franklin Joel Benedict, T. (2026) · EPJ Web of Conferences · doi:10.1051/epjconf/202636001029 · Cited by 2
Solving the Traveling Salesman Problem Using Quantum Devices: QUBO and HOBO Formulations
Shuvalov, G. V., Krivtsova, E. N., Remnev, M. A., & Kapranov, A. V. (2025) · Russian Microelectronics · doi:10.1134/s1063739725601882 · Cited by 1
Quantum phases classification using quantum machine learning with SHAP-driven feature selection
Franco, G. S., Mahlow, F. R. P., Prado, P. B. B., Pexe, G. E. L., Rattighieri, L. A. M., & Fanchini, F. F. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05132-1 · Cited by 11
Hardware Agnostic Backend Adaptation through Quantum Circuit Evaluation
Sharma, A., Kailash, S., & Ethirajan, D. (2026) · EPJ Web of Conferences · doi:10.1051/epjconf/202636001009
Memory Optimization of a Quantum-Inspired Processor for High-Speed Computation
Moulisvaran, U., Pramoth, K. P., Naveencharan, R., et al. (2026) · EPJ Web of Conferences · doi:10.1051/epjconf/202636001022
BRIDGING ARTIFICIAL INTELLIGENCE AND NANOTECHNOLOGY: SHAPING THE FUTURE OF INTELLIGENT INNOVATION
Dwivedi, A., Kasera, F., & Darwhekar, G. N. (2026) · European journal of parenteral & pharmaceutical sciences · doi:10.37521/ejpps31105
Quantum Semantic Sensing Approach for Intelligent IoT
Nunavath, N., Bassoli, R., & Fitzek, F. H. P. (2025) · doi:10.1109/mecom67453.2025.11439600
Baioletti, M., Fagiolo, F., Oddi, A., & Rasconi, R. (2026) · Journal of Aerospace Information Systems · doi:10.2514/1.i011645 · Cited by 1
Efficiently Architecting VQAs: Expressibility–Trainability–Resources Pareto-Optimality
Sanz, R., Anglés-Castillo, A., Alarcon, E., & Almudéver, C. G. (2026) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2026.3721256 · Cited by 2
Multipartite entanglement measure: genuine to absolutely maximally entangled
Rahul, V., & Aravinda, S. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05141-0 · Cited by 1
Noise-resilient quantum reinforcement learning
Yue, J.-C., & An, J. (2026) · Physical Review Applied · doi:10.1103/8gfc-2nsc · Cited by 1
Challenges and Strategies for Integrating Quantum Computing into Learning Analytics
Pagano, A., Rossano, V., & Travisani, F. P. (2025) · International Conference on Innovation and Intelligence for Informatics, Computing, and Technologies (3ICT) · doi:10.1109/3ict68299.2025.11442014
Quantum Machine Learning for Smart Grid Load Balancing
Hong, G., & Fong, A. (2025) · 2025 3rd Power Electronics and Power System Conference (PEPSC) · doi:10.1109/pepsc67251.2025.11453430
Boosting thermalization of classical and quantum many-body systems
Chen, J.-F., Rai, K. S., Emonts, P., Farina, D., Płodzień, M., Grzybowski, P. R., Lewenstein, M., & Tura, J. (2026) · Physical review. B./Physical review. B · doi:10.1103/r43j-qfj5 · Cited by 8
Park, S., & Son, Y. (2026) · Applied Sciences · doi:10.3390/app16073243
Non-Equilibrium Dynamics of Quantum Many-Body Systems for Image Processing
Zhou, R., & Bayat, A. (2025) · Intelligent Autonomous Systems · doi:10.1109/icoias69065.2025.00008
Functional Size Measurement of Hybrid Classical Quantum Software Systems
Soubra, H., Hacaloğlu, T., Abran, A., Bourque, P., & Beland, S. (2025) · Global Congress on Emerging Technologies (GCET) · doi:10.1109/gcet68529.2025.11450862
Wang, W., Liu, F., Wang, W., Han, C., Qin, Z., Zhou, B., Huang, Y., Hou, Y., Ding, X., Xu, J., et al. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.202500982
Guerrero-Domínguez, D., Azevedo, C. L., Karlsson, S., & Nielsen, O. A. (2026) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2026.3676854 · Cited by 2
TEMPORAL INTERPRETATION OF QUANTUM DECOHERENCE IN INFORMATION SYSTEMS
LEMESHKO, A., Krasnoshchok, V., & Desiatko, A. (2026) · Cybersecurity Education Science Technique · doi:10.28925/2663-4023.2026.32.1117 · Cited by 2
Co-design threading model and circuit cutting for static and adaptive quantum circuits
Cambiucci, W., Silveira, R. M., & Ruggiero, W. V. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05136-x
Athira, P. G., & Deepika, M. P. (2026) · International Conference on Advances in Intelligent Computing and Applications (AICAPS) · doi:10.1109/aicaps68631.2026.11452990 · Cited by 1
Sarkar, A., Kundu, A., Steinberg, M., Mishra, S., Fauquenot, S., Acharya, T., Miszczak, J. A., & Feld, S. (2026) · New Journal of Physics · doi:10.1088/1367-2630/ae5a54 · Cited by 10
Xie, Q.-X., Lin, Z., Liu, Y., & Zhao, Y. (2026) · Quantum Information Processing · doi:10.1007/s11128-026-05154-9
Application of quantum neural networks and variational quantum regression in seismic inversion
Liu, Z., & Zhang, J. (2026) · Second International Meeting for Applied Geoscience & Energy · doi:10.1190/image2025-4301526.1
Rius, G. (2026) · APL Quantum · doi:10.1063/5.0319835 · Cited by 1
Logical-to-Physical Compilation for Reducing Depth in Distributed Quantum Systems
de Ronde, F., Wong, S., & Feld, S. (2026) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn69946.2026.11662592
Lee, D., Lee, W. S., Hong, H., & Kwon, O. (2026) · Symmetry · doi:10.3390/sym18040605
Ramadhan, R. U., Permatahati, L. K., Prayitno, T. B., & Sarwono, Y. P. (2026) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.5c08292 · Cited by 2
Leakage suppression in quantum control via static parameter offsets
Lin, T., Qin, Z.-H., Xue, Z., & Chen, T. (2026) · Physical Review A · doi:10.1103/lycw-g48q · Cited by 2
Novel algorithms for strongly correlated quantum systems in and out of equilibrium
Moutenet, A. (2020) · theses.fr (ABES) · doi:10.70675/4661a30ez54c5z4628z988az1a0ddb210646
Randomness for quantum information processing
Mezher, R. (2019) · theses.fr (ABES) · doi:10.70675/20d8dd52zead4z4afcz8e10z9e2c54fd7654
Exact quantum noise deconvolution with partial knowledge of noise
Ahmadvand, N., & Memarzadeh, L. (2026) · Physical Review A · doi:10.1103/b92y-rp8j
Constraint-optimal driven allocation for scalable quantum error correction decoder scheduling
Kim, D., Seo, J., Han, Y., & Kim, Y. (2026) · Physical Review A · doi:10.1103/1zc1-wpjp
Hardware-Aware Compilation for Different Quantum Computing Platforms
Schmid, L., Schoenberger, D., Stade, Y., Burgholzer, L., & Wille, R. (2026) · Springer eBooks · doi:10.1007/978-3-032-09303-5_5
Machine learning and quantum phases of matter
Théveniaut, H. (2020) · theses.fr (ABES) · doi:10.70675/5fe0e7a5z4b0ez477fz9ebfz2f29e57c0a49
Mapping of fermionic lattice models for Ising solvers
Nagpal, L., Kumar, A., & Hassan, S. R. (2026) · Scientific Reports · doi:10.1038/s41598-026-44886-7 · Cited by 2
Coherent acoustic-phonon dynamics in GaAs/AlAs heterostructures
Ortiz, O. (2021) · theses.fr (ABES) · doi:10.70675/aae841ddz5d0az4403zaa9fze2d67fafb0b6 · Cited by 1
Continuous variable quantum advantages and applications in quantum optics
Chabaud, U. (2020) · theses.fr (ABES) · doi:10.70675/3d77bdc3zadd1z4d1az8ae6zf516db82f794 · Cited by 8
Methods for optimizing the synthesis of quantum circuits
de Brugière, T. G. (2020) · theses.fr (ABES) · doi:10.70675/e70b70f9z8381z43a4z806fz68402f3080de · Cited by 9
Laser trapped Circular Rydberg atoms for quantum simulation
Cortiñas, R. G. (2020) · theses.fr (ABES) · doi:10.70675/bf035e50z0730z4356zbac9z5f57bc8db50a · Cited by 3
Characterisation and detection of hybrid entanglement and contextuality
Massé, G. (2021) · theses.fr (ABES) · doi:10.70675/4e299903ze658z4518z9809z99fe56b9f794
Quantum Information Techniques for Quantum Metrology
Shettell, N. (2021) · theses.fr (ABES) · doi:10.70675/8853f6b9zb5e4z450cz9d3ezadfa13e09f3e · Cited by 1
Arnal, M. (2020) · theses.fr (ABES) · doi:10.70675/a8729b82z4dc8z443bza97fz0f59cd097b5f · Cited by 4
Charge control in semiconductor quantum-dot arrays and prospects for large-scale integration
Chanrion, E. (2021) · theses.fr (ABES) · doi:10.70675/d93d6176z9dadz40e3z848fzd3b23332cd69 · Cited by 4
Étude des performances des machines à recuit quantique pour la résolution de problèmes combinatoires
Vert, D. (2021) · theses.fr (ABES) · doi:10.70675/785ae50cz79e3z4923zb9a6zfd30be202ce4 · Cited by 1
Shintani, S. A. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.04.02.716025
Nonlinear quantum optics with a single Rydberg superatom coupled to a medium-finesse cavity
Vaneecloo, J. (2022) · theses.fr (ABES) · doi:10.70675/c24954e2z1ec5z468dza496zfd8979a93d27 · Cited by 2
Optimal measurement strategies for quantum states and quantum channels estimation
Milazzo, N. (2021) · theses.fr (ABES) · doi:10.70675/ab5e9c11z573dz4938za409z4aae63958c83
Quantum-dot lasers on silicon : nonlinear properties, dynamics, and applications
Dong, B. (2021) · theses.fr (ABES) · doi:10.70675/02f50e71z4324z4375za91ez03b01f03de51
Multi-Party Quantum Cryptography : from Folklore to Real-World
Music, L. (2021) · theses.fr (ABES) · doi:10.70675/33bf8631zcceaz4db5zbe0bz279040613f5a
Automated design of photonic quantum circuits
Yao, Y. (2023) · theses.fr (ABES) · doi:10.70675/137f6c70zbc72z4cbdzb338z6722012d84e0
Enhancing the reachability of variational quantum algorithms via input-state design
Wu, S., Jin, S., Bayat, A., & Wang, X. (2026) · Communications Physics · doi:10.1038/s42005-026-02610-x · Cited by 4
Simulation of atomic nuclei and their constituents with quantum computers
Guzman, E. A. R. (2023) · theses.fr (ABES) · doi:10.70675/efb16840z58b5z4c76z8eadzfeae7d3faaaa
Quantum algorithms for reinforcement learning
Cherrat, E. A. (2023) · theses.fr (ABES) · doi:10.70675/ec6ab96az80c1z473az8098z76724c736a49
Far-from-equilibrium dynamics and entanglement in long-range quantum systems
Schneider, J. (2022) · theses.fr (ABES) · doi:10.70675/19a4dfcdz202bz4e3aza76fz49b15523ccca
Device-independent certification : quantum resources and quantum key distribution
Valcarce, X. (2023) · theses.fr (ABES) · doi:10.70675/47a9dcc2zbf3dz4453z98ffz90339ccb4186 · Cited by 2
Quantum algorithms for energy management optimization problems
Veshchezerova, M. (2022) · theses.fr (ABES) · doi:10.70675/f0d70a66z3066z4c81z8aa7zf9e72830f940 · Cited by 6
QSeg: Quantum - Classical Segmentation Model for Breast Cancer Images
Matondo-Mvula, N., & Elleithy, K. M. (2025) · International Conference on Machine Learning and Applications · doi:10.1109/icmla66185.2025.00191
Convergence of quantum and classical communications
Aymeric, R. (2022) · theses.fr (ABES) · doi:10.70675/2137f631zab2fz4dd2zb454z8f0d8863fdf8 · Cited by 1
Liu, W., Cheng, J., Ma, Y., Li, X., & Li, X. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00436-y
Krasnok, A. (2026) · AVS Quantum Science · doi:10.1116/5.0337237
Kriekouki, I. (2022) · theses.fr (ABES) · doi:10.70675/9fed023fze214z429fzbf66z0d82f6e955c8 · Cited by 5
Experimental demonstration of quantum advantage for computing and communication tasks
Yacoub, V. (2024) · theses.fr (ABES) · doi:10.70675/8c73171dze00bz499az92a3z44b4d1a55c04
Performance evaluation and control improvements for solving optimization problems on NISQ platforms
Gilbert, V. (2024) · theses.fr (ABES) · doi:10.70675/81f9c638z5867z40e4zaed8ze9824ff5a163 · Cited by 1
Quantum Computing for Operations Research : A special approach for Project Scheduling
Armas, L. F. P. (2024) · theses.fr (ABES) · doi:10.70675/cf991df2zcbd5z4574z9f45z6f05451dcf70 · Cited by 1
Solving Quantum Many-Body Problems on Quantum Computers
Martin, B. A. (2023) · theses.fr (ABES) · doi:10.70675/911dc194ze97bz42d2z8611z3daf90a7419c · Cited by 2
Analog Quantum Computing for NP-Hard Combinatorial Graph Problems
Braida, A. (2024) · theses.fr (ABES) · doi:10.70675/ddc8a4b2z9f68z49d3z91e1zc1d6664298b1 · Cited by 2
Quantum Hardware Security and Near-term Applications
Ma, Y. (2023) · theses.fr (ABES) · doi:10.70675/4f128c9aze95ez495cza315z386b01b2df54 · Cited by 2
Complex quantum Networks for machine learning protocols
Henaff, J. (2024) · theses.fr (ABES) · doi:10.70675/9cf94ee2z8367z4741zb21bz2eb55cf23f29
The disparate impact of noise on quantum learning algorithms
Angrisani, A. (2023) · theses.fr (ABES) · doi:10.70675/69f942ebz4417z4eceza746z1c9d436d09bb · Cited by 3
Klemt, B. (2023) · theses.fr (ABES) · doi:10.70675/c9289d27z7165z4474z83c2ze6a5cd30184e · Cited by 1
Quantum-classical hybrid algorithms for quantum many-body physics
Besserve, P. (2023) · theses.fr (ABES) · doi:10.70675/a5e8da3az4c08z4ae8z87a7ze5004c01bf42 · Cited by 1
Gyöngyösi, L., & Imre, S. (2026) · International Journal of Theoretical Physics · doi:10.1007/s10773-026-06321-5
Neutron-proton pairing problems simulated on quantum computers
Zhang, J. (2025) · theses.fr (ABES) · doi:10.70675/066a889bzbfb9z40d4z8957za0e98b2d394a · Cited by 2
Quantum inspired image encryption using a memristive hopfield neural network
Verma, V., Njitacke, Z. T., & Kumar, S. (2026) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2026.104464
Conjugate coding based designated verifier quantum zero knowledge proof for user authentication
Garcia-Diaz, J., Escánez-Expósito, D., Caballero‐Gil, P., et al. (2026) · Cryptography and Communications · doi:10.1007/s12095-026-00878-y
Coherent Rydberg excitation of single atoms using a pulsed fiber amplifier
Zhang, Y., Wang, Y., Xu, C.-L., Wang, Y.-B., & 许, P. 鹏. X. (2026) · Chinese Physics B · doi:10.1088/1674-1056/ae5db3
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.