pith. sign in

arxiv: quant-ph/0602176 · v2 · submitted 2006-02-21 · 🪐 quant-ph

Quantum states representing perfectly secure bits are always distillable

classification 🪐 quant-ph
keywords distillableentanglementsecurestatesalwaysbipartitebitscryptographic
0
0 comments X
read the original abstract

It is proven that recently introduced states with perfectly secure bits of cryptographic key (private states representing secure bit) [K. Horodecki et al., Phys. Rev. Lett. 94, 160502 (2005)] as well as its multipartite and higher dimension generalizations always represent distillable entanglement. The corresponding lower bounds on distillable entanglement are provided. We also present a simple alternative proof that for any bipartite quantum state entanglement cost is an upper bound on distillable cryptographic key in bipartite scenario.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.