Identity check is QMA-complete

Details Identity check is QMA-complete Identity check is QMA-complete

2003-05-09

arxiv.org/abs/quant-ph/0305050v1

Physics

Quantum Physics

9 pages

Scientific paper

We define the problem identity check: Given a classical description of a quantum circuit, determine whether it is almost equivalent to the identity. Explicitly, the task is to decide whether the corresponding unitary is close to a complex multiple of the identity matrix with respect to the operator norm. We show that this problem is QMA-complete. A generalization of this problem is equivalence check: Given two descriptions of quantum circuits and a description of a common invariant subspace, decide whether the restrictions of the circuits to this subspace almost coincide. We show that equivalence check is also in QMA and hence QMA-complete.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-719669