Relaxation Method For Calculating Quantum Entanglement

Abstract

In a previous paper, we showed how entanglement of formation can be defined as a minimum of the quantum conditional mutual information (a.k.a. quantum conditional information transmission). In classical information theory, the Arimoto-Blahut method is one of the preferred methods for calculating extrema of mutual information. In this paper, we present a new method, akin to the Arimoto-Blahut method, for calculating entanglement of formation. We also present several examples computed with a computer program called Causa Comun that implements the ideas of this paper.

25 pages (files: 1 .tex, 2 .eps, 2 .sty) 95% same paper. Corrected minor mistakes and typos. Made many small changes to make more user friendly. Added simple but useful ideas about convexity

References in corpus (7)

• Mixed State Entanglement and Quantum Error Correction
• Separability criterion and inseparable mixed states with positive partial transposition
• Bound entanglement can be activated
• Variational Characterisations of Separability and Entanglement of Formation
• Quantum Entanglement and Conditional Information Transmission
• Separability of Density Matrices and Conditional Information Transmission
• Entanglement of Formation and Conditional Information Transmission

Cited by in corpus (7)

• The entanglement of purification
• Entanglement of Distillation and Conditional Mutual Information
• An Introduction to Quantum Entanglement: a Geometric Approach
• Linear growth of the entanglement entropy for quadratic Hamiltonians and arbitrary initial states
• Entanglement of Bell Mixtures of Two Qubits
• On the strong superadditivity of entanglement of formation -- Conditions and examples
• Quantum d-separation and quantum belief propagation