Back to Results
First PageMeta Content
Quantum computing / Computational complexity theory / Quantum complexity theory / Polynomials / Complexity classes / Tutte polynomial / BQP / PP / Chromatic polynomial / NP / Quantum algorithm / Time complexity


c 2005 Cambridge University Press Combinatorics, Probability and Computing, 737–754. DOI: S0963548305007005 Printed in the United Kingdom Approximate Counting and Quantum Computation
Add to Reading List

Document Date: 2006-01-18 09:22:02


Open Document

File Size: 301,84 KB

Share Result on Facebook