Maximum dimension of subspaces with no product basis
From MaRDI portal
Publication:2020690
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).
Recommendations
Cites work
- scientific article; zbMATH DE number 3887879 (Why is no real title available?)
- scientific article; zbMATH DE number 2103534 (Why is no real title available?)
- A derivation of quantum theory from physical requirements
- Asymptotic properties for Markovian dynamics in quantum theory and general probabilistic theories
- Entropy in general physical theories
- Generalized probability theories: what determines the structure of quantum theory?
- On the dimension of subspaces with bounded Schmidt rank
- On the maximal dimension of a completely entangled subspace for finite level quantum systems
- Perfect discrimination of non-orthogonal separable pure states on bipartite system in general probabilistic theory
- Separability criterion and inseparable mixed states with positive partial transposition.
- The minimum size of unextendible product bases in the bipartite case (and some multipartite cases)
- The order-\(n\) minors of certain \((n+k)\times n\) matrices
- Ultimate data hiding in quantum mechanics and beyond
- Unextendible product bases
- Unextendible product bases and 1-factorization of complete graphs
- Unextendible product bases, uncompletable product bases and bound entanglement
- Unifying typical entanglement and coin tossing: on randomization in probabilistic theories
Cited in
(2)
This page was built for publication: Maximum dimension of subspaces with no product basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020690)