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 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.
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 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.
We introduce a class of entangled subspaces: completely entangled subspaces of entanglement depth k (k-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-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 non-trivial bound on the cardinality of a UPB whose orthocomplement is a k-CES. Further, we discuss the existence of such UPBs for qubit systems.
While we possess a basic understanding of bipartite entangled systems, multipartite entanglement
remains mostly unexplored. Specifically, it is quite unclear how several concepts
developed for the bipartite case can be generalized in a meaningful way to study multipartite
scenarios. At the heart of this research on multiparty quantum states lies the problem
of testing the entanglement present in a given state. It has been proved, that in the most
general scenario, the question of determining the entanglement or separability of a state is
NP-hard.
From this perspective, it is desirable to have a construction of states for which
some prior knowledge about entanglement properties already exist. One particular approach
to this problem relies on the construction of Completely Entangled Subspaces
(CESes), i.e., subspaces void of product states. It follows that states in such subspaces
are necessarily entangled and form a convex set. This means we possess prior knowledge
of entanglement of all states in that subspace. In our study of multiparty systems, we have
constructed a specific subclass of the CESes such that all the states residing in the newly
constructed subspace is not only entangled but also Genuinely Entangled. A given state
is Genuinely Entangled if it is not just entangled for any pair among the multiparty but is
entangled with all the parties present and at the same time.
The notion of a CES is intimately connected with the idea of Unextendible Product
Bases (UPBs). UPBs are sets of twisted orthogonal product states/vectors spanning a
proper subset of a given Hilbert space. They have the property that no other product vector
exists in the ortho-complement of their span. While UPBs have been relatively well
studied for bipartite systems, no known multipartite orthogonal UPBs give rise to Genuinely
Entangled Subspace (GES). In our study, we provide schemes for the construction
of GES for a tripartite scenario. The construction proposed is linked to a Symmetric Block
structure such that it can be extended to any arbitrary dimension.One of the primary motivations for construction of UPBs is to create entangled
states which remain Positive under Partial Transposition (PPT). These classes of Entangled
States are known to be un-distillable and hence called Bound Entangled, i.e., states
in which the resource of Entanglement is not free to be used. These Bound Entangled states are essential to our understanding the basics of Entanglement Theory such as distillability,
quantification of entanglement, and the relationship between nonlocality and
entanglement (apart from their applications in other quantum information tasks). The
construction itself guarantees the PPTness of the state residing in the complementary subspace
i.e. formed by the equal mixture of the basis spanning the complementary space.
In our study, we propose a symmetric and an asymmetric construction of the Biseperable
and Genuinely Entangled states. Via the symmetric construction, we have derived two
subspaces, an eight-dimensional CES and a five-dimensional GES within the CES mentioned
above. The state formed by the equal mixtures of the CES is a Genuinely Bound
Entangled PPT state i.e., it entangled as well as PPT in each cut. To the best of author’s
knowledge, the proposed state is the only know Genuinely Entangled PPT state derived
from a UPB construction.
Additionally, the state lying in the ortho-complement of UPB (i.e., states formed
by an equal mixture of the basis of CES) is known to be a PPT Bound Entangled state.
However, unlike in case of UPBs, the state in the ortho-complement of Unextendible
Biseparable Product basis (i.e. states formed by an equal mixture of the basis of GES)
is found to be NPT states across all bipartitions. This is striking and prompts us to believe
that the state in the ortho-complement of CES is the only examples of bound entangled
state and distinct from other states in the space. We further expect that the state we obtain
must exhibit some distinctive features. We verify that this state is one copy undistillable.
However, the n-copy undistillablity needs to be probed further, and no conclusive
statement regarding the same can be made with our current analysis. The existence of
NPT-bound entangled state would prove that the distillable entanglement is nonadditive
and not convex.
The constructed subspace of Genuinely Entangled States in-turn reveals some
peculiar features. As mentioned above, unlike the Bennett et al., 1999 case, the state in the
ortho-complement is an NPT state across all bipartition. Furthermore, it was numerically
verified by taking one hundred thousand random probability distributions that the entire
five-dimensional genuine subspace obtained happens to be NPT. This leads us to conjecture
that the subspace obtained is a Genuinly Entangled NPT subspace. To the best of
the author’s knowledge, no known genuine NPT subspace exists for the multipartite scenario.
The exists only one other NPT subspace for Biseparable States and was suggested
by Johnston, 2013. Here, the construction is not related to UPBs. We further argue that
if our conjecture on the NPTness of the entire subspace is correct, any four-dimensional
subspace of the constructed tripartite NPT GES is also distillable. This would then be the
only known distillable subspace in a multipartite scenario. We believe that our study brings us closer to a systematic analysis of multipartite
entanglement and provides us with tools to probe further into the current mess of an
entangled (read communicating) world of multiple actors.