All entangled states are useful for channel discrimination.
We prove that every entangled state is useful as a resource for the problem of minimum-error channel discrimination. More specifically, given a single copy of an arbitrary bipartite entangled state, it holds that there is an instance of a quantum channel discrimination task for which this state allows for a correct discrimination with strictly higher probability than every separable state.
Piani
Marco
M
Institute for Quantum Computing & Department of Physics and Astronomy, University of Waterloo, 200 University Avenue West, Waterloo, Ontario N2L 3G1, Canada.
Watrous
John
J