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

Mathematics

Extensions of Completely Entangled Subspaces in C2⊗CN

Yunlang Li, Ziwei Chen

Published Nov 5, 2026• 0 citations
Publisher

Abstract

In the Kronecker product C2⊗CN, completely entangled subspaces (CESs) are subspaces containing no nonzero product vectors. In this paper, we study the extension of a given M-dimensional CES to a higher-dimensional CES. We first prove an existence result using the geometry of the Segre variety and an incidence-variety dimension-counting argument. In particular, an M-dimensional CES can be extended to an (M+1)-dimensional CES whenever M<N−1. We then introduce a constructive method based on matrix representations and invertible local transformations. We show that if the corresponding matrix Ψ satisfies rank(Ψ)≤N−2, an explicit extension can be constructed. In particular, the condition 2M≤N−2 is sufficient for this construction. Finally, we give a concrete example in C2⊗C8, where a three-dimensional CES is extended to a four-dimensional CES.

DOI
10.3390/math14214050

Related papers

Completely entangled subspaces from Moore-like matrices

Mohamed Nawareg

Abstract Construction of completely entangled subspaces (CES) has gained a considerable attention, recently. These subspaces which contain only entangled states are of great importance for entanglement theory and also provide a valuable resource for quantum information processing tasks. The results of [Proc. Math. Sci., 114, 365 (2004)] and in particular using the properties of certain matrix, namely Vandermonde matrix, to build CES motivated us to search for new distinct CES's. Mainly, the stimulating question of whether there are other matrices that can lead to building CESs emerged. In the current paper we give an affirmative answer to this question by providing a method for constructing CESs using the properties of Moore-like matrices. In addition, we give few examples for the proposed subspaces in case of 3-qubit and 2-qutrit systems. Then a comparison between the resulted subspaces and those constructed from Vandermonde matrix has been given for the systems understudy. The results shows that the two methods give identically the same subspaces in case of multiqubit systems. However, for multipartite systems with local dimensions d ≥ 3 the two methods gave unequivalent CES subspaces. Interestingly, the properties of the proposed Moore-like matrices provided a far rich way for constructing CES subspaces. It leads to generating as many distinct CES's as we want for each multipartite quantum system. This is in contrary to Vandermonde-based method which can give only one CES per system. In addition, the basis for each of the given examples has been obtained in a simple form. Moreover, we evaluated the entanglement of uniformly mixed states over the obtained subspaces in terms of concurrence and geometric measure of entanglement. Since different parameters of a Moore-like matrix lead to distinct CESs for the same system, the realized results can open the door for more investigations and/or applications.

Physica Scripta•Jul 31, 2023•2 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

Entangled Subspaces through Algebraic Geometry

Masoud Gharahi, Stefano Mancini

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.

arXiv:2504.11525•Quantum•Dec 15, 2025•4 citations

Quantum information meets algebraic geometry: A python framework for CES and UPBs

Rathika V, Rammohan A

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

•Mar 23, 2026•0 citations

Quantum information meets algebraic geometry: A python framework for CES and UPBs

Rathika V, A Rammohan

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

EPJ Web of Conferences•Jan 1, 2026•0 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
In the Kronecker product C2⊗CN, completely entangled subspaces (CESs) are subspaces containing no nonzero product vectors. In this paper, we study the extension of a given M-dimensional CES to a higher-dimensional CES. We first prove an existence result using the geometry of the Segre variety and an incidence-variety dimension-counting argument. In particular, an M-dimensional CES can be extended to an (M+1)-dimensional CES whenever M<N−1. We then introduce a constructive method based on matrix representations and invertible local transformations. We show that if the corresponding matrix Ψ satisfies rank(Ψ)≤N−2, an explicit extension can be constructed. In particular, the condition 2M≤N−2 is sufficient for this construction. Finally, we give a concrete example in C2⊗C8, where a three-dimensional CES is extended to a four-dimensional CES.
Abstract Construction of completely entangled subspaces (CES) has gained a considerable attention, recently. These subspaces which contain only entangled states are of great importance for entanglement theory and also provide a valuable resource for quantum information processing tasks. The results of [Proc. Math. Sci., 114, 365 (2004)] and in particular using the properties of certain matrix, namely Vandermonde matrix, to build CES motivated us to search for new distinct CES's. Mainly, the stimulating question of whether there are other matrices that can lead to building CESs emerged. In the current paper we give an affirmative answer to this question by providing a method for constructing CESs using the properties of Moore-like matrices. In addition, we give few examples for the proposed subspaces in case of 3-qubit and 2-qutrit systems. Then a comparison between the resulted subspaces and those constructed from Vandermonde matrix has been given for the systems understudy. The results shows that the two methods give identically the same subspaces in case of multiqubit systems. However, for multipartite systems with local dimensions d ≥ 3 the two methods gave unequivalent CES subspaces. Interestingly, the properties of the proposed Moore-like matrices provided a far rich way for constructing CES subspaces. It leads to generating as many distinct CES's as we want for each multipartite quantum system. This is in contrary to Vandermonde-based method which can give only one CES per system. In addition, the basis for each of the given examples has been obtained in a simple form. Moreover, we evaluated the entanglement of uniformly mixed states over the obtained subspaces in terms of concurrence and geometric measure of entanglement. Since different parameters of a Moore-like matrix lead to distinct CESs for the same system, the realized results can open the door for more investigations and/or applications.
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.
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.
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
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.