Maximum Dimension of Subspaces with No Product Basis
arXiv:2010.16293 · doi:10.1016/j.laa.2021.03.001
Abstract
Let and be integers, and be a field. A vector is called a product vector if for some . A basis composed of product vectors is called a product basis. In this paper, we show that the maximum dimension of subspaces of with no product basis is equal to if either (i) or (ii) and for some and . When , this result is related to the maximum number of simultaneously distinguishable states in general probabilistic theories (GPTs).
arXiv comment14 pages
References in corpus (17)
- Separability criterion and inseparable mixed states with positive partial transposition
- Unextendible Product Bases and Bound Entanglement
- Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement
- A derivation of quantum theory from physical requirements
- Largest separable balls around the maximally mixed bipartite quantum state
- Generalized Probability Theories: What determines the structure of quantum theory?
- Entropy in general physical theories
- On the dimension of subspaces with bounded Schmidt rank
- Tensor products of convex sets and the volume of separable states on N qudits
- The Minimum Size of Unextendible Product Bases in the Bipartite Case (and Some Multipartite Cases)
- Ultimate data hiding in quantum mechanics and beyond
- Unifying typical entanglement and coin tossing: on randomization in probabilistic theories
- Entangled states close to the maximally mixed state
- Cones of ball-ball separable elements
- Perfect Discrimination of Non-Orthogonal Separable Pure States on Bipartite System in General Probabilistic Theory
- Perfect Discrimination in Approximate Quantum Theory of General Probabilistic Theories
- Asymptotic Properties for Markovian Dynamics in Quantum Theory and General Probabilistic Theories