pith. sign in

arxiv: quant-ph/0207147 · v1 · submitted 2002-07-25 · 🪐 quant-ph

Hiding Quantum Data

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

Recent work has shown how to use the laws of quantum mechanics to keep classical and quantum bits secret in a number of different circumstances. Among the examples are private quantum channels, quantum secret sharing and quantum data hiding. In this paper we show that a method for keeping two classical bits hidden in any such scenario can be used to construct a method for keeping one quantum bit hidden, and vice--versa. In the realm of quantum data hiding, this allows us to construct bipartite and multipartite hiding schemes for qubits from the previously known constructions for hiding bits. Our method also gives a simple proof that two bits of shared randomness are required to construct a private quantum channel hiding one qubit.

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.