[go: up one dir, main page]

Paper 2013/360

Achieving the limits of the noisy-storage model using entanglement sampling

Frédéric Dupuis, Omar Fawzi, and Stephanie Wehner

Abstract

A natural measure for the amount of quantum information that a physical system $E$ holds about another system $A = A_1,...,A_n$ is given by the min-entropy $\hmin(A|E)$. Specifically, the min-entropy measures the amount of entanglement between $E$ and $A$, and is the relevant measure when analyzing a wide variety of problems ranging from randomness extraction in quantum cryptography, decoupling used in channel coding, to physical processes such as thermalization or the thermodynamic work cost (or gain) of erasing a quantum system. As such, it is a central question to determine the behaviour of the min-entropy after some process M is applied to the system $A$. Here we introduce a new generic tool relating the resulting min-entropy to the original one, and apply it to several settings of interest, including sampling of subsystems and measuring in a randomly chosen basis. The results on random measurements yield new high-order entropic uncertainty relations with which we prove the optimality of cryptographic schemes in the bounded quantum storage model. This is an abridged version of the paper; the full version containing all proofs and further applications can be found in \cite{DFW13}.

Note: This is the abridged version of the paper submitted to the proceedings of CRYPTO 2013; the full version is available at arxiv.org/abs/1305.1316.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. IACR version of a CRYPTO 2013 paper
Keywords
quantum cryptographyinformation theory
Contact author(s)
dupuis @ cs au dk
History
2013-06-10: received
Short URL
https://ia.cr/2013/360
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/360,
      author = {Frédéric Dupuis and Omar Fawzi and Stephanie Wehner},
      title = {Achieving the limits of the noisy-storage model using entanglement sampling},
      howpublished = {Cryptology {ePrint} Archive, Paper 2013/360},
      year = {2013},
      url = {https://eprint.iacr.org/2013/360}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.