IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2004-10-15 15:55
An algorithm for computing the Holevo capacity of 1-qubit channel with using computational gemetry
Mayumi Oto, Hiroshi Imai (Univ. of Tokyo), Keiko Imai (Chuo Univ.)
Abstract (in Japanese) (See Japanese page) 
(in English) Let a parameter space of qubits be a quantum space.
In this space, computational-geometric problems can be treated for the quantum divergence as a proximity function, whose geometry is called quantum information geometry, and the quantum divergence is treated as a proximity function.
By generalizing the result by Onishi and Imai on the computational-geometric structure in the classical information geometry, where the Kullback-Leibler divergence is used as a proximity function, Voronoi diagrams are introduced.
In our paper, we describe the minimum enclosing sphere problem in the 1-qubit quantum space and propose the algorithm for computing the quantum channel capacity with respect to the quantum divergence and it produces $\epsilon$-approximate solution in time $O(1/\epsilon)$.
Keyword (in Japanese) (See Japanese page) 
(in English) Quantum channel / the farthest Voronoi diagram / the minimum enclosing sphere / / / / /  
Reference Info. IEICE Tech. Rep., vol. 104, no. 339, COMP2004-51, pp. 55-59, Oct. 2004.
Paper # COMP2004-51 
Date of Issue 2004-10-07 (COMP) 
ISSN Print edition: ISSN 0913-5685
Download PDF

Conference Information
Committee COMP  
Conference Date 2004-10-14 - 2004-10-15 
Place (in Japanese) (See Japanese page) 
Place (in English) Tohoku University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To COMP 
Conference Code 2004-10-COMP 
Language English (Japanese title is available) 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) An algorithm for computing the Holevo capacity of 1-qubit channel with using computational gemetry 
Sub Title (in English)  
Keyword(1) Quantum channel  
Keyword(2) the farthest Voronoi diagram  
Keyword(3) the minimum enclosing sphere  
Keyword(4)  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Mayumi Oto  
1st Author's Affiliation The University of Tokyo (Univ. of Tokyo)
2nd Author's Name Hiroshi Imai  
2nd Author's Affiliation The University of Tokyo (Univ. of Tokyo)
3rd Author's Name Keiko Imai  
3rd Author's Affiliation Chuo University (Chuo Univ.)
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
Speaker Author-1 
Date Time 2004-10-15 15:55:00 
Presentation Time 30 minutes 
Registration for COMP 
Paper # COMP2004-51 
Volume (vol) vol.104 
Number (no) no.339 
Page pp.55-59 
#Pages
Date of Issue 2004-10-07 (COMP) 


[Return to Top Page]

[Return to IEICE Web Page]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan