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

Simple algorithm for computing the geometric measure of entanglement

Alexander Streltsov, Hermann Kampermann, Dagmar Bruß

Published Aug 18, 2011• 24 citations
arXivHTMLPDF

Abstract

We present an easy implementable algorithm for approximating the geometric measure of entanglement from above. The algorithm can be applied to any multipartite mixed state. It involves only the solution of an eigenproblem and finding a singular value decomposition; no further numerical techniques are needed. To provide examples, the algorithm was applied to the isotropic states of three qubits and the three-qubit $XX$ model with external magnetic field.

DOI
10.1103/physreva.84.022323

Related papers

Geometric measure of entanglement and applications to bipartite and multipartite quantum states

Tzu-Chieh Wei, Paul M. Goldbart

The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement, already present in a number of settings [A. Shimony, Ann. NY. Acad. Sci. 755, 675 (1995); H. Barnum and N. Linden, J. Phys. A: Math. Gen. 34, 6787 (2001)], is explored for bipartite and multipartite pure and mixed states. The measure is determined analytically for arbitrary two-qubit mixed states and for generalized Werner and isotropic states, and is also applied to certain multipartite mixed states. In particular, a detailed analysis is given for arbitrary mixtures of three-qubit Greenberger-Horne-Zeilinger, W, and inverted-$W$ states. Along the way, we point out connections of the geometric measure of entanglement with entanglement witnesses and with the Hartree approximation method.

arXiv:quant-ph/0307219•Physical Review A•Oct 9, 2003•744 citations

Quantifying Multipartite Entanglement

Tzu-Chieh Wei

A natural way of quantifying the degree of entanglement for a pure quantum state is to compare how far this state is from the set of all unentangled pure states. This geometric measure of entanglement is explored for bipartite and multipartite pure and mixed states. It is determined analytically for arbitrary two‐qubit mixed states and for generalized Werner and isotropic states. It is also applied to certain multipartite mixed states, including two multipartite bound entangled states discovered by Smolin and Dür. Moreover, the geometric measure of entanglement is applied to the ground state of the Ising model in a transverse magnetic field. From this model the entanglement is shown to exhibit singular behavior at the quantum critical point.

AIP conference proceedings•Jan 1, 2004•0 citations

Numerical results for geometric measure of coherence and geometric measure of entanglement based on semidefinite programs

Zhou Zhang, Yue Dai, Yuli Dong +1 more

We present semidefinite programs for computing the geometric measure of coherence and the geometric measure of entanglement, respectively. For the geometric measure of coherence, the algorithm can be applied to any finite-dimensional mixed state. We test randomly generated single-qubit states, single-qutrit states, and a special kind of $d$-dimensional mixed states. For the geometric measure of entanglement, the algorithm is applied to all two-qubit and qubit-qutrit states, and some special kinds of higher dimensional mixed states. For other states, the algorithm can get a lower bound of the geometric measure of entanglement. Randomly generated two-qubit states, the isotropic states and the Werner states are tested. Furthermore, the maximum deviation between the analytical solution and the numerical solution is calculated.

•Mar 26, 2019•0 citations

Geometric measure of entanglement for multipartite quantum states

Tzu-Chieh Wei, Paul M. Goldbart

The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement, already present in a number of settings [A. Shimony, Ann. NY. Acad. Sci. 755, p.675 (1995) and H. Barnum and N. Linden, J. Phys. A: Math. Gen. 34, p.6787 (2001)], is explored for bipartite and multipartite pure and mixed states. It is determined for arbitrary two-qubit mixed states and for generalized Werner and isotropic states, and is also applied to certain multipartite mixed states.

arXiv:quant-ph/0212030•Dec 5, 2002•3 citations

ENTCALC: Toolkit for calculating geometric entanglement in multipartite quantum systems

Piotr Masajada, Aby Philip, Alexander Streltsov

We present entcalc, a Python and MATLAB package for estimating the geometric entanglement of multipartite quantum states. The package operates as follows: given a multipartite quantum state as input, it outputs an estimate of its geometric entanglement. For pure states, it computes the geometric entanglement together with an estimation error. For mixed states, it provides both lower and upper bounds on the geometric entanglement, thereby identifying an interval in which the true value lies. We provide several methods to compute the lower bound, enabling users to balance accuracy against computational cost. We apply entcalc to several representative examples, including for $3\otimes3$ PPT entangled states, mixtures of GHZ and W states, thermal states of selected three-qubit spin chains, and noisy GHZ and W states. We observe signatures of quantum phase transitions by quantifying entanglement in spin chains. We also demonstrate that entanglement between non-neighbouring sites can be activated by tuning the external magnetic field. In all tested cases, the gap between the lower and upper bounds is found to be very small, indicating that entcalc provides highly accurate estimates of the geometric entanglement for these states.

quant-pharXiv:2512.10884•Dec 12, 2025•0 citations

The geometric measure of multipartite entanglement and the singular values of a hypermatrix

Joseph J. Hilling, Anthony Sudbery

It is shown that the geometric measure of entanglement of a pure multipartite state satisfies a polynomial equation, generalizing the singular-value equation of the matrix of coefficients of a bipartite state. The equation is solved for a class of three-qubit states.

arXiv:0905.2094•Journal of Mathematical Physics•Jul 1, 2010•53 citations
We present an easy implementable algorithm for approximating the geometric measure of entanglement from above. The algorithm can be applied to any multipartite mixed state. It involves only the solution of an eigenproblem and finding a singular value decomposition; no further numerical techniques are needed. To provide examples, the algorithm was applied to the isotropic states of three qubits and the three-qubit XXXXXX model with external magnetic field.
The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement, already present in a number of settings [A. Shimony, Ann. NY. Acad. Sci. 755, 675 (1995); H. Barnum and N. Linden, J. Phys. A: Math. Gen. 34, 6787 (2001)], is explored for bipartite and multipartite pure and mixed states. The measure is determined analytically for arbitrary two-qubit mixed states and for generalized Werner and isotropic states, and is also applied to certain multipartite mixed states. In particular, a detailed analysis is given for arbitrary mixtures of three-qubit Greenberger-Horne-Zeilinger, W, and inverted-WWW states. Along the way, we point out connections of the geometric measure of entanglement with entanglement witnesses and with the Hartree approximation method.
A natural way of quantifying the degree of entanglement for a pure quantum state is to compare how far this state is from the set of all unentangled pure states. This geometric measure of entanglement is explored for bipartite and multipartite pure and mixed states. It is determined analytically for arbitrary two‐qubit mixed states and for generalized Werner and isotropic states. It is also applied to certain multipartite mixed states, including two multipartite bound entangled states discovered by Smolin and Dür. Moreover, the geometric measure of entanglement is applied to the ground state of the Ising model in a transverse magnetic field. From this model the entanglement is shown to exhibit singular behavior at the quantum critical point.
We present semidefinite programs for computing the geometric measure of coherence and the geometric measure of entanglement, respectively. For the geometric measure of coherence, the algorithm can be applied to any finite-dimensional mixed state. We test randomly generated single-qubit states, single-qutrit states, and a special kind of ddd-dimensional mixed states. For the geometric measure of entanglement, the algorithm is applied to all two-qubit and qubit-qutrit states, and some special kinds of higher dimensional mixed states. For other states, the algorithm can get a lower bound of the geometric measure of entanglement. Randomly generated two-qubit states, the isotropic states and the Werner states are tested. Furthermore, the maximum deviation between the analytical solution and the numerical solution is calculated.
The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement, already present in a number of settings [A. Shimony, Ann. NY. Acad. Sci. 755, p.675 (1995) and H. Barnum and N. Linden, J. Phys. A: Math. Gen. 34, p.6787 (2001)], is explored for bipartite and multipartite pure and mixed states. It is determined for arbitrary two-qubit mixed states and for generalized Werner and isotropic states, and is also applied to certain multipartite mixed states.
We present entcalc, a Python and MATLAB package for estimating the geometric entanglement of multipartite quantum states. The package operates as follows: given a multipartite quantum state as input, it outputs an estimate of its geometric entanglement. For pure states, it computes the geometric entanglement together with an estimation error. For mixed states, it provides both lower and upper bounds on the geometric entanglement, thereby identifying an interval in which the true value lies. We provide several methods to compute the lower bound, enabling users to balance accuracy against computational cost. We apply entcalc to several representative examples, including for 3⊗33\otimes33⊗3 PPT entangled states, mixtures of GHZ and W states, thermal states of selected three-qubit spin chains, and noisy GHZ and W states. We observe signatures of quantum phase transitions by quantifying entanglement in spin chains. We also demonstrate that entanglement between non-neighbouring sites can be activated by tuning the external magnetic field. In all tested cases, the gap between the lower and upper bounds is found to be very small, indicating that entcalc provides highly accurate estimates of the geometric entanglement for these states.