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.
Recommendations
Cited in
(15)- Quantum advantage of resources in data hiding
- Faithful squashed entanglement
- Randomizing quantum states: constructions and applications
- Local indistinguishability and possibility of hiding cbits in activable bound entangled states
- Hiding messages in quantum data
- Misdirection steganography
- How to randomly flip a quantum bit
- Quantum steganography using prior entanglement
- Quantum encryption and generalized Shannon impossibility
- Quantum data hiding
- Multi-party quantum steganography
- Ultimate data hiding in quantum mechanics and beyond
- The locking-decoding frontier for generic dynamics
- Metric and classical fidelity uncertainty relations for random unitary matrices
- Quantum Data Hiding in the Presence of Noise
This page was built for publication: Hiding quantum data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q720539)
