2 resultados para physics.plasm-ph

em Boston University Digital Common


Relevância:

20.00% 20.00%

Publicador:

Resumo:

http://www.archive.org/details/manualofmissions014078mbp

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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.