NLTS Hamiltonians from good quantum codes

DOI10.1145/3564246.3585114WikidataQ130908076 ScholiaQ130908076MaRDI QIDQ6499287

Anurag Anshu, Chinmay Nirkhe, Nikolas P. Breuckmann

Publication date: 8 May 2024

zbMATH Keywords

ground stateslocal Hamiltonianquantum PCP conjecturequantum circuit lower bounds

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
• Ramanujan graphs
• Inclusion-exclusion: exact and approximate
• The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
• Entanglement subvolume law for 2D frustration-free spin systems
• Expander codes
• A recursive approach to low complexity codes
• Coding theorem and strong converse for quantum channels
• Sum-of-squares proofs and the quest toward optimal algorithms
• Quantum LDPC Codes With Almost Linear Minimum Distance
• Balanced Product Quantum Codes
• The detectability lemma and quantum gap amplification
• Product-state approximations to quantum ground states
• A construction of combinatorial NLTS
• Complexity of Positivstellensatz proofs for the knapsack

This page was built for publication: NLTS Hamiltonians from good quantum codes