The present paper introduces a Python-based framework customized for the structured exploration of subspaces in Cm ⊗ Cn that do not contain any product states-known as completely entangled subspaces (CES). The frame makes use of recent developments in quantum information and algebraic geometry to enable the construction, verification, and geometric characterization of CES, supporting both theoretical and numerical studies. By integrating algorithms for entanglement detection and geometric quantification, the tool enables exploration of maximal dimension CES and their relationships with unextendible product bases (UPBs). The approach utilizes totally non-singular matrices, such as Vandermonde matrices, to generate non-orthogonal product bases and solve homogeneous systems of linear equations for basis vector determination. The implementation supports efficient manipulation of quantum operators and their ranges, permit recognition of genuinely entangled multipartite subspaces derived from bipartite systems. The framework is designed for scalability to higher-dimensional and multipartite framework, providing a flexible platform for researchers investigating the geometry of entanglement and separability in quantum systems. Contributions include the incorporation of quantum support vector machines and classical deep neural networks for entanglement detection, the use of entanglement witnesses for verification, and advanced visualization tools for geometric properties. The framework draws on foundational results and recent advances in quantum information, offering a robust and accessible resource for both theoretical and practical research in quantum entanglement. This work advances the field by providing an expandable and adaptable tool for studying CES in Cm ⊗ Cn
The present paper introduces a Python-based framework customized for the structured exploration of subspaces in Cm ⊗ Cn that do not contain any product states-known as completely entangled subspaces (CES). The frame makes use of recent developments in quantum information and algebraic geometry to enable the construction, verification, and geometric characterization of CES, supporting both theoretical and numerical studies. By integrating algorithms for entanglement detection and geometric quantification, the tool enables exploration of maximal dimension CES and their relationships with unextendible product bases (UPBs). The approach utilizes totally non-singular matrices, such as Vandermonde matrices, to generate non-orthogonal product bases and solve homogeneous systems of linear equations for basis vector determination. The implementation supports efficient manipulation of quantum operators and their ranges, permit recognition of genuinely entangled multipartite subspaces derived from bipartite systems. The framework is designed for scalability to higher-dimensional and multipartite framework, providing a flexible platform for researchers investigating the geometry of entanglement and separability in quantum systems. Contributions include the incorporation of quantum support vector machines and classical deep neural networks for entanglement detection, the use of entanglement witnesses for verification, and advanced visualization tools for geometric properties. The framework draws on foundational results and recent advances in quantum information, offering a robust and accessible resource for both theoretical and practical research in quantum entanglement. This work advances the field by providing an expandable and adaptable tool for studying CES in Cm ⊗ Cn
The present paper introduces a Python-based framework customized for the structured exploration of subspaces in C m ⊗ C n that do not contain any product states-known as completely entangled subspaces (CES). The frame makes use of recent developments in quantum information and algebraic geometry to enable the construction, verification, and geometric characterization of CES, supporting both theoretical and numerical studies. By integrating algorithms for entanglement detection and geometric quantification, the tool enables exploration of maximal dimension CES and their relationships with unextendible product bases (UPBs). The approach utilizes totally non-singular matrices, such as Vandermonde matrices, to generate non-orthogonal product bases and solve homogeneous systems of linear equations for basis vector determination. The implementation supports efficient manipulation of quantum operators and their ranges, permit recognition of genuinely entangled multipartite subspaces derived from bipartite systems. The framework is designed for scalability to higher-dimensional and multipartite framework, providing a flexible platform for researchers investigating the geometry of entanglement and separability in quantum systems. Contributions include the incorporation of quantum support vector machines and classical deep neural networks for entanglement detection, the use of entanglement witnesses for verification, and advanced visualization tools for geometric properties. The framework draws on foundational results and recent advances in quantum information, offering a robust and accessible resource for both theoretical and practical research in quantum entanglement. This work advances the field by providing an expandable and adaptable tool for studying CES in C m ⊗ C n
We propose an algebraic geometry-inspired approach for constructing entangled subspaces within the Hilbert space of a multipartite quantum system. Specifically, our method employs a modified Veronese embedding, restricted to the conic, to define subspaces within the symmetric part of the Hilbert space. By utilizing this technique, we construct the minimal-dimensional, non-orthogonal yet Unextendible Product Basis (nUPB), enabling the decomposition of the multipartite Hilbert space into a two-dimensional subspace, complemented by a Genuinely Entangled Subspace (GES) and a maximal-dimensional Completely Entangled Subspace (CES). In multiqudit systems, we determine the maximum achievable dimension of a symmetric GES and demonstrate its realization through this construction. Furthermore, we systematically investigate the transition from the conventional Veronese embedding to the modified one by imposing various constraints on the affine coordinates, which, in turn, increases the CES dimension while reducing that of the GES.
Constructing optimal entanglement witnesses for arbitrary quantum systems remains a formidable challenge, hindered by the structural complexity of high-dimensional quantum state spaces. In this work, we overcome this barrier by introducing a unified framework for constructing geometrically optimal witnesses capable of identifying arbitrary entanglement structures. By leveraging the geometric properties of a target quantum state relative to a specific entanglement structure in Hilbert-Schmidt space, these witnesses are constructed in an efficient and effective manner. Among all nontrivial witnesses, they provide maximal distinguishability between the target state and the set of states without the desired entanglement structure. As a result, our approach enables the universal detection of bipartite, multipartite, and high-dimensional entanglement. To demonstrate its experimental feasibility, we apply the framework to a four-qubit nuclear spin quantum system. Compared to existing methods, our approach offers enhanced noise robustness, broader detection universality, and improved construction efficiency, providing a powerful and versatile tool for advancing the characterization and understanding of entanglement in quantum systems.
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.
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.
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.