Several natural BQP-Complete problems

Details Several natural BQP-Complete problems Several natural BQP-Complete problems

2006-06-21

arxiv.org/abs/quant-ph/0606179v1

Physics

Quantum Physics

13 pages, 4 figures

Scientific paper

A 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.

Affiliated with

Also associated with

No associations

Rating

Several natural BQP-Complete problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Several natural BQP-Complete problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Several natural BQP-Complete problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-208722