The Evolution of Quantum Secure Direct Communication: On the Road to the Qinternet
Open accessThe DOI matches its Crossref record; 55 of the 55 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].”
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
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406 · cited 2×
“As a conclusion, it is claimed in [137] that unknown quantum states cannot be cloned (copied) perfectly.”
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597 · cited 1×
“However, at the time of writing, the security of asymmetric cryptography is facing increasing threats from quantum computers [5]–[8], which are capable of factoring large primes.”
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
�ber den anschaulichen Inhalt der quantentheoretischen Kinematik und Mechanik
Heisenberg, W. (1927) · Zeitschrift f�r Physik · doi:10.1007/bf01397280 · Cited by 4,278
Quantum information with continuous variables
Braunstein, S. L., & van Loock, P. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.513 · Cited by 3,858
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
Three qubits can be entangled in two inequivalent ways
Dür, W., Vidal, G., & Cirac, J. I. (2000) · Physical Review A · doi:10.1103/physreva.62.062314 · Cited by 3,384 · cited 1×
“(9), other members of the entangled state family include the GHZ states [123], [124] defined as: and the W-state [125] They have been widely used in quantum communication protocols.”
Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
Shor, P. W., & Preskill, J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.441 · Cited by 3,047
Quantum internet: a vision for the road ahead
Wehner, S., Elkouss, D., & Hanson, R. (2018) · Science · doi:10.1126/science.aam9288 · Cited by 2,467
‘‘Event-ready-detectors’’ Bell experiment via entanglement swapping
Żukowski, M., Zeilinger, A., Horne, M. A., & Ekert, A. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.71.4287 · Cited by 2,045 · cited 1×
“5) Entanglement resources for information transmission: Superdense coding [147], quantum teleportation [40], [148], and entanglement swapping [149] are important quantum-domain operations that rely on EPR pairs.”
Experimental Test of Local Hidden-Variable Theories
Freedman, S. J., & Clauser, J. F. (1972) · Physical Review Letters · doi:10.1103/physrevlett.28.938 · Cited by 1,999
Optical Communication in Space: Challenges and Mitigation Techniques
Kaushal, H., & Kaddoum, G. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2603518 · Cited by 1,927 · cited 1×
“[234] The additional attenuation caused by diffraction was taken into consideration in the analysis of key-rate performance in earth-satellite QKD. Absorption and scattering [235], [224] The propagation loss of adverse weathers conditions was quantified.”
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
Bell’s Theorem, Quantum Theory and Conceptions of the Universe
(1989) · doi:10.1007/978-94-017-0849-4 · Cited by 1,632 · cited 1×
“(9), other members of the entangled state family include the GHZ states [123], [124] defined as: and the W-state [125] They have been widely used in quantum communication protocols.”
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470 · cited 1×
“However, Grover’s algorithm provides an improvement to this problem [25], although an exponential speed-up in the database search problem is infeasible even for Grover’s optimal algorithm [20], [26]–[28].”
Dieks, D. (1982) · Physics Letters A · doi:10.1016/0375-9601(82)90084-6 · Cited by 1,461
Random numbers certified by Bell’s theorem
Pironio, S., Acín, A., Massar, S., de la Giroday, A. B., Matsukevich, D. N., Maunz, P., Olmschenk, S., Hayes, D., Luo, L., Manning, T. A., et al. (2010) · Nature · doi:10.1038/nature09008 · Cited by 1,420 · cited 1×
“…test suite [251], [252] Continuous Laser phase fluctuations [253], [254], Vacuum fluctuation [255] Shot noise [256], [257] Super-luminescent diode [258] Detection varies with dfferent quantum randomness source Randomness extractors [259] Physicalcertifica-tion Bell’s theorem [260] in Fig.”
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×
“However, at the time of writing, the security of asymmetric cryptography is facing increasing threats from quantum computers [5]–[8], which are capable of factoring large primes.”
O'Brien, J. L. (2007) · Science · doi:10.1126/science.1142892 · Cited by 1,221
Entanglement-based quantum communication over 144 km
Ursin, R., Tiefenbacher, F., Schmitt-Manderbach, T., Weier, H., Scheidl, T., Lindenthal, M., Blauensteiner, B., Jennewein, T., Perdigues, J., Trojek, P., et al. (2007) · Nature Physics · doi:10.1038/nphys629 · Cited by 1,210
Report on Post-Quantum Cryptography
Chen, L., Jordan, S., Liu, Y.-K., Moody, D., Peralta, R., Perlner, R., & Smith-Tone, D. (2016) · doi:10.6028/nist.ir.8105 · Cited by 1,034 · cited 1×
“Large-scale quantum computers are expected to have far-reaching influence on the existing cryptographic solutions as reported by the National Institute of Standards and Technology [30].”
Measurement-Device-Independent Quantum Key Distribution Over a 404 km Optical Fiber
Yin, H.-L., Chen, T.-Y., Yu, Z.-W., Liu, H., You, L.-X., Zhou, Y.-H., Chen, S.-J., Mao, Y., Huang, M.-Q., Zhang, W.-J., et al. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.190501 · Cited by 836
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830
Optimal Quantum Cloning Machines
Gisin, N., & Massar, S. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2153 · Cited by 722
Quantum Teleportation of a Polarization State with a Complete Bell State Measurement
Kim, Y.-H., Kulik, S. P., & Shih, Y. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.1370 · Cited by 660
Noncommuting Mixed States Cannot Be Broadcast
Barnum, H., Caves, C. M., Fuchs, C. A., Jozsa, R., & Schumacher, B. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.2818 · Cited by 654 · cited 1×
“This argument has also been extended to mixed states in [140].”
Bell measurements for teleportation
Lütkenhaus, N., Calsamiglia, J., & Suominen, K.-A. (1999) · Physical Review A · doi:10.1103/physreva.59.3295 · Cited by 538
Theory of two-photon entanglement in type-II optical parametric down-conversion
Rubin, M. H., Klyshko, D. N., Shih, Y. H., & Sergienko, A. V. (1994) · Physical Review A · doi:10.1103/physreva.50.5122 · Cited by 478
A fast and compact quantum random number generator
Jennewein, T., Achleitner, U., Weihs, G., Weinfurter, H., & Zeilinger, A. (2000) · Review of Scientific Instruments · doi:10.1063/1.1150518 · Cited by 434
A generator for unique quantum random numbers based on vacuum states
Gabriel, C., Wittmann, C., Sych, D., Dong, R., Mauerer, W., Andersen, U. L., Marquardt, C., & Leuchs, G. (2010) · Nature Photonics · doi:10.1038/nphoton.2010.197 · Cited by 419
Introduction to post-quantum cryptography
Bernstein, D. J. (2009) · Post-Quantum Cryptography · doi:10.1007/978-3-540-88702-7_1 · Cited by 364
Distribution of Time-Bin Entangled Qubits over 50 km of Optical Fiber
Marcikic, I., de Riedmatten, H., Tittel, W., Zbinden, H., Legré, M., & Gisin, N. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.180502 · Cited by 343
Complete Deterministic Linear Optics Bell State Analysis
Schuck, C., Huber, G., Kurtsiefer, C., & Weinfurter, H. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.190501 · Cited by 299 · cited 1×
“Hyper-entanglement is a state that is entangled in more than one degrees of freedom and the extra degrees of freedom allows for secondary interferometry, so that the remaining two Bell states can be distinguished [265]– [267].”
Quantum cryptanalysis of hash and claw-free functions: Invited paper
Brassard, G., HØyer, P., & Tapp, A. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054319 · Cited by 251
Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction
Ma, X., Xu, F., Xu, H., Tan, X., Qi, B., & Lo, H.-K. (2013) · Physical Review A · doi:10.1103/physreva.87.062327 · Cited by 241
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
Roetteler, M., Naehrig, M., Svore, K. M., & Lauter, K. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70697-9_9 · Cited by 212
The generation of 68 Gbps quantum random number by measuring laser phase fluctuations
Nie, Y.-Q., Huang, L., Liu, Y., Payne, F., Zhang, J., & Pan, J.-W. (2015) · Review of Scientific Instruments · doi:10.1063/1.4922417 · Cited by 167
Quantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149
Self-citationQuantum Teleportation with a Quantum Dot Single Photon Source
Fattal, D., Diamanti, E., Inoue, K., & Yamamoto, Y. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.037904 · Cited by 138
Quantum communication for wireless wide-area networks
Cheng, S.-T., Wang, C.-Y., & Tao, M.-H. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.851157 · Cited by 109 · cited 1×
“These quantum techniques can be employed for the design of quantum communication protocols as exemplified in [150]–[155].”
Castelletto, S. A., & Scholten, R. E. (2008) · The European Physical Journal Applied Physics · doi:10.1051/epjap:2008029 · Cited by 68 · cited 1×
“By contrast, probabilistic single-photon sources, which are also referred to as heralded single-photon sources [185], generate single photons by measuring one of the photons in an entangled photon pair, which then serves as reference for the generation of a single photon [186], [187].”
Botsinis, P., Ng, S. X., & Hanzo, L. (2013) · IEEE Access · doi:10.1109/access.2013.2259536 · Cited by 64
Self-citationQuantum communications: explained for communication engineers
Imre, S. (2013) · IEEE Communications Magazine · doi:10.1109/mcom.2013.6576335 · Cited by 57 · cited 1×
“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.”
Botsinis, P., Alanis, D., Babar, Z., Ng, S. X., & Hanzo, L. (2015) · IEEE Transactions on Communications · doi:10.1109/tcomm.2015.2458857 · Cited by 48 · cited 1×
“Another well-known algorithm running on a quantum computer is Grover’s search algorithm [16]–[20], which is capable of finding a known entry in unsorted databases [21], [22].”
Self-citation
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
- 55
- 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.