Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Voronoi diagrams for quantum states and its application to a numerical estimation of a quantum channel capacity

公一 加藤

Published Jan 1, 2008• 0 citations
OpenAlex

Related papers

Notes on Voronoi Diagrams for Pure Quantum States

Kimikazu Kato, Mayumi Oto, Imai Hiroshi +1 more

IEICE Technical Report; IEICE Tech. Rep.•Jun 16, 2006•0 citations

Voronoi Diagrams for Quantum States and Its Application to a Numerical Estimation of a Quantum Channel Capacity

Kimikazu Kato

In quantum information theory, a geometric approach, known as "quantum information geometry," has been considered as a powerful method. In this thesis, we give a computational geometric interpretation to the geometric structure of a quantum system. Especially we introduce the concept of the Voronoi diagram and the smallest enclosing ball problem to the space of quantum states. With those tools in computational geometry, we analyze the adjacency structure of a point set in the quantum state space. Additionally, as an application, we show an effective method to compute the capacity of a quantum channel.

arXiv:0803.3109•Mar 21, 2008•3 citations

Capacities of quantum channels and how to find them

Peter W. Shor

arXiv:quant-ph/0304102•Mathematical Programming•Jul 1, 2003•66 citations

Voronoi Diagrams and a Numerical Estimation of a Quantum Channel Capacity

Kimikazu Kato, Mayumi Oto, Imai, Hiroshi +1 more

We give a new geometric interpretation of quantum pure states. Using Voronoi diagrams, we reinterpret the structure of the space of pure states as a subspace of the quantum state space. In addition to the known coincidence of some Voronoi diagrams for one-qubit pure states, we will show that even for mixed one-qubit states, as far as sites are given as pure states, the Voronoi diagram with respect to some distances -- the divergence, the Bures distance, and the Euclidean distance -- are all the same. As to higher level pure quantum states, for the divergence, the Fubini-Study distance, and the Bures distance, the coincidence of the diagrams still holds, while the coincidence of the diagrams with respect to the divergence and the Euclidean distance no longer holds. That fact has a significant meaning when we try to apply the method used for a numerical estimation of a one-qubit quantum channel capacity to a higher level system.

arXiv:quant-ph/0611146•Nov 14, 2006•5 citations

Quantum Voronoi diagrams and Holevo channel capacity for 1-qubit quantum states

Frank Nielsen, Richard Nock

In this paper, we first introduce a smooth parametric family of Bregman-Csiszar quantum entropies including the von Neumann and Burg quantum entropies. We then describe the dualistic nature of Voronoi diagrams for 1-qubit quantum states inside the 3D Bloch ball representation. We show that these diagrams can be computed as Bregman Voronoi diagrams for the corresponding Bregman generator acting on Hermitian density matrices. This implies that these dual diagrams can be derived from power diagrams of balls in the Laguerre geometry, and allows one to prove by equivalence that the von Neumann quantum Voronoi diagram on the degenerated Bloch sphere of pure quantum states coincides with the ordinary Euclidean Voronoi diagram, bypassing the fact that the quantum divergence is not defined there. We then show how to compute the Holevo channel capacity of 1-qubit quantum states, and provide a practical approximation algorithm based on Bregman core-sets. Finally, we define the quantum sided centroids that yield practical upper bounds on the Holevo capacity in linear time.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•6 citations

Numerical Computation of Quantum Capacity

Masanori Ohya, Dėnes Petz, Noboru Watanabe

International Journal of Theoretical Physics•Jan 1, 1998•35 citations
In quantum information theory, a geometric approach, known as "quantum information geometry," has been considered as a powerful method. In this thesis, we give a computational geometric interpretation to the geometric structure of a quantum system. Especially we introduce the concept of the Voronoi diagram and the smallest enclosing ball problem to the space of quantum states. With those tools in computational geometry, we analyze the adjacency structure of a point set in the quantum state space. Additionally, as an application, we show an effective method to compute the capacity of a quantum channel.
We give a new geometric interpretation of quantum pure states. Using Voronoi diagrams, we reinterpret the structure of the space of pure states as a subspace of the quantum state space. In addition to the known coincidence of some Voronoi diagrams for one-qubit pure states, we will show that even for mixed one-qubit states, as far as sites are given as pure states, the Voronoi diagram with respect to some distances -- the divergence, the Bures distance, and the Euclidean distance -- are all the same. As to higher level pure quantum states, for the divergence, the Fubini-Study distance, and the Bures distance, the coincidence of the diagrams still holds, while the coincidence of the diagrams with respect to the divergence and the Euclidean distance no longer holds. That fact has a significant meaning when we try to apply the method used for a numerical estimation of a one-qubit quantum channel capacity to a higher level system.
In this paper, we first introduce a smooth parametric family of Bregman-Csiszar quantum entropies including the von Neumann and Burg quantum entropies. We then describe the dualistic nature of Voronoi diagrams for 1-qubit quantum states inside the 3D Bloch ball representation. We show that these diagrams can be computed as Bregman Voronoi diagrams for the corresponding Bregman generator acting on Hermitian density matrices. This implies that these dual diagrams can be derived from power diagrams of balls in the Laguerre geometry, and allows one to prove by equivalence that the von Neumann quantum Voronoi diagram on the degenerated Bloch sphere of pure quantum states coincides with the ordinary Euclidean Voronoi diagram, bypassing the fact that the quantum divergence is not defined there. We then show how to compute the Holevo channel capacity of 1-qubit quantum states, and provide a practical approximation algorithm based on Bregman core-sets. Finally, we define the quantum sided centroids that yield practical upper bounds on the Holevo capacity in linear time.