Abstract
We address the problem of optimally approximating the action of a desired and unavailable quantum channel having at our disposal a single use of a given set of other channels . The problem is recast to look for the least distinguishable channel from among the convex set , and the corresponding optimal weights provide the optimal convex mixing of the available channels . For single-qubit channels we study specifically cases where the available convex set corresponds to covariant channels or to Pauli channels, and the desired target map is an arbitrary unitary transformation or a generalized damping channel.
- Received 6 May 2017
DOI:https://doi.org/10.1103/PhysRevA.96.032311
©2017 American Physical Society