SearcharxivSearch

arXiv subjects

Masakazu Yoshida

Publications and source records attributed to Masakazu Yoshida.

4 recordsLinked to original sources

Construction of general symmetric-informationally-complete-positive-operator-valued measures by using a complete orthogonal basis

A general symmetric-informationally-complete (GSIC)-positive-operator-valued measure (POVM) is known to provide an optimal quantum state tomography among minimal IC POVMs with a fixed average purity. In this paper we provide a general construction of a GSIC POVM by means of a complete orthogonal basis (COB), also interpreted as a normal quasiprobability representation. A spectral property of a COB is shown to play a key role in the construction of SIC POVMs and also for the bound of the mean-square error of the state tomography. In particular, a necessary and sufficient condition to construct a SIC POVM for any d is constructively given by the power of traces of a COB. We give three simple constructions of COBs from which one can systematically obtain GSIC POVMs.

quant-ph

Solutions to the mean king's problem: higher-dimensional quantum error-correcting codes

Mean king's problem is a kind of quantum state discrimination problems. In the problem, we try to discriminate eigenstates of noncommutative observables with the help of classical delayed information. The problem has been investigated from the viewpoint of error detection and correction. We construct higher-dimensional quantum error-correcting codes against error corresponding to the noncommutative observables. Any code state of the codes provides a way to discriminate the eigenstates correctly with the classical delayed information.

quant-ph

Solution to the mean king's problem using quantum error-correcting codes

We discuss the so-called mean king's problem, a retrodiction problem among non-commutative observables, in the context of error detection. Describing the king's measurement effectively by a single error operation, we give a solution of the mean king's problem using quantum error-correcting codes. The existence of a quantum error-correcting code from a solution is also presented.

quant-ph

On Ping-Pong protocol and its variant

We discuss the Ping-Pong protocol which was proposed by Bostroem and Felbinger. We derive a simple trade-off inequality between distinguishability of messages for Eve and detectability of Eve for legitimate users. Our inequality holds for arbitrary initial states. That is, even if Eve prepares an initial state, she cannot distinguish messages without being detected. We show that the same inequality holds also on another protocol in which Alice and Bob use one-way quantum communication channel twice.

quant-ph