A category theoretic approach to asymptotic quantum channel approximation and Birkhoff's Theorem

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages. Comments and suggestions very much appreciated. Extensively revised for submission to QIP 2010. Most recent version

Scientific paper

Birkhoff's Theorem states that doubly stochastic matrices are convex combinations of permutation matrices. Quantum mechanically these matrices are doubly stochastic channels, i.e. they are completely positive maps preserving both the trace and the identity. We expect these channels to be convex combinations of unitary channels and yet it is known that some channels cannot be written that way. Recent work has suggested that $n$ copies of a single channel might approximate a mixture (convex combination) of unitaries. In this paper we show that $n(n+1)/2$ copies of a symmetric unital quantum channel may be arbitrarily-well approximated by a mixture (convex combination) of unitarily implemented channels. In addition, we prove that any extremal properties of a channel are preserved over $n$ (and thus $n(n+1)/2$) copies. The result has the potential to be completely generalized to include non-symmetric channels.

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

A category theoretic approach to asymptotic quantum channel approximation and Birkhoff's Theorem 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 A category theoretic approach to asymptotic quantum channel approximation and Birkhoff's Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A category theoretic approach to asymptotic quantum channel approximation and Birkhoff's Theorem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-526654

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