Quantum computing and polynomial equations over the finite field Z_2

Details Quantum computing and polynomial equations over the finite field Z_2 Quantum computing and polynomial equations over the finite field Z_2

2004-08-20

arxiv.org/abs/quant-ph/0408129v1

Quantum Information and Computation, vol. 5 (2), pp.102-112 (2005)

Physics

Quantum Physics

7 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Quantum computing and polynomial equations over the finite field Z_2 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Quantum computing and polynomial equations over the finite field Z_2, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum computing and polynomial equations over the finite field Z_2 will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-713738