Complex quantum systems are much simpler than they look and can be stripped of most of their parts without changing how they behave.
Physicists long assumed that every interaction in a quantum Hamiltonian was necessary to describe its behavior. This discovery proves that many of these systems are sparsifiable, meaning they can be compressed into a much smaller set of terms. This finding contradicts the standard belief that quantum matter is too complex to be easily simplified. It means that simulating the behavior of new materials will be significantly easier and faster than previously thought. This compression makes the daunting task of modeling quantum chemistry much more manageable for current computers.
Many Hamiltonians Are Sparsifiable
arXiv · 2605.02211
We study the problem of Hamiltonian sparsification: given a parameter $\varepsilon \in (0,1)$ and an $n$-qubit Hamiltonian $H$ which is the sum of $r$-local positive semi-definite (PSD) terms $H_1, \dots H_m$, our goal is to compute a sparse set $L \subseteq [m]$, along with weights $w: L \rightarrow \mathbb{R}_{\geq 0}$ such that for every state $|\psi\rangle\in \mathbb{C}^{2^n}$, $$ \sum_{i \in L} w(i) \langle \psi | H_i | \psi \rangle \in (1 \pm \epsilon) \sum_{i = 1}^m \langle \psi | H_i | \