Quantum communications: explained for communication engineers
The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Moore¿s Law dictates that during the forthcoming decades, new communications and computing technologies that exploit quantum mechanics will become generally available. To assist Communications Society members with this transition, we provide a pragmatic description of quantum communications theory that introduces the quantum mechanical properties of polarization and entanglement, which do not have analogs in classical communications theory. We show plausible examples of how these quantum properties may be exploited to create noisefree channels and to improve channel utilization for distributed MAC protocols. Finally, we describe how entanglement is used to enhance security and improve key distribution efficiency in symmetric-key cryptography systems used by operational quantum cryptographic networks.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“In summary, quantum principles provide significant benefits to the communication networks including enhanced channel capacity, the ability to transmit an unknown quantum state, i.e, quantum teleportation, and to deliver secure information, i.e., quantum cryptography by utilizing a number of advanced communication protocols which will not be possible with the classical techniques [119].”
From Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future (2019) · cites this paper as [119]
In the citing paper
“Also, another promising application area is the quantum Internet, which enables the transmission of Qubits from one quantum computer to another [119].”
From Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future (2019) · cites this paper as [119]
Citations
Cites
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
Bennett, C. H., Shor, P. W., Smolin, J. A., & Thapliyal, A. V. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.802612 · Cited by 698
Advanced Quantum Communications: An Engineering Approach
Imre, S., & Gyongyosi, L. (2012) · Wiley eBooks · doi:10.1002/9781118337462 · Cited by 167
Self-citationCurrent status of the DARPA quantum network (Invited Paper):
Elliott, C., Colvin, A., Pearson, D., Pikalo, O., Schlafer, J., & Yeh, H. (2005) · SPIE Proceedings · doi:10.1117/12.606489 · Cited by 136
Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel
Cubitt, T. S., Chen, J., & Harrow, A. W. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2169109 · Cited by 101
Current status of the DARPA Quantum Network
Elliott, C., Colvin, A., Pearson, D., Pikalo, O., Schlafer, J., & Yeh, H. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0503058 · Cited by 85
Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel
Cubitt, T. S., Chen, J., & Harrow, A. W. (2009) · Library Open Repository (Universidad Complutense Madrid) · Cited by 62
Research works printed but not linked: 3
- gyongyosi, 0, Pilot Quantum Error-Correction for Noisy Quantum Channels, Proe 2nd lnt'l Conf Quantum Error Correction, 5
- zeilinger, 2010, Dance of the Photons, 205
- imre, 2005, Quantum Computing and communications An Engineering Approach
Cited by
6G and Beyond: The Future of Wireless Communications Systems
Akyildiz, I. F., Kak, A., & Nie, S. (2020) · IEEE Access · doi:10.1109/access.2020.3010896 · Cited by 1,385
“been widely recognized as a key enabling technology for realizing computationally complex systems [187].”
BackgroundQuantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
“Quantum mechanics is expected to play a significant role in various sectors of our everyday life, ranging from high-endurance materials and pharmaceuticals to communications and computing [118].”
BackgroundMethodA Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
Self-citationA Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
“For some further research topic on quantum channels see [34], [419, 420], [194197,198-199, 200, 201, 202-205, 206], [246].”
BackgroundSelf-citationThe Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet
Pan, D., Long, G.-L., Yin, L., Sheng, Y.-B., Ruan, D., Ng, S. X., Lu, J., & Hanzo, L. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2024.3367535 · Cited by 180
“The polarization of a single-photon may be decribed by its state vector [274], [275]: the state of | 1 ⟩ stands for the vertically polarized photon | ↑⟩ = | 𝑉 ⟩ also seen in the Bloch sphere of Fig.”
Metadata
- Authors
- Imre, S.
- Affiliations
- Budapest University of Technology and Economics (HU)
- Corresponding author
- Imre, S.
- ORCID
- Imre, S.
- Venue
- IEEE Communications Magazine
- Published
- 2013-08
- Volume
- 51
- Issue
- 8
- Pages
- 28-35
- ISSN
- 0163-6804 (ISSN-L)
- OpenAlex
- W1979021932
- Cited by
- 57
- References
- 11
- Citations by year
- 2026: 2 · 2025: 5 · 2024: 2 · 2023: 10 · 2022: 7 · 2021: 6 · 2020: 6 · 2019: 3 · 2018: 4 · 2017: 3 · 2016: 3 · 2015: 2 · 2014: 3 · 2013: 1
- FWCI
- 3.32
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Communications Magazine (publishedVersion)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Wireless Communication Security Techniques
- Keywords
- quantum communication, quantum entanglement, polarization, quantum cryptography, key distribution, symmetric encryption, noiseless channel, channel utilization, distributed MAC protocol, Moore's law
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.