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:2412.10166 · Physical Review A

Nonconvex optimization strategy for computing convex-roof entanglement

Jimmie Adriazola, Katarzyna Roszak

Published Mar 28, 2025• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.111.032435

Related papers

A variational quantum algorithm for approximating convex roofs

George Androulakis, Ryan McGaha

Many entanglement measures are first defined for pure states of a bipartite Hilbert space, and then extended to mixed states via the convex roof extension. In this article we alter the convex roof extension of an entanglement measure, to produce a sequence of extensions that we call $f$-$d$ extensions, for $d \in \mathbb{N}$, where $f:[0,1]\to [0, \infty)$ is a fixed continuous function which vanishes only at zero. We prove that for any such function $f$, and any continuous, faithful, non-negative function, (such as an entanglement measure), $\mu$ on the set of pure states of a finite dimensional bipartite Hilbert space, the collection of $f$-$d$ extensions of $\mu$ detects entanglement, i.e. a mixed state $\rho$ on a finite dimensional bipartite Hilbert space is separable, if and only if there exists $d \in \mathbb{N}$ such that the $f$-$d$ extension of $\mu$ applied to $\rho$ is equal to zero. We introduce a quantum variational algorithm which aims to approximate the $f$-$d$ extensions of entanglement measures defined on pure states. However, the algorithm does have its drawbacks. We show that this algorithm exhibits barren plateaus when used to approximate the family of $f$-$d$ extensions of the Tsallis entanglement entropy for a certain function $f$ and unitary ansatz $U(\theta)$ of sufficient depth. In practice, if additional information about the state is known, then one needs to avoid using the suggested ansatz for long depth of circuits.

arXiv:2203.02099•Quantum Information and Computation•Sep 1, 2022•3 citations

Convex Analysis in Quantum Information

Mark Girard

Convexity arises naturally in the study of quantum information. As a result, many useful tools from convex analysis can be used to give important results regarding aspects of quantum information. This thesis builds up methods using core concepts from convex analysis, including convex optimization problems, convex roof constructions, and conic programming, to study mathematical problems related to quantum entanglement. In this thesis, I develop a method for solving convex optimization problems that arise in quantum information theory by analyzing the corresponding converse problem. That is, given an element in a convex set, I determine a family of convex functions that are minimized at this point. This method is used find explicit formulas for the relative entropy of entanglement, as well as other important quantities used to quantify entanglement, and allows one to show important relationships between them. I also construct a practical algorithm that can be used to compute these quantities. This thesis also presents a method to compute convex roofs of arbitrary entanglement measures evaluated on highly symmetric bipartite states. I also establish a framework for completely characterizing quantum resource theories that are convex. For resource theories with a simple mathematical structure, this gives rise to a complete set of resource monotones that can be computed in practice using semidefinite programs. This has applications to the study of entanglement transformations.

•Jan 1, 2017•3 citations

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•111 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•26 citations

Unified framework for calculating convex roof resource measures

Xuanran Zhu, Chao Zhang, Zheng An +1 more

Quantum resource theories (QRTs) provide a comprehensive and practical framework for the analysis of diverse quantum phenomena. A fundamental task within QRTs is the quantification of resources inherent in a given quantum state. In this work, we introduce a unified computational framework for a class of widely utilized quantum resource measures, derived from convex roof extensions. We establish that the computation of these convex roof resource measures can be reformulated as an optimization problem over a Stiefel manifold, which can be further unconstrained through polar projection. Compared to existing methods employing semi-definite programming (SDP), gradient-based techniques or seesaw strategy, our approach not only demonstrates satisfying computational efficiency but also maintains applicability across various scenarios within a unified framework. We substantiate the efficacy of our method by applying it to several key quantum resources, including entanglement, coherence, and magic states. Moreover, our methodology can be readily extended to other convex roof quantities beyond the domain of resource theories, suggesting broad applicability in the realm of quantum information theory.

arXiv:2406.19683•npj Quantum Information•Apr 4, 2025•13 citations
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.
Many entanglement measures are first defined for pure states of a bipartite Hilbert space, and then extended to mixed states via the convex roof extension. In this article we alter the convex roof extension of an entanglement measure, to produce a sequence of extensions that we call fff-ddd extensions, for d∈Nd \in \mathbb{N}d∈N, where f:[0,1]→[0,∞)f:[0,1]\to [0, \infty)f:[0,1]→[0,∞) is a fixed continuous function which vanishes only at zero. We prove that for any such function fff, and any continuous, faithful, non-negative function, (such as an entanglement measure), μ\muμ on the set of pure states of a finite dimensional bipartite Hilbert space, the collection of fff-ddd extensions of μ\muμ detects entanglement, i.e. a mixed state ρ\rhoρ on a finite dimensional bipartite Hilbert space is separable, if and only if there exists d∈Nd \in \mathbb{N}d∈N such that the fff-ddd extension of μ\muμ applied to ρ\rhoρ is equal to zero. We introduce a quantum variational algorithm which aims to approximate the fff-ddd extensions of entanglement measures defined on pure states. However, the algorithm does have its drawbacks. We show that this algorithm exhibits barren plateaus when used to approximate the family of fff-ddd extensions of the Tsallis entanglement entropy for a certain function fff and unitary ansatz U(θ)U(\theta)U(θ) of sufficient depth. In practice, if additional information about the state is known, then one needs to avoid using the suggested ansatz for long depth of circuits.
Convexity arises naturally in the study of quantum information. As a result, many useful tools from convex analysis can be used to give important results regarding aspects of quantum information. This thesis builds up methods using core concepts from convex analysis, including convex optimization problems, convex roof constructions, and conic programming, to study mathematical problems related to quantum entanglement. In this thesis, I develop a method for solving convex optimization problems that arise in quantum information theory by analyzing the corresponding converse problem. That is, given an element in a convex set, I determine a family of convex functions that are minimized at this point. This method is used find explicit formulas for the relative entropy of entanglement, as well as other important quantities used to quantify entanglement, and allows one to show important relationships between them. I also construct a practical algorithm that can be used to compute these quantities. This thesis also presents a method to compute convex roofs of arbitrary entanglement measures evaluated on highly symmetric bipartite states. I also establish a framework for completely characterizing quantum resource theories that are convex. For resource theories with a simple mathematical structure, this gives rise to a complete set of resource monotones that can be computed in practice using semidefinite programs. This has applications to the study of entanglement transformations.
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.
Quantum resource theories (QRTs) provide a comprehensive and practical framework for the analysis of diverse quantum phenomena. A fundamental task within QRTs is the quantification of resources inherent in a given quantum state. In this work, we introduce a unified computational framework for a class of widely utilized quantum resource measures, derived from convex roof extensions. We establish that the computation of these convex roof resource measures can be reformulated as an optimization problem over a Stiefel manifold, which can be further unconstrained through polar projection. Compared to existing methods employing semi-definite programming (SDP), gradient-based techniques or seesaw strategy, our approach not only demonstrates satisfying computational efficiency but also maintains applicability across various scenarios within a unified framework. We substantiate the efficacy of our method by applying it to several key quantum resources, including entanglement, coherence, and magic states. Moreover, our methodology can be readily extended to other convex roof quantities beyond the domain of resource theories, suggesting broad applicability in the realm of quantum information theory.