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:2010.16293 · Linear Algebra and its Applications

Maximum dimension of subspaces with no product basis

Yuuya Yoshida

Published Mar 5, 2021• 1 citation
arXivHTMLPDF

Abstract

Let n≥2 and d1,…,dn≥2 be integers, and F be a field. A vector u∈Fd1⊗⋯⊗Fdn is called a product vector if u=u[1]⊗⋯⊗u[n] for some u[1]∈Fd1,…,u[n]∈Fdn. A basis composed of product vectors is called a product basis. In this paper, we show that the maximum dimension of subspaces of Fd1⊗⋯⊗Fdn with no product basis is equal to d1d2⋯dn−2 if either (i) n=2 or (ii) n≥3 and #F>max⁡{di:i≠n1,n2} for some n1 and n2. When F=C, this result is related to the maximum number of simultaneously distinguishable states in general probabilistic theories (GPTs).

DOI
10.1016/j.laa.2021.03.001

Related papers

A COMPLETELY ENTANGLED SUBSPACE OF MAXIMAL DIMENSION

B. V. Rajarama Bhat

Consider a tensor product [Formula: see text] of finite-dimensional Hilbert spaces with dimension [Formula: see text], 1 ≤ i ≤ k. Then the maximum dimension possible for a subspace of [Formula: see text] with no non-zero product vector is known to be d1 d2…dk - (d1 + d2 + … + dk + k - 1. We obtain an explicit example of a subspace of this kind. We determine the set of product vectors in its orthogonal complement and show that it has the minimum dimension possible for an unextendible product basis of not necessarily orthogonal product vectors.

arXiv:quant-ph/0409032•International Journal of Quantum Information•Apr 1, 2006•52 citations

Negative result about the construction of genuinely entangled subspaces from unextendible product bases

Maciej Demianowicz

Unextendible product bases (UPBs) provide a versatile tool with various applications across different areas of quantum information theory. Their comprehensive characterization is thus of great importance and has been a subject of vital interest for over two decades now. An open question asks about the existence of UPBs, which are genuinely unextendible, i.e., they are not extendible even with biproduct vectors. In other words, the problem is to verify whether there exist genuinely entangled subspaces (GESs), subspaces composed solely of genuinely multiparty entangled states, complementary to UPBs. We solve this problem in the negative for many sizes of UPBs in different multipartite scenarios. In particular, in the all-important case of equal local dimensions, we show that there are always forbidden cardinalities for such UPBs, including the minimal ones corresponding to GESs of the maximal dimensions.

arXiv:2202.08356•Physical Review A•Jul 29, 2022•6 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

Minimum Cardinalities of Multipartite Unextendible Product Bases

Chenhao Wang

In quantum information theory, the state space of a multipartite quantum system is modeled by a tensor product. In the tensor-product space $\C^{d_1}\otimes\cdots\otimes\C^{d_p}$, a nonzero vector is a \emph{product state} if it can be written as $\ket{\varphi_1}\otimes\cdots\otimes\ket{\varphi_p}$ with $\ket{\varphi_j}\in\C^{d_j}\setminus\{0\}$. An \emph{unextendible product basis} (UPB) is a finite family of pairwise orthogonal product states such that no nonzero product state is orthogonal to all of them. UPBs play a key role in investigating quantum entanglement and nonlocal phenomena. Finding a smallest UPB is a natural extremal problem: it asks how few pairwise orthogonal product states suffice to prevent any further product state from being added. The general minimum-size problem for UPBs has been studied for over two decades since the seminal work of Alon and Lovász. Let $f_m(d_1,\ldots,d_p)$ be the minimum cardinality of a UPB in the space, and let \(f_{LB}(d_1,\ldots,d_p)=1+\sum_{j=1}^{p}(d_j-1)\) be the natural lower bound. Alon and Lovász determined exactly when \(f_m\) attains the lower bound \(f_{LB}\), but the obstructed multipartite cases remained open in general. We prove a stabilization theorem: for every non-all-qubit system with $p\ge3$, whenever the natural lower bound $f_{LB}$ is unattainable, the true minimum is exactly $f_{LB}+1$. Precisely, if the number of even local dimensions $d_i$ is positive and even, and at least one local dimension is greater than two, then \(f_m(d_1,\ldots,d_p)=f_{LB}(d_1,\ldots,d_p)+1\). The proof is built on a unified graph-theoretic framework. Our result, together with earlier work, settles the minimum size problem for UPBs in all finite quantum systems.

quant-pharXiv:2609.05657•Sep 8, 2026•0 citations

The Indistinguishability of Quantum States is Independent of the Dimension of Quantum System

Hao Shu

The distinguishability of quantum states is important in quantum information theory and has been considered by authors. However, there were no general results considering whether a set of indistinguishable states become distinguishable by viewing them in a larger system without employing extra resources. In this paper, we consider this question for LOCC$_{1}$, PPT and SEP distinguishabilities of states. We use mathematical methods to show that if a set of states is indistinguishable in $\otimes _{k=1}^{K} C^{d _{k}}$, then it is indistinguishable even being viewed in $\otimes _{k=1}^{K} C^{d _{k}+h _{k}}$, where $K, d _{k}\geqslant2$, $h _{k}\geqslant0$ are integers. This shows that LOCC$_{1}$, PPT and SEP distinguishabilities of states are properties of states themselves and independent of the dimension of quantum system. With these results, we can give the maximal number of states which can be distinguished via LOCC$_{1}$ and construct a LOCC indistinguishable basis of product states in a general system. Note that our results are also suitable for unambiguous discriminations. Also, we give a conjecture for other distinguishabilities and a framework by defining the Local-global indistinguishable property. Instead of considering such problems for special sets or special systems, we consider the problems for general states in general systems, which have not been considered yet, for our knowledge.

•Oct 7, 2020•1 citation

Constructions of Unextendible Special Entangled Bases

Yanling Wang

Unextendible product basis (UPB), a set of incomplete orthonormal product states whose complementary space has no product state, is very useful for constructing bound entangled states. Naturally, instead of considering the set of product states, Bravyi and Smolin considered the set of maximally entangled states. They introduced the concept of unextendible maximally entangled basis (UMEB), a set of incomplete orthonormal maximally entangled states whose complementary space contains no maximally entangled state [Phys. Rev. A 84, 042,306 (2011)]. An entangled state whose nonzero Schmidt coefficients are all equal to 1/k is called a special entangled state of “type k”. In this paper, we introduce a concept named special unextendible entangled basis of “type k” which generalizes both UPB and UMEB. A special unextendible entangled basis of “type k” (SUEBk) is a set of incomplete orthonormal special entangled states of “type k” whose complementary space has no special entangled state of “type k”. We present an efficient method to construct sets of SUEBk. The main strategy here is to decompose the whole space into two subspaces such that the rank of each element in one subspace can be easily upper bounded by k while the other one can be generated by two kinds of the special entangled states of “type k”. This method is very effective when k = pm ≥ 3 where p is a prime number. For these cases, we can obtain sets of SUEBk with continuous integer cardinality when the local dimensions are large.

Frontiers in Physics•May 27, 2022•0 citations
Let n≥2 and d1,…,dn≥2 be integers, and F be a field. A vector u∈Fd1⊗⋯⊗Fdn is called a product vector if u=u[1]⊗⋯⊗u[n] for some u[1]∈Fd1,…,u[n]∈Fdn. A basis composed of product vectors is called a product basis. In this paper, we show that the maximum dimension of subspaces of Fd1⊗⋯⊗Fdn with no product basis is equal to d1d2⋯dn−2 if either (i) n=2 or (ii) n≥3 and #F>max⁡{di:i≠n1,n2} for some n1 and n2. When F=C, this result is related to the maximum number of simultaneously distinguishable states in general probabilistic theories (GPTs).
Consider a tensor product [Formula: see text] of finite-dimensional Hilbert spaces with dimension [Formula: see text], 1 ≤ i ≤ k. Then the maximum dimension possible for a subspace of [Formula: see text] with no non-zero product vector is known to be d1 d2…dk - (d1 + d2 + … + dk + k - 1. We obtain an explicit example of a subspace of this kind. We determine the set of product vectors in its orthogonal complement and show that it has the minimum dimension possible for an unextendible product basis of not necessarily orthogonal product vectors.
Unextendible product bases (UPBs) provide a versatile tool with various applications across different areas of quantum information theory. Their comprehensive characterization is thus of great importance and has been a subject of vital interest for over two decades now. An open question asks about the existence of UPBs, which are genuinely unextendible, i.e., they are not extendible even with biproduct vectors. In other words, the problem is to verify whether there exist genuinely entangled subspaces (GESs), subspaces composed solely of genuinely multiparty entangled states, complementary to UPBs. We solve this problem in the negative for many sizes of UPBs in different multipartite scenarios. In particular, in the all-important case of equal local dimensions, we show that there are always forbidden cardinalities for such UPBs, including the minimal ones corresponding to GESs of the maximal dimensions.
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.
In quantum information theory, the state space of a multipartite quantum system is modeled by a tensor product. In the tensor-product space $\C^{d_1}\otimes\cdots\otimes\C^{d_p}$, a nonzero vector is a \emph{product state} if it can be written as ∣φ1⟩⊗⋯⊗∣φp⟩\ket{\varphi_1}\otimes\cdots\otimes\ket{\varphi_p}∣φ1​⟩⊗⋯⊗∣φp​⟩ with $\ket{\varphi_j}\in\C^{d_j}\setminus\{0\}$. An \emph{unextendible product basis} (UPB) is a finite family of pairwise orthogonal product states such that no nonzero product state is orthogonal to all of them. UPBs play a key role in investigating quantum entanglement and nonlocal phenomena. Finding a smallest UPB is a natural extremal problem: it asks how few pairwise orthogonal product states suffice to prevent any further product state from being added. The general minimum-size problem for UPBs has been studied for over two decades since the seminal work of Alon and Lovász. Let fm(d1,…,dp)f_m(d_1,\ldots,d_p)fm​(d1​,…,dp​) be the minimum cardinality of a UPB in the space, and let fLB(d1,…,dp)=1+∑j=1p(dj−1)f_{LB}(d_1,\ldots,d_p)=1+\sum_{j=1}^{p}(d_j-1)fLB​(d1​,…,dp​)=1+∑j=1p​(dj​−1) be the natural lower bound. Alon and Lovász determined exactly when fmf_mfm​ attains the lower bound fLBf_{LB}fLB​, but the obstructed multipartite cases remained open in general. We prove a stabilization theorem: for every non-all-qubit system with p≥3p\ge3p≥3, whenever the natural lower bound fLBf_{LB}fLB​ is unattainable, the true minimum is exactly fLB+1f_{LB}+1fLB​+1. Precisely, if the number of even local dimensions did_idi​ is positive and even, and at least one local dimension is greater than two, then fm(d1,…,dp)=fLB(d1,…,dp)+1f_m(d_1,\ldots,d_p)=f_{LB}(d_1,\ldots,d_p)+1fm​(d1​,…,dp​)=fLB​(d1​,…,dp​)+1. The proof is built on a unified graph-theoretic framework. Our result, together with earlier work, settles the minimum size problem for UPBs in all finite quantum systems.
The distinguishability of quantum states is important in quantum information theory and has been considered by authors. However, there were no general results considering whether a set of indistinguishable states become distinguishable by viewing them in a larger system without employing extra resources. In this paper, we consider this question for LOCC1_{1}1​, PPT and SEP distinguishabilities of states. We use mathematical methods to show that if a set of states is indistinguishable in ⊗k=1KCdk\otimes _{k=1}^{K} C^{d _{k}}⊗k=1K​Cdk​, then it is indistinguishable even being viewed in ⊗k=1KCdk+hk\otimes _{k=1}^{K} C^{d _{k}+h _{k}}⊗k=1K​Cdk​+hk​, where K,dk⩾2K, d _{k}\geqslant2K,dk​⩾2, hk⩾0h _{k}\geqslant0hk​⩾0 are integers. This shows that LOCC1_{1}1​, PPT and SEP distinguishabilities of states are properties of states themselves and independent of the dimension of quantum system. With these results, we can give the maximal number of states which can be distinguished via LOCC1_{1}1​ and construct a LOCC indistinguishable basis of product states in a general system. Note that our results are also suitable for unambiguous discriminations. Also, we give a conjecture for other distinguishabilities and a framework by defining the Local-global indistinguishable property. Instead of considering such problems for special sets or special systems, we consider the problems for general states in general systems, which have not been considered yet, for our knowledge.
Unextendible product basis (UPB), a set of incomplete orthonormal product states whose complementary space has no product state, is very useful for constructing bound entangled states. Naturally, instead of considering the set of product states, Bravyi and Smolin considered the set of maximally entangled states. They introduced the concept of unextendible maximally entangled basis (UMEB), a set of incomplete orthonormal maximally entangled states whose complementary space contains no maximally entangled state [Phys. Rev. A 84, 042,306 (2011)]. An entangled state whose nonzero Schmidt coefficients are all equal to 1/k is called a special entangled state of “type k”. In this paper, we introduce a concept named special unextendible entangled basis of “type k” which generalizes both UPB and UMEB. A special unextendible entangled basis of “type k” (SUEBk) is a set of incomplete orthonormal special entangled states of “type k” whose complementary space has no special entangled state of “type k”. We present an efficient method to construct sets of SUEBk. The main strategy here is to decompose the whole space into two subspaces such that the rank of each element in one subspace can be easily upper bounded by k while the other one can be generated by two kinds of the special entangled states of “type k”. This method is very effective when k = pm ≥ 3 where p is a prime number. For these cases, we can obtain sets of SUEBk with continuous integer cardinality when the local dimensions are large.