Exact Non-identity check is NQP-complete

Details Exact Non-identity check is NQP-complete Exact Non-identity check is NQP-complete

2009-03-04

arxiv.org/abs/0903.0675v1

Physics

Quantum Physics

10 pages, 3 figures

Scientific paper

We define a problem "exact non-identity check": Given a classical description of a quantum circuit with an ancilla system, determine whether it is strictly equivalent to the identity or not. We show that this problem is NQP-complete. In a sense of the strict equivalence condition, this problem is different from a QMA-complete problem, non-identity check defined by D. Janzing etc. As corollaries, it is derived that exact equivalence check is also NQP-complete and that it is hard to minimize quantum resources of a given quantum gate array without changing an implemented unitary operation.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-368482