Title :
Algorithms of Arimoto-Blahut type for computing quantum channel capacity
Author :
Nagaoka, Hiroshi
Author_Institution :
Graduate Sch. of Inf. Syst., Univ. of Electro-Commun., Tokyo, Japan
Abstract :
In the Arimoto-Blahut (1972) algorithm for computing the capacity of a classical discrete memoryless channel, maximization of the mutual information is converted to more tractable alternating maximization of a two-variable function. We apply the same idea to computation of the capacity of a quantum memoryless channel
Keywords :
channel capacity; memoryless systems; optical communication; optimisation; Arimoto-Blahut type algorithms; discrete memoryless channel; mutual information maximization; quantum channel capacity; quantum memoryless channel; two-variable function; Channel capacity; Communication channels; Density functional theory; Eigenvalues and eigenfunctions; Hilbert space; Information systems; Memoryless systems; Mutual information; Probability distribution; Quantum computing;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708959
