arXiv subjects

Armin Uhlmann

Publications and source records attributed to Armin Uhlmann.

24 records · Page 2Linked to original sources

arXiv2000

Fidelity and Concurrence of conjugated states

We prove some new properties of fidelity (transition probability) and concurrence, the latter defined by straightforward extension of Wootters notation. Choose a conjugation and consider the dependence of fidelity or of concurrence on conjugated pairs of density operators. These functions turn out to be concave or convex roofs. Optimal decompositions are constructed. Some applications to two- and tripartite systems illustrate the general theorem.

quant-ph↗

arXiv2000

"Partial" Fidelities

For pairs, omega, rho, of density operators on a finite dimensional Hilbert space of dimension d I call k-fidelity the d - k smallest eigenvalues of | omega^1/2 rho^1/2 |. k-fidelities are jointly concave in omega, rho. This follows by representing them as infima over linear functions. For k = 0 known properties of fidelity and transition probability are reproduced. Partial fidelities characterize equivalence classes which are partially ordered in a natural way.

quant-ph↗

arXiv1999

Quantum channels of the Einstein-Podolski-Rosen kind

Assume the quantum state of a bipartite system is known. The result of local von Neumann measurements can be described by maps from one subsystem to the other one. Main properties of these antilinear ''EPR-channel'' maps are shortly discussed. Talk in honour of Jan Lopuszanski.

quant-ph↗

arXiv1998

Entropy and optimal decompositions of states relative to a maximal commutative subalgebra

To calculate the entropy of a subalgebra or of a channel with respect to a state, one has to solve an intriguing optimalization problem. The latter is also the key part in the entanglement of formation concept, in which case the subalgebra is a subfactor. I consider some general properties, valid for these definitions in finite dimensions, and apply them to a maximal commutative subalgebra of a full matrix algebra. The main method is an interplay between convexity and symmetry. A collection of helpful tools from convex analysis for the problems in question is collected in an appendix.

quant-ph↗

arXiv1998

Entanglement of Assistance

The newfound importance of ``entanglement as a resource'' in quantum computation and quantum communication compels us to quantify it in as many distinct ways as possible. Here we explore a new measure of entanglement for mixed quantum states of bipartite systems, which we name the Entanglement of Assistance. We show it to be the maximum average entanglement of all pure-state ensembles consistent with the given density matrix. In this sense, the Entanglement of Assistance is a quantity directly dual to the more standard Entanglement of Formation. With the help of lower and upper bounds, we calculate the Entanglement of Assistance for a few cases and use these results to show that it possesses the surprising property of superadditivity. We believe that this may shed some light on the question of additivity for the Entanglement of Formation.

quant-ph↗

arXiv1997

Optimizing entropy relative to a channel or a subalgebra

After recalling definition, monotonicity, concavity, and continuity of a channel's entropy with respect to a state (finite dimensional cases only), I introduce the roof property, a convex analytic tool, and show its use in treating an example. Full proofs and more examples will appear elsewhere. The relation (a la Benatti) to accessible information is mentioned.

quant-ph↗