Profitable entanglement for channel discrimination

Abstract

We investigate the usefulness of side entanglement in discriminating between two generic qubit channels, up to unitary pre- and post-processing, and determine exact conditions under which it does enhance (as well as conditions under which it does not) the success probability. This is done in a constructive way by first analysing the problem for channels that are extremal in the set of completely positive and trace-preserving qubit linear maps and then for channels that are inside such a set.

On the effectiveness of Bayesian discrete feedback for quantum information reclaiming

“…Any other quantum channel T that is not on the closure of extreme points of T, can be written as convex combination of two maps in the closure of extreme points [8], namely as…”