Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.05535

Quantum information loss

James Fullwood, Wu-zhong Guo, Boyu Yang

quant-phgr-qchep-thSubmitted Aug 6, 2026• Announced Aug 7, 2026• 0 citations
arXivHTMLPDF

Abstract

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 $ρ$, 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 $(ρ,\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.

Comments
13 pages, 2 figures

Related papers

Out of the box approach to Black hole Information paradox

Kiran Adhikari

Suppose a black hole forms from a pure quantum state $\ketψ$. The black hole information loss paradox arises from semiclassical arguments suggesting that, even in a closed system, the process of black hole formation and evaporation evolves a pure state into a mixed state. Resolution to the paradox typically demands violation of quantum mechanics or relativity in domains where they should hold. Instead, I propose that in a complete theory of quantum gravity, any region $\mathcal{U}$ that could collapse into a black hole should already be described by a mixed state, thus bypassing the paradox entirely. To that end, I present a model in which the universe is in a quantum error-corrected state, such that any local black hole appears mixed and encodes no information locally.

arXiv:2504.10429•Apr 14, 2025•0 citations

Entropy of a Quantum Error Correction Code

David W. Kribs, Aron Pasieka, Karol Życzkowski

We define and investigate the notion of entropy for quantum error correcting codes. The entropy of a code for a given quantum channel has a number of equivalent realisations, such as through the coefficients associated with the Knill-Laflamme conditions and the entropy exchange computed with respect to any initial state supported on the code. In general the entropy of a code can be viewed as a measure of how close it is to the minimal entropy case, which is given by unitarily correctable codes (including decoherence-free subspaces), or the maximal entropy case, which from dynamical Choi matrix considerations corresponds to non-degenerate codes. We consider several examples, including a detailed analysis of the case of binary unitary channels, and we discuss an extension of the entropy to operator quantum error correcting subsystem codes.

arXiv:0811.1621•Open Systems & Information Dynamics•Dec 1, 2008•9 citations

Quantifying information loss of quantum channels

Yuan Li, Shunlong Luo, Yuan Sun +1 more

Quantum channels often cause information loss of a quantum system, and it is desirable to quantify such loss. Alternatively, one may ask how much information can be preserved by a quantum channel. In this work we introduce a quantifier for information loss of quantum channels via uncertainty of the corresponding Choi states determined by the channel-state duality, reveal its basic properties, derive its ranges for various channels, and identify the extremal channels (which depend crucially on the relation between the input and output system dimensions) with the minimal and maximal information loss. Furthermore, we evaluate this quantifier for some prototypical quantum channels and their corresponding complementary channels. We further compare information loss and irreversibility by illuminating their similarities and differences. These results shed light on channel structures from an information-theoretic perspective.

Physical Review A•Dec 3, 2025•1 citation

Sequential Discrimination Between Non-Orthogonal Quantum States

Dov Fields

The problem of discriminating between non-orthogonal states is one that has generated a lot of interest. This basic formalism is useful in many areas of quantum information. It serves as a fundamental basis for many quantum key distribution schemes, it functions as an integral part of other quantum algorithms, and it is useful in experimental settings where orthogonal states are not always possible to generate. Additionally, the discrimination problem reveals important fundamental properties, and is intrinsically related to entanglement. In this thesis, the focus is on exploring the problem of sequentially discriminating between non-orthogonal states. In the simplest version these schemes, Alice sends one of two known pure states to Bob who performs a non-optimal discrimination procedure such that the post measurement states resulting from his measurement can then be discriminated by a third participant, Charlie. In these schemes, the goal is to optimize the joint probability of both Bob and Charlie succeeding. In devising such a scheme, there are several different criteria that can be prioritized. The most basic scheme, referred to as Minimum Error (ME) discrimination, prioritizes Bob's and Charlie's abilities to successfully determine which state was sent by Alice. In this scheme, Bob and Charlie each set up two detectors and based on the result from the detector they make a guess as to which state was sent. For instance, if Bob registers a click in his first detector, he concludes that Alice sent the first state. As each detector has some probability to produce a result for either incoming result, Bob and Charlie optimize their joint probability of success by optimizing the probability that each detector will fire when the correlated state is sent by Alice. Another possible scheme, referred to as Unambiguous Discrimination (UD), prioritizes Bob's and Charlie's ability to correctly determine the state sent by Alice. In this scheme, Bob and Charlie each set up three detectors, where if a result is obtained from the first two detectors Bob or Charlie can determine with certainty which state was sent by Alice. One final setup, referred to as Discrimination with a Fixed Rate of Inconclusive Outcome, is a combination of the previous two schemes, where Bob and Charlie maximize their probability of successfully determining the state sent by Alice where they allow some fixed probability that they will not be able to determine which state Alice sent. This fixed inconclusive probability allows Bob and Charlie to control how much they prioritize correctly determining the state that was sent, as in the Unambiguous Discrimination, versus prioritizing successfully determining the state sent by Alice, as in Minimum Error discrimination. One final topic that will be discussed by this thesis is Quantum Retrodiction. Quantum Retrodiction applies an alternate perspective on the communication protocol between Alice and Bob. In the predictive model, Alice calculates the probability that Bob gets a specific measurement result given that she prepares her system in a specific state. In the retrodictive model, Bob calculates the probability that Alice prepared her system in a specific state given the result of his measurement. This alternate perspective on the communication procedure gives new a new understanding and new tools for approaching the problem of state discrimination, as exemplified by applying the retrodictive formalism to unambiguous discrimination.

•Jan 1, 2019•0 citations

Theory of quantum error-correcting codes

Emanuel H. Knill, Raymond Laflamme

Quantum error correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery-operator-independent definition of error-correcting codes. We relate this definition to four others: the existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state, and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct e errors and a formal proof that the classical bounds on the probability of error of e-error-correcting codes applies to e-error-correcting quantum codes, provided that the interaction is dominated by an identity component.

Physical Review A•Feb 1, 1997•1,593 citations

The Petz (lite) recovery map for scrambling channel

Nakayama, Yasuaki, Akihiro Miyata, Tomonori Ugajin

We study properties of the Petz recovery map in chaotic systems, such as the Hayden-Preskill setup for evaporating black holes and the SYK model. Since these systems exhibit the phenomenon called scrambling, we expect that the expression of the recovery channel $\mathcal{R}$ gets simplified, given by just the adjoint $\mathcal{N}^{\dagger}$ of the original channel $\mathcal{N}$ which defines the time evolution of the states in the code subspace embedded into the physical Hilbert space. We check this phenomenon in two examples. The first one is the Hayden-Preskill setup described by Haar random unitaries. We compute the relative entropy $S(\mathcal{R}\left[\mathcal{N}[ρ]\right] ||ρ)$ and show that it vanishes when the decoupling is archived. We further show that the simplified recovery map is equivalent to the protocol proposed by Yoshida and Kitaev. The second example is the SYK model where the two dimensional code subspace is defined by an insertion of a fermionic operator, and the system is evolved by the SYK Hamiltonian. We check the recovery phenomenon by relating some matrix elements of an output density matrix $\langle T|\mathcal{R}[\mathcal{N}[ρ]]|T' \rangle$ to Rényi-two modular flowed correlators, and show that they coincide with the elements for the input density matrix with small error after twice the scrambling time.

arXiv:2310.18991•Oct 29, 2023•0 citations
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 ρρρ, and over all POVMs on the output of a channel E\mathcal{E}E, we arrive at an intrinsic notion of information loss for any state-channel pair (ρ,E)(ρ,\mathcal{E})(ρ,E). We show that the vanishing of information loss with respect to all states supported on a fixed codespace Hcode\mathcal{H}_{\text{code}}Hcode​ is equivalent to a condition we term \emph{universal pristineness}, which ensures that orthogonal pure states in Hcode\mathcal{H}_{\text{code}}Hcode​ get sent via the channel E\mathcal{E}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 Hcode\mathcal{H}_{\text{code}}Hcode​. 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.
Suppose a black hole forms from a pure quantum state ∣ψ⟩\ketψ∣ψ⟩. The black hole information loss paradox arises from semiclassical arguments suggesting that, even in a closed system, the process of black hole formation and evaporation evolves a pure state into a mixed state. Resolution to the paradox typically demands violation of quantum mechanics or relativity in domains where they should hold. Instead, I propose that in a complete theory of quantum gravity, any region U\mathcal{U}U that could collapse into a black hole should already be described by a mixed state, thus bypassing the paradox entirely. To that end, I present a model in which the universe is in a quantum error-corrected state, such that any local black hole appears mixed and encodes no information locally.
We define and investigate the notion of entropy for quantum error correcting codes. The entropy of a code for a given quantum channel has a number of equivalent realisations, such as through the coefficients associated with the Knill-Laflamme conditions and the entropy exchange computed with respect to any initial state supported on the code. In general the entropy of a code can be viewed as a measure of how close it is to the minimal entropy case, which is given by unitarily correctable codes (including decoherence-free subspaces), or the maximal entropy case, which from dynamical Choi matrix considerations corresponds to non-degenerate codes. We consider several examples, including a detailed analysis of the case of binary unitary channels, and we discuss an extension of the entropy to operator quantum error correcting subsystem codes.
Quantum channels often cause information loss of a quantum system, and it is desirable to quantify such loss. Alternatively, one may ask how much information can be preserved by a quantum channel. In this work we introduce a quantifier for information loss of quantum channels via uncertainty of the corresponding Choi states determined by the channel-state duality, reveal its basic properties, derive its ranges for various channels, and identify the extremal channels (which depend crucially on the relation between the input and output system dimensions) with the minimal and maximal information loss. Furthermore, we evaluate this quantifier for some prototypical quantum channels and their corresponding complementary channels. We further compare information loss and irreversibility by illuminating their similarities and differences. These results shed light on channel structures from an information-theoretic perspective.
The problem of discriminating between non-orthogonal states is one that has generated a lot of interest. This basic formalism is useful in many areas of quantum information. It serves as a fundamental basis for many quantum key distribution schemes, it functions as an integral part of other quantum algorithms, and it is useful in experimental settings where orthogonal states are not always possible to generate. Additionally, the discrimination problem reveals important fundamental properties, and is intrinsically related to entanglement. In this thesis, the focus is on exploring the problem of sequentially discriminating between non-orthogonal states. In the simplest version these schemes, Alice sends one of two known pure states to Bob who performs a non-optimal discrimination procedure such that the post measurement states resulting from his measurement can then be discriminated by a third participant, Charlie. In these schemes, the goal is to optimize the joint probability of both Bob and Charlie succeeding. In devising such a scheme, there are several different criteria that can be prioritized. The most basic scheme, referred to as Minimum Error (ME) discrimination, prioritizes Bob's and Charlie's abilities to successfully determine which state was sent by Alice. In this scheme, Bob and Charlie each set up two detectors and based on the result from the detector they make a guess as to which state was sent. For instance, if Bob registers a click in his first detector, he concludes that Alice sent the first state. As each detector has some probability to produce a result for either incoming result, Bob and Charlie optimize their joint probability of success by optimizing the probability that each detector will fire when the correlated state is sent by Alice. Another possible scheme, referred to as Unambiguous Discrimination (UD), prioritizes Bob's and Charlie's ability to correctly determine the state sent by Alice. In this scheme, Bob and Charlie each set up three detectors, where if a result is obtained from the first two detectors Bob or Charlie can determine with certainty which state was sent by Alice. One final setup, referred to as Discrimination with a Fixed Rate of Inconclusive Outcome, is a combination of the previous two schemes, where Bob and Charlie maximize their probability of successfully determining the state sent by Alice where they allow some fixed probability that they will not be able to determine which state Alice sent. This fixed inconclusive probability allows Bob and Charlie to control how much they prioritize correctly determining the state that was sent, as in the Unambiguous Discrimination, versus prioritizing successfully determining the state sent by Alice, as in Minimum Error discrimination. One final topic that will be discussed by this thesis is Quantum Retrodiction. Quantum Retrodiction applies an alternate perspective on the communication protocol between Alice and Bob. In the predictive model, Alice calculates the probability that Bob gets a specific measurement result given that she prepares her system in a specific state. In the retrodictive model, Bob calculates the probability that Alice prepared her system in a specific state given the result of his measurement. This alternate perspective on the communication procedure gives new a new understanding and new tools for approaching the problem of state discrimination, as exemplified by applying the retrodictive formalism to unambiguous discrimination.
Quantum error correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery-operator-independent definition of error-correcting codes. We relate this definition to four others: the existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state, and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct e errors and a formal proof that the classical bounds on the probability of error of e-error-correcting codes applies to e-error-correcting quantum codes, provided that the interaction is dominated by an identity component.
We study properties of the Petz recovery map in chaotic systems, such as the Hayden-Preskill setup for evaporating black holes and the SYK model. Since these systems exhibit the phenomenon called scrambling, we expect that the expression of the recovery channel R\mathcal{R}R gets simplified, given by just the adjoint N†\mathcal{N}^{\dagger}N† of the original channel N\mathcal{N}N which defines the time evolution of the states in the code subspace embedded into the physical Hilbert space. We check this phenomenon in two examples. The first one is the Hayden-Preskill setup described by Haar random unitaries. We compute the relative entropy S(R[N[ρ]]∣∣ρ)S(\mathcal{R}\left[\mathcal{N}[ρ]\right] ||ρ)S(R[N[ρ]]∣∣ρ) and show that it vanishes when the decoupling is archived. We further show that the simplified recovery map is equivalent to the protocol proposed by Yoshida and Kitaev. The second example is the SYK model where the two dimensional code subspace is defined by an insertion of a fermionic operator, and the system is evolved by the SYK Hamiltonian. We check the recovery phenomenon by relating some matrix elements of an output density matrix ⟨T∣R[N[ρ]]∣T′⟩\langle T|\mathcal{R}[\mathcal{N}[ρ]]|T' \rangle⟨T∣R[N[ρ]]∣T′⟩ to Rényi-two modular flowed correlators, and show that they coincide with the elements for the input density matrix with small error after twice the scrambling time.