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.
Classical simulation of noisy random circuits from exponential decay of correlation
Pritzker School of Molecular Engineering, The University of Chicago(芝加哥大学普里茨克分子工程学院);Department of Computer Science, University of Chicago(芝加哥大学计算机科学系);Department of Physics, Korea Advanced Institute of Science and Technology(韩国科学技术院物理系);AWS Center for Quantum Computing(亚马逊云科技量子计算中心)
Approximation Methods for Simulation and Equivalence Checking of Noisy Quantum Circuits
University of Chinese Academy of Sciences(中国科学院大学);School of Informatics, University of Edinburgh(爱丁堡大学信息学院);Centre for Quantum Software and Information, University of Technology Sydney(悉尼科技大学量子软件与信息研究中心)
Enhancing classical simulation with noisy quantum devices
Yau Mathematical Sciences Center, Tsinghua University(丘成桐数学科学中心,清华大学);Department of Mathematics, Tsinghua University(清华大学数学系);Yanqi Lake Beijing Institute of Mathematical Sciences and Applications(北京雁栖湖应用数学研究院)
Parallel classical simulation of noisy shallow circuits: no quantum advantage in 1D
Technical University of Munich(慕尼黑工业大学);Munich Center for Quantum Science and Technology(慕尼黑量子科学与技术中心);National University of Singapore(新加坡国立大学);Centre for Quantum Technologies(量子技术中心)
Limitations of Noisy Geometrically Local Quantum Circuits
University of Maryland(马里兰大学);Joint Center for Quantum Information & Computer Science, University of Maryland and NIST(马里兰大学与美国国家标准与技术研究院联合量子信息与计算中心);IBM T. J. Watson Research Center(IBM托马斯·J·沃森研究中心)
Classical simulation of a quantum circuit with noisy magic inputs
Graduate School of Quantum Science and Technology, Korea Advanced Institute of Science and Technology (KAIST)(韩国科学技术院量子科学与技术研究生院);Department of Physics, Korea Advanced Institute of Science and Technology (KAIST)(韩国科学技术院物理系)
Sampling (noisy) quantum circuits through randomized rounding
IBM France(法国国际商业机器公司);Univ Lyon, ENS Lyon, UCBL, Inria, LIP(里昂大学、巴黎高等师范学校里昂分校、里昂第一大学、法国国家信息与自动化研究所、计算与图像实验室);Department of Mathematical Sciences, University of Copenhagen(哥本哈根大学数学科学系)
Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits
Lomonosov Moscow State University(莫斯科国立大学);University of Science and Technology of China(中国科学技术大学);Peking University(北京大学);Southern University of Science and Technology(南方科技大学)
Erasure surface code circuit without mid-circuit erasure checks
Yale Quantum Institute, Yale University(耶鲁量子研究所,耶鲁大学);Department of Applied Physics, Yale University(耶鲁大学应用物理系);Department of Physics, University of Massachusetts, Amherst(马萨诸塞大学阿默斯特分校物理系);Department of Physics, University of Toronto(多伦多大学物理系)
A polynomial-time classical sampler for noisy quantum circuits from statistical mechanics
University of Maryland, College Park(马里兰大学帕克分校);Electrical & Computer Engineering Department, UCLA(加州大学洛杉矶分校电气与计算机工程系);Department of Electrical and Computer Engineering, Princeton University(普林斯顿大学电气与计算机工程系);QuEra Computing Inc.(QuEra计算公司);Department of Physics, Stanford University(斯坦福大学物理系)
Estimates of loss function concentration in noisy parametrized quantum circuits
University of Trieste(的里雅斯特大学);Istituto Nazionale di Fisica Nucleare, Trieste Section(意大利国家核物理研究所,的里雅斯特分部);European Organization for Nuclear Research (CERN)(欧洲核子研究组织(CERN))