量子复杂性的一次几乎突然的跳跃
An Almost Sudden Jump in Quantum Complexity
摘要:
量子可满足性问题(QSAT)是经典NP完全问题-布尔可满足性的推广。(k,s)-QSAT是该问题的以下变体:给定一组秩为1的投影仪,非平凡地作用于n个量子比特中的k个量子比特,使得每个量子比特最多出现在s个投影仪中,决定在所有投影仪的零空间中是否存在量子态。设f*(k)是使得每个(k,s)-QSAT实例都是可满足的最大整数s。确定(k,f*(k))-QSAT在计算上很容易:根据定义,答案是“可满足的”。但是,通过稍微放宽条件,我们证明了(k,f*(k)+2)-QSAT是QMA_1-困难的,当k >=15。这是Kratochvíl等人[KST 93]经典结果的量子模拟。我们使用术语“几乎突然的跳跃”来强调(k,f*(k)+1)-QSAT的复杂度是开放的,其中经典复杂度的跳跃是突然的。我们提出的量子PCP猜想,可以说是在该领域的哈密顿复杂性的最重要的开放问题之一,这一发现的含义。我们的影响施加限制的一种可能的方式来反驳量子PCP。
英文摘要:
The Quantum Satisfiability problem (QSAT) is the generalization of the canonical NP-complete problem - Boolean Satisfiability. (k,s)-QSAT is the following variant of the problem: given a set of projectors of rank 1, acting non-trivially on k qubits out of n qubits, such that each qubit appears in at most s projectors, decide whether there exists a quantum state in the null space of all the projectors. Let f*(k) be the maximal integer s such that every (k,s)-QSAT instance is satisfiable. Deciding (k,f*(k))-QSAT is computationally easy: by definition the answer is "satisfiable". But, by relaxing the conditions slightly, we show that (k,f*(k)+2)-QSAT is QMA_1-hard, for k >=15. This is a quantum analogue of a classical result by Kratochvíl et al. [KST93]. We use the term "an almost sudden jump" to stress that the complexity of (k,f*(k)+1)-QSAT is open, where the jump in the classical complexity is known to be sudden. We present an implication of this finding to the quantum PCP conjecture, arguably one of the most important open problems in the field of Hamiltonian complexity. Our implications impose constraints on one possible way to refute the quantum PCP.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。