Entanglement-saving channels

DOI10.1063/1.4942495MaRDI QIDQ2798674zbMATH OpenOpenAlexWikidataFDO

Publication date 13 April 2016

Published in Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1505.00461

Positive linear operators and order-bounded operators (47B65) Quantum coherence, entanglement, quantum correlations (81P40) Channel models (including quantum) in information and communication theory (94A40)

Abstract: The set of Entanglement Saving (ES) quantum channels is introduced and characterized. These are completely positive, trace preserving transformations which when acting locally on a bipartite quantum system initially prepared into a maximally entangled configuration, preserve its entanglement even when applied an arbitrary number of times. In other words, a quantum channel

p s i

is said to be ES if its powers

p s i^{n}

are not entanglement-breaking for all integers

n

. We also characterize the properties of the Asymptotic Entanglement Saving (AES) maps. These form a proper subset of the ES channels that is constituted by those maps which, not only preserve entanglement for all finite

n

, but which also sustain an explicitly not null level of entanglement in the asymptotic limit~

n i g h t a r r o w i n f t y

. Structure theorems are provided for ES and for AES maps which yield an almost complete characterization of the former and a full characterization of the latter.

Review text

The text investigates quantum channels (completely positive normalised maps) with respect to the amount of entanglement with a spectator system they preserve. Specifically, consider a maximally entangled state of a bipartite system and apply a quantum channel \(\varphi\) to one subsystem, i.e. subject the bipartite system to the channel \(\varphi\otimes 1\).NEWLINENEWLINEThe extreme cases are realised if the resulting state is separable (no matter what the initial maximally entangled state was) -- \(\varphi\) is called \textit{entanglement breaking} -- or if the resulting state is still maximally entangled in which case \(\varphi\) is called \textit{entanglement preserving}. Intermediate cases are in particular \textit{entanglement saving} maps, those for which \(\varphi^n\) is not entanglement breaking and \textit{asymptotic entanglement saving}, those for which this even holds in the limit \(n\to\infty\).NEWLINENEWLINEThe text characterises such maps: According to Horodecki etal., entanglement breaking channels are characterised as measuring the state in a POVM and the reconstructing the state accordingly, i.e. \(\phi = \sum_i \rho_i tr(E_i\cdot)\) while this text characterised entanglement preserving channels to be unitary (with proof which is claimed to be original).NEWLINENEWLINEFor entropy saving channels it is demonstrated that these are those which have a semipositive fixed point or which have more than one (counting multiplicity) eigenvalue on the unit circle. Asymptotic entropy saving channels are those that have at least two non-commuting eigenstates with eigenvalue on the unit circle.NEWLINENEWLINEThe paper is set in the finite dimensional situation and works out specifically the two-dimensional case of qubits.

Recommendations

Cites work

Cited in

(19)

This page was built for publication: Entanglement-saving channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2798674)