NQP_{C} = co-C_{=}P
| dc.creator | Yamakami, Tomoyuki | |
| dc.creator | Yao, Andrew C. | |
| dc.date | 1998-12-14 | |
| dc.date | 1999-07-26 | |
| dc.date.accessioned | 2026-07-07T06:15:55Z | |
| dc.date.available | 2026-07-07T06:15:55Z | |
| dc.description | Adleman, DeMarrais, and Huang introduced the nondeterministic quantum polynomial-time complexity class NQP as an analogue of NP. Fortnow and Rogers implicitly showed that, when the amplitudes are rational numbers, NQP is contained in the complement of C_{=}P. Fenner, Green, Homer, and Pruim improved this result by showing that, when the amplitudes are arbitrary algebraic numbers, NQP coincides with co-C_{=}P. In this paper we prove that, even when the amplitudes are arbitrary complex numbers, NQP still remains identical to co-C_{=}P. As an immediate corollary, BQP differs from NQP when the amplitudes are unrestricted. | |
| dc.description | 9 pages. Accepted for Information Processing Letters, June, 1999 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9812032 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9812032 | |
| dc.identifier | Inform.Proc.Lett. 71 (1999) 63-69 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/93907 | |
| dc.subject | Quantum Physics | |
| dc.subject | Computational Complexity | |
| dc.title | NQP_{C} = co-C_{=}P | |
| dc.type | text |