pith. sign in

Quantum computing and polynomial equations over the finite field Z_2

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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.

fields

quant-ph 1

years

2025 1

verdicts

UNVERDICTED 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.