Entanglement of genuinely entangled subspaces and states: exact, approximate, and numerical results
arXiv:1907.12463 · doi:10.1103/PhysRevA.100.062318
Abstract
Genuinely entangled subspaces (GESs) are those subspaces of multipartite Hilbert spaces that consist only of genuinely multiparty entangled pure states. They are natural generalizations of the well-known notion of completely entangled subspaces , which by definition are void of fully product vectors. Entangled subspaces are an important tool of quantum information theory as they directly lead to constructions of entangled states, since any state supported on such a subspace is automatically entangled. Moreover, they have also proven useful in the area of quantum error correction. In our recent contribution [M. Demianowicz and R. Augusiak, Phys. Rev. A \textbf{98}, 012313 (2018)], we have studied the notion of a GES qualitatively in relation to so--called nonorthogonal unextendible product bases and provided a few constructions of such subspaces. The main aim of the present work is to perform a quantitative study of the entanglement properties of GESs. First, we show how one can attempt to compute analytically the subspace entanglement, defined as the entanglement of the least entangled vector from the subspace, of a GES and illustrate our method by applying it to a new class of GESs. Second, we show that certain semidefinite programming relaxations can be exploited to estimate the entanglement of a GES and apply this observation to a few classes of GESs revealing that in many cases the method provides the exact results. Finally, we study the entanglement of certain states supported on GESs, which is compared to the obtained values of the entanglement of the corresponding subspaces, and find the white--noise robustness of several GESs. In our study we use the (generalized) geometric measure as the quantifier of entanglement.
References in corpus (44)
- Geometric measure of entanglement and applications to bipartite and multipartite quantum states
- Unextendible Product Bases and Bound Entanglement
- Multipartite entanglement and high precision metrology
- A complete family of separability criteria
- Taming multiparticle entanglement
- Computing quantum discord is NP-complete
- Most quantum states are too entangled to be useful as computational resources
- Absolute Maximal Entanglement and Quantum Secret Sharing
- Monotones and invariants for multi-particle quantum states
- Multi-partite entanglement speeds up quantum key distribution in networks
- Optimal entanglement criterion for mixed quantum states
- Characterization of separable states and entanglement witnesses
- Genuinely multipartite entangled states and orthogonal arrays
- Channel Capacities versus Entanglement Measures in Multiparty Quantum States
- Hierarchies of Geometric Entanglement
- Universal geometric entanglement close to quantum phase transitions
- Distinguishability of complete and unextendible product bases
- Complete hierarchies of efficient approximations to problems in entanglement theory
- Linking a distance measure of entanglement to its convex roof
- Quantum Correlation Without Classical Correlations
- Entanglement of multiparty stabilizer, symmetric, and antisymmetric states
- On the dimension of subspaces with bounded Schmidt rank
- Entanglement and quantum combinatorial designs
- Relaxations of separability in multipartite systems: Semidefinite programs, witnesses and volumes
- Entanglement and local information access for graph states
- Device-independent witnesses of entanglement depth from two-body correlators
- A completely entangled subspace of maximal dimension
- Constructing optimal quantum error correcting codes from absolute maximally entangled states
- Genuinely entangled subspace with all-encompassing distillable entanglement across every bipartition
- Additivity and non-additivity of multipartite entanglement measures
- From unextendible product bases to genuinely entangled subspaces
- Converting multilevel nonclassicality into genuine multipartite entanglement
- Generalized Geometric Measure of Entanglement for Multiparty Mixed States
- Bell inequalities with no quantum violation and unextendible product bases
- Scale invariance of entanglement dynamics in Grover's quantum search algorithm
- Distribution of G-concurrence of random pure states
- Experimental certification of millions of genuinely entangled atoms in a solid
- Entanglement of Subspaces and Error Correcting Codes
- Easy implementable algorithm for the geometric measure of entanglement
- Entanglement of subspaces in terms of entanglement of superpositions
- Constructions of genuinely entangled multipartite states with applications to local hidden variables (LHV) and states (LHS) models
- Evaluation of two different entanglement measures on a bound entangled state
- Entangled subspaces and quantum symmetries
- Genuinely multipartite entangled states in higher dimensions: a generalization of balancedness
Cited by in corpus (13)
- Quantum Codes of Maximal Distance and Highly Entangled Subspaces
- Universal construction of genuinely entangled subspaces of any size
- An approach to constructing genuinely entangled subspaces of maximal dimension
- Simple sufficient condition for subspace to be completely or genuinely entangled
- Construction of genuinely multipartite entangled subspaces and the associated bounds on entanglement measures for mixed states
- Construction of genuinely entangled multipartite subspaces from bipartite ones by reducing the total number of separated parties
- Negative result about the construction of genuinely entangled subspaces from unextendible product bases
- Quantum algorithmic randomness
- Quantifying subspace entanglement with geometric measures
- Progress in the study of the (non)existence of genuinely unextendible product bases
- Frustration graph formalism for qudit observables
- Local Purity Distillation in Quantum Systems: Exploring the Complementarity Between Purity and Entanglement
- Entanglement witnesses for stabilizer states and subspaces beyond qubits