arXiv:2609.25929
On the Computational Complexity of Guided Berry Phase Estimation
Gabriel Waite
Abstract
We prove that deciding the Berry phase for parameterised 2-local qubit Hamiltonians is BQP-complete when presented with a classical description of a guiding state, promised to overlap with the ground state of the system. Our results extend to systems with weighted Heisenberg interactions and when restricted to a 2D square or triangular lattice geometry. The techniques we develop leverage the Schrieffer--Wolff transformation, typically used in the construction of perturbative gadget reductions for local Hamiltonian problems, extending it to parameterised families of Hamiltonians. We demonstrate that there exists a choice of parameterised simulator Hamiltonians whose Berry phase well-approximates that of a parameterised target family. Using the perturbative gadget reduction framework of Oliveira and Terhal and of Schuch and Verstraete, we adapt the arguments to parameterised interactions and demonstrate the error bounds in the resulting simulation can be controlled. Additionally, we provide an explicit proof that families of 1-local Hamiltonians have a Berry phase that can be efficiently computed to inverse-polynomial precision. This establishes a complexity transition between 1-local and 2-local Hamiltonian families.
AI Summary
The paper asks whether the known BQP-completeness of guided Berry-phase estimation for $5$-local Hamiltonian paths persists with two-body interactions and geometric restrictions. The problem supplies a classical description of an efficiently preparable guiding state with inverse-polynomial ground-state overlap and asks which of two separated arcs contains the ground-state Berry phase. It establishes BQP-completeness for $2$-local qubit Hamiltonians on square or triangular lattices, including weighted Heisenberg interactions with local fields. The promises include closed $C^2$ paths, unique ground states, inverse-polynomial spectral gaps, polynomially bounded Hamiltonian norms and first two derivatives, and inverse-polynomial phase resolution. For $1$-local paths, it gives a classical polynomial-time algorithm requiring no guiding state, establishing a locality boundary between membership in P and BQP-completeness. The reductions extend perturbative-gadget simulation to parameter-dependent families using Schrieffer–Wolff transformations and Kato parallel transport. Besides pointwise simulation error $\varepsilon$, Berry-phase control tracks the error derivative $\|\partial_s E\|_\infty$ and the derivative $\kappa$ of a closed low-energy identification isometry. The phase-error bound is $O(\gamma_*^{-2}L\varepsilon+\gamma_*^{-1}\|\partial_sE\|_\infty+\gamma_*^{-1}\varepsilon+\kappa)$, where $L$ bounds target and pulled-back simulator derivatives. Polynomial penalty strengths control these errors through a constant-depth gadget chain while preserving guiding-state overlap. The one-local algorithm uses cyclic products of single-qubit projectors with discretisation error $O(1/N)$ up to polynomial factors. The results retain the gap, regularity, nondegeneracy, and guiding-state promises. Extensions to other Berry-phase estimation variants, Fermi–Hubbard models, degenerate low-energy encodings, and exponential precision remain open.
were used to assist with language and formatting, this included: grammar correction, sentence/statement restructuring, ensuring consistency in terminology throughout the manuscript, and assistance with summarising mathematical content.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 41 + 30 pages; 8 figures. v1: comments welcome