Approximate Counting and Quantum Computation

Details Approximate Counting and Quantum Computation Approximate Counting and Quantum Computation

2009-08-14

arxiv.org/abs/0908.2122v1

Combinatorics, Probability and Computing (2005) 14,737-754

Computer Science

Computational Complexity

Scientific paper

Motivated by the result that an `approximate' evaluation of the Jones polynomial of a braid at a $5^{th}$ root of unity can be used to simulate the quantum part of any algorithm in the quantum complexity class BQP, and results relating BQP to the counting class GapP, we introduce a form of additive approximation which can be used to simulate a function in BQP. We show that all functions in the classes #P and GapP have such an approximation scheme under certain natural normalisations. However we are unable to determine whether the particular functions we are motivated by, such as the above evaluation of the Jones polynomial, can be approximated in this way. We close with some open problems motivated by this work.

Affiliated with

Also associated with

No associations

Rating

Approximate Counting and Quantum Computation 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 Approximate Counting and Quantum Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Counting and Quantum Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-272839