Quantifying subspace entanglement with geometric measures

Abstract

Determining whether a subspace spanned by certain quantum states is entangled and its entanglement dimensionality remains a fundamental challenge in quantum information science. This paper introduces a geometric measure of $r$-bounded rank, $E_r(\mathcal{S})$, for a given subspace $\mathcal{S}$. Derived from the established geometric measure of entanglement, this measure is specifically designed to assess the entanglement within $\mathcal{S}$. It not only serves as a tool for determining the entanglement dimensionality but also illuminates the subspace's capacity to preserve such entanglement. By employing developed non-convex optimization techniques utilized in machine learning area, we can accurately calculate $E_r(\mathcal{S})$ within the manifold optimization framework. Our approach demonstrates notable advantages over existing hierarchical methods, PPT relaxation techniques, and the seesaw strategy, particularly by combining computational efficiency with broad applicability. More importantly, it paves the way for high-dimensional entanglement certification, which is crucial for numerous quantum information tasks. We showcase its effectiveness in validating high-dimensional entangled subspaces in bipartite systems, determining the border rank of multipartite pure states, and identifying genuinely or completely entangled subspaces.

11 pages, 4 figures, 2 tables

References in corpus (18)

• High-dimensional quantum communication: benefits, progress, and future challenges
• A complete family of separability criteria
• The geometric measure of entanglement for symmetric states
• Hierarchies of Geometric Entanglement
• Tensor Rank and Stochastic Entanglement Catalysis for Multipartite Pure States
• Tripartite entanglement transformations and tensor rank
• Generic local distinguishability and completely entangled subspaces
• Connecting the generalized robustness and the geometric measure of entanglement
• Bounds on Negativity of Superpositions
• Characterizing entanglement dimensionality from randomized measurements
• Bounds on the multipartite entanglement of superpositions
• Tight bounds on the concurrence of quantum superpositions
• Universal construction of genuinely entangled subspaces of any size
• An Algebraic-Geometric Characterization of Tripartite Entanglement
• Simple sufficient condition for subspace to be completely or genuinely entangled
• Evaluation of two different entanglement measures on a bound entangled state
• A Complete Hierarchy of Linear Systems for Certifying Quantum Entanglement of Subspaces
• The Bound of Entanglement of Superpositions with More Than Two Components

Cited by in corpus (1)

• Matrix-product entanglement characterizing the optimality of state-preparation quantum circuits