How many copies are needed for state discrimination?
Aram W. Harrow, Andreas Winter
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.
Create a lesson
Related papers
Spectral Fingerprints of Gauge Theories on a Quantum Computer
Graham Van Goffrier, Debasish Banerjee, Bipasha Chakraborty et al.
Dynamics of local quantum information in random unitary circuits
Ratul Thakur, Sthitadhi Roy
Factorized Boolean representations for efficient quantum synthesis
Mehul Shah, Robert Fiszer, Marek Perkowski
Detuning- and Stark-robust Rydberg gates
Elie Bataille, Gyohei Nomura, Manuel Endres
Krylov Break Times from an Inhomogeneous Lieb--Robinson Light Cone
Shunji Matsuura, Yoji Kawamura, Joseph Salfi et al.
Stochastic transport of a Goldstone mode in a self-organized atomic crystal
Zhanhai Yu, Di Xiang, Xiaotian Zhang et al.