The DOI matches its Crossref record; 93 of the 93 references it cites were found in a registry or an index; 12 of the 24 sources its claims cite were checked for support.
Quantum computing: vision and challenges
Open accessOverview
CoChat Summary
TL;DR
This review/vision paper surveys quantum computing foundations, hardware/software advances, algorithms, cryptography, and scalability while cataloguing open challenges. It argues quantum computing has promising applications but remains limited by decoherence, error correction, and scalability, with no clear timeline for replacing classical supercomputers.
Key findings
- Quantum computing uses qubits, superposition, and entanglement; \(n\) qubits can be in a superposition with \(2^n\) potential values, enabling applications in logistics, drug design, banking, climate prediction, cryptography, and more.
- Google’s 2019 quantum supremacy demonstration is highlighted, but IBM scientists showed the same computation could be executed far more efficiently on a conventional supercomputer; practical “quantum advantage” remains unsolved.
- Cryptography is a major focus: Shor’s algorithm threatens RSA, while responses include QKD variants (DV-QKD, CV-QKD, DI-QKD, MDI-QKD, twin-field QKD) and post-quantum cryptography families (code-based, hash-based, lattice-based, multivariate, supersingular curve-elliptic isogeny), with NIST standardization underway.
- Hardware/software examples include IBM’s five-qubit cloud computer in 2016, later 16-qubit system, cloud machines up to 65 qubits, and a 433-qubit quantum computer; Rigetti Forest has over 36 qubits; IBM simulated beryllium hydride on a seven-qubit processor; small-scale quantum simulators with 50–100 qubits are anticipated.
Methods
- This is a review/vision paper, not an experimental study; it synthesizes current research on quantum computing foundations, hardware, algorithms, cryptography, software, scalability, and challenges.
- No primary data, sample, or experimental design is reported; examples and numbers are drawn from prior literature and vendor/platform claims.
- The main analysis is narrative and qualitative, with figures summarizing applications/benefits and new trends/potential challenges.
Limitations
- Stated: decoherence and short qubit coherence times, high error rates, difficult quantum error correction, limited qubit connectivity, large control overhead, and the need for many physical qubits remain major obstacles; the paper says there is no clear indication when quantum computers will supplant conventional computers for difficult tasks.
- Stated: DI-QKD is difficult to implement and its practical performance is still limited because it requires loophole-free Bell inequality violations and near-perfect quantum detection; QKD protocols are hybrid, and PQC standardization is still underway.
- Evident: as a vision/review, it does not provide a systematic review protocol, quantitative synthesis, or new experimental results, and many claims about future applications and timelines are forward-looking.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
8 Valid · 4 Not valid · 10 Not checked · 7 Own results and interpretations
At least one cited source doesn’t support this claim or points to a different paper, and none confirmed it — see the verdicts below.
In the paper
“There have been attempts to prove blind quantum computing through experimentation, in which quantum servers are unaware of the inputs, delegations, calculations, or outputs [20].”
§ Quantum Computing: Vision and Challenges > 6.9 Statistical Modelling of Future Climate:
What the sources say
- Misattributedcites [20] sourceExperimental — accuracy not yet measured
The References (p. 12) identify Huang et al. (2017), not this support-vector-machine paper, as the work titled “Experimental blind quantum computing for a classical client.” The Introduction (p. 1) does not discuss blind computing, and our copy does not describe what a quantum server can or cannot know. (LLM, conf=0.78) It matches “Experimental blind quantum computing for a classical client” (2017) instead.
Checked by a reasoning model — may be wrong.
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.
- Misattributed
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“Furthermore, decoherence results from qubit interactions with their environments due to the fragility of qubits and the gradual loss of qubit-to-environment information [82].”
§ Quantum Computing: Vision and Challenges > 6.5 Quantum Web/Internet:
What the sources say
- Partly supportedcites [82] sourceExperimental — accuracy not yet measured
The Methods section, “Atomic coherence time” (page not provided), says fluctuations in local magnetic fields and trap-induced light shifts limit the coherence of atomic qubits and describes dephasing effects. This supports environmental influences on coherence, but the paper does not attribute decoherence to qubit fragility or a gradual loss of qubit-to-environment information. (LLM, conf=0.84)
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.
- Partly supported
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“To achieve sufficient reliability to enable sustained quantum computation, iterative error mitigation is required [36].”
§ Quantum Computing: Vision and Challenges > 6.2 Resilient and Sustainable Quantum Modelling:
What the sources say
- Partly supportedcites [36] sourceExperimental — accuracy not yet measured
The 'Quantum error correction' section says correcting errors is indispensable because real devices cannot run error-free calculations. It does not say that iterative error mitigation specifically is required for sustained computation; the 'Code search' section also describes autonomous correction without active feedback. No page numbers are available in our copy. (LLM, conf=0.85)
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.
- Partly supported
The cited sources that could be checked couldn’t confirm or dispute this claim.
In the paper
“In order to build the quantum Internet, a radical change from the current classical approach to networking design is required [44].”
§ Quantum Computing: Vision and Challenges > 6.5 Quantum Web/Internet:
What the sources say
- Could not verifycites [44] sourceExperimental — accuracy not yet measured
The paper’s discussion on p. 1 concerns a nanowire spin-orbit qubit and its potential for long-distance quantum communication. Searches for quantum Internet, classical networking, and a radical change in networking design found no passage addressing the claimed design requirement. (LLM, conf=0.78)
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.
- Could not verify
Every source the paper cites for this claim was checked and supports it.
In the paper
“The recent development of quantum computing, which uses entanglement, superposition, and other quantum fundamental concepts, can provide substantial processing advantages over traditional computing.”
§ Quantum Computing: Vision and Challenges > Abstract
What the sources say
- Supportedcites [4] source
The paper’s opening passage reports that its processor completed a specific sampling task in about 200 seconds, while its benchmarks estimated approximately 10,000 years for a classical supercomputer. This supports the qualified claim that quantum computing can provide substantial processing advantages, without implying an advantage for every task. (LLM, conf=0.94)
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
9 more claims · 2 with their cited sources checked
Create a free account to see all 29 claims and to verify the 1 reference still open.
- Probably not a substantial claim. 8
- It may state two separate claims as one. 8
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
§ Quantum Computing: Vision and Challenges > 6.8 Modern Cryptography:
“Generally speaking, six methods-symmetric key quantum resistance, code-based, hash-based, multifaceted, and lattice-based encryption-are the primary focus of post-quantum cryptography investigation.”
§ Quantum Computing: Vision and Challenges > 6.8 Modern Cryptography:
“symmetric key quantum resistance, code-based, hash-based, multifaceted, and lattice-based encryption”
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
§ Quantum Computing: Vision and Challenges > 7. Summary of Findings, Take-Aways and Conclusions
“A post-quantum cryptography system is developed to safeguard conventional cryptographic basics and protocols by using the computational power of a quantum computer, which can solve mathematical issues in milliseconds.”
§ Quantum Computing: Vision and Challenges > 4. Modern Cryptography: From Quantum to Post-Quantum
“the potential threat represented by the Shor's algorithm has led to new developments in classical cryptographic approaches, with the work on post-quantum cryptography and on a completely new paradigm to grant security named quantum cryptography [43]”
Citations
Cites
Quantum Computation and Quantum Information: Bibliography
Nielsen, M. A., & Chuang, I. (2010) · doi:10.1017/cbo9780511976667.023 · Cited by 12,065
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406
Basic concepts and taxonomy of dependable and secure computing
Avizienis, A., Laprie, J.-C., Randell, B., & Landwehr, C. (2004) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2004.2 · Cited by 5,223
Cited by
Federated learning for network attack detection using attention-based graph neural networks
Jianping, W., Guangqiu, Q., Wu, C., Jiang, W., & Jin, J. (2024) · Scientific Reports · doi:10.1038/s41598-024-70032-2 · Cited by 133
Ali, S., Wang, J., & Leung, V. C. M. (2025) · Information Fusion · doi:10.1016/j.inffus.2024.102922 · Cited by 87
Bouchmal, O., Cimoli, B., Stabile, R., Olmos, J. J. V., & Monroy, I. T. (2025) · Computer Networks · doi:10.1016/j.comnet.2025.111345 · Cited by 21
Supraja, T., Chawla, P., & Gill, S. S. (2025) · Cluster Computing · doi:10.1007/s10586-025-05759-2 · Cited by 18
Self-citationQuantum computing enhanced knowledge tracing: Personalized KT research for mitigating data sparsity
Bao, C., Wu, Q., Ji, W., Wang, M., & Wang, H. (2024) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2024.102224 · Cited by 11
Metadata
- Authors
- Gill, S. S., Cetinkaya, O., Marrone, S., Claudino, D., Haunschild, D., Schlote, L., Wu, H., Ottaviani, C., Liu, X., Machupalli, S. P., Kaur, K., Arora, P., Liu, J., Farouk, A., Song, H. H., Uhlig, S., & Ramamohanarao, K.
- Affiliations
- Queen Mary University of London (GB)
- University of Oxford (GB)
- University of Campania "Luigi Vanvitelli" (IT)
- Oak Ridge National Laboratory (US)
- Deutsche Bahn (Germany) (DE)
- Tianjin University (CN)
- University of York (GB)
- Argonne National Laboratory (US)
- Carnegie Mellon University (US)
- Microsoft (Netherlands) (NL)
- University of Maryland, Baltimore County (US)
- The University of Melbourne (AU)
- ORCID
- Venue
- Quantum Computing
- Publisher
- Elsevier
- Published
- 2025
- Pages
- 19-42
- OpenAlex
- W4412588932
- Cited by
- 44
- References
- 88
- Citations by year
- 2026: 14 · 2025: 21
- FWCI
- 73.33
- Type
- book chapter
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/legal/tdmrep-license (tdm)
- doi.org/10.15223/policy-017 (stm-asf)
- doi.org/10.15223/policy-037 (stm-asf)
- doi.org/10.15223/policy-012 (stm-asf)
- doi.org/10.15223/policy-029 (stm-asf)
- doi.org/10.15223/policy-004 (stm-asf)
- Locations
- Elsevier eBooks (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- U.S. Department of Energy (DE‐ AC02‐06CH11357, AC02‐06CH11357, 06CH11357, DE-AC02-)
- Advanced Scientific Computing Research (DE-AC02-06CH11357)
- 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 Mechanics and Applications
- Keywords
- quantum computing, quantum entanglement, quantum superposition, quantum computing hardware, quantum algorithms, quantum computing software, quantum cryptography, scalable quantum computers, quantum chemistry simulation, drug design, quantum computing challenges
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-12, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-12 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum computing: vision and challenges. https://app.cochat.ai/papers/10.1016/b978-0-443-29096-1.00008-8
- The paper
- Gill, S. S., Cetinkaya, O., Marrone, S., Claudino, D., Haunschild, D., Schlote, L., Wu, H., Ottaviani, C., Liu, X., Machupalli, S. P., Kaur, K., Arora, P., Liu, J., Farouk, A., Song, H. H., Uhlig, S., & Ramamohanarao, K. (2025). Quantum computing: vision and challenges. Quantum Computing. https://doi.org/10.1016/b978-0-443-29096-1.00008-8
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.