Reaching Fleming's dicrimination bound

Abstract

Any rule for identifying a quantum system's state within a set of two non-orthogonal pure states by a single measurement is flawed. It has a non-zero probability of either yielding the wrong result or leaving the query undecided. This also holds if the measurement of an observable A is repeated on a finite sample of n state copies. We formulate a state identification rule for such a sample. This rule's probability of giving the wrong result turns out to be bounded from above by 1/nδA2 with δA=|<A>1-<A>2|/(1A+2A). A larger δA results in a smaller upper bound. Yet, according to Fleming, δA cannot exceed θ with θ∈(0,π/2) being the angle between the pure states under consideration. We demonstrate that there exist observables A which reach the bound θ and we determine all of them.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…