English

Rounding Almost Commuting Hamiltonians

Quantum Physics 2026-05-26 v1 Other Condensed Matter Computational Complexity

Abstract

Commuting Hamiltonians lie at the boundary between classical constraint satisfaction and quantum many-body physics, exhibiting rich quantum structure while remaining more tractable than general noncommuting models. In contrast, physical Hamiltonians are rarely exactly commuting, which naturally motivates the study of almost commuting Hamiltonians. Despite their relevance, the implications of approximate commutation are only poorly understood. In this work, we show how to efficiently approximate any almost commuting 22-local qubit Hamiltonian by a commuting one: we give a locality-preserving algorithmic rounding technique that maps any 22-local Hamiltonian H=i=1mhiH=\sum_{i=1}^m h_i with [hi,hj]ϵ\|[h_i,h_j]\| \leq \epsilon to a nearby Hamiltonian H^\hat{H} whose terms pair-wise commute, and which is within overall distance HH^=O(mϵ1/6)\|H-\hat{H}\| = O(m\,\epsilon^{1/6}). As a consequence, we show that δ\delta-approximations to the ground energy for ϵ\epsilon-almost commuting 22-local qubit Hamiltonians lie in NP\mathsf{NP} when δmϵ1/6\delta \gg m\epsilon^{1/6}, extending the classical containment well beyond the commuting setting. Finally, we present two applications of our rounding framework: Gibbs sampling and fast Hamiltonian simulation for almost commuting systems.

Keywords

Cite

@article{arxiv.2605.26096,
  title  = {Rounding Almost Commuting Hamiltonians},
  author = {Islam Faisal and Anand Natarajan and Alexander Poremba},
  journal= {arXiv preprint arXiv:2605.26096},
  year   = {2026}
}

Comments

41 pages