Entropy of a quantum error correction code
From MaRDI portal
Publication:3567159
DOI10.1142/S1230161208000225zbMATH Open1188.81048arXiv0811.1621WikidataQ112267044 ScholiaQ112267044MaRDI QIDQ3567159FDOQ3567159
Authors: David Kribs, Aron Pasieka, Karol Życzkowski 
Publication date: 11 June 2010
Published in: Open Systems & Information Dynamics (Search for Journal in Brave)
Abstract: We define and investigate a 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 in the case of binary unitary channels, and we discuss an extension of the entropy to operator quantum error correcting subsystem codes.
Full work available at URL: https://arxiv.org/abs/0811.1621
Recommendations
Cites Work
- Error Correcting Codes in Quantum Theory
- Completely positive linear maps on complex matrices
- Mixed-state entanglement and quantum error correction
- General state changes in quantum theory
- Quantum error correcting codes from the compression formalism
- Canonical forms, higher rank numerical ranges, totally isotropic subspaces, and matrix equations
- The higher rank numerical range is convex
- Higher-rank numerical ranges and compression problems
- Theory of Quantum Error Correction for General Noise
- Geometry of higher-rank numerical ranges
- An elementary constructive approach to the higher-rank numerical ranges of unitary matrices and quantum error-correcting codes
Cited In (7)
- Quantifying the performance of quantum codes
- An entropic analysis of approximate quantum error correction
- The role of entropy in topological quantum error correction
- Protected subspaces in quantum information
- Entropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes
- On non-commutative operator graphs generated by covariant resolutions of identity
- Decoherence-free communication over multiaccess quantum channels
This page was built for publication: Entropy of a quantum error correction code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3567159)
