Testing non-isometry is QMA-complete

Details Testing non-isometry is QMA-complete Testing non-isometry is QMA-complete

2009-10-20

arxiv.org/abs/0910.3740v2

Physics

Quantum Physics

12 pages, 3 figures. Presentation improved, results unchanged

Scientific paper

Determining the worst-case uncertainty added by a quantum circuit is shown to be computationally intractable. This is the problem of detecting when a quantum channel implemented as a circuit is close to a linear isometry, and it is shown to be complete for the complexity class QMA of verifiable quantum computation. This is done by relating the problem of detecting when a channel is close to an isometry to the problem of determining how mixed the output of the channel can be when the input is a pure state. How mixed the output of the channel is can be detected by a protocol making use of the swap test: this follows from the fact that an isometry applied twice in parallel does not affect the symmetry of the input state under the swap operation.

Affiliated with

Also associated with

No associations

Rating

Testing non-isometry is QMA-complete 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 Testing non-isometry is QMA-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Testing non-isometry is QMA-complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-143527