Randomness cost of masking quantum information and the information conservation law

Abstract

Masking quantum information, which is impossible without randomness as a resource, is a task that encodes quantum information into the bipartite quantum state while forbidding local parties from accessing that information. In this paper, we disprove the geometric conjecture about unitarily maskable states [Modi, Pati, Sen, and Sen, Phys. Rev. Lett. 120, 230501 (2018)], and make an algebraic analysis of quantum masking. First, we show a general result of quantum channel mixing that a subchannel's mixing probability should be suppressed if its classical capacity is larger than the mixed channel's capacity. This constraint combined with the well-known information conservation law, a law that does not exist in classical information theories, gives a lower bound of randomness cost of masking quantum information as a monotone decreasing function of evenness of information distribution. This result provides a consistency test for various scenarios of fast scrambling conjecture on the black-hole evaporation process. Our results are robust to incompleteness of quantum masking.