Lower Bounds on the Quantum Capacity and Highest Error Exponent of General Memoryless Channels
arXiv:quant-ph/0112103 · doi:10.1109/TIT.2002.801470
Abstract
Tradeoffs between the information rate and fidelity of quantum error-correcting codes are discussed. Quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a general completely positive linear map, where the dimension of the underlying Hilbert space is a prime number. On such a quantum channel, the highest fidelity of a quantum error-correcting code of length and rate R is proven to be lower bounded by 1 - \exp [-n E(R) + o(n)] for some function E(R). The E(R) is positive below some threshold R', which implies R' is a lower bound on the quantum capacity. The result of this work applies to general discrete memoryless channels, including channel models derived from a physical law of time evolution, or from master equations.
19 pages, 2 figures. Ver.2: Comparisons with the previously known bounds and examples were added. Except for very noisy channels, this work's bound is, in general, better than those previously known. Ver.3: Introduction shortened. Minor changes
References in corpus (5)
- Achievable rates for the Gaussian quantum channel
- A Lower Bound on the Quantum Capacity of Channels with Correlated Errors
- Lower bound for the quantum capacity of a discrete memoryless quantum channel
- An Analysis of Completely-Positive Trace-Preserving Maps on 2x2 Matrices
- Exponential lower bound on the highest fidelity achievable by quantum error-correcting codes
Cited by in corpus (9)
- Quantum channels and their entropic characteristics
- Tema Con Variazioni: Quantum Channel Capacity
- On quantum channels
- Teleportation and entanglement distillation in the presence of correlation among bipartite mixed states
- Finite-Block-Length Analysis in Classical and Quantum Information Theory
- Constructive Conjugate Codes for Quantum Error Correction and Cryptography
- Information Rates Achievable with Algebraic Codes on Quantum Discrete Memoryless Channels
- Several Classes of Concatenated Quantum Codes: Constructions and Bounds
- Notes on the Fidelity of Symplectic Quantum Error-Correcting Codes