Non-Identity Check Remains QMA-Complete for Short Circuits

Details Non-Identity Check Remains QMA-Complete for Short Circuits Non-Identity Check Remains QMA-Complete for Short Circuits

2009-06-30

arxiv.org/abs/0906.5416v1

Physics

Quantum Physics

8 pages

Scientific paper

The Non-Identity Check problem asks whether a given a quantum circuit is far away from the identity or not. It is well known that this problem is QMA-Complete \cite{JWB05}. In this note, it is shown that the Non-Identity Check problem remains QMA-Complete for circuits of short depth. Specifically, we prove that for constant depth quantum circuit in which each gate is given to at least $\Omega(\log n)$ bits of precision, the Non-Identity Check problem is QMA-Complete. It also follows that the hardness of the problem remains for polylogarithmic depth circuit consisting of only gates from any universal gate set and for logarithmic depth circuit using some specific universal gate set.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-440287