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

Simple sufficient condition for subspace entanglement

Maciej Demianowicz, Grzegorz Rajchel-Mieldzioć, Remigiusz Augusiak

Published Jul 15, 2021• 0 citations
OpenAlex

Abstract

We introduce a simple sufficient criterion allowing to tell whether a subspace of a bipartite or multipartite Hilbert space is entangled. The main ingredient of our criterion is a bound on the minimal entanglement of a subspace in terms of entanglement of vectors spanning that subspace expressed for geometrical measures of entanglement. The criterion is applicable to both completely and genuinely entangled subspaces. We explore its applicability in several important scenarios. Further, an entanglement criterion for mixed states following directly from the condition is stated. As an auxiliary result we provide a formula for the generalized geometric measure of entanglement of the $d$--level Dicke states.

Related papers

Simple sufficient condition for subspace to be completely or genuinely entangled

Maciej Demianowicz, Grzegorz Rajchel-Mieldzioć, Remigiusz Augusiak

Abstract We introduce a simple sufficient criterion, which allows one to tell whether a subspace of a bipartite or multipartite Hilbert space is entangled. The main ingredient of our criterion is a bound on the minimal entanglement of a subspace in terms of entanglement of vectors spanning that subspace expressed for geometrical measures of entanglement. The criterion is applicable to both completely and genuinely entangled subspaces. We explore its usefulness in several important scenarios. Further, an entanglement criterion for mixed states following directly from the condition is stated. As an auxiliary result we provide a formula for the generalized geometric measure of entanglement of the d -level Dicke states.

arXiv:2107.07530•New Journal of Physics•Sep 27, 2021•10 citations

Quantifying subspace entanglement with geometric measures

Xuanran Zhu, Chao Zhang, Bei Zeng

Determining whether a subspace spanned by certain quantum states is entangled and its entanglement dimensionality remains a fundamental challenge in quantum information science. This paper introduces a geometric measure of $r$-bounded rank, ${E}_{r}(\mathcal{S})$, for a given subspace $\mathcal{S}$. Derived from the established geometric measure of entanglement, this measure is specifically designed to assess the entanglement within $\mathcal{S}$. It not only serves as a tool for determining the entanglement dimensionality but also illuminates the subspace's capacity to preserve such entanglement. By employing developed nonconvex optimization techniques utilized in machine learning area, we can accurately calculate ${E}_{r}(\mathcal{S})$ within the manifold optimization framework. Our approach demonstrates notable advantages over existing hierarchical methods, PPT relaxation techniques, and the seesaw strategy, particularly by combining computational efficiency with broad applicability. More importantly, it paves the way for high-dimensional entanglement certification, which is crucial for numerous quantum information tasks. We showcase its effectiveness in validating high-dimensional entangled subspaces in bipartite systems, determining the border rank of multipartite pure states, and identifying genuinely or completely entangled subspaces.

arXiv:2311.10353•Physical Review A•Jul 22, 2024•4 citations

A Characterization For Entangled Vectors

Stanley Gudder

This article presents a simple characterization for entangled vectors in a finite dimensional Hilbert space $H$. The characterization is in terms of the coefficients of an expansion of the vector relative to an orthonormal basis for $H$. This simple necessary and sufficient condition contains a restriction and we also present a more complicated condition that is completely general. Although these characterizations apply to bipartite systems, we show that generalizations to multipartite systems are also valid.

arXiv:1902.08853•Feb 23, 2019•2 citations

Constructive entanglement test from triangle inequality

Łukasz Rudnicki, Zbigniew Puchała, Paweł Horodecki +1 more

We derive a simple lower bound on the geometric measure of entanglement for mixed quantum states in the case of a general multipartite system. The main ingredient of the presented derivation is the triangle inequality applied to the root infidelity distance in the space of density matrices. The obtained bound leads to entanglement criteria with a straightforward interpretation. The proposed criteria provide an experimentally accessible, powerful entanglement test. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to '50 years of Bell's theorem'.

arXiv:1211.2306•Journal of Physics A Mathematical and Theoretical•Oct 9, 2014•9 citations

Entanglement of genuinely entangled subspaces and states: Exact, approximate, and numerical results

Maciej Demianowicz, Remigiusz Augusiak

Genuinely entangled subspaces (GESs) are those subspaces of multipartite Hilbert spaces that consist only of genuinely multiparty entangled pure states. They are natural generalizations of the well-known notion of completely entangled subspaces, which by definition are void of fully product vectors. Entangled subspaces are an important tool of quantum information theory as they directly lead to constructions of entangled states, since any state supported on such a subspace is automatically entangled. Moreover, they have also proven useful in the area of quantum error correction. In our recent contribution [M. Demianowicz and R. Augusiak, Phys. Rev. A 98, 012313 (2018)], we have studied the notion of a GES qualitatively in relation to so-called nonorthogonal unextendible product bases and provided a few constructions of such subspaces. The main aim of the present work is to perform a quantitative study of the entanglement properties of GESs. First, we show how one can attempt to compute analytically the subspace entanglement, defined as the entanglement of the least-entangled vector from the subspace, of a GES and illustrate our method by applying it to a new class of GESs. Second, we show that certain semidefinite programming relaxations can be exploited to estimate the entanglement of a GES and apply this observation to a few classes of GESs revealing that in many cases the method provides the exact results. Finally, we study the entanglement of certain states supported on GESs, which is compared to the obtained values of the entanglement of the corresponding subspaces, and find the white-noise robustness of several GESs. In our study we use the (generalized) geometric measure as the quantifier of entanglement.

arXiv:1907.12463•Physical Review A•Dec 16, 2019•18 citations

Construction of genuinely entangled subspaces and the associated bounds on entanglement measures for mixed states

K. V. Antipin

Abstract Genuine entanglement is the strongest form of multipartite entanglement. Genuinely entangled pure states contain entanglement in every bipartition and as such can be regarded as a valuable resource in the protocols of quantum information processing. A recent direction of research is the construction of genuinely entangled subspaces (GESs)—the class of subspaces consisting entirely of genuinely entangled pure states. In this paper we present methods of construction of such subspaces including those of maximal possible dimension. The approach is based on the composition of bipartite entangled subspaces and quantum channels of certain types. The examples include maximal subspaces for systems of three qubits, four qubits, three qutrits. We also provide lower bounds on two entanglement measures for mixed states, the concurrence and the convex-roof extended negativity, which are directly connected with the projection on GESs.

arXiv:2104.09664•Journal of Physics A Mathematical and Theoretical•Nov 9, 2021•10 citations
We introduce a simple sufficient criterion allowing to tell whether a subspace of a bipartite or multipartite Hilbert space is entangled. The main ingredient of our criterion is a bound on the minimal entanglement of a subspace in terms of entanglement of vectors spanning that subspace expressed for geometrical measures of entanglement. The criterion is applicable to both completely and genuinely entangled subspaces. We explore its applicability in several important scenarios. Further, an entanglement criterion for mixed states following directly from the condition is stated. As an auxiliary result we provide a formula for the generalized geometric measure of entanglement of the ddd--level Dicke states.
Abstract We introduce a simple sufficient criterion, which allows one to tell whether a subspace of a bipartite or multipartite Hilbert space is entangled. The main ingredient of our criterion is a bound on the minimal entanglement of a subspace in terms of entanglement of vectors spanning that subspace expressed for geometrical measures of entanglement. The criterion is applicable to both completely and genuinely entangled subspaces. We explore its usefulness in several important scenarios. Further, an entanglement criterion for mixed states following directly from the condition is stated. As an auxiliary result we provide a formula for the generalized geometric measure of entanglement of the d -level Dicke states.
Determining whether a subspace spanned by certain quantum states is entangled and its entanglement dimensionality remains a fundamental challenge in quantum information science. This paper introduces a geometric measure of rrr-bounded rank, Er(S){E}_{r}(\mathcal{S})Er​(S), for a given subspace S\mathcal{S}S. Derived from the established geometric measure of entanglement, this measure is specifically designed to assess the entanglement within S\mathcal{S}S. It not only serves as a tool for determining the entanglement dimensionality but also illuminates the subspace's capacity to preserve such entanglement. By employing developed nonconvex optimization techniques utilized in machine learning area, we can accurately calculate Er(S){E}_{r}(\mathcal{S})Er​(S) within the manifold optimization framework. Our approach demonstrates notable advantages over existing hierarchical methods, PPT relaxation techniques, and the seesaw strategy, particularly by combining computational efficiency with broad applicability. More importantly, it paves the way for high-dimensional entanglement certification, which is crucial for numerous quantum information tasks. We showcase its effectiveness in validating high-dimensional entangled subspaces in bipartite systems, determining the border rank of multipartite pure states, and identifying genuinely or completely entangled subspaces.
This article presents a simple characterization for entangled vectors in a finite dimensional Hilbert space HHH. The characterization is in terms of the coefficients of an expansion of the vector relative to an orthonormal basis for HHH. This simple necessary and sufficient condition contains a restriction and we also present a more complicated condition that is completely general. Although these characterizations apply to bipartite systems, we show that generalizations to multipartite systems are also valid.
We derive a simple lower bound on the geometric measure of entanglement for mixed quantum states in the case of a general multipartite system. The main ingredient of the presented derivation is the triangle inequality applied to the root infidelity distance in the space of density matrices. The obtained bound leads to entanglement criteria with a straightforward interpretation. The proposed criteria provide an experimentally accessible, powerful entanglement test. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to '50 years of Bell's theorem'.
Genuinely entangled subspaces (GESs) are those subspaces of multipartite Hilbert spaces that consist only of genuinely multiparty entangled pure states. They are natural generalizations of the well-known notion of completely entangled subspaces, which by definition are void of fully product vectors. Entangled subspaces are an important tool of quantum information theory as they directly lead to constructions of entangled states, since any state supported on such a subspace is automatically entangled. Moreover, they have also proven useful in the area of quantum error correction. In our recent contribution [M. Demianowicz and R. Augusiak, Phys. Rev. A 98, 012313 (2018)], we have studied the notion of a GES qualitatively in relation to so-called nonorthogonal unextendible product bases and provided a few constructions of such subspaces. The main aim of the present work is to perform a quantitative study of the entanglement properties of GESs. First, we show how one can attempt to compute analytically the subspace entanglement, defined as the entanglement of the least-entangled vector from the subspace, of a GES and illustrate our method by applying it to a new class of GESs. Second, we show that certain semidefinite programming relaxations can be exploited to estimate the entanglement of a GES and apply this observation to a few classes of GESs revealing that in many cases the method provides the exact results. Finally, we study the entanglement of certain states supported on GESs, which is compared to the obtained values of the entanglement of the corresponding subspaces, and find the white-noise robustness of several GESs. In our study we use the (generalized) geometric measure as the quantifier of entanglement.
Abstract Genuine entanglement is the strongest form of multipartite entanglement. Genuinely entangled pure states contain entanglement in every bipartition and as such can be regarded as a valuable resource in the protocols of quantum information processing. A recent direction of research is the construction of genuinely entangled subspaces (GESs)—the class of subspaces consisting entirely of genuinely entangled pure states. In this paper we present methods of construction of such subspaces including those of maximal possible dimension. The approach is based on the composition of bipartite entangled subspaces and quantum channels of certain types. The examples include maximal subspaces for systems of three qubits, four qubits, three qutrits. We also provide lower bounds on two entanglement measures for mixed states, the concurrence and the convex-roof extended negativity, which are directly connected with the projection on GESs.