arXiv subjects

M. Reimpell

Publications and source records attributed to M. Reimpell.

5 recordsLinked to original sources

arXiv2008

Lower bounds on entanglement measures from incomplete information

How can we quantify the entanglement in a quantum state, if only the expectation value of a single observable is given? This question is of great interest for the analysis of entanglement in experiments, since in many multiparticle experiments the state is not completely known. We present several results concerning this problem by considering the estimation of entanglement measures via Legendre transforms. First, we present a simple algorithm for the estimation of the concurrence and extensions thereof. Second, we derive an analytical approach to estimate the geometric measure of entanglement, if the diagonal elements of the quantum state in a certain basis are known. Finally, we compare our bounds with exact values and other estimation methods for entanglement measures.

quant-ph↗

arXiv2007

Estimating entanglement measures in experiments

We present a method to estimate entanglement measures in experiments. We show how a lower bound on a generic entanglement measure can be derived from the measured expectation values of any finite collection of entanglement witnesses. Hence witness measurements are given a quantitative meaning without the need of further experimental data. We apply our results to a recent multi-photon experiment [M. Bourennane et al., Phys. Rev. Lett. 92, 087902 (2004)], giving bounds on the entanglement of formation and the geometric measure of entanglement in this experiment.

quant-ph↗

arXiv2006

A Meaner King uses Biased Bases

The mean king problem is a quantum mechanical retrodiction problem, in which Alice has to name the outcome of an ideal measurement on a d-dimensional quantum system, made in one of (d+1) orthonormal bases, unknown to Alice at the time of the measurement. Alice has to make this retrodiction on the basis of the classical outcomes of a suitable control measurement including an entangled copy. We show that the existence of a strategy for Alice is equivalent to the existence of an overall joint probability distribution for (d+1) random variables, whose marginal pair distributions are fixed as the transition probability matrices of the given bases. In particular, for d=2 the problem is decided by John Bell's classic inequality for three dichotomic variables. For mutually unbiased bases in any dimension Alice has a strategy, but for randomly chosen bases the probability for that goes rapidly to zero with increasing d.

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↗

arXiv2005

Iterative Optimization of Quantum Error Correcting Codes

We introduce a convergent iterative algorithm for finding the optimal coding and decoding operations for an arbitrary noisy quantum channel. This algorithm does not require any error syndrome to be corrected completely, and hence also finds codes outside the usual Knill-Laflamme definition of error correcting codes. The iteration is shown to improve the figure of merit "channel fidelity" in every step.

quant-ph↗