Optimal convex approximation of qubit states and geometry of completely represented states

Abstract

Abstract We investigate the optimal convex approximation, optimally approximating a desired and unavailable qubit state by the convex mixing of a given set of available states. When the available states are the eigenvectors of three Pauli matrices, we present the complete exact solution for the optimal convex approximation of an arbitrary qubit state based on the fidelity distance. By the comparison of optimal states based on fidelity and trace norm, the advantages and disadvantages of the optimal convex approximation are identified. Several examples are provided to support this. We also analyze the geometrical properties of the target states which can be completely represented by a set of available states. Using the feature of convex combination, we derive the maximum range of completely represented states and clearly illustrate that any qubit state can be optimally prepared by at most three available states in known useable states.