We discuss online strategies for discriminating pure states with zero error when n copies of the states are provided. We rederive the binary case and extend the analysis to ternary symmetric states.
We consider online strategies for discriminating between symmetric pure states with zero error when n copies of the states are provided. Optimized online strategies involve local, possibly adaptive measurements on each copy and are optimal at each step, which makes them robust in front of particle losses or an abrupt termination of the discrimination process. We first review previous results on binary minimum and zero error discrimination with local measurements that achieve the maximum success probability set by optimizing over global measurements, highlighting their online features. We then extend these results to the case of zero error identification of three symmetric states with constant overlap. We provide optimal online schemes that attain global performance for any n if the state overlaps are positive, and for odd n if overlaps have a negative value. For arbitrary complex overlaps, we show compelling evidence that online schemes fail to reach optimal global performance. The online schemes that we describe only require to store the last outcome obtained in a classical memory, and adaptiveness of the measurements reduce to at most two changes, regardless of the value of n .
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 consider online detection strategies for identifying a change point in a stream of quantum particles allegedly prepared in identical states. We show that the identification of the change point can be done without error via sequential local measurements while attaining the optimal performance bound set by quantum mechanics. In this way, we establish the task of exactly identifying a quantum change point as an instance where local protocols are as powerful as global ones. The optimal online detection strategy requires only one bit of memory between subsequent measurements, and it is amenable to experimental realization with current technology.
We study the process of quantum telecloning of d -dimensional pure quantum states using partially entangled pure states as quantum channel. This process efficiently mixes optimal universal symmetric cloning with quantum teleportation. It is shown that it is possible to implement universal symmetric telecloning in a probabilistic way using unambiguous state discrimination and quantum state separation schemes. It is also shown that other strategies, such as minimum error discrimination, lead to a decrease in the fidelity of the copies and that certain partially entangled pure states with maximal Schmidt rank lead to an average telecloning fidelity which is always above the optimal fidelity of measuring and preparation of quantum states. We also discuss the case of partially entangled pure states with non-maximal Schmidt rank. The results presented here are valid for arbitrary numbers of copies of a single-input qudit state of any dimension.