量子计算与二次符号权枚举
Quantum Computation and Quadratically Signed Weight Enumerators
摘要：
我们证明了量子计算是多项式等价于经典的概率计算与预言估计值的简单和，二次签署的重量枚举。估计这些和的问题可以被转换为承诺问题，并且有两个有趣的变体。用于无约束变体的预言机可能比量子计算更强大，而用于更多约束变体的预言机在量子计算的一位模型中是有效可解的。因此，问题涉及估计二次签署的重量枚举产生的问题，在BQP（有界误差量子多项式时间），是不同于迄今为止研究的，包括一个典型的BQP完全问题，并可用于定义和研究复杂性类和它们的关系，量子计算。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
