The Commuting Local Hamiltonian Problem: Relativized Evidence Against BQP-Hardness

📅 2026-09-30
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
This study investigates the open problems regarding the QMA-completeness and BQP-hardness of the Commuting Local Hamiltonian (CLH) problem. By introducing an intermediate complexity class, QIMA, and constructing a specific classical oracle, we rigorously prove the separation between QIMA and QMA. Furthermore, we demonstrate the existence of an oracle relative to which BQP^O is not contained in QIMA^O. These results provide crucial relativized evidence against the conjectures that CLH is BQP-hard or QMA-complete, thereby deepening the theoretical understanding of the structural relationships among quantum computational complexity classes.
📝 Abstract
The commuting local-Hamiltonian (CLH) problem is a restriction of the local-Hamiltonian problem, in which the terms of the Hamiltonian are required to pairwise commute. A long line of work has shown that the problem lies in $\mathsf{NP}$ for certain families of commuting local Hamiltonians. Nevertheless, there has been no formal evidence against the possibility that the general CLH problem is $\mathsf{QMA}$-complete. CLH is complete for the complexity class $\mathsf{QIMA}$, defined through quantum verifiers whose local gates commute. Therefore, CLH is $\mathsf{QMA}$-complete if and only if $\mathsf{QIMA}=\mathsf{QMA}$. In this work, we introduce a classical-oracle analogue $\mathsf{QIMA}^{\mathcal{O}}$ and construct a classical oracle $\mathcal{O}$ such that $\mathsf{BQP}^{\mathcal{O}}\not\subseteq\mathsf{QIMA}^{\mathcal{O}}$. Since $\mathsf{BQP}^{\mathcal{O}}\subseteq\mathsf{QMA}^{\mathcal{O}}$ for any classical oracle $\mathcal{O}$, this implies $\mathsf{QIMA}^{\mathcal{O}}\neq\mathsf{QMA}^{\mathcal{O}}$ for our constructed oracle. Thus, our result provides relativized evidence against the possibility that the general commuting local-Hamiltonian problem is $\mathsf{BQP}$-hard, and hence also against the possibility that it is $\mathsf{QMA}$-complete.
Problem

Research questions and friction points this paper is trying to address.

Commuting Local Hamiltonian
BQP-hardness
QMA-completeness
QIMA
Innovation

Methods, ideas, or system contributions that make the work stand out.

Commuting Local Hamiltonian
QIMA
Classical Oracle
Relativized Evidence
BQP-Hardness
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
I
Itay Shalit
Stanford University
Mark Zhandry
Mark Zhandry
NTT Research
Cryptography