On the complexity of approximating the diamond norm

Details On the complexity of approximating the diamond norm On the complexity of approximating the diamond norm

2009-02-19

arxiv.org/abs/0902.3397v3

Physics

Quantum Physics

9 pages

Scientific paper

The diamond norm is a norm defined over the space of quantum transformations. This norm has a natural operational interpretation: it measures how well one can distinguish between two transformations by applying them to a state of arbitrarily large dimension. This interpretation makes this norm useful in the study of quantum interactive proof systems. In this note we exhibit an efficient algorithm for computing this norm using convex programming. Independently of us, Watrous recently showed a different algorithm to compute this norm. An immediate corollary of this algorithm is a slight simplification of the argument of Kitaev and Watrous [STOC 2000] that QIP is contained in EXP.

Affiliated with

Also associated with

No associations

Rating

On the complexity of approximating the diamond norm 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 On the complexity of approximating the diamond norm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the complexity of approximating the diamond norm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-260638