EXACT NON-IDENTITY CHECK IS NQP-COMPLETE
2010 ◽
Vol 08
(05)
◽
pp. 807-819
Keyword(s):
To understand quantum gate array complexity, we define a problem named exact non-identity check, which is a decision problem to determine whether a given classical description of a quantum circuit is strictly equivalent to the identity or not. We show that the computational complexity of this problem is non-deterministic quantum polynomial-time (NQP)-complete. As corollaries, it is derived that exact non-equivalence check of two given classical descriptions of quantum circuits is also NQP-complete and that minimizing the number of quantum gates for a given quantum circuit without changing the implemented unitary operation is NQP-hard.
2005 ◽
Vol 03
(03)
◽
pp. 463-473
◽
2019 ◽
Vol 475
(2226)
◽
pp. 20180767
◽
2019 ◽
Vol 23
(4)
◽
pp. 726-734
2016 ◽
Vol 94
(2)
◽
pp. 150-157
◽
Keyword(s):
Keyword(s):
Keyword(s):