An algorithm for characterizing SLOCC classes of multiparticle entanglement
It is well known that the classification of pure multiparticle entangled states according to stochastic local operations leads to a natural classification of mixed states in terms of convex sets. We present a simple algorithmic procedure to prove that a quantum state lies within a given convex set. Our algorithm generalizes a recent algorithm for proving separability of quantum states [J. Barreiro et al., Nature Phys. 6, 943 (2010)]. We give several examples which show the wide applicability of our approach. We also propose a procedure to determine a vicinity of a given quantum state which still belongs to the considered convex set.
pacs:03.67.-a, 03.67.Mn, 03.65.Aa
The importance of quantum entanglement for quantum computation as well as for many other applications in quantum information processing has raised many fundamental questions regarding its characterization Horodecki et al. (2009). In mathematical terms, a quantum state is said to be separable, if it can be written as a mixture of projectors onto product states, otherwise it is entangled. Much work has been devoted to the development of criteria (in particular, the well-known tool of entanglement witnesses) which can prove that a quantum state is entangled, which means that it is outside of the convex set of separable states Gühne and Tóth (2009). Interestingly, methods which prove that a mixed quantum state is within the set of separable states (e.g., by providing an explicit decomposition into product states), are less well known. Nevertheless, for some cases explicit decompositions are known Wootters (1998); Sanpera et al. (1998); Unanyan et al. (2007); Kay (2011) and recently even some algorithms for this task have been developed Spedalieri (2007); Navascues et al. (2009); Barreiro et al. (2010).
If more than two particles are considered, the problem becomes more complicated, since different classes of multiparticle entanglement exist. One possibility uses the notion of stochastic local operations and classical communication (SLOCC) Dür et al. (2000); Verstraete et al. (2002). For this notion, one can again ask, whether a given state can be decomposed into states of the same SLOCC class, which leads for the case of three spin-1/2 particles to the well known classification into GHZ- and W-states Acin et al. (2001). Distinguishing these classes is a hard task, for partial results see Refs. Acin et al. (2001); Eltschka and Siewert (2012). Especially if one wishes to prove that a given state is within an entanglement class (such as the W-class), no general methods are known.
In this paper we propose an algorithm which allows to prove that a given mixed state belongs to a specific SLOCC entanglement class i.e., a decomposition exists where the pure states belong to the specified entanglement class. During the iterative procedure pure states and probabilities of the decomposition are determined as well as the “rest” operator which has an increasing mixedness during the iterations. In case of convergence we determine an explicit decomposition of the initial mixed state in terms of a convex combination of projectors onto pure states with the desired properties as well as a “rest” which is verified to be fully separable. It is not known whether the algorithm converges in all cases, but the method is easy to implement and it turns out to be well working in practice. Our algorithm is a generalization of the algorithm for proving separability from Ref. Barreiro et al. (2010).
Additionally we present a simple method to determine a lower bound on the -ball of the calculated decomposition Wilmott et al. (2010). This we achieve by constructing a cross polytope inside the convex set spanned by our decomposition. We find a ball with respect to the Hilbert-Schmidt distance for states in this convex space. This method helps to verify that such properties also hold in case of reasonable small “experimental” errors. In some cases it also helps to get an idea of how far the state is at least away from sets with different properties.
The paper is organized as follows. After an overview about multipartite entanglement and SLOCC entanglement classes in Section II we present in Section III an iterative algorithmic procedure to incrementally determine constituents of a decomposition of a given mixed quantum state. The main ingredient, the maximization of the overlap of a pure state with a given density operator under SLOCC operations, will be presented in Section IV and the properties of the algorithm in terms of convergence as well as scaling is discussed in Sections V-VII. It follows in Section VIII the procedure of determining an -ball. At the end a series of examples, where decompositions are determined and -balls are calculated, is presented in Section IX and compared with results already known in the literature. We conclude with possible further improvements and limitations of our procedure.
Ii Definitions and notations
Let us first consider pure states. Generally, a pure composite quantum state of particles is called entangled if it cannot be written as a tensor product of local states
where the are states on a subset of all particles. Depending on the value of one can further distinguish the number of parties involved which are not of tensor product form. Consequently, the states are said to be biseparable (), triseparable (), up to -separable. If a state does not possess any tensor product structure it is called genuine multipartite entangled.
This classification of pure state entanglement can be refined to the equivalence under stochastic local operations and classical communication (SLOCC) Dür et al. (2000); Verstraete et al. (2002). Physically speaking, SLOCC operations can be implemented with nonzero probability via local operations and classical communication, i.e. a single copy of can be mapped onto using local operations with probability , but with probability some other state may result. If two states can be converted into each other via SLOCC, this implies that both states are in principle useful for the same tasks in information processing, albeit the efficiency might be different. We denote such a class of SLOCC equivalent states by .
Mathematically speaking, a general SLOCC operation can be represented by the action of local operators i.e., , where are arbitrary operators acting on the th party. An SLOCC operation maps the initial state to by
where denotes the normalization.
For mixed quantum states shared between parties a state is called entangled if it cannot be written as a convex combination of an -fold tensor product of projectors onto pure states Werner (1989) i.e.,
One can extend this naturally by considering -separable states. Finally, a state is genuine multipartite entangled, if it cannot be written as a mixture of biseparable states.
For three qubits and pure genuine entangled states there exist two types of entanglement classes which are not SLOCC equivalent Dür et al. (2000): The two representatives are the GHZ state and the W state
Any pure entangled state can either be transformed into or , but these two states cannot be converted into each other. The analysis and the hierarchy of the set of mixed W/GHZ states was then developed in Ref. Acin et al. (2001). For more than three qubits already an infinite number of inequivalent SLOCC classes exist Verstraete et al. (2002).
Iii The main idea for the algorithm
iii.1 Structure of the problem
In this section, we will describe the main idea from Ref. Barreiro et al. (2010) to design an algorithm for proving that a quantum state belongs to a given class . In the most general case, the task is to prove that a quantum state is a convex combination of some projectors onto pure states . This means that we can write
where the form a probability distribution. The are states within a specific class : For instance, if one wishes to prove that is fully separable, then is the class of pure fully product states, or if should be proven to belong to the W-class for three qubits, then is the class of pure W class states (that is, the SLOCC orbit of ). In the following, we will denote the set of density matrices that can be decomposed as in Eq. (5) as , meaning the convex hull of .
In order to design an algorithm to check whether can be decomposed as in Eq. (5) we will use the following two facts:
(a) Convexity: First, the set of density matrices with a decomposition as in Eq. (5) forms a convex set i.e., if and are in , then is also in . This is indeed obvious by definition and it will be used as follows: Assume that we have three states and which obey
where and lies in the set . In this situation, if we can prove that , then must hold, too. We will use this fact in terms of the first part of Eq. (6): starting from we will subtract a term with and . If we can then show that , this implies that .
(b) Highly mixed states are in : As a second fact we need statements which imply that highly mixed states are in . This, of course, requires a specification of the degree of mixedness and depends on the structure of For instance, if we consider a bipartite system and if denotes the set of pure product states, then it has been shown that if
then is separable, that is Gurvits and Barnum (2002). Similar results have been obtained for other situations Zyczkowski et al. (1998); Braunstein et al. (1999); Kendon et al. (2002); de Vicente (2007) For instance, an -qubit state with for which
holds, is fully separable Hildebrand (2006). This condition will be used as a termination condition in the algorithm below.
It should be noted that there are cases, where a condition as Eq. (7) is not directly given. For instance, if is the set of all symmetric product states, then the maximally mixed state is clearly not in , as consists of matrices acting on the symmetric space only. Even for the identity operator on the symmetric space, a condition like Eq. (7) is not straightforward to derive, since there are non-symmetric states close to which are not in In our paper, such problems do not play a role, a detailed discussion of symmetric states will be given elsewhere.
iii.2 The algorithm
Now we can formulate the iterative algorithm to prove that a state is in . The algorithm consists of the following steps:
Take the input state as with
Consider the optimization problem
and find some state within which has a high overlap with
Find an such that
has no negative eigenvalues and that furthermore holds. In fact, one can directly calculate the optimal , such that is minimal (see Section VI); this choice is, however, not mandatory. In practical implementations, it can be useful to set an upper bound as this prevents the algorithm from subtracting too much from .
The main idea is that if has a high overlap with , then it also has a high overlap with the eigenvector corresponding to the maximal eigenvalue of . The construction of leads typically to and, due to the normalization, holds. Hence, will be closer to the maximally mixed state than and is more likely to obey conditions as in Eq. (7).
Before discussing and extending this algorithm in detail, two facts must be mentioned: First, it is of course not guaranteed that for a given state in the algorithm will terminate after a finite number of steps. So we do not claim that the algorithm can in general prove that a state is in , we only claim (and demonstrate in this paper) that the algorithm is a powerful tool which works very well in practice.
Second, a crucial step in the algorithm is the optimization in Eq. (9). As already mentioned, one does not need a certified solution, but still it is important to find a good approximate solution. Clearly, the difficulty of this task depends on the structure of
For the simple case that are the pure bipartite product states, one can do this as follows: For the optimal the part is the eigenvector corresponding to the maximal eigenvalue of and is similarly the vector corresponding to the maximal eigenvalue of . This can be used to tackle the maximization iteratively: Starting from a random one computes the optimal via , then with this the optimal , then again the optimal etc. In practice, this converges quickly against the desired solution. For multiparticle fully separable states, this can be done similarly Gühne et al. (2007).
If denotes the SLOCC equivalence class of some pure state, however, it is not so clear how to perform the optimization in Eq. (9). For pure three-qubit W class states one may use the explicit parameterization of pure W states from Ref. Acin et al. (2001), but for more qubits, such explicit formulae are not available. A central step to extend the algorithm from Ref. Barreiro et al. (2010) to SLOCC classes is therefore a simple algorithm for the maximization in Eq. (9). Such an algorithm will be described in the next section.
Iv Maximizing the overlap of -partite states via SLOCC
As mentioned in the previous section, a crucial part of the algorithm is to perform the maximization in Eq. (9). If is the SLOCC orbit of a suitably chosen -partite pure quantum state in , the state after a general SLOCC operation is given by
where is the local filtering (or SLOCC) operator of the -th party.
The goal is then to maximize the overlap of with a given quantum state by applying such an SLOCC operation, so one has to compute
The general optimization over the tensor product of SLOCC operators is a hard task. Therefore, one may consider an iterative procedure where in each iteration step () we optimize the overlap (fidelity) with respect to a single party () i.e., we calculate a new state by applying a local SLOCC operator of the -th party and using the identity for the remaining parties,
here denotes the identity operator on all parties except the -th party. In the following, we will usually omit the symbol , when there is no risk of confusion.
In each iteration step the optimizing party is changed, e.g. by going from the first to the second up to the -th party and then starting with the first party again. This iterative procedure is continued up to a fixed point, where the state does not change anymore. The calculated SLOCC operator is in this case up to some factor proportional to the identity. Note that in general this optimization may converge to a local extremum only, but, as discussed above, global optimality is not required for the separability algorithm.
A possible way to deal with Eq. (13) is to perform a direct numerical optimization over the If is the dimension of the local Hilbert space this requires an optimization over real parameters. For multi-qubit states this is directly feasible, however, for larger local dimensions or for a large number of particles , it is necessary to have an analytical method to find an which increases the overlap. This analytical approach will be explained in the following.
Increasing the overlap in each iteration step is equivalent to (for brevity we use )
In this inequality only the operator is unknown. We denote the overlap (fidelity) of the previous iteration step by and choosing a local orthonormal basis we can rewrite
with , , and , where we used the multi-indices which denote all index elements of the -partite system.
With this parametrization the last term of the left hand side in Eq. (15) takes the form
Here, is just the matrix representation of and we used , that is
and is a mapping of a two valued index (the “matrix element” indices of the -th party) to a single valued integer index.
The remaining unknown expectation value of the left hand side in Eq. (15) becomes
Therefore, we can rewrite Eq. (15) as
where . Note that the matrices and are hermitian and is non-negative. The maximum left-hand side corresponds to the maximal eigenvalue () of the matrix or likewise the left hand side of Eq. (23) is maximized by using the eigenvector corresponding to the maximal eigenvalue (). By undoing the mapping we obtain the SLOCC operator,
This procedure gives the following insight into the optimization over one local filter as in Eq. (13): If the maximal eigenvalue of is positive, one can still increase the overlap with a suitable . The corresponding eigenvector gives an which increases the overlap. Note, however, that this is optimal for Eq. (15), but not necessarily the optimal for in Eq. 14.
In the practical implementation, especially at the beginning of the optimization procedure it is not helpful to use directly as the SLOCC operator, because this operator is not necessarily invertible. This could therefore correspond to an irreversible operation which destroys entanglement. It turns out that using
avoids this problem. With this SLOCC operator the state for the next iteration step is calculated according to Eq. (13). During the iteration procedure, will decrease [see Eq. (15)], the SLOCC operators become close to the identity, and the convergence criterion is that is up to numerical precision zero.
V Finding the optimal
A second optimization occurring in the algorithm is the task to find the best (see Eq. 10). In detail, we want to maximize the decrease in the purity in each iteration, that is
with . With the abbreviation the above maximization leads to
Taking the derivative with respect to , we find the maximum as
In the implementation, in case of , we define , where is the minimal eigenvalue of (guided by practical experience), to keep the remaining state positive during the iterations. This corresponds to an upper bound on , as mentioned above.
Vi Increasing the mixedness
A central strategy of the algorithm is to increase the “mixedness” of in each iteration step i.e., to lower the purity One may wonder, whether this is always possible by subtracting some Indeed, one can show that this is the case, unless is outside , which means that the algorithm has no chance to succeed anyway.
To see this, the condition for an increase of the mixedness can be formulated as
for small . It follows that iff
the state can be subtracted with a small weight, and the mixedness increases.
If condition Eq. (29) is not fulfilled for any the mixedness cannot increase. But this implies that
Consequently, for the observable
with This is nothing but a witness Gühne and Tóth (2009) which discriminates between and the remaining states, and implies that a state is not in Therefore, states which cannot fulfill the condition in Eq. (29) are either not in or (in case that ) they may lie at the border of This, however, is a set of measure zero and not of practical relevance.
Vii Convergence behavior of the algorithm
Let us now discuss some practical issues. The question, whether or not the algorithm converges depends first on the type of state and decomposition to be determined and second on the distance of the state from the boundary of the considered convex set. The closer the state is to a boundary the slower is the convergence. The algorithm does e.g. not work with rank deficit states, because overlap of the optimized pure states with the kernel of the density operator cannot be avoided i.e., it is not possible to ensure . In the three- and four-qubit case the decompositions consists of the order of states (meaning that the algorithm requires this number of iterations, until the conditions in Eqs. (7, 8) apply) i.e., usually such decompositions contain many more states then the Caratheodory-bound of .
Viii Lower bound on the -ball via cross polytope
The presented algorithmic procedure allows to determine a decomposition of the state with the specified SLOCC properties. After iterations we have a decomposition i.e., the set , of our initial state of the form
where the probabilities are given by and with and .
By construction, our convex set has specific “entanglement” properties which are valid for all states in its convex hull. However, if we obtained the state from experimental data, we have to deal with errors and imperfections, and so the starting state is affected by uncertainties. Therefore it is of great importance to give some statements about the “stability” of the determined decomposition, or an estimate of the probability that an experimental states lies inside this convex set.
A first possibility to deal with this problem was used in Ref. Barreiro et al. (2010): There, starting from the experimentally obtained state the measurements were simulated via a Monte-Carlo simulation, and 200 sampled states were reconstructed via a maximum likelihood approximation. Then, separability of the state was only claimed, when the algorithm could prove that as well as all samples were separable. Note that the generation of states via Monte-Carlo simulation of the measurements is a standard technique to estimate errors in ion-trap experiments.
A different possibility can be obtained by answering the question, how much can an experimental state deviate from such that the state still belongs to the set . Although this question is in general not easy to answer Grünbaum (2003), we can determine a lower bound on the minimal Hilbert-Schmidt-distance of the state with respect to the convex hull of .
The idea is to show that if the state deviates from in different directions, then it remains in the convex set. More precisely, we construct a symmetric cross polytope Wilmott et al. (2010) with the state in the center (see Fig. 1 for a 2-dimensional example). For a quantum state with Hilbert space dimension the set needs at least constituents s.t. a nonzero volume object in this space is possible. The cross polytope is a symmetric polytope with vertex states. The vertex states of the cross polytope are defined by , where we used a vector representation of the density operator in -dimensional Euclidian space by mapping
The elements of the basisvectors in this notation are given by .
The Euclidian distance of the vertex states of the cross polytope with respect to the state , which is given by , is maximized under the constraint that the vertex states are contained in the convex hull of our set (see Fig. 1).
First, using a divide and conquer algorithm we calculate the maximal parameter of each state such that it is contained in the convex hull of our set . Whether a state is contained in the convex set can be decided by using a linear program, e.g. via the Matlab routine linprog. The vertex state with the smallest parameter is used for defining the vertex states of the cross polytope inside our convex hull. The parameter also depends on the relative orientation of the chosen orthogonal basis , here an additional optimization is possible.
Then, the smallest Hilbert-Schmidt distance of with respect to any point in the convex hull of the cross polytope is given by , where is the dimension of the Hilbert space and is the maximal parameter such that the cross polytope is contained inside the set Wilmott et al. (2010). We will present an example below.
In this section, we present several examples for the application of our algorithm outlined above.
ix.1 GHZ states affected by white noise
First, we consider the GHZ state of qubits affected by white noise
where For three qubits, these states have the following properties:
is fully separable iff Dür and Cirac (2000),
is genuine multipartite (tripartite) entangled iff Gühne and Seevinck (2010),
belongs to the GHZ class iff . For a detailed discussion see Ref. Eltschka and Siewert (2012).
With our algorithm we can determine separable and biseparable decompositions up to the threshold values of . A bound with a threshold value of for existing W-class decomposition was obtained with our algorithm, which is close to the optimal threshold value of .
ix.1.1 The -ball and the robustness depending on
With our algorithm it is possible to obtain W-decompositions of the state up to . Due to the “small” number of vertex states forming the convex set the size of an -ball generated via the procedure of Sec. VIII will be small in comparison to the maximum possible ball which fulfills the considered properties. However the lower bound on the size of this ball will also depend on the distance of the considered state to the border where the properties are not fulfilled anymore. In Fig. 2 the lower bound on the size of the -ball is plotted versus the parameter . As expected for the almost maximally mixed state (small ) the ball is quite large, but it decreases by several orders of magnitude as approaches the threshold value of the considered convex set.
From our -ball we can also deduce that any state which has an Euclidean distance from which is smaller equal the radius of the -ball is contained in our convex set i.e., using the Hilbert-Schmidt-distance between two operators and given by , we can calculate the distance between two GHZ-Werner states, see Eq. (33), with purity and to be given by
If we have an -ball in the surrounding of with radius then we can deduce that also the state with
belongs to the same convex set, allowing to increase the threshold parameter accordingly.
ix.1.2 Entanglement properties of
The maximal parameter for biseparability of the four-qubit GHZ-state mixed with white noise was derived in Ref. Gühne and Seevinck (2010). Our algorithm is able to determine decompositions for values of up to .
For four qubits there is already a continuous set of inequivalent SLOCC entanglement classes, and it can happen that a state can be decomposed into biseparable states, but not into SLOCC equivalents of some genuine multipartite entangled states. To investigate this, we considered the state and asked when it can be decomposed into SLOCC equivalents of the four-qubit W-state, . This seems to be only possible for , but for the larger parameter regime the state is biseparable.
An intuitive argument for such a behavior is that the four qubit W-state can be transformed via SLOCC into a three-qubit GHZ state as well as to a two-qubit Bell state tensored with a product state, but it is not possible to reach , we even have 111This property can e.g. be supported by considering the Schmidt-rank of with respect to the split 1,3 vs 2,4 which is 2, whereas the corresponding Schmidt rank of is 4. It is not possible to increase the Schmidt-rank of a state via SLOCC operations.. States like , however, are essential in the biseparable decomposition of Gühne and Seevinck (2010). Many lower entangled pure states are SLOCC inequivalent to specific genuine multipartite entangled pure states.
ix.2 W-states with white noise
In order to give an example where the algorithm is not capable of computing the threshold of separability, we consider states of the form
where the three-qubits W state is given in Eq. (4) and for four qubits we have . The border to the class of biseparable states can only be roughly approached by the algorithm. In the three-qubit case we have a gap of about , the exact value is known from Ref. Jungnitsch et al. (2011). For the four-qubit W-state with white noise the gap with respect to the upper bound obtained by an semidefinit-programming-witness (SDP-witness) Jungnitsch et al. (2011) is approximately i.e., we determined a decomposition for .
ix.3 Bound entangled state from an unextendible product basis
As a second example, we consider the bound entangled states arising from an unextendible product basis Bennett et al. (1999). These states are defined via using the product vectors , , , , . Then the state
is an entangled state on a system, which is not detected by the PPT criterion. We considered the family of states
They have often been used as a test-bed for separability criteria. To our knowledge, the best criterion for these states is the first step of the algorithm of Doherty et al. Doherty et al. (2002) which detects them to be entangled for . Our algorithm proves that these states are separable for .
ix.4 Thermal states with the Heisenberg interaction
Let us consider the thermal state
of three spin-1/2 particles interacting with the Heisenberg interaction,
where . In Ref. Tóth et al. (2007) the entanglement properties of this system were investigated, and it was shown that the spin-squeezing inequality with detects these states as entangled for . Remarkably, the spin-squeezing inequality shows that for the thermal state is biseparable with respect to any bipartition, but not fully separable. Direct application of our algorithm gives that for the thermal state is fully separable, giving strong evidence that the spin-squeezing inequality is a necessary and sufficient criterion for the thermal state. For more than three spins, however, this does not seem to be the case.
ix.5 Experimental pseudo bound entangled state
In Ref. Acin et al. (2001) a class of three-qubit bound entangled states with rank seven were introduced. We consider the specific state where the entanglement is maximally robust with respect to white noise Hyllus et al. (2004):
where , , and the normalization is . The state has the curious property that it is biseparable with respect to any bipartite splitting, but it is nevertheless entangled. A pseudo bound entangled state of this form was experimentally generated and characterized in Ref. Kampermann et al. (2010), see Fig. 3. It was shown via a witness operator that the state is entangled and PPT with respect to any bipartite splitting. Now with our algorithm we are able to prove that this state is biseparable with respect to the split B-AC with an -ball of .
ix.6 Experimental three-qubit W-state
Nowadays it is possible in several experimental setups to generate quantum states which are e.g. close to the three-qubit W-state. The generated states are characterized by quantum state tomography. Here we use data from an experiment by Roos et al. Roos (). This “typical” experiment (see Fig. 4) led to a fidelity of , where we can prove via an entanglement witness that this state is genuine multipartite entangled. Now the question arises whether this state really belongs to the W-class of entanglement. With our algorithm it is not possible to find a W-class decomposition of , so probably the state belongs to the class of GHZ-entangled-states. On the other hand we can find for the slightly depolarized version of this state, e.g. , a W-decomposition and we can prove that it is genuine multipartite entangled.
ix.7 Summary of the algorithmic performance
In this section we summarize the obtained threshold parameters for the various examples considered. Our standard approach was to consider different types of quantum states mixed with white noise of the form:
Then we determined the threshold parameters for various types of entanglement which we can achieve via our algorithm, and to compared them with bounds from the literature or with exact values if they are known. The only exceptional parameterization was the case of the thermal equilibrium Heisenberg spin chain state (Sec. IX.4) which depends on the temperature. In Table 1 we summarize the threshold parameters reached via our algorithm and show the best known bounds from the literature. For several cases we also calculated lower bounds on the -ball for our determined decompositions (see Sec. VIII). For all cases where the exact bounds are known we can reproduce the threshold parameters quite well by our procedure, apart from the three-qubit W state, where there is a small gap. It is remarkable that our algorithm seems to work independently of the type of decomposition to be determined. For the given examples the calculation needs less than 5 min on a standard personal computer. The number of terms calculated in the decomposition strongly depends on the distance to the border of the convex set. I.e. already a very small change on the -threshold values has a huge influence on the number of terms in the decomposition. For threshold values with the given precision in Table 1 it is possible to find decomposition within the order of terms.
|BS||Jungnitsch et al. (2011)|
|W||Eltschka and Siewert (2012)|
|BS||Jungnitsch et al. (2011)|
|BS||Jungnitsch et al. (2011)|
|BS||Jungnitsch et al. (2011)|
|S||Doherty et al. (2002)|
|BS (AB-C)||Acin et al. (2001)|
|S||Tóth et al. (2007)|
|BS (AB-C)||Tóth et al. (2007)|
We presented an easy to implement, fast and straight-forward method for finding decompositions of quantum states with specific SLOCC entanglement properties. For a large variety of examples decompositions were determined for those parameters, where they are known to exist. For instance, is it possible to find separable decompositions of Werner states with minimal amount of white noise. Also the threshold values for biseparability can be reproduced in most cases for three- and four-qubit states. Especially interesting are the cases where the exact parameter range for the existing decompositions is not known. It was e.g. possible to investigate bound entangled states with our algorithm. This method of determining specific decompositions of a quantum state is a complementary tool to entanglement criteria such as entanglement witnesses. Together these tools allow to extensively specify the entanglement properties of a given quantum state. In the future we would like to understand better the convergence behavior of the algorithm, especially why optimally decreasing the purity of the quantum state in each iteration is at the end not necessarily a good strategy.
We would like to thank J. Barreiro, M. Kleinmann, M. Mertz, M. Piani, C. Roos, and A. Streltsov for valuable discussions. This project was financially supported by the Austrian Science Fund (FWF): Y376-N16 (START prize), the EU (Marie Curie CIG 293993/ENFOQI), the BMBF (Chist-Era Project QUASAR) and the Deutsche Forschungsgemeinschaft (DFG).
- Horodecki et al. (2009) R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, Rev. Mod. Phys. 81, 865 (2009).
- Gühne and Tóth (2009) O. Gühne and G. Tóth, Phys. Rep. 474, 1 (2009).
- Wootters (1998) W. K. Wootters, Phys. Rev. Lett. 80, 2245 (1998).
- Sanpera et al. (1998) A. Sanpera, R. Tarrach, and G. Vidal, Phys. Rev. A 58, 826 (1998).
- Unanyan et al. (2007) R. Unanyan, H. Kampermann, and D. Bruß, J. Phys. A 40, F483 (2007).
- Kay (2011) A. Kay, Phys. Rev. A 83, 020303(R) (2011).
- Spedalieri (2007) F. M. Spedalieri, Phys. Rev. A 76, 032318 (2007).
- Navascues et al. (2009) M. Navascues, M. Owari, and M. B. Plenio, Phys. Rev. Lett. 103, 160404 (2009).
- Barreiro et al. (2010) J. Barreiro, P. Schindler, O. Gühne, T. Monz, M. Chwalla, C. Roos, M. Hennrich, and R. Blatt, Nat. Phys. 6, 943 (2010).
- Dür et al. (2000) W. Dür, G. Vidal, and J. I. Cirac, Phys. Rev. A 62, 062314 (2000).
- Verstraete et al. (2002) F. Verstraete, J. Dehaene, B. DeMoor, and H. Verschelde, Phys. Rev. A 65, 052112 (2002).
- Acin et al. (2001) A. Acin, D. Bruß, M. Lewenstein, and A. Sanpera, Phys. Rev. Lett. 87, 040401 (2001).
- Eltschka and Siewert (2012) C. Eltschka and J. Siewert, Phys. Rev. Lett. 108, 020502 (2012).
- Wilmott et al. (2010) C. Wilmott, H. Kampermann, and D. Bruß, J. Phys. A 43, 505306 (2010).
- Werner (1989) R. F. Werner, Phys. Rev. A 40, 4277 (1989).
- Gurvits and Barnum (2002) L. Gurvits and H. Barnum, Phys. Rev. A 66, 062311 (2002).
- Zyczkowski et al. (1998) K. Zyczkowski, P. Horodecki, A. Sanpera, and M. Lewenstein, Phys. Rev. A 58, 883 (1998).
- Braunstein et al. (1999) S. L. Braunstein, C. M. Caves, R. Jozsa, N. Linden, S. Popescu, and R. Schack, Phys. Rev. Lett. 83, 1054 (1999).
- Kendon et al. (2002) V. M. Kendon, K. Nemoto, and W. J. Munro, J. Mod. Optics 49, 1709 (2002).
- de Vicente (2007) J. I. de Vicente, Quantum Inf. Comput. 7, 624 (2007).
- Hildebrand (2006) R. Hildebrand, Separable balls around the maximally mixed state for a 3-qubit system (2006), quant-ph/0601201.
- Gühne et al. (2007) O. Gühne, M. Reimpell, and R. F. Werner, Phys. Rev. Lett. 98, 110502 (2007).
- Grünbaum (2003) B. Grünbaum, Convex Polytopes (Springer, 2003), 2nd ed.
- Dür and Cirac (2000) W. Dür and J. I. Cirac, Phys. Rev. A 61, 042314 (2000).
- Gühne and Seevinck (2010) O. Gühne and M. Seevinck, New J. Phys. 12, 053002 (2010).
- Jungnitsch et al. (2011) B. Jungnitsch, T. Moroder, and O. Gühne, Phys. Rev. Lett. 106, 190502 (2011).
- Bennett et al. (1999) C. H. Bennett, D. P. DiVincenzo, T. Mor, P. W. Shor, J. A. Smolin, and B. M. Terhal, Phys. Rev. Lett. 82, 5385 (1999).
- Doherty et al. (2002) A. C. Doherty, P. A. Parrilo, and F. M. Spedalieri, Phys. Rev. Lett. 88, 187904 (2002).
- Tóth et al. (2007) G. Tóth, C. Knapp, O. Gühne, and H. J. Briegel, Phys. Rev. Lett. 99, 250405 (2007).
- Hyllus et al. (2004) P. Hyllus, C. M. Alves, D. Bruß, and C. Macchiavello, Phys. Rev. A 70, 032316 (2004).
- Kampermann et al. (2010) H. Kampermann, D. Bruß, X. Peng, and D. Suter, Phys. Rev. A 81, 040304(R) (2010).
- (32) C. Roos, private communication.
- Hyllus (2005) P. Hyllus, Ph.D. thesis, Universität Hannover (2005).