Quantum computing and polynomial equations over Z_2 (pp102-112)
         Christopher M. Dawson, Andrew P. Hines, Duncan Mortimer, Henry L. Haselgrove, Michael A. Nielsen, and Tobias J. Osborne
          doi: https://doi.org/10.26421/QIC5.2-2
Abstracts: What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field Z_2. This connection allows simple proofs to be given for two known relationships between quantum and classical complexity classes, namely BQP/P/\#P and BQP/PP.
Key words: quantum computing, complexity, polynomials