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

Complete hierarchy of linear systems for certifying quantum entanglement of subspaces

Nathaniel Johnston, Benjamin Lovitz, Aravindan Vijayaraghavan

Published Dec 29, 2022• 9 citations
arXivHTMLPDF

Abstract

We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms known methods already at the first level, and it is complete in the sense that every entangled subspace is shown to be so at some finite level of the hierarchy. It straightforwardly generalizes to the case of higher Schmidt rank, as well as the multipartite cases of completely and genuinely entangled subspaces. These hierarchies work extremely well in practice even in very large quantum systems, as they can be implemented via elementary linear algebra techniques rather than the semidefinite programming techniques that are required by previously known hierarchies.

DOI
10.1103/physreva.106.062443

Related papers

On the dimension of subspaces with bounded Schmidt rank

Toby S. Cubitt, Ashley Montanaro, Andreas Winter

We consider the question of how large a subspace of a given bipartite quantum system can be when the subspace contains only highly entangled states. This is motivated in part by results of Hayden et al. [e-print arXiv:quant-ph∕0407049; Commun. Math. Phys., 265, 95 (2006)], which show that in large d×d-dimensional systems there exist random subspaces of dimension almost d2, all of whose states have entropy of entanglement at least logd−O(1). It is also a generalization of results on the dimension of completely entangled subspaces, which have connections with the construction of unextendible product bases. Here we take as entanglement measure the Schmidt rank, and determine, for every pair of local dimensions dA and dB, and every r, the largest dimension of a subspace consisting only of entangled states of Schmidt rank r or larger. This exact answer is a significant improvement on the best bounds that can be obtained using the random subspace techniques in Hayden et al. We also determine the converse: the largest dimension of a subspace with an upper bound on the Schmidt rank. Finally, we discuss the question of subspaces containing only states with Schmidt equal to r.

arXiv:0706.0705•Journal of Mathematical Physics•Feb 1, 2008•94 citations

Generic local distinguishability and completely entangled subspaces

Jonathan Walgate, A J Scott

A subspace of a multipartite Hilbert space is completely entangled if it contains no product states. Such subspaces can be large with a known maximum size, S, approaching the full dimension of the system, D. We show that almost all subspaces with dimension less than or equal to S are completely entangled, and then use this fact to prove that n random pure quantum states are unambiguously locally distinguishable if and only if n does not exceed D-S. This condition holds for almost all sets of states of all multipartite systems, and reveals something surprising. The criterion is identical for separable and for nonseparable states: entanglement makes no difference.

arXiv:0709.4238•Journal of Physics A Mathematical and Theoretical•Aug 13, 2008•64 citations

Quantum-Inspired Hierarchy for Rank-Constrained Optimization

Xiao‐Dong Yu, Timo Simnacher, H. Chau Nguyen +1 more

Many problems in information theory can be reduced to optimizations over matrices, where the rank of the matrices is constrained.We establish a link between rank-constrained optimization and the theory of quantum entanglement.More precisely, we prove that a large class of rank-constrained semidefinite programs can be written as a convex optimization over separable quantum states and, consequently, we construct a complete hierarchy of semidefinite programs for solving the original problem.This hierarchy not only provides a sequence of certified bounds for the rank-constrained optimization problem, but also gives pretty good and often exact values in practice when the lowest level of the hierarchy is considered.We demonstrate that our approach can be used for relevant problems in quantum information processing, such as the optimization over pure states, the characterization of mixed unitary channels and faithful entanglement, and quantum contextuality, as well as in classical information theory including the maximum cut problem, pseudo-Boolean optimization, and the orthonormal representation of graphs.Finally, we show that our ideas can be extended to rank-constrained quadratic and higher-order programming.

arXiv:2012.00554•PRX Quantum•Mar 11, 2022•24 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

From unextendible product bases to genuinely entangled subspaces

Maciej Demianowicz, Remigiusz Augusiak

Unextendible product bases (UPBs) are interesting mathematical objects arising in composite Hilbert spaces that have found various applications in quantum information theory, for instance in a construction of bound entangled states or Bell inequalities without quantum violation. They are closely related to another important notion, completely entangled subspaces (CESs), which are those that do not contain any fully separable pure state. Among CESs one finds a class of subspaces in which all vectors are not only entangled but genuinely entangled. Here we explore the connection between UPBs and such genuinely entangled subspaces (GESs) and provide classes of nonorthogonal UPBs that lead to GESs for any number of parties and local dimensions. We then show how these subspaces can be immediately utilized for a simple general construction of genuinely entangled states in any such multipartite scenario.

arXiv:1712.08916•Physical Review A•Jul 13, 2018•47 citations

Completely entangled subspaces of entanglement depth k

Maciej Demianowicz, Kajetan Vogtt, Remigiusz Augusiak

We introduce a class of entangled subspaces: completely entangled subspaces of entanglement depth $k$ $(k\text{\ensuremath{-}}\text{CESs})$. These are subspaces of multipartite Hilbert spaces containing only pure states with an entanglement depth of at least $k$. We present an efficient construction of $k\text{\ensuremath{-}}\text{CESs}$ of any achievable dimensionality in any multipartite scenario. Further, we discuss the relation between these subspaces and unextendible product bases (UPBs). In particular, we establish that there is a nontrivial bound on the cardinality of a UPB whose orthocomplement is a $k\text{\ensuremath{-}}\text{CES}$. Further, we discuss the existence of such UPBs for qubit systems.

arXiv:2312.08474•Physical Review A•Jul 1, 2024•4 citations
We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms known methods already at the first level, and it is complete in the sense that every entangled subspace is shown to be so at some finite level of the hierarchy. It straightforwardly generalizes to the case of higher Schmidt rank, as well as the multipartite cases of completely and genuinely entangled subspaces. These hierarchies work extremely well in practice even in very large quantum systems, as they can be implemented via elementary linear algebra techniques rather than the semidefinite programming techniques that are required by previously known hierarchies.
We consider the question of how large a subspace of a given bipartite quantum system can be when the subspace contains only highly entangled states. This is motivated in part by results of Hayden et al. [e-print arXiv:quant-ph∕0407049; Commun. Math. Phys., 265, 95 (2006)], which show that in large d×d-dimensional systems there exist random subspaces of dimension almost d2, all of whose states have entropy of entanglement at least logd−O(1). It is also a generalization of results on the dimension of completely entangled subspaces, which have connections with the construction of unextendible product bases. Here we take as entanglement measure the Schmidt rank, and determine, for every pair of local dimensions dA and dB, and every r, the largest dimension of a subspace consisting only of entangled states of Schmidt rank r or larger. This exact answer is a significant improvement on the best bounds that can be obtained using the random subspace techniques in Hayden et al. We also determine the converse: the largest dimension of a subspace with an upper bound on the Schmidt rank. Finally, we discuss the question of subspaces containing only states with Schmidt equal to r.
A subspace of a multipartite Hilbert space is completely entangled if it contains no product states. Such subspaces can be large with a known maximum size, S, approaching the full dimension of the system, D. We show that almost all subspaces with dimension less than or equal to S are completely entangled, and then use this fact to prove that n random pure quantum states are unambiguously locally distinguishable if and only if n does not exceed D-S. This condition holds for almost all sets of states of all multipartite systems, and reveals something surprising. The criterion is identical for separable and for nonseparable states: entanglement makes no difference.
Many problems in information theory can be reduced to optimizations over matrices, where the rank of the matrices is constrained.We establish a link between rank-constrained optimization and the theory of quantum entanglement.More precisely, we prove that a large class of rank-constrained semidefinite programs can be written as a convex optimization over separable quantum states and, consequently, we construct a complete hierarchy of semidefinite programs for solving the original problem.This hierarchy not only provides a sequence of certified bounds for the rank-constrained optimization problem, but also gives pretty good and often exact values in practice when the lowest level of the hierarchy is considered.We demonstrate that our approach can be used for relevant problems in quantum information processing, such as the optimization over pure states, the characterization of mixed unitary channels and faithful entanglement, and quantum contextuality, as well as in classical information theory including the maximum cut problem, pseudo-Boolean optimization, and the orthonormal representation of graphs.Finally, we show that our ideas can be extended to rank-constrained quadratic and higher-order programming.
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.
Unextendible product bases (UPBs) are interesting mathematical objects arising in composite Hilbert spaces that have found various applications in quantum information theory, for instance in a construction of bound entangled states or Bell inequalities without quantum violation. They are closely related to another important notion, completely entangled subspaces (CESs), which are those that do not contain any fully separable pure state. Among CESs one finds a class of subspaces in which all vectors are not only entangled but genuinely entangled. Here we explore the connection between UPBs and such genuinely entangled subspaces (GESs) and provide classes of nonorthogonal UPBs that lead to GESs for any number of parties and local dimensions. We then show how these subspaces can be immediately utilized for a simple general construction of genuinely entangled states in any such multipartite scenario.
We introduce a class of entangled subspaces: completely entangled subspaces of entanglement depth kkk $(k\text{\ensuremath{-}}\text{CESs})$. These are subspaces of multipartite Hilbert spaces containing only pure states with an entanglement depth of at least kkk. We present an efficient construction of $k\text{\ensuremath{-}}\text{CESs}$ of any achievable dimensionality in any multipartite scenario. Further, we discuss the relation between these subspaces and unextendible product bases (UPBs). In particular, we establish that there is a nontrivial bound on the cardinality of a UPB whose orthocomplement is a $k\text{\ensuremath{-}}\text{CES}$. Further, we discuss the existence of such UPBs for qubit systems.