Random private quantum states
Matthias Christandl (1), Roberto Ferrara (1, 4), C\'ecilia Lancien, (2, 3, 5) ((1) QMATH, Department of Mathematical Sciences, University of, Copenhagen, (2) Departamento de An\'alisis Matem\'atico, Universidad, Complutense de Madrid, (3) Instituto de Ciencias Matem\'aticas

TL;DR
This paper investigates the entanglement properties of random private quantum states, revealing they are nearly indistinguishable from separable states and have low repeatable key despite containing one bit of secret key.
Contribution
The work introduces new analytical tools for studying private quantum states, including a novel operator ordering and bounds on norms under tensoring with entangled states.
Findings
Random private quantum states are nearly indistinguishable from separable states.
They possess low repeatable key despite containing one bit of secret key.
New techniques include bounds on norms and a continuity bound for relative entropy.
Abstract
The study of properties of randomly chosen quantum states has in recent years led to many insights into quantum entanglement. In this work, we study private quantum states from this point of view. Private quantum states are bipartite quantum states characterised by the property that carrying out simple local measurements yields a secret bit. This feature is shared by the maximally entangled pair of quantum bits, yet private quantum states are more general and can in their most extreme form be almost bound entangled. In this work, we study the entanglement properties of random private quantum states and show that they are hardly distinguishable from separable states and thus have low repeatable key, despite containing one bit of key. The technical tools we develop are centred around the concept of locally restricted measurements and include a new operator ordering, bounds on norms under…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
