Improved Product-state Approximation Algorithms for Quantum Local Hamiltonians

Watch a conference talk from TQC 2023 (Theory of Quantum Computation, Communication and Cryptography Conference) exploring advanced techniques for finding classical, additive error product-state approximations for quantum local Hamiltonians. Delve into new methodologies for estimating ground state energy and free energy in quantum many-body physics, focusing on dense systems, low threshold rank cases, and sparse graphs excluding fixed minors. Learn about the connection between product-state approximations and combinatorial graph property testing, including weak Szemerédi regularity lemmas and constant time sampling algorithms. Explore information-theoretic product-state approximation techniques, their extension to free energy calculations, and their application to asymmetric graph settings, particularly relevant for low-temperature systems and specific sparse graph families.