Local Hamiltonians whose ground states are hard to approximate

DOI10.1109/FOCS.2017.46MaRDI QIDQ6946342zbMATH OpenFDO

Authors Lior Eldar, Aram W. Harrow

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2017.46

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(6)

• Circuit lower bounds for low-energy states of quantum code Hamiltonians
• NLTS Hamiltonians and strongly-explicit SoS lower bounds from low-rate quantum LDPC codes
• Stabilizer testing and magic entropy via quantum Fourier analysis
• Robust quantum entanglement at (nearly) room temperature
• Towards local testability for quantum coding
• Order p quantum Wasserstein distances from couplings

This page was built for publication: Local Hamiltonians whose ground states are hard to approximate

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946342)