Quantum computing and polynomial equations over the finite field Z_2

Simple item page
dc.creatorDawson, Christopher M.
dc.creatorHaselgrove, Henry L.
dc.creatorHines, Andrew P.
dc.creatorMortimer, Duncan
dc.creatorNielsen, Michael A.
dc.creatorOsborne, Tobias J.
dc.date2004-08-20
dc.date.accessioned2026-07-07T06:24:43Z
dc.date.available2026-07-07T06:24:43Z
dc.descriptionWhat 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.
dc.description7 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0408129
dc.identifierhttp://arxiv.org/abs/quant-ph/0408129
dc.identifierQuantum Information and Computation, vol. 5 (2), pp.102-112 (2005)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/96642
dc.subjectQuantum Physics
dc.titleQuantum computing and polynomial equations over the finite field Z_2
dc.typetext

Files

Collections

arXiv