Lower bounds on the quantum capacity and highest error exponent of general memoryless channels

@article{Hamada2002LowerBO,
  title={Lower bounds on the quantum capacity and highest error exponent of general memoryless channels},
  author={Mitsuru Hamada},
  journal={IEEE Trans. Inf. Theory},
  year={2002},
  volume={48},
  pages={2547-2557}
}
  • M. Hamada
  • Published 2002
  • Mathematics, Physics, Computer Science
  • IEEE Trans. Inf. Theory
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 (CP) 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 n and rate R is proven to be lower-bounded by 1-exp[-nE(R)+o(n)] for… Expand
An exponential lower bound on the highest fidelity achievable by quantum error-correcting codes
  • M. Hamada
  • Computer Science
  • Proceedings IEEE International Symposium on Information Theory,
  • 2002
TLDR
On a quantum memoryless channel, the highest fidelity of a quantum error-correcting code of length n and rate R is proven to be lower bounded by 1-exp[-nE(R)+o(n)] for some function E(R) so that R/sub 0/ is a lower bound on the quantum capacity of the channel. Expand
Information rates achievable with algebraic codes on quantum discrete memoryless channels
  • M. Hamada
  • Mathematics, Computer Science
  • IEEE Transactions on Information Theory
  • 2005
The highest information rate at which quantum error-correction schemes work reliably on a channel is called the quantum capacity. Here this is proven to be lower-bounded by the limit of coherentExpand
A low-rate bound on the reliability of a quantum discrete memoryless channel
  • A. Barg
  • Mathematics, Physics
  • IEEE Trans. Inf. Theory
  • 2002
TLDR
A low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) is extended to its quantum counterpart to show that the problem of bounding below the error exponent for a quantum channel relying on the class of stabilizer codes is equivalent to the issue of deriving error exponents for a certain symmetric classical channel. Expand
Some classes of concatenated quantum codes: constructions and lower bounds
  • H. Fujita
  • Mathematics, Computer Science
  • Quantum Inf. Comput.
  • 2015
TLDR
This paper presents some classes of asymptotically good concatenated quantum codes, which are a quantum analogue of classical concatenation codes, and derive lower bounds on the minimum distance and the rate of the codes. Expand
Quantum channels and their entropic characteristics.
TLDR
A survey of the main properties of quantum channels and of their entropic characterization, with a variety of examples for finite-dimensional quantum systems, and the remarkable role of specific quantum correlations-entanglement-as a novel communication resource is stressed. Expand
On quantum channels
One of the most challenging open problems in quantum information theory is to clarify and quantify how entanglement behaves when part of an entangled state is sent through a quantum channel. OfExpand
Tema con variazioni: quantum channel capacity
Channel capacity describes the size of the nearly ideal channels, which can be obtained from many uses of a given channel, using an optimal error correcting code. In this paper we collect and compareExpand
NOTES ON THE FIDELITY OF SYMPLECTIC QUANTUM ERROR-CORRECTING CODES
TLDR
It is shown that the fidelity of a symplectic (stabilizer) code, if properly defined, exactly equals the "probability" of the correctable errors for general quantum channels. Expand
Several Classes of Concatenated Quantum Codes: Constructions and Bounds
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with theExpand
Several Classes of Concatenated Quantum Codes: Constructions and Bounds
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with theExpand
...
1
2
3
...

References

SHOWING 1-10 OF 63 REFERENCES
A lower bound on the quantum capacity of channels with correlated errors
The highest fidelity of quantum error-correcting codes of length n and rate R is proven to be lower bounded by 1−exp[−nE(R)+o(n)] for some function E(R) on noisy quantum channels that are subject toExpand
Exponential lower bound on the highest fidelity achievable by quantum error-correcting codes
On a class of quantum channels which includes the depolarizing channel, the highest fidelity of quantum error-correcting codes of length n and rate R is proven to be lower bounded byExpand
QUANTUM-CHANNEL CAPACITY OF VERY NOISY CHANNELS
We present a family of additive quantum error-correcting codes whose capacities exceed those of quantum random coding (hashing) for very noisy channels. These codes provide nonzero capacity in aExpand
Theory of quantum error-correcting codes
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 ofExpand
Lower bound for the quantum capacity of a discrete memoryless quantum channel
We generalize the random coding argument of stabilizer codes and derive a lower bound on the quantum capacity of an arbitrary discrete memoryless quantum channel. For the depolarizing channel, ourExpand
Quantum error correction via codes over GF(4)
The unreasonable effectiveness of quantum computing is founded on coherent quantum superposition or entanglement which allows a large number of calculations to be performed simultaneously. ThisExpand
On quantum fidelities and channel capacities
TLDR
It is shown that a restricted class of encodings is sufficient to transmit any quantum source which may be transmitted on a given channel, and that the availability of an auxiliary classical channel from encoder to decoder does not increase the quantum capacity. Expand
Encoding a qubit in an oscillator
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codesExpand
Quantum error detection II: Bounds
TLDR
This part shows that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent and formulates two linear programming problems that are convenient for the analysis of specific short codes. Expand
A low-rate bound on the reliability of a quantum discrete memoryless channel
  • A. Barg
  • Mathematics, Physics
  • IEEE Trans. Inf. Theory
  • 2002
TLDR
A low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) is extended to its quantum counterpart to show that the problem of bounding below the error exponent for a quantum channel relying on the class of stabilizer codes is equivalent to the issue of deriving error exponents for a certain symmetric classical channel. Expand
...
1
2
3
4
5
...