An algorithm is proposed that serves to handle full rank density matrices, when coming from a lower rank method to compute the convex-roof. This is in order to calculate an upper bound for any polynomial SL invariant multipartite entanglement measure E. Here, it is exemplifyed how this algorithm works, based on a method for calculating convex-roofs of rank two density matrices. It iteratively considers the decompositions of the density matrix into two states each, exploiting the knowledge for the rank-two case. The algorithm is therefore quasi exact as far as the two rank case is concerned, and it also gives hints where it should include more states in the decomposition of the density matrix. Focusing on the threetangle, I show the results the algorithm gives for two states, one of which being the $GHZ$-Werner state, for which the exact convex roof is known. It overestimates the threetangle in the state, thereby giving insight into the optimal decomposition the $GHZ$-Werner state has. As a proof of principle, I have run the algorithm for the threetangle on the transverse quantum Ising model. I give qualitative and quantitative arguments why the convex roof should be close to the upper bound found here.
Download