NLTS Hamiltonians from good quantum codes

Abstract

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.

12 pages, 1 figure, both updated versions update funding information and clarify discussions. No technical content changed between versions

References in corpus (7)

• Coding Theorem and Strong Converse for Quantum Channels
• Balanced Product Quantum Codes
• The Overlap Gap Property: a Geometric Barrier to Optimizing over Random Structures
• An area law for 2D frustration-free spin systems
• Good Quantum LDPC Codes with Linear Time Decoders
• Circuit lower bounds for low-energy states of quantum code Hamiltonians
• Explicit Lower Bounds Against $\Omega (n)$-Rounds of Sum-of-Squares

Cited by in corpus (21)

• Symmetry-enforced many-body separability transitions
• Exponentially tighter bounds on limitations of quantum error mitigation
• Single-shot decoding of good quantum LDPC codes
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Measurement-induced phase transition in teleportation and wormholes
• Quantum memory at nonzero temperature in a thermodynamically trivial system
• Low-density parity-check codes as stable phases of quantum matter
• On the Pauli Spectrum of QAC0
• NoRA: A Tensor Network Ansatz for Volume-Law Entangled Equilibrium States of Highly Connected Hamiltonians
• How much entanglement is needed for quantum error correction?
• Bounds on the ground state energy of quantum $p$-spin Hamiltonians
• A construction of Combinatorial NLTS
• The 7 faces of quantum NP
• Approximate Quantum Codes From Long Wormholes
• Combinatorial NLTS From the Overlap Gap Property
• A distribution testing oracle separation between QMA and QCMA
• Single-shot preparation of hypergraph product codes via dimension jump
• Quantum Locally Testable Code with Constant Soundness
• Contextuality of Quantum Error-Correcting Codes
• Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
• Testing quantum satisfiability