Randomizing Quantum States: Constructions and Applications
Open accessThe 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.
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.
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?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“This unbounded information density is itself tantamount to a loss of unitarity (at least in our universe) [21].”
From Quantum Information Cannot Be Completely Hidden in Correlations: Implications for the Black-Hole Information Paradox (2007) · cites this paper as [21]
Experimental — accuracy not yet measured
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
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 · cited 1×
“Insofar as teleportation [10], or more generally remote state preparation [11], can be interpreted as a method for encrypting quantum states [12, 13], our approximate encryption procedure should give rise to an approximate remote state preparation method consuming only half as much communication as teleportation.”
MethodCommunication 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 · cited 1×
“This factor of 2 represents a familiar and even welcome phenomenon in quantum information theory; the reason for its appearance is intimately connected to the existence of superdense coding [3, 4].”
BackgroundLarge Deviations Techniques and Applications
Schmock, U., Dembo, A., & Zeitouni, O. (2000) · Journal of the American Statistical Association · doi:10.2307/2669805 · Cited by 3,524
Generalized entropic uncertainty relations
Maassen, H., & Uffink, J. B. M. (1988) · Physical Review Letters · doi:10.1103/physrevlett.60.1103 · Cited by 1,241 · cited 1×
“The general mathematical question we addressed in this section amounts to quantifying the constraints imposed by entropic uncertainty relations [24, 25] on typical observables, an interesting problem in its own right, regardless of its connection to locking classical correlations.”
BackgroundQuantum nonlocality without entanglement
Bennett, C. H., DiVincenzo, D. P., Fuchs, C. A., Mor, T., Rains, E., Shor, P. W., Smolin, J. A., & Wootters, W. K. (1999) · Physical Review A · doi:10.1103/physreva.59.1070 · Cited by 1,130 · cited 1×
“The fact that -randomizing maps render the correlations of entanglement invisible to LOCC also raises the question of their relationship to the phenomenon of quantum nonlocality without entanglement [17].”
BackgroundSelf-citationSchumacher, B. (1995) · Physical Review A · doi:10.1103/physreva.51.2738 · Cited by 1,090 · cited 1×
“Most results in quantum information theory exploit regularities in the structure of the input or operations; Schumacher’s quantum noiseless coding theorem [20, 26], for example, is based on the fact that for large l, a state ρ⊗l will be almost entirely supported on an l(S(ρ)+ δ)-qubit subspace.”
BackgroundUncertainty in Quantum Measurements
Deutsch, D. (1983) · Physical Review Letters · doi:10.1103/physrevlett.50.631 · Cited by 906 · cited 1×
“The general mathematical question we addressed in this section amounts to quantifying the constraints imposed by entropic uncertainty relations [24, 25] on typical observables, an interesting problem in its own right, regardless of its connection to locking classical correlations.”
Background大矢, 雅., & Petz, D. (1993) · Cited by 817
Asymptotic Theory of Finite Dimensional Normed Spaces
(1986) · Lecture Notes in Mathematics · doi:10.1007/bfb0075912 · Cited by 778
Cryptographic distinguishability measures for quantum-mechanical states
Fuchs, C. A., & van de Graaf, J. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.761271 · Cited by 773 · cited 1×
“It would then follow by standard inequalities [23] that ‖D◦R(φ)−φ‖1 ≤ 2√α and, choosing α = δ2/4, that the correctness criterion is satisfied.”
Ohya, M., & Petz, D. (1993) · doi:10.1007/978-3-642-57997-4 · Cited by 764 · cited 2×
“Most results in quantum information theory exploit regularities in the structure of the input or operations; Schumacher’s quantum noiseless coding theorem [20, 26], for example, is based on the fact that for large l, a state ρ⊗l will be almost entirely supported on an l(S(ρ)+ δ)-qubit subspace.”
BackgroundMethodLo, H.-K. (2000) · Physical Review A · doi:10.1103/physreva.62.012313 · Cited by 671 · cited 1×
“Insofar as teleportation [10], or more generally remote state preparation [11], can be interpreted as a method for encrypting quantum states [12, 13], our approximate encryption procedure should give rise to an approximate remote state preparation method consuming only half as much communication as teleportation.”
MethodClassical information capacity of a quantum channel
Hausladen, P., Jozsa, R., Schumacher, B., Westmoreland, M., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.1869 · Cited by 498 · cited 2×
“Our proof that this decoding procedure works is via a reduction to the task of decoding classical data, for which there are well-known criteria for the success of the pretty good measurement [22].”
BackgroundMethodA continuity property of the entropy density for spin lattice systems
Fannes, M. (1973) · Communications in Mathematical Physics · doi:10.1007/bf01646490 · Cited by 405 · cited 1×
“Then, applying Fannes’ inequality [27] to the distributions pj and p̃j ,”
MethodDiVincenzo, D. P., Leung, D. W., & Terhal, B. M. (2002) · IEEE Transactions on Information Theory · doi:10.1109/18.985948 · Cited by 362 · cited 1×
“This basic insight provides the intuition behind a new scheme for data hiding in a bipartite system [5, 6, 7].”
BackgroundSelf-citationOptimal encryption of quantum bits
Boykin, P. O., & Roychowdhury, V. (2003) · Physical Review A · doi:10.1103/physreva.67.042317 · Cited by 337
A ‘Pretty Good’ Measurement for Distinguishing Quantum States
Hausladen, P., & Wootters, W. K. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552221 · Cited by 323 · cited 1×
“Our decoding procedure will be given by the transpose channel [20], a generalization of the pretty good measurement [21].”
MethodDivincenzo, D. P., Leung, D., & Terhal, B. M. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 281
Self-citationOblivious Remote State Preparation
Leung, D. W., & Shor, P. W. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.127905 · Cited by 240 · cited 1×
“Insofar as teleportation [10], or more generally remote state preparation [11], can be interpreted as a method for encrypting quantum states [12, 13], our approximate encryption procedure should give rise to an approximate remote state preparation method consuming only half as much communication as teleportation.”
MethodSelf-citationLocking Classical Correlations in Quantum States
DiVincenzo, D. P., Horodecki, M., Leung, D. W., Smolin, J. A., & Terhal, B. M. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.067902 · Cited by 238 · cited 1×
“[8] but some central questions about the range of possible effects were left open.”
BackgroundSelf-citationAmbainis, A., Mosca, M., Tapp, A., & De Wolf, R. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892142 · Cited by 214 · cited 2×
“For instance, one can encrypt a state |φ〉 ∈ C using a secret key of length 2 log d as follows [2, 3].”
BackgroundMethodHiding Classical Data in Multipartite Quantum States
Eggeling, T., & Werner, R. F. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.097905 · Cited by 180 · cited 2×
“[5] requires roughly 24 qubits per hidden bit.”
BackgroundTruncations of random unitary matrices
Zyczkowski, K., & Sommers, H.-J. (2000) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/33/10/307 · Cited by 168 · cited 2×
“⊓⊔ As an aside, we note that the probability density function for Tr( U j ϕU † j P ) was recently calculated exactly by Zyczkowski and Sommers [16].”
MethodLower bound for accessible information in quantum mechanics
Jozsa, R., Robb, D., & Wootters, W. K. (1994) · Physical Review A · doi:10.1103/physreva.49.668 · Cited by 159
Statistical problems in quantum physics
Holevo, A. S. (1973) · Lecture notes in mathematics · doi:10.1007/bfb0061483 · Cited by 121 · cited 1×
“This accessible information is bounded above by the Holevo quantity [14]”
MethodYoung, R. M. (1991) · The Mathematical Gazette · doi:10.2307/3620251 · Cited by 120
A.: Remote preparation of quantum states
Bennett, C. H., Hayden, P. M., Leung, D., Shor, P. W., & Winter, A. (2003) · Bristol Research (University of Bristol) · Cited by 120
Self-citationBurk, F. (1985) · College Mathematics Journal · doi:10.1080/07468342.1985.11972895 · Cited by 115
Quantum Nonlocality in the Presence of Superselection Rules and Data Hiding Protocols
Verstraete, F., & Cirac, J. I. (2003) · Physical Review Letters · doi:10.1103/physrevlett.91.010404 · Cited by 103 · cited 1×
“It was recently discovered, for example, that in some systems with superselection rules, a ratio of 1 : 1 is achievable [19].”
BackgroundQuantum vernam cipherPreprint
Leung, D. (2002) · doi:10.5555/2011417.2011419 · Cited by 68
Self-citationDivincenzo, D. P., Hayden, P. M., & Terhal, B. M. (2003) · Foundations of Physics · doi:10.1023/a:1026013201376 · Cited by 52 · cited 1×
“[6] would have multiplied that overhead by a further dimension-dependent factor.”
BackgroundSelf-citationDivincenzo, D. P., Hayden, P. M., & Terhal, B. M. (2002) · CERN Document Server (European Organization for Nuclear Research) · Cited by 28
Self-citation
Cited by
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
“[682] showed that a random choice of k random observables (distributed according to the unitary invariant measure) satisfies a maximally strong EUR with probability arbitrary close to 1, provided that d is large enough and k grows at least logarithmically in d (see also Refs.”
Verstraete, F., Murg, V., & Cirac, J. I. (2008) · Advances in Physics · doi:10.1080/14789940801912366 · Cited by 1,762
Advances in Quantum Cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2019) · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · Cited by 1,566
The Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
SECURITY OF QUANTUM KEY DISTRIBUTION
RENNER, R. (2008) · International Journal of Quantum Information · doi:10.1142/s0219749908003256 · Cited by 1,047
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
- Semantic Scholar
- 95adbc1cb9c884b85da7c92aa74b3632a98aa128
- 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
- green
- arxiv.org
- 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
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.