arXiv subjects

Keiko Imai

Publications and source records attributed to Keiko Imai.

4 recordsLinked to original sources

arXiv2009

Distance k-Sectors Exist

The bisector of two nonempty sets P and Q in a metric space is the set of all points with equal distance to P and to Q. A distance k-sector of P and Q, where k is an integer, is a (k-1)-tuple (C_1, C_2, ..., C_{k-1}) such that C_i is the bisector of C_{i-1} and C_{i+1} for every i = 1, 2, ..., k-1, where C_0 = P and C_k = Q. This notion, for the case where P and Q are points in Euclidean plane, was introduced by Asano, Matousek, and Tokuyama, motivated by a question of Murata in VLSI design. They established the existence and uniqueness of the distance trisector in this special case. We prove the existence of a distance k-sector for all k and for every two disjoint, nonempty, closed sets P and Q in Euclidean spaces of any (finite) dimension, or more generally, in proper geodesic spaces (uniqueness remains open). The core of the proof is a new notion of k-gradation for P and Q, whose existence (even in an arbitrary metric space) is proved using the Knaster-Tarski fixed point theorem, by a method introduced by Reem and Reich for a slightly different purpose.

cs.CG↗

arXiv2006

Voronoi Diagrams and a Numerical Estimation of a Quantum Channel Capacity

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.

quant-ph↗

arXiv2006

On a Geometric Structure of Pure Multi-qubit Quantum States and Its Applicability to a Numerical Computation

For one-qubit pure quantum states, it is already proved that the Voronoi diagrams with respect to two distances -- Euclidean distance and the quantum divergence -- coincide. This fact is a support for a known method to calculate the Holevo capacity. To consider an applicability of this method to quantum states of a higher level system, it is essential to check if the coincidence of the Voronoi diagrams also occurs. In this paper, we show a negative result for that expectation. In other words, we mathematically prove that those diagrams no longer coincide in a higher dimension. That indicates that the method used in one-qubit case to calculate the Holevo capacity might not be effective in a higher dimension.

quant-ph↗

arXiv2006

Voronoi Diagrams for Pure 1-qubit Quantum States

1-qubit quantum states form a space called the three-dimensional Bloch ball. To compute Holevo capacity, Voronoi diagrams in the Bloch ball with respect to the quantum divergence have been used as a powerful tool. These diagrams basically treat mixed quantum states corresponding to points in the interior of the Bloch ball. Due to the existence of logarithm in the quantum divergence, the diagrams are not defined on pure quantum states corresponding to points on the two-dimensional sphere. This paper first defines the Voronoi diagrams for pure quantum states on the Bloch sphere by the Fubini-Study distance and the Bures distance. We also introduce other Voronoi diagrams on the sphere obtained by taking a limit of Voronoi diagrams for mixed quantum states by the quantum divergences in the Bloch ball. These diagrams are shown to be equivalent to the ordinary Voronoi diagram on the sphere.

quant-ph↗