The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Experimental long-distance quantum secure direct communication
Open accessAbstract
Quantum secure direct communication (QSDC) is an important quantum communication branch, which realizes the secure information transmission directly without encryption and decryption processes. Recently, two table-top experiments have demonstrated the principle of QSDC. Here, we report the first long-distance QSDC experiment, including the security test, information encoding, fiber transmission and decoding. After the fiber transmission of 0.5 km, quantum state fidelities of the two polarization entangled Bell states are 91% and 88%, respectively, which are used for information coding. We theoretically analyze the performance of the QSDC system based on current optical communication technologies, showing that QSDC over fiber links of several tens kilometers could be expected. It demonstrates the potential of long-distance QSDC and supports its future applications on quantum communication networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
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
Kimble, H. J. (2008) · Nature · doi:10.1038/nature07127 · Cited by 6,023
Quantum cryptography using any two nonorthogonal states
Bennett, C. H. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.3121 · Cited by 3,028
Aspect, A., Grangier, P., & Roger, G. (1982) · Physical Review Letters · doi:10.1103/physrevlett.49.91 · Cited by 2,687
James, D. F. V., Kwiat, P. G., Munro, W. J., & White, A. G. (2001) · Physical Review A · doi:10.1103/physreva.64.052312 · Cited by 2,176 · cited 1×
“The information is encoded on polarizations of entangled photon pairs and discriminated by quantum state tomography (QST) technology [19].”
Gisin, N., & Thew, R. (2007) · Nature Photonics · doi:10.1038/nphoton.2007.22 · Cited by 2,147
Two-step quantum direct communication protocol using the Einstein-Podolsky-Rosen pair block
Deng, F.-G., Long, G. L., & Liu, X.-S. (2003) · Physical Review A · doi:10.1103/physreva.68.042317 · Cited by 1,771
Theoretically efficient high-capacity quantum-key-distribution scheme
Long, G. L., & Liu, X. S. (2002) · Physical Review A · doi:10.1103/physreva.65.032302 · Cited by 1,741
Cited by
One-step quantum secure direct communication
Sheng, Y.-B., Zhou, L., & Long, G.-L. (2022) · Science Bulletin · doi:10.1016/j.scib.2021.11.002 · Cited by 362
Self-citationDevice-independent quantum secure direct communication against collective attacks
Zhou, L., Sheng, Y.-B., & Long, G.-L. (2020) · Science Bulletin · doi:10.1016/j.scib.2019.10.025 · Cited by 293
Self-citationRecent progress in quantum photonic chips for quantum communication and internet
Luo, W., Cao, L., Shi, Y., Wan, L., Zhang, H., Li, S., Chen, G., Li, Y., Li, S., Wang, Y., et al. (2023) · Light: Science & Applications · doi:10.1038/s41377-023-01173-8 · Cited by 284
Implementation and security analysis of practical quantum secure direct communication
Qi, R., Sun, Z., Lin, Z., Niu, P., Hao, W., Song, L., Huang, Q., Gao, J., Yin, L., & Long, G.-L. (2019) · Light: Science & Applications · doi:10.1038/s41377-019-0132-3 · Cited by 255
Metadata
- Authors
- Zhu, F., Zhang, W., Sheng, Y., & Huang, Y.
- Venue
- Science Bulletin
- Publisher
- Elsevier BV
- Published
- 2017-11
- Volume
- 62
- Issue
- 22
- Pages
- 1519-1524
- ISSN
- 2095-9273 (ISSN-L)
- OpenAlex
- W2963636894
- Cited by
- 277
- References
- 23
- FWCI
- 20.01
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Experimental long-distance quantum secure direct communication. https://app.cochat.ai/papers/10.1016/j.scib.2017.10.023
- The paper
- Zhu, F., Zhang, W., Sheng, Y., & Huang, Y. (2017). Experimental long-distance quantum secure direct communication. Science Bulletin. https://doi.org/10.1016/j.scib.2017.10.023
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.