We introduce a measure of information loss for any quantum process that may be modeled by a prepare-evolve-measure scenario: Alice prepares an ensemble of states that gets sent via a quantum channel to Bob, who then measures the output. As a quantum channel models open system dynamics, our measure of information loss quantifies Bob's inability to retrodict with certainty which state Alice sent through the channel. By minimizing this measure over all possible pure state ensemble decompositions of a fixed state $\rho$, and over all POVMs on the output of a channel $\mathcal{E}$, we arrive at an intrinsic notion of information loss for any state-channel pair $(\rho,\mathcal{E})$. We show that the vanishing of information loss with respect to all states supported on a fixed codespace $\mathcal{H}_{\text{code}}$ is equivalent to a condition we term \emph{universal pristineness}, which ensures that orthogonal pure states in $\mathcal{H}_{\text{code}}$ get sent via the channel $\mathcal{E}$ to possibly mixed states whose supports are orthogonal. Moreover, we prove universal pristineness is equivalent to the Knill-Laflamme conditions in quantum error correction, which are necessary and sufficient for the existence of a perfect recovery channel for all states supported on $\mathcal{H}_{\text{code}}$. As an application, we apply our framework to the Hayden-Preskill model of black hole evaporation, demonstrating that the evaporation channel becomes asymptotically universally pristine, thereby providing a purely channel-theoretic formulation of Page-time information retrieval.
Phenomena that slip beyond the grasp of our classical intuition reveal uniquely quantum effects that deepen our understanding of the physical world and enable advances in information processing, particularly in quantum communication and computation. One such phenomenon is quantum steering, whereby measurements performe...
Gerard Anglès Munné, Paweł Cieśliński, Tamás Vértesi et al.· 0 citations
Although the task is learning a particular state, these bounds carry stronger implications than standard state-learning bounds since the learner controls the inputs and ancillary assistance, and establishes a hierarchy of channel-learning resources: self-complex-conjugate channels require two-copy ancilla-assisted acce...
M. Subramanian, Hyukgun Kwon, Liang Jiang· 0 citations
We study classical string commitment over quantum channels with limited preshared entanglement. For noninteractive protocols, we determine the commitment capacity of a class of channels with input dimension $d$ that, at each use, sample a pair of classical random variables $(F,Z)$, apply one of the $d^2$ Heisenberg--We...
An ideal CNOT maps the phase of a coherent qubit onto the coherence between $\ket{00}$ and $\ket{11}$ of a two-qubit state, producing an output that carries both entanglement and estimable phase information. We ask how post-gate noise degrades these two quantities, and find that they are not lost together. For the phas...
Asad Ali, H. Kuniyil, M. T. Rahim et al.· 0 citations
The recovery of quantum information after subsystem loss is a central challenge in quantum information processing. However, some states remain beyond the reach of any recovery strategies. Here we identify the algebraic origin of virtual irrecoverability, the \emph{ghost information}---correlations encoded in the global...
A family of semi-device-independent (SDI) entanglement-assisted prepare-measure (PM) communication games involving two parties, within the random-access code (RAC) framework, which demonstrates quantum supremacy over both classical RACs and conventional quantum PMRACs.
Rajdeep Paul, Prabuddha Roy, A. Pan· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.