Probabilistic and Approximate Masking of Quantum Information

TL;DR

This paper extends the no-masking theorem to probabilistic and approximate quantum masking protocols, providing bounds on their performance and exploring the limits of encoding quantum information into correlations.

Contribution

It generalizes the no-masking theorem to probabilistic and approximate scenarios, establishing bounds on the effectiveness of such quantum masking protocols.

Findings

Generalized no-masking theorem for probabilistic protocols

Derived bounds on approximate quantum masking performance

Showed limitations of encoding quantum states into correlations

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.