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

Operator Algebras and Data Hiding in Topologically Ordered Systems

Pieter Naaijkens, Leander Fiedler, Tobias J. Osborne

Published Oct 9, 2016• 0 citations
OpenAlex

Related papers

Mixed State Topological Order: Operator Algebraic Approach

Yoshiko Ogata

arXiv:2501.02398•Communications in Mathematical Physics•Oct 30, 2025•10 citations

Multiparty data hiding of quantum information

Patrick M. Hayden, Debbie Leung, Graeme Smith

We present protocols for multiparty data hiding of quantum information that implement all possible threshold access structures. Closely related to secret sharing, data hiding has a more demanding security requirement: that the data remain secure against unrestricted attacks via local operation and classical communication. In the limit of hiding a large amount of data, our protocols achieve an asymptotic rate of one hidden qubit per local physical qubit. That is, each party holds a share that is the same size as the hidden state to leading order, with accuracy and security parameters incurring an overhead that is asymptotically negligible. The data-hiding states have very unusual entanglement properties, which we briefly discuss.

arXiv:quant-ph/0407152•Physical Review A•Jun 30, 2005•51 citations

Quantum structures and operator algebras

Jan Hamhalter

Elsevier eBooks•Jan 1, 2007•5 citations

Quantum data hiding with continuous-variable systems

Ludovico Lami

Suppose we want to benchmark a quantum device held by a remote party, e.g., by testing its ability to carry out challenging quantum measurements outside of a free set of measurements $\mathcal{M}$. A very simple way to do so is to set up a binary-state discrimination task that cannot be solved efficiently by means of free measurements. If we can find pairs of orthogonal states that become arbitrarily indistinguishable under measurements in $\mathcal{M}$, in the sense that the error probability in discrimination approaches that of a random guess, we say that there are data hiding against $\mathcal{M}$. Here we investigate data hiding in the context of continuous-variable quantum systems. First, we look at the case where $\mathcal{M}$ denotes the set of measurements implementable with local operations and classical communication. While previous studies have placed upper bounds on the maximum efficiency of data hiding in terms of the local dimension and are thus not applicable to continuous-variable systems, we establish more general bounds that rely solely on the local mean photon number of the states employed. Along the way, we perform a rigorous quantitative analysis of the error introduced by the nonideal Braunstein-Kimble quantum teleportation protocol, determining how much squeezing and local detection efficiency are needed in order to teleport an arbitrary multimode local state of known mean energy with a prescribed accuracy. Finally, following a seminal proposal by Sabapathy and Winter, we look at data hiding against Gaussian operations assisted by the feedforward of measurement outcomes, providing an example of a relatively simple scheme that works with a single mode only.

arXiv:2102.01100•Physical Review A•Nov 29, 2021•20 citations

An Operator-based Approach to Topological Physics

Alexander Cerjan, Stephan Wong, Kahlil Dixon +1 more

•Apr 1, 2024•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 present protocols for multiparty data hiding of quantum information that implement all possible threshold access structures. Closely related to secret sharing, data hiding has a more demanding security requirement: that the data remain secure against unrestricted attacks via local operation and classical communication. In the limit of hiding a large amount of data, our protocols achieve an asymptotic rate of one hidden qubit per local physical qubit. That is, each party holds a share that is the same size as the hidden state to leading order, with accuracy and security parameters incurring an overhead that is asymptotically negligible. The data-hiding states have very unusual entanglement properties, which we briefly discuss.
Suppose we want to benchmark a quantum device held by a remote party, e.g., by testing its ability to carry out challenging quantum measurements outside of a free set of measurements M\mathcal{M}M. A very simple way to do so is to set up a binary-state discrimination task that cannot be solved efficiently by means of free measurements. If we can find pairs of orthogonal states that become arbitrarily indistinguishable under measurements in M\mathcal{M}M, in the sense that the error probability in discrimination approaches that of a random guess, we say that there are data hiding against M\mathcal{M}M. Here we investigate data hiding in the context of continuous-variable quantum systems. First, we look at the case where M\mathcal{M}M denotes the set of measurements implementable with local operations and classical communication. While previous studies have placed upper bounds on the maximum efficiency of data hiding in terms of the local dimension and are thus not applicable to continuous-variable systems, we establish more general bounds that rely solely on the local mean photon number of the states employed. Along the way, we perform a rigorous quantitative analysis of the error introduced by the nonideal Braunstein-Kimble quantum teleportation protocol, determining how much squeezing and local detection efficiency are needed in order to teleport an arbitrary multimode local state of known mean energy with a prescribed accuracy. Finally, following a seminal proposal by Sabapathy and Winter, we look at data hiding against Gaussian operations assisted by the feedforward of measurement outcomes, providing an example of a relatively simple scheme that works with a single mode only.
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.