精确的非同一性检查是NQP完成的
Exact Non-identity check is NQP-complete
摘要：
我们定义了一个问题“精确非恒等检验”：给定一个带有辅助系统的量子线路的经典描述，确定它是否严格等价于恒等式。我们证明了这个问题是NQP-完全的。在严格等价条件的意义下，该问题不同于D.作为推论，导出了精确等价性检验也是NQP-完全的，并且在不改变所实现的幺正操作的情况下，很难最小化给定量子门阵列的量子资源。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
