Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0207147 · Foundations of Physics

Hiding Quantum Data

David Peter Divincenzo, Patrick M. Hayden, Barbara M. Terhal

Published Oct 24, 2003• 52 citations
arXivHTMLPDF
DOI
10.1023/a:1026013201376

Related papers

Ultimate Data Hiding in Quantum Mechanics and Beyond

Ludovico Lami, Carlos Palazuelos, Andreas Winter

arXiv:1703.03392•Communications in Mathematical Physics•Jun 12, 2018•69 citations

Keeping quantum secrets

Nature•Nov 12, 2013•0 citations

Quantum data hiding

David Peter Divincenzo, Debbie Leung, Barbara M. Terhal

We expand on our work on quantum data hiding - hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell (1964) states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data-hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.

arXiv:quant-ph/0103098•IEEE Transactions on Information Theory•Mar 1, 2002•402 citations

Quantum Data Hiding

David Peter Divincenzo, Debbie Leung, Barbara M. Terhal

Abstract — We expand on our work on Quantum Data Hiding [1] – hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.

•Mar 16, 2001•280 citations

Quantum information leakage

Gabriella Graziano

Nature Reviews Chemistry•Mar 20, 2020•0 citations

Quantum Data Hiding in the Presence of Noise

Cosmo Lupo, Mark M. Wilde, Seth Lloyd

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 reliably decode 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:1507.06038•IEEE Transactions on Information Theory•Apr 11, 2016•11 citations
We expand on our work on quantum data hiding - hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell (1964) states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data-hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.
Abstract — We expand on our work on Quantum Data Hiding [1] – hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.
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 reliably decode 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.