Quantum computing and polynomial equations over the finite field Z_2
Quantum Physics
2007-05-23 v1
Abstract
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.
Cite
@article{arxiv.quant-ph/0408129,
title = {Quantum computing and polynomial equations over the finite field Z_2},
author = {Christopher M. Dawson and Henry L. Haselgrove and Andrew P. Hines and Duncan Mortimer and Michael A. Nielsen and Tobias J. Osborne},
journal= {arXiv preprint arXiv:quant-ph/0408129},
year = {2007}
}
Comments
7 pages, 3 figures