CoChat

Randomizing Quantum States: Constructions and Applications

Open access
Hayden, Patrick, Leung, Debbie, Shor, Peter W., Winter, Andreas · 2004 · Communications in Mathematical Physics

The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.

Abstract

The construction of a perfectly secure private quantum channel in dimension d is known to require 2 log d shared random key bits between the sender and receiver. We show that if only near-perfect security is required, the size of the key can be reduced by a factor of two. More specifically, we show that there exists a set of roughly d log d unitary operators whose average effect on every input pure state is almost perfectly randomizing, as compared to the d2 operators required to randomize perfectly. Aside from the private quantum channel, variations of this construction can be applied to many other tasks in quantum information processing. We show, for instance, that it can be used to construct LOCC data hiding schemes for bits and qubits that are much more efficient than any others known, allowing roughly log d qubits to be hidden in 2 log d qubits. The method can also be used to exhibit the existence of quantum states with locked classical correlations, an arbitrarily large amplification of the correlation being accomplished by sending a negligibly small classical key. Our construction also provides the basic building block for a method of remotely preparing arbitrary d-dimensional pure quantum states using approximately log d bits of communication and log d ebits of entanglement.

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.

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

Integrity signals

Registry

Crossref · 10.1007/s00220-004-1087-6

Cites

32 of 32 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.

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.

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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 32 references

Cited by

See all 345

Metadata

Authors
Hayden, P., Leung, D., Shor, P. W., & Winter, A.
Affiliations
  • California Institute of Technology (US)
  • Mathematical Sciences Research Institute (US)
  • AT&T (United States) (US)
  • University of Bristol (GB)
Corresponding author
Hayden, Patrick
Venue
Communications in Mathematical Physics
Published
2004-07-08
Volume
250
Issue
2
Pages
371-391
ISSN
  • 0010-3616 (ISSN-L)
  • 1432-0916
OpenAlex
W1980744208
Cited by
345
References
32
Citations by year
2026: 4 · 2025: 13 · 2024: 12 · 2023: 9 · 2022: 13 · 2021: 16 · 2020: 12 · 2019: 10 · 2018: 13 · 2017: 12 · 2016: 22 · 2015: 17 · 2014: 22 · 2013: 21 · 2012: 13
FWCI
20.97
Type
journal article
Language
en
Open access
Licence
www.springer.com/tdm (tdm)
Locations
  • Communications in Mathematical Physics (publishedVersion)
  • Bristol Research (University of Bristol) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CaltechAUTHORS (California Institute of Technology) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
unitary operators, quantum correlations, remote state preparation, entanglement, quantum information security

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: Randomizing Quantum States: Constructions and Applications. https://app.cochat.ai/papers/10.1007/s00220-004-1087-6
The paper
Hayden, P., Leung, D., Shor, P. W., & Winter, A. (2004). Randomizing Quantum States: Constructions and Applications. Communications in Mathematical Physics. https://doi.org/10.1007/s00220-004-1087-6

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.