Tripartite entanglement transformations and tensor rank

Abstract

Understanding the nature of multipartite entanglement is a central mission of quantum information theory. To this end, we investigate the question of tripartite entanglement convertibility. We find that there exists no easy criterion to determine whether a general tripartite transformation can be performed with a nonzero success probability and in fact, the problem is NP-hard. Our results are based on the connections between multipartite entanglement and tensor rank (also called Schmidt rank), a key concept in algebraic complexity theory. Not only does this relationship allow us to characterize the general difficulty in determining possible entanglement transformations, but it also enables us to observe the previously overlooked fact that {\em the Schmidt rank is not an additive entanglement measure}. As a result, we improve some best known transformation rates between specific tripartite entangled states. In addition, we find obtaining the most efficient algorithm for matrix multiplication to be precisely equivalent to determining the optimal rate of conversion between the Greenberger-Horne-Zeilinger state and a triangular distribution of three Einstein-Podolsky-Rosen states.

5 pages

References in corpus (7)

• Three qubits can be entangled in two inequivalent ways
• Multi-party entanglement in graph states
• Conditions for a class of entanglement transformations
• Four qubits can be entangled in nine different ways
• Entanglement of pure states for a single copy
• The Schmidt Measure as a Tool for Quantifying Multi-Particle Entanglement
• Random bipartite entanglement from W and W-like states

Cited by in corpus (44)

• Entanglement detection
• Quantum Resource Theories
• Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
• Quantifying entanglement resources
• Tensor Rank and Stochastic Entanglement Catalysis for Multipartite Pure States
• Obtain $W$-state from three-qubit $GHZ$-state on rate 1
• Monogamy of quantum correlations in three qubit pure states using Rajagopal-Rendell (RR) quantum deficit
• Characterizing multipartite entanglement classes via higher-dimensional embeddings
• Weaker entanglement guarantees stronger entanglement
• Multi-copy and stochastic transformation of multipartite pure states
• Asymptotic entanglement transformation between W and GHZ states
• Deterministic Transformations of Multipartite Entangled States with Tensor Rank 2
• The Tensor Rank of the Tripartite State ${|W⟩}^{\otimes n}$}
• Entangled Datasets for Quantum Machine Learning
• Stochastic Local Operations with Classical Communication of Absolutely Maximally Entangled States
• Matrix Pencils and Entanglement Classification
• Entanglement distillation from Greenberger-Horne-Zeilinger shares
• Minimal Renyi-Ingarden-Urbanik entropy of multipartite quantum states
• Tensor network representations from the geometry of entangled states
• Fine-Structure Classification of Multiqubit Entanglement by Algebraic Geometry
• Tensor rank and entanglement of pure quantum states
• Entanglement Classification with Algebraic Geometry
• Tripartite to Bipartite Entanglement Transformations and Polynomial Identity Testing
• Bounds on probability of transformations between multi-partite pure states
• Entanglement manipulation and distillability beyond LOCC
• An Algebraic-Geometric Characterization of Tripartite Entanglement
• Overcoming entropic limitations on asymptotic state transformations through probabilistic protocols
• Reinforcement Learning Generation of 4-Qubits Entangled States
• Non-distillable entanglement guarantees distillable entanglement
• A family of multipartite entanglement measures
• Distillation of Greenberger-Horne-Zeilinger states by combinatorial methods
• Quantifying subspace entanglement with geometric measures
• Quantifying entanglement from the geometric perspective
• Higher order singular value decomposition and the reduced density matrices of three qubits
• Finding maximal quantum resources
• Persistent Tensors and Multiqudit Entanglement Transformation
• Probabilistic pure state conversion on the majorization lattice
• Classifying Entanglement by Algebraic Geometry
• Tensor Rank and Other Multipartite Entanglement Measures of Graph States
• Approximate and ensemble local entanglement transformations for multipartite states
• The Tensor as an Informational Resource
• The product structure of MPS-under-permutations
• Entanglement in the symmetric subspace: mapping multipartite to bipartite states
• Tripartite-to-bipartite Entanglement Transformation by Stochastic Local Operations and Classical Communication and the Structure of Matrix Spaces