arXiv subjects
Publications and source records attributed to Lieven Clarisse.
PhD thesis (University of York). The thesis covers in a unified way the material presented in quant-ph/0403073, quant-ph/0502040, quant-ph/0504160, quant-ph/0510035, quant-ph/0512012 and quant-ph/0603283. It includes two large review chapters on entanglement and distillation.
We define the disentangling power of a unitary operator in a similar way as the entangling power defined by Zanardi, Zalka and Faoro [PRA, 62, 030301]. A general formula is derived and it is shown that both quantities are directly proportional. All results concerning the entangling power can simply be translated into similar statements for the disentangling power. In particular, the disentangling power is maximal for certain permutations derived from orthogonal latin squares. These permutations can therefore be interpreted as those that distort entanglement in a maximal way.
An important open problem in quantum information theory is the question of the existence of NPT bound entanglement. In the past years, little progress has been made, mainly because of the lack of mathematical tools to address the problem. (i) In an attempt to overcome this, we show how the distillability problem can be reformulated as a special instance of the separability problem, for which a large number of tools and techniques are available. (ii) Building up to this we also show how the problem can be formulated as a Schmidt number problem. (iii) A numerical method for detecting distillability is presented and strong evidence is given that all 1-copy undistillable Werner states are also 4-copy undistillable. (iv) The same method is used to estimate the volume of distillable states, and the results suggest that bound entanglement is primarily a phenomenon found in low dimensional quantum systems. (v) Finally, a set of one parameter states is presented which we conjecture to exhibit all forms of distillability.
Entangled states with a positive partial transpose (PPTES) have interest both in quantum information and in the theory of positive maps. In $3\otimes 3$ there is a conjecture by Sanpera, Bruß and Lewenstein [PRA, 63, 050301] that all PPTES have Schmidt number two (or equivalently that every 2-positive map between $3\times 3$ matrices is decomposable). In order to prove or disprove the conjecture it is sufficient to look at edge PPTES. Here the rank m of the PPTES and the rank n of its partial transpose seem to play an important role. Until recently all known examples of edge PPTES had ranks (4,4) or (6,7). In a recent paper Ha and Kye [quant-ph/0509079] managed to find edge PPTES for all ranks except (5,5) and (6,6). Here we complement their work and present edge PPTES with those ranks.
Robustness measures as introduced by Vidal and Tarrach [PRA, 59, 141-155] quantify the extent to which entangled states remain entangled under mixing. Analogously, we introduce here the Schmidt robustness and the random Schmidt robustness. The latter notion is closely related to the construction of Schmidt balls around the identity. We analyse the situation for pure states and provide non-trivial upper and lower bounds. Upper bounds to the random Schmidt-2 robustness allow us to construct a particularly simple distillability criterion. We present two conjectures, the first one is related to the radius of inner balls around the identity in the convex set of Schmidt number n-states. We also conjecture a class of optimal Schmidt witnesses for pure states.
Recently P. Wocjan and M. Horodecki [quant-ph/0503129] gave a characterization of combinatorially independent permutation separability criteria. Combinatorial independence is a necessary condition for permutations to yield truly independent criteria meaning that that no criterion is strictly stronger that any other. In this paper we observe that some of these criteria are still dependent and analyze why these dependencies occur. To remove them we introduce an improved necessary condition and give a complete classification of the remaining permutations. We conjecture that the remaining class of criteria only contains truly independent permutation separability criteria. Our conjecture is based on the proof that for two, three and four parties all these criteria are truly independent and on numerical verification of their independence for up to 8 parties. It was commonly believed that for three parties there were 9 independent criteria, here we prove that there are exactly 6 independent criteria for three parties and 22 for four parties.
The notion of entangling power of unitary matrices was introduced by Zanardi, Zalka and Faoro [PRA, 62, 030301]. We study the entangling power of permutations, given in terms of a combinatorial formula. We show that the permutation matrices with zero entangling power are, up to local unitaries, the identity and the swap. We construct the permutations with the minimum nonzero entangling power for every dimension. With the use of orthogonal latin squares, we construct the permutations with the maximum entangling power for every dimension. Moreover, we show that the value obtained is maximum over all unitaries of the same dimension, with possible exception for 36. Our result enables us to construct generic examples of 4-qudits maximally entangled states for all dimensions except for 2 and 6. We numerically classify, according to their entangling power, the permutation matrices of dimension 4 and 9, and we give some estimates for higher dimensions.
A necessary and sufficient condition for 1-distillability is formulated in terms of decomposable positive maps. As an application we provide insight into why all states violating the reduction criterion map are distillable and demonstrate how to construct such maps in a systematic way. We establish a connection between a number of existing results, which leads to an elementary proof for the characterisation of distillability in terms of 2-positive maps.