Asymptotically perfect discrimination in the local-operation-and-classical-communication paradigm

2011/05/31 by M. Kleinmann, Matthias Kleinmann, Hermann Kampermann +3
Computer Science · Mathematics · Physics and Astronomy · #Computer science #Focus (optics) #LOCC #Mathematical economics #Mathematics #Physics #Product (mathematics) #Protocol (science) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #Quantum state #Theoretical computer science #quant-ph

paper · pdf · doi:10.1103/physreva.84.042326

published as Phys. Rev. A 84, 042326 (2011) · 7 pages, 3 trees; v2: minor corrections & improvements

arxiv created 2011/09/26 · openalex publication_date 2011/10/14 · arxiv updated 2011/10/17 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/06

Abstract

We revisit the problem of discriminating orthogonal quantum states within the local-quantum-operation-and-classical-communication (LOCC) paradigm. Our particular focus is on the asymptotic situation where the parties have infinite resources and the protocol may become arbitrarily long. Our main result is a necessary condition for perfect asymptotic LOCC discrimination. As an application, we prove that for complete product bases, unlimited resources are of no advantage. On the other hand, we identify an example for which it still remains undecided whether unlimited resources are superior.

Citations

• Distinguishability of Bell States
• Distinguishing the elements of a full product basis set needs only projective measurements and classical communication
• Distinguishing bipartitite orthogonal states using LOCC: Best and worst cases
• Orthogonality and distinguishability: Criterion for local distinguishability of arbitrary orthogonal states
• Quantum entanglement
• Entanglement detection