Exact Non-identity check is NQP-complete
| dc.creator | Tanaka, Yu | |
| dc.date | 2009-03-04 | |
| dc.date.accessioned | 2026-07-07T12:48:58Z | |
| dc.date.available | 2026-07-07T12:48:58Z | |
| dc.description | 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. | |
| dc.description | 10 pages, 3 figures | |
| dc.identifier | https://arxiv.org/abs/0903.0675 | |
| dc.identifier | http://arxiv.org/abs/0903.0675 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/222243 | |
| dc.subject | Quantum Physics | |
| dc.title | Exact Non-identity check is NQP-complete | |
| dc.type | text |