Optimal verification of general bipartite pure states

Abstract

The efficient and reliable verification of quantum states plays a crucial role in various quantum information processing tasks. We consider the task of verifying entangled states using one-way and two-way classical communication and completely characterize the optimal strategies via convex optimization. We solve these optimization problems using both analytical and numerical methods, and the optimal strategies can be constructed for any bipartite pure state. Compared with the nonadaptive approach, our adaptive strategies significantly improve the efficiency of quantum state verification. Moreover, these strategies are experimentally feasible, as only few local projective measurements are required.