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:quant-ph/9706064 · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences

Information-theoretic approach to quantum error correction and reversible measurement

Michael A. Nielsen, Carlton M. Caves, Benjamin W. Schumacher, Howard Barnum

Published Jan 8, 1998• 121 citations
arXivHTMLPDF

Abstract

Quantum operations provide a general description of the state changes allowed by quantum mechanics. The reversal of quantum operations is important for quantum error–correcting codes, teleportation and reversing quantum measurements. We derive information–theoretic conditions and equivalent algebraic conditions that are necessary and sufficient for a general quantum operation to be reversible. We analyse the thermodynamic cost of error correction and show that error correction can be regarded as a kind of `Maxwell demon', for which there is an entropy cost associated with information obtained from measurements performed during error correction. A prescription for thermodynamically efficient error correction is given.

DOI
10.1098/rspa.1998.0160

Related papers

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,642 citations

Information-theoretic interpretation of quantum error-correcting codes

Nicolas J. Cerf, Richard Cleve

Quantum error-correcting codes are analyzed from an information-theoretic perspective centered on quantum conditional and mutual entropies. This approach parallels the description of classical error correction in Shannon theory, while clarifying the differences between classical and quantum codes. More specifically, it is shown how quantum information theory accounts for the fact that ``redundant'' information can be distributed over quantum bits even though this does not violate the quantum ``no-cloning'' theorem. Such a remarkable feature, which has no counterpart for classical codes, is related to the property that the ternary mutual entropy vanishes for a tripartite system in a pure state. This information-theoretic description of quantum coding is used to derive the quantum analog of the Singleton bound on the number of logical bits that can be preserved by a code of fixed length which can recover a given number of errors.

arXiv:quant-ph/9702031•Physical Review A•Sep 1, 1997•46 citations

Landauer's erasure, error correction and entanglement

Vlatko Vedral

Classical and quantum error correction are presented in the form of Maxwell's demon and their efficiency analysed from the thermodynamic point of view. We explain how Landauer's principle of information erasure applies to both cases. By then extending this principle to entanglement manipulations we rederive upper bounds on purification procedures, thereby linking the ‘no local increase of entanglement’ principle to the second law of thermodynamics.

arXiv:quant-ph/9903049•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Apr 8, 2000•53 citations

A New Error Correction Intuitive Approach in Quantum Communications Protocols

Skander Aris, Merabtine Nadjim, Malek Benslama

Abstract: 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 errors and a formal proof that the classical bounds on the probability of errorcorrecting codes applies to error correcting quantum codes, provided that the interaction is dominated by an identity component.

American Journal of Applied Sciences•Aug 1, 2007•3 citations

Reversible quantum operations and their application to teleportation

Michael A. Nielsen, Carlton M. Caves

Quantum operations provide a general description of the state changes allowed by quantum mechanics. Simple necessary and sufficient conditions for an ideal quantum operation to be reversible by a unitary operation are derived in this paper. These results generalize recent work on reversible measurements by Mabuchi and Zoller [Phys. Rev. Lett. 76, 3108 (1996)]. Quantum teleportation can be understood as a special case of the problem of reversing quantum operations. We characterize completely teleportation schemes of the type proposed by Bennett et al. [Phys. Rev. Lett. 70, 1895 (1993)].

arXiv:quant-ph/9608001•Physical Review A•Apr 1, 1997•108 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•8 citations
Quantum operations provide a general description of the state changes allowed by quantum mechanics. The reversal of quantum operations is important for quantum error–correcting codes, teleportation and reversing quantum measurements. We derive information–theoretic conditions and equivalent algebraic conditions that are necessary and sufficient for a general quantum operation to be reversible. We analyse the thermodynamic cost of error correction and show that error correction can be regarded as a kind of `Maxwell demon', for which there is an entropy cost associated with information obtained from measurements performed during error correction. A prescription for thermodynamically efficient error correction is given.
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.
Quantum error-correcting codes are analyzed from an information-theoretic perspective centered on quantum conditional and mutual entropies. This approach parallels the description of classical error correction in Shannon theory, while clarifying the differences between classical and quantum codes. More specifically, it is shown how quantum information theory accounts for the fact that ``redundant'' information can be distributed over quantum bits even though this does not violate the quantum ``no-cloning'' theorem. Such a remarkable feature, which has no counterpart for classical codes, is related to the property that the ternary mutual entropy vanishes for a tripartite system in a pure state. This information-theoretic description of quantum coding is used to derive the quantum analog of the Singleton bound on the number of logical bits that can be preserved by a code of fixed length which can recover a given number of errors.
Abstract: 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 errors and a formal proof that the classical bounds on the probability of errorcorrecting codes applies to error correcting quantum codes, provided that the interaction is dominated by an identity component.
Quantum operations provide a general description of the state changes allowed by quantum mechanics. Simple necessary and sufficient conditions for an ideal quantum operation to be reversible by a unitary operation are derived in this paper. These results generalize recent work on reversible measurements by Mabuchi and Zoller [Phys. Rev. Lett. 76, 3108 (1996)]. Quantum teleportation can be understood as a special case of the problem of reversing quantum operations. We characterize completely teleportation schemes of the type proposed by Bennett et al. [Phys. Rev. Lett. 70, 1895 (1993)].
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.