2000 character limit reached
Probabilistic and Approximate Masking of Quantum Information
Published 5 Dec 2019 in quant-ph | (1912.02419v2)
Abstract: The no-masking theorem states that it is impossible to encode an arbitrary quantum state into the correlations between two subsystems so that no original information about is accessible in the marginal state of either subsystem. In this paper, we generalize this theorem to allow for failure of the protocol. We then bound the performance of a masking protocol when we are allowed a (probabilistic) approximate protocol.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.