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:2601.23243

Complete Hierarchies for the Geometric Measure of Entanglement

Lisa T. Weinbrenner, Albert Rico, Kenneth Goodenough, Xiao-Dong Yu, Otfried Gühne

quant-phSubmitted Jan 30, 2026• Announced Feb 2, 2026• 3 citations• Revised Mar 5, 2026 (v2)
v1 · Jan 30, 2026v2 · Mar 5, 2026
arXivHTMLPDF

Abstract

In quantum physics, multiparticle systems are described by quantum states acting on tensor products of Hilbert spaces. This product structure leads to the distinction between product states and entangled states; moreover, one can quantify entanglement by considering the distance of a quantum state to the set of product states. The underlying optimization problem occurs frequently in physics and beyond, for instance in the computation of the injective tensor norm in multilinear algebra. Here, we introduce a method to determine the maximal overlap of a pure multiparticle quantum state with product states based on considering several copies of the pure state. This leads to three types of hierarchical approximations to the problem, all of which we prove to converge to the actual value. Besides allowing for the computation of the geometric measure of entanglement, our results can be used to tackle optimizations over stochastic local transformations, to find entanglement witnesses for weakly entangled bipartite states, and to design strong separability tests for mixed multiparticle states. Finally, our approach sheds light on the complexity of separability tests.

Comments
16 pages, 6 figures

Related papers

Complete hierarchies of efficient approximations to problems in entanglement theory

Jens Eisert, Philipp Hyllus, Otfried Gühne +1 more

We investigate several problems in entanglement theory from the perspective of convex optimization. This list of problems comprises (A) the decision whether a state is multiparty entangled, (B) the minimization of expectation values of entanglement witnesses with respect to pure product states, (C) the closely related evaluation of the geometric measure of entanglement to quantify pure multiparty entanglement, (D) the test whether states are multiparty entangled on the basis of witnesses based on second moments and on the basis of linear entropic criteria, and (E) the evaluation of instances of maximal output purities of quantum channels. We show that these problems can be formulated as certain optimization problems: as polynomially constrained problems employing polynomials of degree 3 or less. We then apply very recently established known methods from the theory of semidefinite relaxations to the formulated optimization problems. By this construction we arrive at a hierarchy of efficiently solvable approximations to the solution, approximating the exact solution as closely as desired, in a way that is asymptotically complete. For example, this results in a hierarchy of efficiently decidable sufficient criteria for multiparticle entanglement, such that every entangled state will necessarily be detected in some step of the hierarchy. Finally, we present numerical examples to demonstrate the practical accessibility of this approach.

arXiv:quant-ph/0407135•Physical Review A•Dec 21, 2004•103 citations

Hierarchies of efficient approximations to problems in entanglement theory

Jens Eisert, P. Hyllus, Otfried Gühne +1 more

We investigate several problems in entanglement theory from the perspective of convex optimization. This list of problems comprises (A) the decision whether a state is multi-party entangled,(B) the minimization of expectation values of entanglement witnesses with respect to pure product states, (C) the closely related evaluation of the geometric measure of entanglement to quantify pure multi-party entanglement, (D) the test whether states are multi-party entangled on the basis of witnesses based on second moments and on the basis of linear entropic criteria, and (E) the evaluation of instances of maximal output purities of quantum channels. We show that these problems can be formulated as certain optimization problems: as polynomially constrained problems employing polynomials of degree three or less. We then apply very recently established known methods from the theory of semi-definite relaxations to the formulated optimization problems. By this construction we arrive at a hierarchy of efficiently solvable approximations to the solution, approximating the exact solution as closely as desired, in a way that is asymptotically complete. For example, this results in a hierarchy of novel, efficiently decidable sufficient criteria for multi-particle entanglement, such that every entangled state will necessarily be detected in some step of the hierarchy. Finally, we present numerical examples to demonstrate the practical accessibility of this approach.

•Jul 19, 2004•0 citations

Quantifying the dimensionality of multiparticle entanglement via partition rank

Sophia Denker, Ismaël Septembre, Robin Krebs +1 more

The usefulness of entanglement as a resource in quantum technologies increases for larger systems, that is, if more particles or higher-dimensional quantum systems are considered. Yet, the interplay between dimensionality and multiparticle entanglement is not well understood. Only for two-particle systems an unambiguous and coherent notion of entanglement dimensionality, based on the Schmidt decomposition, is known. We introduce a concept to characterize the entanglement dimensionality of multiparticle states based on decompositions of pure states into superpositions of states without genuine multiparticle entanglement. We provide constructive methods to characterize the resulting partition rank for pure and mixed states. This allows the identification of novel maximally correlated states as well as a discrete classification of quantum states under stochastic local operations and classical communication. From a mathematical perspective, our approach can be formulated in terms of the slice rank and partition rank of tensors and our results allow to characterize these by connecting them to a generalized injective tensor norm.

quant-pharXiv:2608.23399•Aug 25, 2026•0 citations

Direct evaluation of pure graph state entanglement

M Hajdušek, Mio Murao

We address the question of quantifying entanglement in pure graph states. The evaluation of multipartite entanglement measures is extremely difficult for most pure quantum states. In this paper, we demonstrate how solving one problem in graph theory, namely the identification of a maximum independent set, allows us to evaluate three multipartite entanglement measures for pure graph states. We construct the minimal linear decomposition into product states for a large group of pure graph states, allowing us to evaluate the Schmidt measure. Furthermore, we show that the computation of distance-like measures such as relative entropy of entanglement and geometric measure becomes tractable for these states by the explicit construction of the closest separable and closest product states, respectively. We show how these separable states can be described using stabilizer formalism as well as projected entangled pairs-like construction. Finally, we discuss how introducing noise into the system can optimally destroy entanglement.

arXiv:1207.5877•New Journal of Physics•Jan 17, 2013•22 citations

Hierarchies of geometric entanglement

Massimo Blasone, Fabio Dell’Anno, Silvio De Siena +1 more

We introduce a class of generalized geometric measures of entanglement. For pure quantum states of $\mathit{N}$ elementary subsystems, they are defined as the distances from the sets of $\mathit{K}$-separable states $(K=2,\dots{},N)$. The entire set of generalized geometric measures provides a quantification and hierarchical ordering of the different bipartite and multipartite components of the global geometric entanglement, and allows discrimination among the different contributions. The extended measures are applied to the study of entanglement in different classes of $\mathit{N}$-qubit pure states. These classes include $\mathit{W}$ and Greenberger-Horne-Zeilinger (GHZ) states, and their symmetric superpositions; symmetric multimagnon states; cluster states; and, finally, asymmetric generalized $\mathit{W}$-like superposition states. We discuss in detail a general method for the explicit evaluation of the multipartite components of geometric entanglement, and we show that the entire set of geometric measures establishes an ordering among the different types of bipartite and multipartite entanglement. In particular, it determines a consistent hierarchy between GHZ and $\mathit{W}$ states, clarifying the original result of Wei and Goldbart that $\mathit{W}$ states possess a larger global entanglement than GHZ states. Furthermore, we show that all multipartite components of geometric entanglement in symmetric states obey a property of self-similarity and scale invariance with the total number of qubits and the number of qubits per party.

arXiv:0712.4085•Physical Review A•Jun 3, 2008•113 citations

Quantifying entanglement from the geometric perspective

Lisa T. Weinbrenner, Otfried Gühne

Abstract Quantum entanglement between several particles is essential for applications like quantum metrology or quantum cryptography, but it is also central for foundational phenomena like quantum non-locality. This leads to the problem of quantifying the amount of entanglement in a quantum state. We present a review on the geometric measure of entanglement, being a quantifier based on the distance of a state to the nearest separable state. We explain basic properties, existing methods to compute it, its operational interpretations, as well as scaling and complexity issues. We point out intimate relations to fundamental problems in mathematics concerning eigenvalues and norms of tensors. Consequently, the geometric measure of entanglement provides a playground where physical intuition and mathematical rigor benefit from each other.

arXiv:2505.01394•Europhysics Letters (EPL)•Aug 27, 2025•11 citations
In quantum physics, multiparticle systems are described by quantum states acting on tensor products of Hilbert spaces. This product structure leads to the distinction between product states and entangled states; moreover, one can quantify entanglement by considering the distance of a quantum state to the set of product states. The underlying optimization problem occurs frequently in physics and beyond, for instance in the computation of the injective tensor norm in multilinear algebra. Here, we introduce a method to determine the maximal overlap of a pure multiparticle quantum state with product states based on considering several copies of the pure state. This leads to three types of hierarchical approximations to the problem, all of which we prove to converge to the actual value. Besides allowing for the computation of the geometric measure of entanglement, our results can be used to tackle optimizations over stochastic local transformations, to find entanglement witnesses for weakly entangled bipartite states, and to design strong separability tests for mixed multiparticle states. Finally, our approach sheds light on the complexity of separability tests.
We investigate several problems in entanglement theory from the perspective of convex optimization. This list of problems comprises (A) the decision whether a state is multiparty entangled, (B) the minimization of expectation values of entanglement witnesses with respect to pure product states, (C) the closely related evaluation of the geometric measure of entanglement to quantify pure multiparty entanglement, (D) the test whether states are multiparty entangled on the basis of witnesses based on second moments and on the basis of linear entropic criteria, and (E) the evaluation of instances of maximal output purities of quantum channels. We show that these problems can be formulated as certain optimization problems: as polynomially constrained problems employing polynomials of degree 3 or less. We then apply very recently established known methods from the theory of semidefinite relaxations to the formulated optimization problems. By this construction we arrive at a hierarchy of efficiently solvable approximations to the solution, approximating the exact solution as closely as desired, in a way that is asymptotically complete. For example, this results in a hierarchy of efficiently decidable sufficient criteria for multiparticle entanglement, such that every entangled state will necessarily be detected in some step of the hierarchy. Finally, we present numerical examples to demonstrate the practical accessibility of this approach.
We investigate several problems in entanglement theory from the perspective of convex optimization. This list of problems comprises (A) the decision whether a state is multi-party entangled,(B) the minimization of expectation values of entanglement witnesses with respect to pure product states, (C) the closely related evaluation of the geometric measure of entanglement to quantify pure multi-party entanglement, (D) the test whether states are multi-party entangled on the basis of witnesses based on second moments and on the basis of linear entropic criteria, and (E) the evaluation of instances of maximal output purities of quantum channels. We show that these problems can be formulated as certain optimization problems: as polynomially constrained problems employing polynomials of degree three or less. We then apply very recently established known methods from the theory of semi-definite relaxations to the formulated optimization problems. By this construction we arrive at a hierarchy of efficiently solvable approximations to the solution, approximating the exact solution as closely as desired, in a way that is asymptotically complete. For example, this results in a hierarchy of novel, efficiently decidable sufficient criteria for multi-particle entanglement, such that every entangled state will necessarily be detected in some step of the hierarchy. Finally, we present numerical examples to demonstrate the practical accessibility of this approach.
The usefulness of entanglement as a resource in quantum technologies increases for larger systems, that is, if more particles or higher-dimensional quantum systems are considered. Yet, the interplay between dimensionality and multiparticle entanglement is not well understood. Only for two-particle systems an unambiguous and coherent notion of entanglement dimensionality, based on the Schmidt decomposition, is known. We introduce a concept to characterize the entanglement dimensionality of multiparticle states based on decompositions of pure states into superpositions of states without genuine multiparticle entanglement. We provide constructive methods to characterize the resulting partition rank for pure and mixed states. This allows the identification of novel maximally correlated states as well as a discrete classification of quantum states under stochastic local operations and classical communication. From a mathematical perspective, our approach can be formulated in terms of the slice rank and partition rank of tensors and our results allow to characterize these by connecting them to a generalized injective tensor norm.
We address the question of quantifying entanglement in pure graph states. The evaluation of multipartite entanglement measures is extremely difficult for most pure quantum states. In this paper, we demonstrate how solving one problem in graph theory, namely the identification of a maximum independent set, allows us to evaluate three multipartite entanglement measures for pure graph states. We construct the minimal linear decomposition into product states for a large group of pure graph states, allowing us to evaluate the Schmidt measure. Furthermore, we show that the computation of distance-like measures such as relative entropy of entanglement and geometric measure becomes tractable for these states by the explicit construction of the closest separable and closest product states, respectively. We show how these separable states can be described using stabilizer formalism as well as projected entangled pairs-like construction. Finally, we discuss how introducing noise into the system can optimally destroy entanglement.
We introduce a class of generalized geometric measures of entanglement. For pure quantum states of N\mathit{N}N elementary subsystems, they are defined as the distances from the sets of K\mathit{K}K-separable states (K=2,…,N)(K=2,\dots{},N)(K=2,…,N). The entire set of generalized geometric measures provides a quantification and hierarchical ordering of the different bipartite and multipartite components of the global geometric entanglement, and allows discrimination among the different contributions. The extended measures are applied to the study of entanglement in different classes of N\mathit{N}N-qubit pure states. These classes include W\mathit{W}W and Greenberger-Horne-Zeilinger (GHZ) states, and their symmetric superpositions; symmetric multimagnon states; cluster states; and, finally, asymmetric generalized W\mathit{W}W-like superposition states. We discuss in detail a general method for the explicit evaluation of the multipartite components of geometric entanglement, and we show that the entire set of geometric measures establishes an ordering among the different types of bipartite and multipartite entanglement. In particular, it determines a consistent hierarchy between GHZ and W\mathit{W}W states, clarifying the original result of Wei and Goldbart that W\mathit{W}W states possess a larger global entanglement than GHZ states. Furthermore, we show that all multipartite components of geometric entanglement in symmetric states obey a property of self-similarity and scale invariance with the total number of qubits and the number of qubits per party.
Abstract Quantum entanglement between several particles is essential for applications like quantum metrology or quantum cryptography, but it is also central for foundational phenomena like quantum non-locality. This leads to the problem of quantifying the amount of entanglement in a quantum state. We present a review on the geometric measure of entanglement, being a quantifier based on the distance of a state to the nearest separable state. We explain basic properties, existing methods to compute it, its operational interpretations, as well as scaling and complexity issues. We point out intimate relations to fundamental problems in mathematics concerning eigenvalues and norms of tensors. Consequently, the geometric measure of entanglement provides a playground where physical intuition and mathematical rigor benefit from each other.