Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0905.3106 · Physical Review A

Numerical evaluation of convex-roof entanglement measures with applications to spin rings

Beat Röthlisberger, J. Lehmann, Daniel Loss

Published Oct 1, 2009• 42 citations
arXivHTMLPDF

Abstract

We present two ready-to-use numerical algorithms to evaluate convex-roof extensions of arbitrary pure-state entanglement monotones. Their implementation leaves the user merely with the task of calculating derivatives of the respective pure-state measure. We provide numerical tests of the algorithms and demonstrate their good convergence properties. We further employ them in order to investigate the entanglement in particular few-spins systems at finite temperature. Namely, we consider ferromagnetic Heisenberg exchange-coupled spin-$\frac{1}{2}$ rings subject to an inhomogeneous in-plane field geometry obeying full rotational symmetry around the axis perpendicular to the ring through its center. We demonstrate that highly entangled states can be obtained in these systems at sufficiently low temperatures and by tuning the strength of a magnetic field configuration to an optimal value which is identified numerically.

DOI
10.1103/physreva.80.042301

Related papers

Evaluating Convex Roof Entanglement Measures

Géza Tóth, Tobias Moroder, Otfried Gühne

We show a powerful method to compute entanglement measures based on convex roof constructions. In particular, our method is applicable to measures that, for pure states, can be written as low order polynomials of operator expectation values. We show how to compute the linear entropy of entanglement, the linear entanglement of assistance, and a bound on the dimension of the entanglement for bipartite systems. We discuss how to obtain the convex roof of the three-tangle for three-qubit states. We also show how to calculate the linear entropy of entanglement and the quantum Fisher information based on partial information or device independent information. We demonstrate the usefulness of our method by concrete examples.

arXiv:1409.3806•Physical Review Letters•Apr 21, 2015•106 citations

Efficient evaluation of convex roof entanglement measures

Géza Tóth, Tobias Moroder, Otfried Gühne

We show a powerful method to compute entanglement measures based on convex roof constructions. In particular, our method is applicable to measures that, for pure states, can be written as low order polynomials of operator expectation values. We show how to compute the linear entropy of entanglement, the linear entanglement of assistance, and a bound on the dimension of the entanglement for bipartite systems. We discuss how to obtain the convex roof of the three-tangle for three-qubit states. We also show how to calculate the linear entropy of entanglement and the quantum Fisher information based on partial information or device independent information. We demonstrate the usefulness of our method by concrete examples

•Sep 12, 2014•0 citations

Entanglement Quantification Made Easy: Polynomial Measures Invariant under Convex Decomposition

Bartosz Regula, Gerardo Adesso

Quantifying entanglement in composite systems is a fundamental challenge, yet exact results are available in only a few special cases. This is because hard optimization problems are routinely involved, such as finding the convex decomposition of a mixed state with the minimal average pure-state entanglement, the so-called convex roof. We show that under certain conditions such a problem becomes trivial. Precisely, we prove by a geometric argument that polynomial entanglement measures of degree 2 are independent of the choice of pure-state decomposition of a mixed state, when the latter has only one pure unentangled state in its range. This allows for the analytical evaluation of convex roof extended entanglement measures in classes of rank-2 states obeying such a condition. We give explicit examples for the square root of the three-tangle in three-qubit states, and we show that several representative classes of four-qubit pure states have marginals that enjoy this property.

arXiv:1512.03326•Physical Review Letters•Feb 19, 2016•25 citations

Entanglement monotones and transformations of symmetric bipartite states

Mark Girard, Gilad Gour

The primary goal in the study of entanglement as a resource theory is to find conditions that determine when one quantum state can or cannot be transformed into another via local operations and classical communication operations. This is typically done through entanglement monotones or conversion witnesses. Such quantities cannot be computed for arbitrary quantum states in general, but it is useful to consider classes of symmetric states for which closed-form expressions can be found. In this paper, we show how to compute the convex roof of any entanglement monotone for all Werner states. The convex roofs of the well-known Vidal monotones are computed for all isotropic states, and we show how this method can generalize to other entanglement measures and other types of symmetries as well. We also present necessary and sufficient conditions that determine when a pure bipartite state can be deterministically converted into a Werner state or an isotropic state.

arXiv:1609.08016•Physical Review A•Jan 9, 2017•10 citations

Convex hulls of varieties and entanglement measures based on the roof construction

Tobias J. Osborne

In this paper we study the problem of calculating the convex hull of certain affine algebraic varieties. As we explain, the motivation for considering this problem is that certain pure-state measures of quantum entanglement, which we call \emph{polynomial entanglement measures}, can be represented as affine algebraic varieties. We consider the evaluation of certain mixed-state extensions of these polynomial entanglement measures, namely \emph{convex and concave roofs}. We show that the evaluation of a roof-based mixed-state extension is equivalent to calculating a hyperplane which is multiply tangent to the variety in a number of places equal to the number of terms in an optimal decomposition for the measure. In this way we provide an \emph{implicit} representation of optimal decompositions for mixed-state entanglement measures based on the roof construction.

arXiv:quant-ph/0402055•Quantum Information and Computation•Mar 1, 2007•13 citations

Nonconvex optimization strategy for computing convex-roof entanglement

Jimmie Adriazola, Katarzyna Roszak

We develop a numerical methodology for the computation of entanglement measures for mixed quantum states. Using the well-known Schr\"odinger-Hughston-Jozsa-Wootters theorem, the computation of convex-roof entanglement measures is reframed as a search for unitary matrices: a nonconvex optimization problem. To address this nonconvexity, we modify a genetic algorithm, known in the literature as differential evolution, constraining the search space to unitary matrices by using a QR factorization. We then refine results using a quasi-Newton method. We benchmark our method on simple test problems and, as an application, compute entanglement between a system and its environment over time for pure dephasing evolutions. We also study the temperature dependence of Gibbs state entanglement for a class of block-diagonal Hamiltonians to provide a complementary test scenario with a set of entangled states that are qualitatively different. We find that the method works well enough to reliably reproduce entanglement curves, even for comparatively large systems. The modified genetic algorithm is a derivative-free, nonconvex computational method that broadly applies to the computation of convex-roof entanglement measures.

arXiv:2412.10166•Physical Review A•Mar 28, 2025•0 citations
We present two ready-to-use numerical algorithms to evaluate convex-roof extensions of arbitrary pure-state entanglement monotones. Their implementation leaves the user merely with the task of calculating derivatives of the respective pure-state measure. We provide numerical tests of the algorithms and demonstrate their good convergence properties. We further employ them in order to investigate the entanglement in particular few-spins systems at finite temperature. Namely, we consider ferromagnetic Heisenberg exchange-coupled spin-12\frac{1}{2}21​ rings subject to an inhomogeneous in-plane field geometry obeying full rotational symmetry around the axis perpendicular to the ring through its center. We demonstrate that highly entangled states can be obtained in these systems at sufficiently low temperatures and by tuning the strength of a magnetic field configuration to an optimal value which is identified numerically.
We show a powerful method to compute entanglement measures based on convex roof constructions. In particular, our method is applicable to measures that, for pure states, can be written as low order polynomials of operator expectation values. We show how to compute the linear entropy of entanglement, the linear entanglement of assistance, and a bound on the dimension of the entanglement for bipartite systems. We discuss how to obtain the convex roof of the three-tangle for three-qubit states. We also show how to calculate the linear entropy of entanglement and the quantum Fisher information based on partial information or device independent information. We demonstrate the usefulness of our method by concrete examples.
We show a powerful method to compute entanglement measures based on convex roof constructions. In particular, our method is applicable to measures that, for pure states, can be written as low order polynomials of operator expectation values. We show how to compute the linear entropy of entanglement, the linear entanglement of assistance, and a bound on the dimension of the entanglement for bipartite systems. We discuss how to obtain the convex roof of the three-tangle for three-qubit states. We also show how to calculate the linear entropy of entanglement and the quantum Fisher information based on partial information or device independent information. We demonstrate the usefulness of our method by concrete examples
Quantifying entanglement in composite systems is a fundamental challenge, yet exact results are available in only a few special cases. This is because hard optimization problems are routinely involved, such as finding the convex decomposition of a mixed state with the minimal average pure-state entanglement, the so-called convex roof. We show that under certain conditions such a problem becomes trivial. Precisely, we prove by a geometric argument that polynomial entanglement measures of degree 2 are independent of the choice of pure-state decomposition of a mixed state, when the latter has only one pure unentangled state in its range. This allows for the analytical evaluation of convex roof extended entanglement measures in classes of rank-2 states obeying such a condition. We give explicit examples for the square root of the three-tangle in three-qubit states, and we show that several representative classes of four-qubit pure states have marginals that enjoy this property.
The primary goal in the study of entanglement as a resource theory is to find conditions that determine when one quantum state can or cannot be transformed into another via local operations and classical communication operations. This is typically done through entanglement monotones or conversion witnesses. Such quantities cannot be computed for arbitrary quantum states in general, but it is useful to consider classes of symmetric states for which closed-form expressions can be found. In this paper, we show how to compute the convex roof of any entanglement monotone for all Werner states. The convex roofs of the well-known Vidal monotones are computed for all isotropic states, and we show how this method can generalize to other entanglement measures and other types of symmetries as well. We also present necessary and sufficient conditions that determine when a pure bipartite state can be deterministically converted into a Werner state or an isotropic state.
In this paper we study the problem of calculating the convex hull of certain affine algebraic varieties. As we explain, the motivation for considering this problem is that certain pure-state measures of quantum entanglement, which we call \emph{polynomial entanglement measures}, can be represented as affine algebraic varieties. We consider the evaluation of certain mixed-state extensions of these polynomial entanglement measures, namely \emph{convex and concave roofs}. We show that the evaluation of a roof-based mixed-state extension is equivalent to calculating a hyperplane which is multiply tangent to the variety in a number of places equal to the number of terms in an optimal decomposition for the measure. In this way we provide an \emph{implicit} representation of optimal decompositions for mixed-state entanglement measures based on the roof construction.
We develop a numerical methodology for the computation of entanglement measures for mixed quantum states. Using the well-known Schr\"odinger-Hughston-Jozsa-Wootters theorem, the computation of convex-roof entanglement measures is reframed as a search for unitary matrices: a nonconvex optimization problem. To address this nonconvexity, we modify a genetic algorithm, known in the literature as differential evolution, constraining the search space to unitary matrices by using a QR factorization. We then refine results using a quasi-Newton method. We benchmark our method on simple test problems and, as an application, compute entanglement between a system and its environment over time for pure dephasing evolutions. We also study the temperature dependence of Gibbs state entanglement for a class of block-diagonal Hamiltonians to provide a complementary test scenario with a set of entangled states that are qualitatively different. We find that the method works well enough to reliably reproduce entanglement curves, even for comparatively large systems. The modified genetic algorithm is a derivative-free, nonconvex computational method that broadly applies to the computation of convex-roof entanglement measures.