Work

Quantum computing and polynomial equations over Z_2

Year: 2005
Type: article
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, namely BQP/P/\#P and BQP/PP.
Language: English
Open Access status: green
OpenAlex ID: W3147651060
FWCI: 5.266
Cites: 24
Cited by: 100
Related to: 9