The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet
Open accessThe DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
Abstract
Communication security has to evolve to a higher plane in the face of the threat from the massive computing power of the emerging quantum computers. Quantum secure direct communication (QSDC) constitutes a promising branch of quantum communication, which is provably secure and overcomes the threat of quantum computing, whilst conveying secret messages directly via the quantum channel. In this survey, we highlight the motivation and the status of QSDC research with special emphasis on its theoretical basis and experimental verification. We will detail the associated point-to-point communication protocols and show how information is protected and transmitted. Finally, we discuss the open challenges as well as the future trends of QSDC networks, emphasizing again that QSDC is not a pure quantum key distribution (QKD) protocol, but a fully-fledged secure communication scheme.
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
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 · cited 1×
“2) Quantum entanglement: The concept of entanglement originates from the influential argument of Einstein et al .”
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703 · cited 3×
“…quantum cryptographic or quantum communication protocols have been proposed, which can be classified into four main branches: quantum key distribution (QKD) [38], quantum teleportation [40], quantum secret sharing [41], and quantum secure direct communication (QSDC) [42], [43], as shown in Fig.”
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462 · cited 3×
“Such as factoring large prime numbers in Rivest-Shamir-Adleman cryptosystems [3], and solving discrete logarithmic problems.”
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777 · cited 3×
“QKD allows two parties to agree on a secret key by exchanging qubits over a quantum channel [38], [47], [48].”
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 2×
“At the time of writing, only the one-time-pad has been proven to be perfectly secure [46].”
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 · cited 1×
“Shor’s algorithm [12] shows that a quantum computer is capable of efficient factorization of large 1 Asymmetric cryptography is also known as public-key cryptography, which is an approach that uses a pair of related keys called public key and private key to encrypt and decrypt a secret plaintext,…”
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Cited by
Quantum Secure Direct Communication Technology-Enhanced Time-Sensitive Networks
Zhang, S., & Zheng, C. (2025) · Entropy · doi:10.3390/e27030221 · Cited by 5
“This property fundamentally eliminates the possibility of eavesdropper obtaining keys through classical channels, so it has advantages in improving communication security [72,73].”
Metadata
- Authors
- Pan, D., Long, G.-L., Yin, L., Sheng, Y.-B., Ruan, D., Ng, S. X., Lu, J., & Hanzo, L.
- Venue
- IEEE Communications Surveys & Tutorials
- Published
- 2024
- Volume
- 26
- Issue
- 3
- Pages
- 1898-1949
- ISSN
- 1553-877X (ISSN-L)
- 2373-745X
- OpenAlex
- W4391948471
- Cited by
- 180
- References
- 60
- FWCI
- 26.79
- 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.