Abstract
The concept of completeness is one of the most important notions in theoretical computer science. PromiseBQP-complete problems are those in PromiseBQP to which all other PromiseBQP problems can be reduced in classically probabilistic polynomial time. Studies of PromiseBQP-complete problems can deepen our understanding of both the power and limitation of efficient quantum computation. In this chapter we give a review of known PromiseBQP-complete problems, including various problems related to the eigenvalues of sparse Hamiltonians and problems about additive approximation of Jones polynomials and Tutte polynomials.
Cite
CITATION STYLE
Zhang, S. (2012). BQP-complete problems. In Handbook of Natural Computing (Vol. 3–4, pp. 1545–1571). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-92910-9_46
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
