NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes

Louis Golowich, Tali Kaufman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Recent constructions of the first asymptotically good quantum LDPC (qLDPC) codes led to two breakthroughs in complexity theory: The NLTS (No Low-Energy Trivial States) theorem (Anshu, Breuckmann, and Nirkhe, STOC 23), and explicit lower bounds against a linear number of levels of the Sum-of-Squares (SoS) hierarchy (Hopkins and Lin, FOCS 22). In this work, we obtain improvements to both of these results using qLDPC codes of low rate: Whereas Anshu et al. only obtained NLTS Hamiltonians from qLDPC codes of linear dimension, we show the stronger result that qLDPC codes of arbitrarily small positive dimension yield NLTS Hamiltonians. The SoS lower bounds of Hopkins and Lin are only weakly explicit because they require running Gaussian elimination to find a nontrivial codeword, which takes polynomial time. We resolve this shortcoming by introducing a new method of planting a strongly explicit nontrivial codeword in linear-distance qLDPC codes, which in turn yields strongly explicit SoS lower bounds. Our "planted" qLDPC codes may be of independent interest, as they provide a new way of ensuring a qLDPC code has positive dimension without resorting to parity check counting, and therefore provide more flexibility in the code construction.

Original languageEnglish
Title of host publication15th Innovations in Theoretical Computer Science Conference, ITCS 2024
EditorsVenkatesan Guruswami
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959773096
DOIs
StatePublished - Jan 2024
Event15th Innovations in Theoretical Computer Science Conference, ITCS 2024 - Berkeley, United States
Duration: 30 Jan 20242 Feb 2024

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume287

Conference

Conference15th Innovations in Theoretical Computer Science Conference, ITCS 2024
Country/TerritoryUnited States
CityBerkeley
Period30/01/242/02/24

Keywords

  • NLTS Hamiltonian
  • Quantum LDPC code
  • Quantum PCP
  • Sum-of-squares lower bound

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes'. Together they form a unique fingerprint.

Cite this