How many copies are needed for state discrimination?
Abstract
Given a collection of states (rho1, ..., rhoN) with pairwise fidelities F(rhoi, rhoj) <= F < 1, we show the existence of a POVM that, given rhoiotimes n, will identify i with probability >= 1-epsilon, as long as n>=2(log N/eps)/log (1/F). This improves on previous results which were either dimension-dependent or required that i be drawn from a known distribution.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.