M. Horibe

Remote state preparation without oblivious conditions

In quantum teleportation, neither Alice nor Bob acquires any classical knowledge on teleported states. The teleportation protocol is said to be oblivious to both parties. In remote state preparation (RSP), it is assumed that Alice is given complete classical knowledge on the state that is to be prepared by Bob. Recently, Leung and Shor [e-print quant-ph/0201008] showed that the same amount of classical information as that in teleportation needs to be transmitted in any exact and deterministic RSP protocol that is oblivious to Bob. Assuming that the dimension of subsystems in the prior-entangled state is the same as the dimension of the input space, we study similar RSP protocols, but not necessarily oblivious to Bob. We show that in this case Bobs quantum operation can be safely assumed to be a unitary transformation. We then derive an equation that is a necessary and sufficient condition for such a protocol to exist. By studying this equation, we show that one-qubit RSP requires two classical bits of communication, which is the same amount as in teleportation, even if the protocol is not assumed oblivious to Bob. For higher dimensions, it is still an open question whether the amount of classical communication can be reduced by abandoning oblivious conditions.

Reexamination of optimal quantum state estimation of pure states

A direct derivation is given for the optimal mean fidelity of quantum state estimation of a d-dimensional unknown pure state with its N copies given as input, which was first obtained by Hayashi in terms of an infinite set of covariant positive operator valued measures (POVMs) and by Bruss and Macchiavello establishing a connection to optimal quantum cloning. An explicit condition for POVM measurement operators for optimal estimators is obtained, by which we construct optimal estimators with finite POVMs using exact quadratures on a hypersphere. These finite optimal estimators are not generally universal, where universality means the fidelity is independent of input states. However, any optimal estimator with finite POVM for M(>N) copies is universal if it is used for N copies as input.

Quantum pure-state identification

We address a problem of identifying a given pure state with one of two reference pure states, when no classical knowledge on the reference states is given, but a certain number of copies of them are available. We assume the input state is guaranteed to be either one of the two reference states. This problem, which we call quantum pure state identification, is a natural generalization of the standard state discrimination problem. The two reference states are assumed to be independently distributed in a unitary invariant way in the whole state space. We give a complete solution for the averaged maximal success probability of this problem for an arbitrary number of copies of the reference states in general dimension. It is explicitly shown that the obtained mean identification probability approaches the mean discrimination probability as the number of the reference copies goes to infinity.

Unambiguous pure-state identification without classical knowledge

We study how to unambiguously identify a given quantum pure state with one of the two reference pure states when no classical knowledge on the reference states is given but a certain number of copies of each reference quantum state are presented. By unambiguous identification, we mean that we are not allowed to make a mistake but our measurement can produce an inconclusive result. Assuming the two reference states are independently distributed over the whole pure state space in a unitary invariant way, we determine the optimal mean success probability for an arbitrary number of copies of the reference states and a general dimension of the state space. It is explicitly shown that the obtained optimal mean success probability asymptotically approaches that of the unambiguous discrimination as the number of the copies of the reference states increases.

Discrimination with error margin between two states: Case of general occurrence probabilities

We investigate a state discrimination problem which interpolates minimum error and unambiguous discrimination by introducing a margin for the probability of error. We closely analyze discrimination of two pure states with general occurrence probabilities. The optimal measurements are classified into three types. One of the three types of measurement is optimal depending on parameters occurrence probabilities and error margin. We determine the three domains in the parameter space and the optimal discrimination success probability in each domain in a fully analytic form. It is also shown that when the states to be discriminated are multipartite, the optimal success probability can be attained by local operations and classical communication. For discrimination of two mixed states, an upper bound of the optimal success probability is obtained.

Locality and nonlocality in quantum pure-state identification problems

Suppose we want to identify an input state with one of two unknown reference states, where the input state is guaranteed to be equal to one of the reference states. We assume that no classical knowledge of the reference states is given, but a certain number of copies of them are available instead. Two reference states are independently and randomly chosen from the state space in a unitary invariant way. This is called the quantum state identification problem, and the task is to optimize the mean identification success probability. In this paper, we consider the case where each reference state is pure and bipartite, and generally entangled. The question is whether the maximum mean identification success probability can be attained by means of a local operations and classical communication (LOCC) measurement scheme. Two types of identification problems are considered when a single copy of each reference state is available. We show that a LOCC scheme attains the globally achievable identification probability in the minimum-error identification problem. In the unambiguous identification problem, however, the maximal success probability by means of LOCC is shown to be less than the globally achievable identification probability.

Extended quantum color coding

The quantum color coding scheme proposed by Korff and Kempe [e-print quant-ph/0405086] is easily extended so that the color coding quantum system is allowed to be entangled with an extra auxiliary quantum system. It is shown that in the extended scheme we need only {approx}2{radical}(N) quantum colors to order N objects in large N limit, whereas {approx}N/e quantum colors are required in the original nonextended version. The maximum success probability has asymptotics expressed by the Tracy-Widom distribution of the largest eigenvalue of a random Gaussian unitary ensemble (GUE) matrix.

Solution to the king's problem with observables that are not mutually complementary

We investigate the kings problem of the measurement of operators n-vector{sub k}{center_dot}{sigma}-vector (k=1, 2, 3) instead of the three Cartesian components {sigma}{sub x},{sigma}{sub y}, and {sigma}{sub z} of the spin operator {sigma}-vector. Here, n-vector{sub k} are three-dimensional real unit vectors. We show the condition over three vectors n-vector{sub k} to ascertain the result for measurement of any one of these operators.

Stationary quantum Markov process for the Wigner function on a lattice phase space

As a stochastic model for quantum mechanics we present a stationary quantum Markov process for the time evolution of the Wigner function on a lattice phase space ZN ? ZN with N odd. By introducing a phase factor extension to the phase space, each particle can be treated independently. This is an improvement on earlier methods that require the whole distribution function to determine the evolution of a constituent particle. The process has branching and vanishing points, though a finite time interval can be maintained between the branchings. The procedure to perform a simulation using the process is presented.