Optimal unambiguous discrimination of two subspaces as a case in mixed state discrimination

Abstract

We show how to optimally unambiguously discriminate between two subspaces of a Hilbert space. In particular we suppose that we are given a quantum system in either the state ψ_{1}, where ψ_{1} can be any state in the subspace S_{1}, or ψ_{2}, where ψ_{2} can be any state in the subspace S_{2}, and our task is to determine in which of the subspaces the state of our quantum system lies. We do not want to make a mistake, which means that our procedure will sometimes fail if the subspaces are not orthogonal. This is a special case of the unambiguous discrimination of mixed states. We present the POVM that solves this problem and several applications of this procedure, including the discrimination of multipartite states without classical communication.

8 pages, replaced with published version

References in corpus (1)

• Unambiguous discrimination of mixed states

Cited by in corpus (9)

• Programmable quantum state discriminators with simple programs
• Optimum unambiguous discrimination of two mixed states and application to a class of similar states
• Discrimination of two mixed quantum states with maximum confidence and minimum probability of inconclusive results
• Optimal unambiguous state discrimination of two density matrices: A second class of exact solutions
• Unambiguous State Discrimination of two density matrices in Quantum Information Theory
• Optimum unambiguous identification of d unknown pure qudit states
• Unambiguous discrimination of mixed states: A description based on system-ancilla coupling
• Physical accessible transformations on a finite number of quantum states
• Commutator Relations Reveal Solvable Structures in Unambiguous State Discrimination