Non-Identity Check Remains QMA-Complete for Short Circuits

Abstract

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.

8 pages

References in corpus (10)

• The power of quantum systems on a line
• N-representability is QMA-complete
• Quantum information and precision measurement
• Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations
• Parallelizing Quantum Circuits
• Quantum NP - A Survey
• Fast parallel circuits for the quantum Fourier transform
• Interacting boson problems are QMA-hard
• Identity check is QMA-complete
• 3-Local Hamiltonian is QMA-complete

Cited by in corpus (2)

• Explicit lower bounds on strong quantum simulation
• Testing non-isometry is QMA-complete