PDQP/qpoly = ALL
PDQP/qpoly = ALL
摘要：
我们表明，结合两种不同的假设增强量子计算-即量子建议和非崩溃测量-将让量子计算机在多项式时间内解决任何决策问题，即使没有增强本身产生奢侈的权力。这补充了Raz的一个相关结果。证明使用本地可解码的代码。
英文摘要：
We show that combining two different hypothetical enhancements to quantum computation---namely, quantum advice and non-collapsing measurements---would let a quantum computer solve any decision problem whatsoever in polynomial time, even though neither enhancement yields extravagant power by itself. This complements a related result due to Raz. The proof uses locally decodable codes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
