Exact Non-identity check is NQP-complete

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

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

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

     

Profile ID: LFWR-SCP-O-368482

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