Reduction theorems for optimal unambiguous state discrimination of density matrices

2003/04/30 by Philippe Raynal, Norbert Lütkenhaus, S. J. van Enk +1 · 11 citations
Computer Science · Physics and Astronomy · #Blind Source Separation Techniques #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #quant-ph

paper · pdf · doi:10.1103/physreva.68.022308

published as Physical Review A 68, 022308 (2003) · 6 pages, 1 figure

arxiv created 2003/06/27 · openalex publication_date 2003/08/20 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present reduction theorems for the problem of optimal unambiguous state discrimination of two general density matrices. We show that this problem can be reduced to that of two density matrices that have the same rank n and are described in a Hilbert space of dimensions 2n. We also show how to use the reduction theorems to discriminate unambiguously between N mixed states (N>~2).

Cited by

• Optimal unambiguous state discrimination of two density matrices: Lower bound and class of exact solutions
• Commutator relations reveal solvable structures in unambiguous state discrimination
• Optimal unambiguous filtering of a quantum state: An instance in mixed state discrimination
• Quantum state discrimination: A geometric approach
• Parameter estimation for mixed states from a single copy
• Optimal quantum detectors for unambiguous detection of mixed states
• Optimum unambiguous discrimination of two mixed states and application to a class of similar states
• Unambiguous discrimination of mixed states: A description based on system-ancilla coupling
• Violating the modified Helstrom bound with nonprojective measurements
• Unambiguous discrimination between mixed quantum states
• Optimal unambiguous state discrimination of two density matrices: A second class of exact solutions