A note on quantum entropy inequalities and channel capacities
2003; Institute of Physics; Volume: 36; Issue: 48 Linguagem: Inglês
10.1088/0305-4470/36/48/010
ISSN1361-6447
Autores Tópico(s)Quantum Computing Algorithms and Architecture
ResumoQuantum entropy inequalities are studied. Some quantum entropy inequalities are obtained by several methods. For an entanglement breaking channel, we show that the entanglement-assisted classical capacity is upper bounded by log d. A relationship between entanglement-assisted and one-shot unassisted capacities is obtained. This relationship shows the entanglement-assisted channel capacity is upper bounded by the sum of log d and the one-shot unassisted classical capacity.
Referência(s)