Tripartite Entanglement Transformations and Tensor Rank

From MaRDI portal
Publication:3107626

DOI10.1103/PHYSREVLETT.101.140502zbMATH Open1228.81061arXiv0805.2977OpenAlexW2050293430WikidataQ51866832 ScholiaQ51866832MaRDI QIDQ3107626FDOQ3107626


Authors: Eric Chitambar, Runyao Duan, Yaoyun Shi Edit this on Wikidata


Publication date: 26 December 2011

Published in: Physical Review Letters (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0805.2977




Recommendations



Cites Work


Cited In (22)





This page was built for publication: Tripartite Entanglement Transformations and Tensor Rank

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107626)