Optimal convex approximations of quantum states
Abstract
We consider the problem of optimally approximating an unavailable quantum state by the convex mixing of states drawn from a set of available states \ i\. The problem is recast to look for the least distinguishable state from among the convex set Σi pi i, and the corresponding optimal weights \ pi \ provide the optimal convex mixing. We present the complete solution for the optimal convex approximation of a qubit mixed state when the set of available states comprises the three bases of the Pauli matrices.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.