Several natural BQP-Complete problems

Simple item page
dc.creatorWocjan, Pawel
dc.creatorZhang, Shengyu
dc.date2006-06-21
dc.date.accessioned2026-07-07T07:19:06Z
dc.date.available2026-07-07T07:19:06Z
dc.descriptionA central problem in quantum computing is to identify computational tasks which can be solved substantially faster on a quantum computer than on any classical computer. By studying the hardest such tasks, known as BQP-complete problems, we deepen our understanding of the power and limitations of quantum computers. We present several BQP-complete problems, including Local Hamiltonian Eigenvalue Sampling and Phase Estimation Sampling. Different than the previous known BQP-complete problems (the Quadratically Signed Weight Enumerator problem [KL01] and the Approximation of Jones Polynomials [FKW02, FLW02, AJL06]), our problems are of a basic linear algebra nature and are closely related to the well-known quantum algorithm and quantum complexity theories.
dc.description13 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0606179
dc.identifierhttp://arxiv.org/abs/quant-ph/0606179
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/114539
dc.subjectQuantum Physics
dc.titleSeveral natural BQP-Complete problems
dc.typetext

Files

Collections

arXiv