Locality and nonlocality in quantum pure-state identification problems

Abstract

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.

11 pages, amalgamation of arXiv:0712.2906 and arXiv:0801.0128

References in corpus (12)

• Quantum Nonlocality without Entanglement
• Local Distinguishability of Multipartite Orthogonal Quantum States
• Optimal local discrimination of two multipartite pure states
• Quantum channels showing superadditivity in capacity
• A universal programmable quantum state discriminator that is optimal for unambiguously distinguishing between unknown states
• Reexamination of optimal quantum state estimation of pure states
• Optimally Conclusive Discrimination of Non-orthogonal Entangled States Locally
• Optimal Conclusive Discrimination of Two Non-orthogonal Pure Product Multipartite States Locally
• Quantum pure-state identification
• Unambiguous pure state identification without classical knowledge
• Optimal conclusive discrimination of two states can be achieved locally
• Programmable quantum state discriminators with simple programs

Cited by in corpus (9)

• State discrimination with error margin and its locality
• Optimum unambiguous identification of d unknown pure qudit states
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders
• Tight asymptotic bounds on local hypothesis testing between a pure bipartite state and the white noise state
• Asymptotic local hypothesis testing between a pure bipartite state and the completely mixed state
• Local hypothesis testing between a pure bipartite state and the white noise state
• Optimal quantum discrimination of single-qubit unitary gates between two candidates
• Optimal quantum state identification with qudit-encoded unknown states
• Dealing with ignorance: universal discrimination, learning and quantum correlations