Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy

Simple item page
dc.creatorFenner, Stephen
dc.creatorGreen, Frederic
dc.creatorHomer, Steven
dc.creatorPruim, Randall
dc.date1998-12-18
dc.date.accessioned2026-07-07T06:15:56Z
dc.date.available2026-07-07T06:15:56Z
dc.descriptionIt is shown that determining whether a quantum computation has a non-zero probability of accepting is at least as hard as the polynomial time hierarchy. This hardness result also applies to determining in general whether a given quantum basis state appears with nonzero amplitude in a superposition, or whether a given quantum bit has positive expectation value at the end of a quantum computation. This result is achieved by showing that the complexity class NQP of Adleman, Demarrais, and Huang, a quantum analog of NP, is equal to the counting class coC$_=$P.
dc.identifierhttps://arxiv.org/abs/quant-ph/9812056
dc.identifierhttp://arxiv.org/abs/quant-ph/9812056
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/93913
dc.subjectQuantum Physics
dc.titleDetermining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy
dc.typetext

Files

Collections

arXiv