We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Approximate counting and quantum computation.

Bordewich, M. and Freedman, M. and Lovász, L. and Welsh, D. (2005) 'Approximate counting and quantum computation.', Combinatorics, probability and computing., 14 (5-6). pp. 737-754.


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.

Item Type:Article
Keywords:Quantum computing, Complexity, Approximation, Jones polynomial, Tutte polynomial.
Full text:(VoR) Version of Record
Download PDF
Publisher Web site:
Publisher statement:© Cambridge University Press 2005.
Date accepted:No date available
Date deposited:21 May 2008
Date of first online publication:October 2005
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar