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.
9 pages
References in corpus (7)
- Entanglement detection
- A complete family of separability criteria
- Evaluation of convex roof entanglement measures
- Generic local distinguishability and completely entangled subspaces
- 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