2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/96642What 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.7 pages, 3 figuresQuantum Physicstext