Quantum Computation and Quadratically Signed Weight Enumerators
<|reference_start|>Quantum Computation and Quadratically Signed Weight Enumerators: 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.<|reference_end|>
@article{knill1999quantum,
    title={Quantum Computation and Quadratically Signed Weight Enumerators},
    author={E. Knill, R. Laflamme},
    journal={arXiv preprint arXiv:quant-ph/9909094},
    year={1999},
    archivePrefix={arXiv},
    eprint={quant-ph/9909094},
    primaryClass={quant-ph cs.CC}
}