arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.07419quant-ph
收藏

噪声基态的近似低重量校验码和电路下界

Approximate low-weight check codes and circuit lower bounds for noisy ground states

Chinmay Nirkhe, Umesh Vazirani, Henry Yuen

摘要:

Freedman和Hastings(量子信息和计算2014)的无低能平凡态(NLTS)猜想断言存在其低能态不能由恒定深度量子线路产生的局域哈密顿量,确定了解决量子PCP猜想的基本障碍。Eldar和Harrow(计算机科学基础2017)在NLTS猜想方面取得了进展,他们证明了一个密切相关的定理,称为无低误差平凡态(NLETS)。在本文中,我们给出了一个更简单的证明NLETS定理,并使用相同的技术来建立超多项式电路大小的下界噪声基态的本地哈密顿(假设$\mathsf{QCMA} \neq \mathsf{QMA}$),解决了一个悬而未决的问题Eldar和哈罗。我们讨论了新的光,我们的结果投在NLTS和NLETS之间的关系。最后,我们的技术意味着存在$\textit{approximate quantum low-weight check (qLWC) codes}$与线性速率,线性距离,和恒定的重量检查。这些码类似于量子LDPC码,除了(1)每个粒子可以参与大量的校验,以及(2)错误仅需要被校正到保真度$1 - 1/\mathsf{poly}(n)$。这与Freedman、Meyer和Luo提出的最著名的稳定器LDPC码形成对比,后者实现了$O(\sqrt{n \log n})$的距离。在我们的研究结果中使用的主要技术是利用Feynman-Kitaev时钟结构近似嵌入由电路定义的状态的子空间作为局部哈密顿量的基空间。

英文摘要:

The No Low-Energy Trivial States (NLTS) conjecture of Freedman and Hastings (Quantum Information and Computation 2014), which asserts the existence of local Hamiltonians whose low energy states cannot be generated by constant depth quantum circuits, identifies a fundamental obstacle to resolving the quantum PCP conjecture. Progress towards the NLTS conjecture was made by Eldar and Harrow (Foundations of Computer Science 2017), who proved a closely related theorem called No Low-Error Trivial States (NLETS). In this paper, we give a much simpler proof of the NLETS theorem, and use the same technique to establish superpolynomial circuit size lower bounds for noisy ground states of local Hamiltonians (assuming $\mathsf{QCMA} \neq \mathsf{QMA}$), resolving an open question of Eldar and Harrow. We discuss the new light our results cast on the relationship between NLTS and NLETS. Finally, our techniques imply the existence of $\textit{approximate quantum low-weight check (qLWC) codes}$ with linear rate, linear distance, and constant weight checks. These codes are similar to quantum LDPC codes except (1) each particle may participate in a large number of checks, and (2) errors only need to be corrected up to fidelity $1 - 1/\mathsf{poly}(n)$. This stands in contrast to the best-known stabilizer LDPC codes due to Freedman, Meyer, and Luo which achieve a distance of $O(\sqrt{n \log n})$. The principal technique used in our results is to leverage the Feynman-Kitaev clock construction to approximately embed a subspace of states defined by a circuit as the ground space of a local Hamiltonian.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑