The DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
A Survey of Important Issues in Quantum Computing and Communications
Open accessAbstract
Driven by the rapid progress in quantum hardware, recent years have witnessed a furious race for quantum technologies in both academia and industry. Universal quantum computers have supported up to hundreds of qubits, while the scale of quantum annealers has reached three orders of magnitude (i.e., thousands of qubits). Quantum computing power keeps climbing. Race has consequently generated an overwhelming number of research papers and documents. This article provides an entry point for interested readers to learn the key aspects of quantum computing and communications from a computer science perspective. It begins with a pedagogical introduction and then reviews the key milestones and recent advances in quantum computing. In this article, the key elements of a quantum Internet are categorized into four important issues, which are investigated in detail: a) quantum computers, b) quantum networks, c) quantum cryptography, and d) quantum machine learning. Finally, the article identifies and discusses the main barriers, the major research directions, and trends.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252
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
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
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
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Giovannetti, V., Lloyd, S., & Maccone, L. (2011) · Nature Photonics · doi:10.1038/nphoton.2011.35 · Cited by 3,894
Quantum Repeaters: The Role of Imperfect Local Operations in Quantum Communication
Briegel, H.-J., Dür, W., Cirac, J. I., & Zoller, P. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5932 · Cited by 3,481
Surface 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 2×
“However, there are still many open problems in each category, for example, the robustness of quantum computers [14], [41], [76], [77], the challenges of network infrastructure (e.g., quantum communication links [15], [16], [17], quantum repeaters and routers [73], [78], [79]), and the efficiency in…”
BackgroundGood quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“Quantum error correction may then focus on decreasing the transmission error rate [170].”
BackgroundQuantum Support Vector Machine for Big Data Classification
Rebentrost, P., Mohseni, M., & Lloyd, S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.130503 · Cited by 1,951
NTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947
Satellite-to-ground quantum key distribution
Liao, S.-K., Cai, W.-Q., Liu, W.-Y., Zhang, L., Li, Y., Ren, J.-G., Yin, J., Shen, Q., Cao, Y., Li, Z.-P., et al. (2017) · Nature · doi:10.1038/nature23655 · Cited by 1,821
Aharonov, Y., Davidovich, L., & Zagury, N. (1993) · Physical Review A · doi:10.1103/physreva.48.1687 · Cited by 1,622
Quantum convolutional neural networks
Cong, I., Choi, S., & Lukin, M. D. (2019) · Nature Physics · doi:10.1038/s41567-019-0648-8 · Cited by 1,517
Bernstein, E., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300921 · Cited by 1,503
An introduction to quantum machine learning
Schuld, M., Sinayskiy, I., & Petruccione, F. (2015) · Contemporary Physics · doi:10.1080/00107514.2014.964942 · Cited by 1,381
Overcoming the rate–distance limit of quantum key distribution without quantum repeaters
Lucamarini, M., Yuan, Z. L., Dynes, J. F., & Shields, A. J. (2018) · Nature · doi:10.1038/s41586-018-0066-6 · Cited by 1,247
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244 · cited 1×
“Even though there are quantum mechanical models describing a Quantum Turing Machine (QTM) [9], [45], [46] (i.e., an abstract reference to model quantum effects), a quantum circuit based on quantum logic gates is a more common model [47].”
MethodBernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
Class of quantum error-correcting codes saturating the quantum Hamming bound
Gottesman, D. (1996) · Physical Review A · doi:10.1103/physreva.54.1862 · Cited by 1,227
Quantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215
Buhrman, H., Cleve, R., Watrous, J., & de Wolf, R. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.167902 · Cited by 1,190
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
On the interpretation of measurement in quantum theory
Zeh, H. D. (1970) · Foundations of Physics · doi:10.1007/bf00708656 · Cited by 1,028
Universal Computation by Quantum Walk
Childs, A. M. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.180501 · Cited by 1,002
Exponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780552 · Cited by 825 · cited 1×
“Quantum walks provide polynomial speed-up in problems such as element distinctness, triangle finding, NAND trees [304], and exponential speed-up to oracular problems [305].”
BackgroundSHA-3 standard: permutation-based hash and extendable-output functions
National Institute of Standards and Technology (US) (2015) · doi:10.6028/nist.fips.202 · Cited by 783
Training deep quantum neural networks
Beer, K., Bondarenko, D., Farrelly, T., Osborne, T. J., Salzmann, R., Scheiermann, D., & Wolf, R. (2020) · Nature Communications · doi:10.1038/s41467-020-14454-2 · Cited by 726 · cited 3×
“Quantum neural network methods to simplify the internal network has been proposed to make the parameters of ground states much smaller [154].”
BackgroundMethodColloquium : Quantum annealing and analog quantum computation
Das, A., & Chakrabarti, B. K. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1061 · Cited by 700
A rigorous and robust quantum speed-up in supervised machine learning
Liu, Y., Arunachalam, S., & Temme, K. (2021) · Nature Physics · doi:10.1038/s41567-021-01287-z · Cited by 649
Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
Jao, D., & De Feo, L. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25405-5_2 · Cited by 634
QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
AMBAINIS, A. (2003) · International Journal of Quantum Information · doi:10.1142/s0219749903000383 · Cited by 632
Aaronson, S. (2015) · Nature Physics · doi:10.1038/nphys3272 · Cited by 567
Quantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states
McClean, J. R., Kimchi-Schwartz, M. E., Carter, J., & de Jong, W. A. (2017) · Physical Review A · doi:10.1103/physreva.95.042308 · Cited by 516
Fault-Tolerant Quantum Computation with Constant Error Rate
Aharonov, D., & Ben-Or, M. (2008) · SIAM Journal on Computing · doi:10.1137/s0097539799359385 · Cited by 513
Operator quantum error-correcting subsystems for self-correcting quantum memories
Bacon, D. (2006) · Physical Review A · doi:10.1103/physreva.73.012340 · Cited by 486
Demonstration of Blind Quantum Computing
Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P. (2012) · Science · doi:10.1126/science.1214707 · Cited by 475
On the Relationship Between Continuous- and Discrete-Time Quantum Walk
Childs, A. M. (2010) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0930-1 · Cited by 411
Quantum mechanical Hamiltonian models of Turing machines
Benioff, P. (1982) · Journal of Statistical Physics · doi:10.1007/bf01342185 · Cited by 402
Experimental free-space quantum teleportation
Jin, X.-M., Ren, J.-G., Yang, B., Yi, Z.-H., Zhou, F., Xu, X.-F., Wang, S.-K., Yang, D., Hu, Y.-F., Jiang, S., et al. (2010) · Nature Photonics · doi:10.1038/nphoton.2010.87 · Cited by 378
The concept of transition in quantum mechanics
Park, J. L. (1970) · Foundations of Physics · doi:10.1007/bf00708652 · Cited by 301
Opportunities and challenges for quantum-assisted machine learning in near-term quantum computers
Perdomo-Ortiz, A., Benedetti, M., Realpe-Gómez, J., & Biswas, R. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab859 · Cited by 274 · cited 6×
“A PPROACHES TO Q UANTUM M ACHINE L EARNING quantum computer result in significant overhead in quantum annealers and universal quantum computers [85].”
BackgroundInfluentialKiktenko, E. O., Pozhar, N. O., Anufriev, M. N., Trushechkin, A. S., Yunusov, R. R., Kurochkin, Y. V., Lvovsky, A. I., & Fedorov, A. K. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aabc6b · Cited by 264
Ground to satellite secure key exchange using quantum cryptography
Rarity, J. G., Tapster, P. R., Gorman, P. M., & Knight, P. (2002) · New Journal of Physics · doi:10.1088/1367-2630/4/1/382 · Cited by 238
Information flow in entangled quantum systems
Deutsch, D., & Hayden, P. (2000) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2000.0585 · Cited by 230 · cited 1×
“That is, information cannot travel faster than the speed of light through teleportation [193].”
BackgroundAsymptotically good Quantum and locally testable classical LDPC codes
Panteleev, P., & Kalachev, G. (2022) · Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3519935.3520017 · Cited by 222 · cited 3×
“However, there are still many open problems in each category, for example, the robustness of quantum computers [14], [41], [76], [77], the challenges of network infrastructure (e.g., quantum communication links [15], [16], [17], quantum repeaters and routers [73], [78], [79]), and the efficiency in…”
BackgroundApplication of Quantum Annealing to Training of Deep Neural Networks
Adachi, S. H., & Henderson, M. P. (2015) · arXiv · doi:10.48550/arxiv.1510.06356 · Cited by 176
Guest Column: A Survey of Quantum Learning Theory
Arunachalam, S., & de Wolf, R. (2017) · ACM SIGACT News · doi:10.1145/3106700.3106710 · Cited by 152
Repeat-until-success quantum computing using stationary and flying qubits
Lim, Y. L., Barrett, S. D., Beige, A., Kok, P., & Kwek, L. C. (2006) · Physical Review A · doi:10.1103/physreva.73.012304 · Cited by 138
Experimental verification of multipartite entanglement in quantum networks
McCutcheon, W., Pappa, A., Bell, B. A., McMillan, A., Chailloux, A., Lawson, T., Mafu, M., Markham, D., Diamanti, E., Kerenidis, I., et al. (2016) · Nature Communications · doi:10.1038/ncomms13251 · Cited by 137 · cited 2×
“For example, a state verification protocol can “broadcast” states to network nodes by following a distributed process [113].”
BackgroundClassification with Quantum Machine Learning: A Survey
Abohashima, Z., Elhosen, M., Houssein, E. H., & Mohamed, W. M. (2020) · arXiv · doi:10.48550/arxiv.2006.12270 · Cited by 68
Lanzerotti, M. Y., Fiorenza, G., & Rand, R. A. (2005) · IBM Journal of Research and Development · doi:10.1147/rd.494.0777 · Cited by 47
Cited by
Walia, G. K., Kumar, M., & Gill, S. S. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3338015 · Cited by 279
Quantum Computing: Vision and Challenges
Gill, S. S., Cetinkaya, O., Marrone, S., Claudino, D., Haunschild, D., Schlote, L., Wu, H., Ottaviani, C., Liu, X., Machupalli, S. P., et al. (2025) · Quantum Computing · doi:10.1016/b978-0-443-29096-1.00008-8 · Cited by 44
Metadata
- Authors
- Yang, Z., Zolanvari, M., & Jain, R.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2023
- Volume
- 25
- Issue
- 2
- Pages
- 1059-1094
- ISSN
- 1553-877X (ISSN-L)
- 2373-745X
- OpenAlex
- W4323644127
- Cited by
- 251
- References
- 58
- FWCI
- 22.05
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.
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.