A Complete Hierarchy of Linear Systems for Certifying Quantum Entanglement of Subspaces
arXiv:2210.16389 · doi:10.1103/PhysRevA.106.062443
Abstract
We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms known methods already at the first level, and it is complete in the sense that every entangled subspace is shown to be so at some finite level of the hierarchy. It generalizes straightforwardly to the case of higher Schmidt rank, as well as the multipartite cases of completely and genuinely entangled subspaces. These hierarchies work extremely well in practice even in very large quantum systems, as they can be implemented via elementary linear algebra techniques rather than the semidefinite programming techniques that are required by previously-known hierarchies.
arXiv comment9 pages
References in corpus (25)
- Quantum entanglement
- Separability Criterion for Density Matrices
- Entanglement detection
- Separability criterion and inseparable mixed states with positive partial transposition
- Mixed-state entanglement and distillation: is there a ``bound'' entanglement in nature?
- Unextendible Product Bases and Bound Entanglement
- A complete family of separability criteria
- A Schmidt number for density matrices
- Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement
- Entanglement witnesses: construction, analysis and classification
- Evaluation of convex roof entanglement measures
- On the dimension of subspaces with bounded Schmidt rank
- The Entanglement of Superpositions
- Generic local distinguishability and completely entangled subspaces
- A completely entangled subspace of maximal dimension
- Quantum Codes of Maximal Distance and Highly Entangled Subspaces
- Genuinely entangled subspace with all-encompassing distillable entanglement across every bipartition
- From unextendible product bases to genuinely entangled subspaces
- A note on the optimality of decomposable entanglement witnesses and completely entangled subspaces
- A complete criterion for separability detection
- Entanglement of Subspaces and Error Correcting Codes
- An improved semidefinite programming hierarchy for testing entanglement
- Entanglement of subspaces in terms of entanglement of superpositions
- Entangled subspaces and generic local state discrimination with pre-shared entanglement
- Simple sufficient condition for subspace to be completely or genuinely entangled
Cited by in corpus (6)
- Semidefinite programming relaxations for quantum correlations
- Computing linear sections of varieties: quantum entanglement, tensor decompositions and beyond
- Quantifying subspace entanglement with geometric measures
- A Variational Approach to Unique Determinedness in Pure-state Tomography
- Progress in the study of the (non)existence of genuinely unextendible product bases
- Bounding Real Tensor Optimizations via the Numerical Range