The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Improving the capacity of the Boström-Felbinger protocol
Open accessAbstract
We show that the capacity of the Bostr\"om-Felbinger (ping-pong) protocol [Phys. Rev. Lett. 89, 187902 (2002)] can be doubled by introducing two additional unitary operations. In message mode, Alice can use one of the four unitary operations to encode two classical bits of information. Bob can decode Alice's information by using a Bell-basis measurement. Security against eavesdropping attack can be ensured by using two conjugate measurement bases in control mode. A message authentification method can protect this communication against a man-in-the-middle attack without eavesdropping.
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
Quantum computation and quantum information
Law, J. (2001) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/505482.505499 · Cited by 18,842
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
Bennett, C. H., & Wiesner, S. J. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.2881 · Cited by 5,470
Quantum cryptography using any two nonorthogonal states
Bennett, C. H. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.3121 · Cited by 3,028
Quantum cryptography without Bell’s theorem
Bennett, C. H., Brassard, G., & Mermin, N. D. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.557 · Cited by 2,460
Unconditional Security of Quantum Key Distribution over Arbitrarily Long Distances
Lo, H.-K., & Chau, H. F. (1999) · Science · doi:10.1126/science.283.5410.2050 · Cited by 1,858
Deterministic Secure Direct Communication Using Entanglement
Boström, K., & Felbinger, T. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.187902 · Cited by 1,072
Optimal Eavesdropping in Quantum Cryptography with Six States
Bruß, D. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.3018 · Cited by 864
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
Quantum Key Distribution in the Holevo Limit
Cabello, A. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5635 · Cited by 634
Quantum cryptography with coherent states
Huttner, B., Imoto, N., Gisin, N., & Mor, T. (1995) · Physical Review A · doi:10.1103/physreva.51.1863 · Cited by 611
Secure Communication with a Publicly Known Key
Beige, A., Englert, B. G., Kurtsiefer, C., & Weinfurter, H. (2002) · Acta Physica Polonica A · doi:10.12693/aphyspola.101.357 · Cited by 417
Eavesdropping on the “Ping-Pong” Quantum Communication Protocol
Wójcik, A. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.157901 · Cited by 334
Quantum Cryptography Based on Orthogonal States
Goldenberg, L., & Vaidman, L. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.1239 · Cited by 296
The “Ping-Pong” Protocol Can Be Attacked without Eavesdropping
Cai, Q.-Y. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.109801 · Cited by 287
Self-citationQuantum Cryptography Based on Split Transmission of One-Bit Information in Two Steps
Koashi, M., & Imoto, N. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.2383 · Cited by 137
Quantum cryptography without public announcement of bases
Hwang, W. Y., Koh, I. G., & Han, Y. D. (1998) · Physics Letters A · doi:10.1016/s0375-9601(98)00358-2 · Cited by 112
Cited by
Quantum secure direct communication with high-dimension quantum superdense coding
Wang, C., Deng, F.-G., Li, Y.-S., Liu, X.-S., & Long, G. L. (2005) · Physical Review A · doi:10.1103/physreva.71.044305 · Cited by 935
Eavesdropping on the two-way quantum communication protocols with invisible photons
Cai, Q.-Y. (2006) · Physics Letters A · doi:10.1016/j.physleta.2005.10.050 · Cited by 439
Self-citationSecure Deterministic Communication without Entanglement
Lucamarini, M., & Mancini, S. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.140501 · Cited by 430
Experimental quantum secure direct communication with single photons
Hu, J.-Y., Yu, B., Jing, M.-Y., Xiao, L.-T., Jia, S.-T., Qin, G.-Q., & Long, G.-L. (2016) · Light: Science & Applications · doi:10.1038/lsa.2016.144 · Cited by 420
Multi-step quantum secure direct communication using multi-particle Green–Horne–Zeilinger state
Wang, C., Deng, F. G., & Long, G. L. (2005) · Optics Communications · doi:10.1016/j.optcom.2005.04.048 · Cited by 355
Metadata
- Authors
- Cai, Q.-Y., & Li, B.-W.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2004-05-10
- Volume
- 69
- Issue
- 5
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2084636151
- Cited by
- 261
- References
- 18
- FWCI
- 15.25
- 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
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.