Journal article
Approximate counting and quantum computation
- Abstract:
-
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 a...
Expand abstract
- Publication status:
- Published
Actions
Authors
Bibliographic Details
- Journal:
- COMBINATORICS PROBABILITY and COMPUTING
- Volume:
- 14
- Issue:
- 5-6
- Pages:
- 737-754
- Publication date:
- 2005-01-01
- DOI:
- EISSN:
-
1469-2163
- ISSN:
-
0963-5483
- Source identifiers:
-
24579
Item Description
- Language:
- English
- Pubs id:
-
pubs:24579
- UUID:
-
uuid:0a758a31-3a26-42b8-94c7-817e55185e7e
- Local pid:
- pubs:24579
- Deposit date:
- 2012-12-19
Terms of use
- Copyright date:
- 2005
If you are the owner of this record, you can report an update to it here: Report update to this record