The strong converse theorem for the product-state capacity of quantum channels with ergodic Markovian memory
arXiv:1602.08362
Abstract
Establishing the strong converse theorem for a communication channel confirms that the capacity of that channel, that is, the maximum achievable rate of reliable information communication, is the ultimate limit of communication over that channel. Indeed, the strong converse theorem for a channel states that coding at a rate above the capacity of the channel results in the convergence of the error to its maximum value 1 and that there is no trade-off between communication rate and decoding error. Here we prove that the strong converse theorem holds for the product-state capacity of quantum channels with ergodic Markovian correlated memory.
arXiv comment11 pages, single column
References in corpus (9)
- Coding Theorem and Strong Converse for Quantum Channels
- Entanglement enhanced information transmission over a quantum channel with correlated noise
- Quantum Channels with Memory
- Strong Converse to the Quantum Channel Coding Theorem
- Coding Theorems of Quantum Information Theory
- A strong converse for classical channel coding using entangled inputs
- Coding Theorem for a Class of Quantum Channels with Long-Term Memory
- Classical capacity of quantum channels with general Markovian correlated noise
- The invalidity of a strong capacity for a quantum channel with memory