Quantum data hiding in the presence of noise
arXiv:1507.06038 · doi:10.1109/TIT.2016.2552547
Abstract
When classical or quantum information is broadcast to separate receivers, there exist codes that encrypt the encoded data such that the receivers cannot recover it when performing local operations and classical communication, but they can decode reliably if they bring their systems together and perform a collective measurement. This phenomenon is known as quantum data hiding and hitherto has been studied under the assumption that noise does not affect the encoded systems. With the aim of applying the quantum data hiding effect in practical scenarios, here we define the data-hiding capacity for hiding classical information using a quantum channel. Using this notion, we establish a regularized upper bound on the data hiding capacity of any quantum broadcast channel, and we prove that coherent-state encodings have a strong limitation on their data hiding rates. We then prove a lower bound on the data hiding capacity of channels that map the maximally mixed state to the maximally mixed state (we call these channels "mictodiactic"---they can be seen as a generalization of unital channels when the input and output spaces are not necessarily isomorphic) and argue how to extend this bound to generic channels and to more than two receivers.
arXiv comment12 pages, accepted for publication in IEEE Transactions on Information Theory
References in corpus (22)
- Quantum Nonlocality without Entanglement
- Coding Theorem and Strong Converse for Quantum Channels
- Quantum Data Hiding
- Randomizing quantum states: Constructions and applications
- Classical capacity of the lossy bosonic channel: the exact solution
- Continuity of quantum conditional information
- Hiding bits in Bell states
- Locking classical correlation in quantum states
- Hiding classical data in multi-partite quantum states
- Contractivity of positive and trace preserving maps under norms
- Quantum broadcast channels
- Classical capacity of bosonic broadcast communication and a new minimum output entropy conjecture
- Multiparty data hiding of quantum information
- On almost randomizing channels with a short Kraus decomposition
- Hiding Quantum Data
- Approximate Randomization of Quantum States With Fewer Bits of Key
- Quantum-locked key distribution at nearly the classical capacity rate
- Quantum enigma machines and the locking capacity of a quantum channel
- Robust quantum data locking from phase modulation
- On the Optimality of Quantum Encryption Schemes
- Quantum data locking for high-rate private communication
- Continuous-variable quantum enigma machines for long-distance key distribution
Cited by in corpus (5)
- Quantum Pufferfish Privacy: A Flexible Privacy Framework for Quantum Systems
- Quantum data hiding with continuous variable systems
- Non-Markovianity in High-Dimensional Open Quantum Systems using Next-generation Multicore Optical Fibers
- Metric and classical fidelity uncertainty relations for random unitary matrices
- Classical State Masking over a Quantum Channel