The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Optimal encryption of quantum bits
Open accessAbstract
We show that $2n$ random classical bits are both necessary and sufficient for encrypting any unknown state of n quantum bits in an informationally secure manner. We also characterize the complete set of optimal protocols in terms of a set of unitary operations that comprise an orthonormal basis in a canonical inner product space. Moreover, a connection is made between quantum encryption and quantum teleportation that allows for a different proof of optimality of teleportation.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
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
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 1×
“, output of the encryption process), then Shannon defined informationally secure cryptography in the following way[5]: I(M ;C) = H(C) − H(C|M) = 0 .”
MethodQuantum 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
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 Theory: Concepts and Methods
Peres, A., & Ballentine, L. E. (1995) · American Journal of Physics · doi:10.1119/1.17946 · Cited by 2,561
Cleve, R., Gottesman, D., & Lo, H.-K. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.648 · Cited by 1,373
Quantum Theory: Concepts and Methods
(2002) · doi:10.1007/0-306-47120-5 · Cited by 1,029
Cited by
DURT, T., ENGLERT, B.-G., BENGTSSON, I., & ŻYCZKOWSKI, K. (2010) · International Journal of Quantum Information · doi:10.1142/s0219749910006502 · Cited by 728
A New Proof for the Existence of Mutually Unbiased Bases
Not Available, N. A., Not Available, N. A., Not Available, N. A., & Not Available, N. A. (2002) · Algorithmica · doi:10.1007/s00453-002-0980-7 · Cited by 570
Universal Blind Quantum Computation
Broadbent, A., Fitzsimons, J., & Kashefi, E. (2009) · 2009 50th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2009.36 · Cited by 521
Randomizing Quantum States: Constructions and Applications
Hayden, P., Leung, D., Shor, P. W., & Winter, A. (2004) · Communications in Mathematical Physics · doi:10.1007/s00220-004-1087-6 · Cited by 345
Authentication of quantum messages
Barnum, H., Crepeau, C., Gottesman, D., Smith, A., & Tapp, A. (2003) · The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. · doi:10.1109/sfcs.2002.1181969 · Cited by 272
Metadata
- Authors
- Boykin, P. O., & Roychowdhury, V.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2003-04-22
- Volume
- 67
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2043414726
- Cited by
- 337
- References
- 13
- FWCI
- 10.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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimal encryption of quantum bits. https://app.cochat.ai/papers/10.1103/physreva.67.042317
- The paper
- Boykin, P. O., & Roychowdhury, V. (2003). Optimal encryption of quantum bits. Physical Review A. https://doi.org/10.1103/physreva.67.042317
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.