Show simple item record

dc.contributor.authorFenner, Stephenen_US
dc.contributor.authorGreen, Fredericen_US
dc.contributor.authorHomer, Stevenen_US
dc.date.accessioned2011-10-20T05:07:33Z
dc.date.available2011-10-20T05:07:33Z
dc.date.issued1998-04-02en_US
dc.identifier.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]en_US
dc.identifier.urihttps://hdl.handle.net/2144/1765
dc.description.abstractIt 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.en_US
dc.language.isoen_USen_US
dc.publisherBoston University Computer Science Departmenten_US
dc.relation.ispartofseriesBUCS Technical Reports;BUCS-TR-1998-008en_US
dc.titleDetermining Acceptance Possibility for a Quantum Computation is Hard for PHen_US
dc.typeTechnical Reporten_US
dc.relation.isnodouble1578*


This item appears in the following Collection(s)

Show simple item record