Details
Original language | English |
---|---|
Pages (from-to) | 062323 |
Number of pages | 1 |
Journal | Phys. Rev. A |
Volume | 72 |
Issue number | 6 |
Publication status | Published - 2005 |
Abstract
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Phys. Rev. A, Vol. 72, No. 6, 2005, p. 062323.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Quantum channels with memory
AU - Kretschmann, D
AU - Werner, R. F.
PY - 2005
Y1 - 2005
N2 - We present a general model for quantum channels with memory and show that it is sufficiently general to encompass all causal automata: any quantum process in which outputs up to some time t do not depend on inputs at times t'private) classical and quantum information. These include setups in which either the receiver or a malicious third party have control of the initializing memory. We introduce classical and quantum channel capacities for these settings and give several examples to show that they may or may not coincide. Entropic upper bounds on the various channel capacities are given. For forgetful quantum channels, in which the effect of the initializing memory dies out as time increases, coding theorems are presented to show that these bounds may be saturated. Forgetful quantum channels are shown to be open and dense in the set of quantum memory channels.
AB - We present a general model for quantum channels with memory and show that it is sufficiently general to encompass all causal automata: any quantum process in which outputs up to some time t do not depend on inputs at times t'private) classical and quantum information. These include setups in which either the receiver or a malicious third party have control of the initializing memory. We introduce classical and quantum channel capacities for these settings and give several examples to show that they may or may not coincide. Entropic upper bounds on the various channel capacities are given. For forgetful quantum channels, in which the effect of the initializing memory dies out as time increases, coding theorems are presented to show that these bounds may be saturated. Forgetful quantum channels are shown to be open and dense in the set of quantum memory channels.
U2 - 10.1103/PhysRevA.72.062323
DO - 10.1103/PhysRevA.72.062323
M3 - Article
VL - 72
SP - 062323
JO - Phys. Rev. A
JF - Phys. Rev. A
SN - 2469-9934
IS - 6
ER -