Characterizing Operations Preserving Separability Measures via Linear Preserver Problems

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, typos corrected, references added, proof of Theorem 4.3 simplified and clarified

Scientific paper

10.1080/03081087.2011.596540

We use classical results from the theory of linear preserver problems to characterize operators that send the set of pure states with Schmidt rank no greater than k back into itself, extending known results characterizing operators that send separable pure states to separable pure states. We also provide a new proof of an analogous statement in the multipartite setting. We use these results to develop a bipartite version of a classical result about the structure of maps that preserve rank-1 operators and then characterize the isometries for two families of norms that have recently been studied in quantum information theory. We see in particular that for k at least 2 the operator norms induced by states with Schmidt rank k are invariant only under local unitaries, the swap operator and the transpose map. However, in the k = 1 case there is an additional isometry: the partial transpose map.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Characterizing Operations Preserving Separability Measures via Linear Preserver Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Characterizing Operations Preserving Separability Measures via Linear Preserver Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Characterizing Operations Preserving Separability Measures via Linear Preserver Problems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-188925

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.