Numerical Experiments on the Capacity of Quantum Channel with Entangled Input States
Summary :
The capacity of quantum channel with product input states was formulated by the quantum coding theorem. However, whether entangled input states can enhance the quantum channel is still open. It turns out that this problem is reduced to a special case of the more general problem whether the capacity of product quantum channel exhibits additivity. In the present study, we apply one of the quantum Arimoto-Blahut type algorithms to the latter problem. The results suggest that the additivity of product quantum channel capacity always holds and that entangled input states cannot enhance the quantum channel capacity.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E84-A No.10 pp.2583-2590
- Publication Date
- 2001/10/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Information Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Susumu OSAWA, Hiroshi NAGAOKA, "Numerical Experiments on the Capacity of Quantum Channel with Entangled Input States" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 10, pp. 2583-2590, October 2001, doi: .
Abstract: The capacity of quantum channel with product input states was formulated by the quantum coding theorem. However, whether entangled input states can enhance the quantum channel is still open. It turns out that this problem is reduced to a special case of the more general problem whether the capacity of product quantum channel exhibits additivity. In the present study, we apply one of the quantum Arimoto-Blahut type algorithms to the latter problem. The results suggest that the additivity of product quantum channel capacity always holds and that entangled input states cannot enhance the quantum channel capacity.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_10_2583/_p
Copy
@ARTICLE{e84-a_10_2583,
author={Susumu OSAWA, Hiroshi NAGAOKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Numerical Experiments on the Capacity of Quantum Channel with Entangled Input States},
year={2001},
volume={E84-A},
number={10},
pages={2583-2590},
abstract={The capacity of quantum channel with product input states was formulated by the quantum coding theorem. However, whether entangled input states can enhance the quantum channel is still open. It turns out that this problem is reduced to a special case of the more general problem whether the capacity of product quantum channel exhibits additivity. In the present study, we apply one of the quantum Arimoto-Blahut type algorithms to the latter problem. The results suggest that the additivity of product quantum channel capacity always holds and that entangled input states cannot enhance the quantum channel capacity.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Numerical Experiments on the Capacity of Quantum Channel with Entangled Input States
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2583
EP - 2590
AU - Susumu OSAWA
AU - Hiroshi NAGAOKA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2001
AB - The capacity of quantum channel with product input states was formulated by the quantum coding theorem. However, whether entangled input states can enhance the quantum channel is still open. It turns out that this problem is reduced to a special case of the more general problem whether the capacity of product quantum channel exhibits additivity. In the present study, we apply one of the quantum Arimoto-Blahut type algorithms to the latter problem. The results suggest that the additivity of product quantum channel capacity always holds and that entangled input states cannot enhance the quantum channel capacity.
ER -
English
