Optimal convex approximations of quantum states based on fidelity

Abstract

We investigate the problem of optimally approximating a desired state by the convex mixing of a set of available states. The problem is recasted as finding the optimal state with the minimum distance from target state in a convex set of usable states. Based on the fidelity, we define the optimal convex approximation of an expected state and present the complete exact solutions with respect to an arbitrary qubit state. We find that the optimal state based on fidelity is closer to the target state than the optimal state based on trace norm in many ranges. Finally, we analyze the geometrical properties of the target states which can be completely represented by a set of practicable states. Using the feature of convex combination, we express this class of target states in terms of three available states.

References in corpus (14)

• Quantum entanglement
• Entanglement of Formation of an Arbitrary State of Two Qubits
• Mixed State Entanglement and Quantum Error Correction
• Quantifying Coherence
• Entanglement detection
• Quantifying Entanglement
• Unified View of Quantum and Classical Correlations
• The Fidelity and Trace Norm Distances for Quantifying Coherence
• Concurrence of mixed bipartite quantum states in arbitrary dimensions
• Bures volume of the set of mixed quantum states
• Detection of $k$-partite entanglement and $k$-nonseparability of multipartite quantum states
• Volume of the space of qubit-qubit channels and state transformations under random quantum channels
• The optimal approximation of qubit states with limited quantum states
• Relations among $k$-ME concurrence, negativity, polynomial invariants, and tangle