Quantum Computation and Quadratically Signed Weight Enumerators

Details Quantum Computation and Quadratically Signed Weight Enumerators Quantum Computation and Quadratically Signed Weight Enumerators

1999-09-30

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

Physics

Quantum Physics

7 pages

Scientific paper

We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be cast in terms of promise problems and has two interesting variants. An oracle for the unconstrained variant may be more powerful than quantum computation, while an oracle for a more constrained variant is efficiently solvable in the one-bit model of quantum computation. Thus, problems involving estimation of quadratically signed weight enumerators yield problems in BQP (bounded error quantum polynomial time) that are distinct from the ones studied so far, include a canonical BQP complete problem, and can be used to define and study complexity classes and their relationships to quantum computation.

Affiliated with

Also associated with

No associations

Rating

Quantum Computation and Quadratically Signed Weight Enumerators 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 Computation and Quadratically Signed Weight Enumerators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Computation and Quadratically Signed Weight Enumerators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-65805