Approximate counting and quantum computation

Journal article

Motivated by the result that an 'approximate' evaluation of the Jones polynomial of a braid at a 5th 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 normalizations. 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. © 2005 Cambridge University Press.

Authors: Bordewich, M; Freedman, M; Lovasz, L; Welsh, D

• Publication status: Published
• Journal: COMBINATORICS PROBABILITY and COMPUTING
• Volume: 14
• Issue: 5-6
• Pages: 737-754
• Publication date: 2005-01-01
• DOI: 10.1017/S0963548305007005
• EISSN: 1469-2163
• ISSN: 0963-5483
• Language: English