Determining Acceptance Possibility for a Quantum Computation is Hard for PH
MetadataShow full item record
CitationFenner, Stephen; Green, Frederic; Homer, Steven; Pruim, Randall. "Determining Acceptance Possibility for a Quantum Computation is Hard for PH", Technical Report BUCS-1998-008, Computer Science Department, Boston University, April 2, 1998. [Available from: http://hdl.handle.net/2144/1765]
It 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.