Bounds on Multipartite Entangled Orthogonal State Discrimination Using Local Operations and Classical Communication

2005/06/30 by M. Hayashi, Masahito Hayashi, Damian Markham +6 · 3 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph

paper · pdf · doi:10.1103/physrevlett.96.040501

published as Phys. Rev. Lett. 96 (2006),040501 · 4 pages, 1 figure. Title changed in accordance with jounral request. Major changes to the paper. Intro rewritten to make motivation clear, and proofs rewritten to be clearer. Picture added for clarity

openalex publication_date 2006/02/02 · arxiv created 2006/02/03 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We show that entanglement guarantees difficulty in the discrimination of orthogonal multipartite states locally. The number of pure states that can be discriminated by local operations and classical communication is bounded by the total dimension over the average entanglement. A similar, general condition is also shown for pure and mixed states. These results offer a rare operational interpretation for three abstractly defined distancelike measures of multipartite entanglement.

Citations

• Three qubits can be entangled in two inequivalent ways
• Distinguishability and Indistinguishability by Local Operations and Classical Communication
• Optimal conclusive discrimination of two states can be achieved locally

Cited by

• Lower bounds on entanglement measures from incomplete information
• Four Locally Indistinguishable Ququad-Ququad Orthogonal Maximally Entangled States
• Local Discrimination of Mixed States