Quantum computing and polynomial equations over Z_2

doi:10.26421/qic5.2-2

Quantum computing and polynomial equations over Z_2

2005-05-01

0

PRE

AI

DOI：10.26421/qic5.2-2

原文链接

原文求助

摘要

En 中文

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.

Quantum computing and polynomial equations over Z_2

摘要

期刊

机构

引用论文