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

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

Zhou Zhang, Yue Dai, Yuli Dong, Chengjie Zhang

Published Mar 26, 2019• 0 citations
OpenAlex

Abstract

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.

Related papers

Numerical and analytical results for geometric measure of coherence and geometric measure of entanglement

Zhou Zhang, Yue Dai, Yuli Dong +1 more

Quantifying coherence and entanglement is extremely important in quantum information processing. Here, we present numerical and analytical results for the geometric measure of coherence, and also present numerical results for the geometric measure of entanglement. On the one hand, we first provide a semidefinite algorithm to numerically calculate geometric measure of coherence for arbitrary finite-dimensional mixed states. Based on this semidefinite algorithm, we test randomly generated single-qubit states, single-qutrit states, and a special kind of d-dimensional mixed states. Moreover, we also obtain an analytical solution of geometric measure of coherence for a special kind of mixed states. On the other hand, another algorithm is proposed to calculate the geometric measure of entanglement for arbitrary 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, we compare our numerical results with some analytical results, which coincide with each other.

arXiv:1903.10944•Scientific Reports•Jul 21, 2020•14 citations

Simple algorithm for computing the geometric measure of entanglement

Alexander Streltsov, Hermann Kampermann, Dagmar Bruß

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.

arXiv:1104.0821•Physical Review A•Aug 18, 2011•24 citations

Quantum Entanglement with Geometric Measures

Xuanran Zhu

Quantifying quantum entanglement is a pivotal challenge in quantum information science, particularly for high-dimensional systems, due to its computational complexity. This thesis extends the geometric measure of entanglement (GME) to introduce and investigate a suite of GME-based entanglement monotones tailored for diverse quantum contexts, including pure states, subspaces, and mixed states. These monotones are applicable to both bipartite and multipartite systems, offering a unified framework for characterizing entanglement across various scenarios. Notably, the proposed monotones are adept at identifying entanglement with varying entanglement dimensionalities, making them particularly effective for detecting high-dimensional entanglement. To support practical computation, we develop a non-convex optimization framework that yields accurate upper bounds, complemented by semidefinite programming techniques to establish robust lower bounds. Together, these approaches provide a consistent and efficient computational methodology. This work advances both the theoretical understanding and algorithmic tools for entanglement quantification, contributing to the study of complex quantum correlations in entangled systems.

arXiv:2506.11453•Jan 1, 2025•0 citations

Geometric Measure of Entanglement of Rank-2 Mixed Multiqubit States and its Estimation on a Quantum Processor

N. A. Susulovska, Kh. P. Gnatenko

The geometric measure of entanglement of mixed states is investigated based on its relation to spin correlations. We derive an analytical expression for the entanglement of rank-2 mixed states composed of arbitrary multiqubit pure states within a two-dimensional Hilbert subspace. The dependence of the entanglement of rank-2 mixed multiqubit states on the parameters characterizing arbitrary pure states in the mixture is studied both analytically and using quantum computing. For a particular class of mixed states, namely, equal-probability mixtures of an arbitrary multiqubit state and the Schrödinger cat state, we construct quantum protocols for detecting the geometric measure of entanglement based on its relation to spin correlations. We quantify the entanglement using both the AerSimulator and the ibm_marrakesh quantum computer. The effects of quantum-computing errors are also analyzed. The simulation results reproduce the analytical dependencies, while measurements on the quantum device demonstrate good agreement with theoretical predictions within estimated error bounds.

quant-pharXiv:2610.06127•Oct 6, 2026•0 citations

Evaluation of entanglement measures by a single observable

Chengjie Zhang, Sixia Yu, Qing Chen +2 more

We present observable lower bounds for several bipartite entanglement measures including entanglement of formation, geometric measure of entanglement, concurrence, convex-roof extended negativity, and $G$ concurrence. The lower bounds facilitate estimates of these entanglement measures for arbitrary finite-dimensional bipartite states. Moreover, these lower bounds can be calculated analytically from the expectation value of a single observable. Based on our results, we use several real experimental measurement data to get lower bounds of entanglement measures for these experimentally realized states. In addition, we also study the relations between entanglement measures.

arXiv:1506.01484•Physical Review A•Oct 18, 2016•11 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
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.
Quantifying coherence and entanglement is extremely important in quantum information processing. Here, we present numerical and analytical results for the geometric measure of coherence, and also present numerical results for the geometric measure of entanglement. On the one hand, we first provide a semidefinite algorithm to numerically calculate geometric measure of coherence for arbitrary finite-dimensional mixed states. Based on this semidefinite algorithm, we test randomly generated single-qubit states, single-qutrit states, and a special kind of d-dimensional mixed states. Moreover, we also obtain an analytical solution of geometric measure of coherence for a special kind of mixed states. On the other hand, another algorithm is proposed to calculate the geometric measure of entanglement for arbitrary 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, we compare our numerical results with some analytical results, which coincide with each other.
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.
Quantifying quantum entanglement is a pivotal challenge in quantum information science, particularly for high-dimensional systems, due to its computational complexity. This thesis extends the geometric measure of entanglement (GME) to introduce and investigate a suite of GME-based entanglement monotones tailored for diverse quantum contexts, including pure states, subspaces, and mixed states. These monotones are applicable to both bipartite and multipartite systems, offering a unified framework for characterizing entanglement across various scenarios. Notably, the proposed monotones are adept at identifying entanglement with varying entanglement dimensionalities, making them particularly effective for detecting high-dimensional entanglement. To support practical computation, we develop a non-convex optimization framework that yields accurate upper bounds, complemented by semidefinite programming techniques to establish robust lower bounds. Together, these approaches provide a consistent and efficient computational methodology. This work advances both the theoretical understanding and algorithmic tools for entanglement quantification, contributing to the study of complex quantum correlations in entangled systems.
The geometric measure of entanglement of mixed states is investigated based on its relation to spin correlations. We derive an analytical expression for the entanglement of rank-2 mixed states composed of arbitrary multiqubit pure states within a two-dimensional Hilbert subspace. The dependence of the entanglement of rank-2 mixed multiqubit states on the parameters characterizing arbitrary pure states in the mixture is studied both analytically and using quantum computing. For a particular class of mixed states, namely, equal-probability mixtures of an arbitrary multiqubit state and the Schrödinger cat state, we construct quantum protocols for detecting the geometric measure of entanglement based on its relation to spin correlations. We quantify the entanglement using both the AerSimulator and the ibm_marrakesh quantum computer. The effects of quantum-computing errors are also analyzed. The simulation results reproduce the analytical dependencies, while measurements on the quantum device demonstrate good agreement with theoretical predictions within estimated error bounds.
We present observable lower bounds for several bipartite entanglement measures including entanglement of formation, geometric measure of entanglement, concurrence, convex-roof extended negativity, and GGG concurrence. The lower bounds facilitate estimates of these entanglement measures for arbitrary finite-dimensional bipartite states. Moreover, these lower bounds can be calculated analytically from the expectation value of a single observable. Based on our results, we use several real experimental measurement data to get lower bounds of entanglement measures for these experimentally realized states. In addition, we also study the relations between entanglement measures.
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.