Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 337

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 access
Boykin, P. Oscar, Roychowdhury, Vwani·2003·Physical Review A

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreva.67.042317

Cites

13 of 13 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 13 references

Cited by

See all 337

Metadata

Authors
Boykin, P. O., & Roychowdhury, V.
Venue
Physical Review A
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.