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.

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

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 [8] 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. We study similar RSP protocols, but not necessarily oblivious to Bob. First it is shown that Bob's 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 2 cbits of classical 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 open whether the amount of classical communication can be reduced by abandoning oblivious conditions.