Probabilistic and approximate masking of quantum information
Mao-Sheng Li, Kavan Modi
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 the state 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.
Topics & Concepts
Masking (illustration)Probabilistic logicENCODEProtocol (science)Computer scienceState (computer science)Theoretical computer scienceQuantumQuantum stateQuantum informationEncoding (memory)MathematicsDiscrete mathematicsAlgorithmStatistical physicsQuantum mechanicsArtificial intelligencePhysicsMedicineGenePathologyArtChemistryAlternative medicineBiochemistryVisual artsQuantum Information and CryptographyQuantum Mechanics and ApplicationsQuantum Computing Algorithms and Architecture