论文标题
来自良好量子代码的NLTS汉密尔顿人
NLTS Hamiltonians from good quantum codes
论文作者
论文摘要
NLT（没有低能的琐碎状态）的猜想[2014年]认为，存在所有非平凡复杂性低的汉密尔顿家族（通过准备状态的量子电路深度来衡量的复杂性）。我们通过表明最近发现的恒定速率和线性距离QLDPC代码的家族与NLTS当地的汉密尔顿人相对应，从而证明了这一猜想。
The NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastings [2014] posits that there exist families of Hamiltonians with all low energy states of non-trivial complexity (with complexity measured by the quantum circuit depth preparing the state). We prove this conjecture by showing that the recently discovered families of constant-rate and linear-distance QLDPC codes correspond to NLTS local Hamiltonians.
