量子PCP:关于自适应性、多证明者以及到局部哈密顿量的归约
Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
AI总结:
定义了涵盖自适应性与多证明者的量子PCP一般形式,通过到局部哈密顿量的归约证明非自适应可模拟自适应PCP,并揭示了量子PCP猜想需要非相对化技术。
摘要:
我们定义了量子PCP的一般形式,它捕捉了自适应性和多个无纠缠证明者,并给出了到具有常数承诺间隙的局部哈密顿量的量子归约的详细构造。该归约被证明是证明量子PCP性质的多功能子程序,使我们能够证明:(i) 当证明查询次数为常数时,非自适应量子PCP可以模拟自适应量子PCP。事实上,即使非自适应量子PCP仅从所有可能的索引组合的子集中均匀随机选取证明索引,这一点也成立,这回答了Aharonov、Arad、Landau和Vazirani(STOC '09)提出的一个开放问题。(ii) 如果具有常数承诺间隙的$q$-局部哈密顿量问题可以在$\mathsf{QCMA}$中解决,那么对于任意$q \in O(1)$,$\mathsf{QPCP}[q] \subseteq \mathsf{QCMA}$。(iii) 如果对于任意$k \leq \text{poly}(n)$,$\mathsf{QMA}(k)$都有一个量子PCP,那么$\mathsf{QMA}(2) = \mathsf{QMA}$,这联系了量子复杂性理论中两个存在最久的开放问题。此外,我们还证明了存在(量子)预言机,使得某些量子PCP陈述相对于它们为假。因此,任何证明量子PCP猜想的尝试都需要(量子上)非相对化的技术,这与经典PCP定理的情况相同。
英文摘要:
We define a general formulation of quantum PCPs, which captures adaptivity and multiple unentangled provers, and give a detailed construction of the quantum reduction to a local Hamiltonian with a constant promise gap. The reduction turns out to be a versatile subroutine to prove properties of quantum PCPs, allowing us to show: (i) Non-adaptive quantum PCPs can simulate adaptive quantum PCPs when the number of proof queries is constant. In fact, this can even be shown to hold when the non-adaptive quantum PCP picks the proof indices simply uniformly at random from a subset of all possible index combinations, answering an open question by Aharonov, Arad, Landau and Vazirani (STOC '09). (ii) If the $q$-local Hamiltonian problem with constant promise gap can be solved in $\mathsf{QCMA}$, then $\mathsf{QPCP}[q] \subseteq \mathsf{QCMA}$ for any $q \in O(1)$. (iii) If $\mathsf{QMA}(k)$ has a quantum PCP for any $k \leq \text{poly}(n)$, then $\mathsf{QMA}(2) = \mathsf{QMA}$, connecting two of the longest-standing open problems in quantum complexity theory. Moreover, we also show that there exist (quantum) oracles relative to which certain quantum PCP statements are false. Hence, any attempt to prove the quantum PCP conjecture requires, just as was the case for the classical PCP theorem, (quantumly) non-relativizing techniques.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。