arXiv subjects

K. Audenaert

Publications and source records attributed to K. Audenaert.

9 recordsLinked to original sources

arXiv2007

Evenly distributed unitaries: on the structure of unitary designs

We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire unitary group. We present a simple necessary and sufficient criterion for deciding if a set of matrices constitutes a design. Lower bounds for the number of elements of 2-designs are derived. We show how to turn mutually unbiased bases into approximate 2-designs whose cardinality is optimal in leading order. Designs of higher order are discussed and an example of a unitary 5-design is presented. We comment on the relation between unitary and spherical designs and outline methods for finding designs numerically or by searching character tables of finite groups. Further, we sketch connections to problems in linear optics and questions regarding typical entanglement.

quant-ph↗

arXiv2006

Comment on "Optimum Quantum Error Recovery using Semidefinite Programming"

In a recent paper ([1]=quant-ph/0606035) it is shown how the optimal recovery operation in an error correction scheme can be considered as a semidefinite program. As a possible future improvement it is noted that still better error correction might be obtained by optimizing the encoding as well. In this note we present the result of such an improvement, specifically for the four-bit correction of an amplitude damping channel considered in [1]. We get a strict improvement for almost all values of the damping parameter. The method (and the computer code) is taken from our earlier study of such correction schemes (quant-ph/0307138).

quant-ph↗

arXiv2002

Entanglement Properties of the Harmonic Chain

We study the entanglement properties of a closed chain of harmonic oscillators that are coupled via a translationally invariant Hamiltonian, where the coupling acts only on the position operators. We consider the ground state and thermal states of this system, which are Gaussian states. The entanglement properties of these states can be completely characterized analytically when one uses the logarithmic negativity as a measure of entanglement.

quant-ph↗

arXiv2002

Remarks on entanglement measures and non-local state distinguishability

We investigate the properties of three entanglement measures that quantify the statistical distinguishability of a given state with the closest disentangled state that has the same reductions as the primary state. In particular, we concentrate on the relative entropy of entanglement with reversed entries. We show that this quantity is an entanglement monotone which is strongly additive, thereby demonstrating that monotonicity under local quantum operations and strong additivity are compatible in principle. In accordance with the presented statistical interpretation which is provided, this entanglement monotone, however, has the property that it diverges on pure states, with the consequence that it cannot distinguish the degree of entanglement of different pure states. We also prove that the relative entropy of entanglement with respect to the set of disentangled states that have identical reductions to the primary state is an entanglement monotone. We finally investigate the trace-norm measure and demonstrate that it is also a proper entanglement monotone.

quant-ph↗

arXiv2002

The entanglement cost under operations preserving the positivity of partial transpose

We study the entanglement cost under quantum operations preserving the positivity of the partial transpose (PPT-operations). We demonstrate that this cost is directly related to the logarithmic negativity, thereby providing the operational interpretation for this easily computable entanglement measure. As examples we discuss general Werner states and arbitrary bi-partite Gaussian states. Equipped with this result we then prove that for the anti-symmetric Werner state PPT-cost and PPT-entanglement of distillation coincide giving the first example of a truly mixed state for which entanglement manipulation is asymptotically reversible.

quant-ph↗

arXiv2002

Asymptotic Relative Entropy of Entanglement for Orthogonally Invariant States

For a special class of bipartite states we calculate explicitly the asymptotic relative entropy of entanglement $E_R^\infty$ with respect to states having a positive partial transpose (PPT). This quantity is an upper bound to distillable entanglement. The states considered are invariant under rotations of the form $O\otimes O$, where $O$ is any orthogonal matrix. We show that in this case $E_R^\infty$ is equal to another upper bound on distillable entanglement, constructed by Rains. To perform these calculations, we have introduced a number of new results that are interesting in their own right: (i) the Rains bound is convex and continuous; (ii) under some weak assumption, the Rains bound is an upper bound to $E_R^\infty$; (iii) for states for which the relative entropy of entanglement $E_R$ is additive, the Rains bound is equal to $E_R$.

quant-ph↗

arXiv2001

Optimizing Completely Positive Maps using Semidefinite Programming

Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc. Mathematically, this problem boils down to finding a completely positive trace-preserving (CPTP) linear map that maximizes the (mean) fidelity between the map itself and the desired transformation. In this note we want to draw attention to the fact that this problem belongs to the class of so-called semidefinite programming (SDP) problems. As SDP problems are convex, it immediately follows that they do not suffer from local optima. Furthermore, this implies that the numerical optimization of the CPTP map can, and should, be done using methods from the well-established SDP field, as these methods exploit convexity and are guaranteed to converge to the real solution. Finally, we show how the duality inherent to convex and SDP problems can be exploited to prove analytically the optimality of a proposed solution. We give an example of how to apply this proof method by proving the optimality of Hardy and Song's proposed solution for the universal qubit $θ$-shifter (quant-ph/0102100).

quant-ph↗

arXiv2001

The asymptotic relative entropy of entanglement

We present an analytical formula for the asymptotic relative entropy of entanglement for Werner states of arbitrary dimension. We then demonstrate its validity using methods from convex optimization. To our knowledge, this is the first case in which the value of a subadditive entanglement measure has been obtained in the asymptotic limit.

quant-ph↗

arXiv2000

Variational Characterisations of Separability and Entanglement of Formation

In this paper we develop a mathematical framework for the characterisation of separability and entanglement of formation (EoF) of general bipartite states. These characterisations are of the variational kind, meaning that separability and EoF are given in terms of a function which is to be minimized over the manifold of unitary matrices. A major benefit of such a characterisation is that it directly leads to a numerical procedure for calculating EoF. We present an efficient minimisation algorithm and an apply it to the bound entangled 3X3 Horodecki states; we show that their EoF is very low and that their distance to the set of separable states is also very low. Within the same variational framework we rephrase the results by Wootters (W. Wootters, Phys. Rev. Lett. 80, 2245 (1998)) on EoF for 2X2 states and present progress in generalising these results to higher dimensional systems.

quant-ph↗