The static selector for graph-local Hamiltonians vanishes exactly at decomposition classes in which the Hamiltonian is a sum of one-site terms and graph-supported two-site terms. We give a sufficient operator-algebraic criterion for uniqueness of such an admissible-support realization, and hence for exact identification of the underlying Hilbert-space decomposition on the physical quotient. For an exact graph-local realization and an omitted site, we study the unital *-algebra generated by all one-site and graph-supported two-site terms that avoid that site. A seed-and-propagation theorem shows that if full one-site matrix control is available at a seed vertex in each connected component of the omitted-site complement and operator-Schmidt coefficients propagate that control along complement edges, then this complement algebra is the full matrix algebra on the omitted-site complement, so the omitted one-site algebra is recovered exactly as a commutant. A pairwise rigidity theorem then shows that two complement-generated exact realizations with the same recovered site-family differ only by local basis changes and subsystem permutation. Consequently, any exactly graph-local Hamiltonian with frame-stable site reconstruction has a unique admissible-support realization and exact zero-set identifiability. The hypotheses are sufficient and are stated entirely in terms of the exact graph-local realization.
For classical lattice systems, the Dobrushin-Lanford-Ruelle theory of boundary conditions states that the restriction of a global equilibrium state to a subsystem can be obtained as an integral over equilibrium states of the subsystem alone. The Hamiltonians for the subsystem are obtained by fixing a configuration for the variables in the complement of the subsystem, or more generally, by evaluating the full interaction Hamiltonian with respect to a state for the complement. We provide examples showing that the quantum mechanical version of this statement is false. It fails even if the subsystem is classical, but embedded into a quantum environment. We suggest an alternative characterization of the local restrictions of global equilibrium states by inequalities involving only local data.
Despite having an unnatural definition,
StoqMA plays a central role in Hamiltonian complexity, e.g., in the classification theorem of the complexity of Hamiltonians by Cubitt and Montanaro (SICOMP 2016). Moreover, it lies between the two randomized extensions of
NP,
MA and
AM. Therefore, understanding the exact power of
StoqMA (and hopefully collapsing it with more natural complexity classes) is of great interest for different reasons. In this work, we take a step further in understanding this complexity class by showing that the Stoquastic Sparse Hamiltonians problem (
StoqSH) is in
StoqMA. Since Stoquastic Local Hamiltonians are
StoqMA-hard, this implies that
StoqSH is
StoqMA-complete. We complement this result by showing that the separable version of
StoqSH is
StoqMA(2)-complete, where
StoqMA(2) is the version of
StoqMA that receives two unentangled proofs.