arXiv:2609.35978
Chern-number estimation: nearly optimal quantum algorithm and provable quantum speedup
Soichiro Imamura, Shintaro Ae, Kazuki Sakamoto, Ryu Hayakawa, Chusei Kiumi
Abstract
Topological phases of matter are characterized by global properties of quantum states beyond conventional local order parameters. The Chern number is a central invariant in this characterization, linking the geometry of quantum states to robust physical observables and making its determination key to understanding quantum matter. We construct a nearly optimal quantum algorithm for estimating the Chern number of a smooth Hamiltonian family over a two-dimensional parameter torus with a unique, gapped ground state, including interacting many-body systems. The algorithm transports and reuses two ground-state copies prepared at a single reference point and uses generalized quantum signal processing to coherently accumulate geometric phases. It achieves a Hamiltonian-oracle evolution time of $\tilde{O}(L_xL_y/Δ_{\min}^3)$, where $L_x,L_y$ bound the parameter derivatives of the Hamiltonian and $Δ_{\min}$ is a known spectral-gap lower bound. We prove a matching worst-case oracle lower bound, even when the Chern number is promised to be zero or one, establishing optimality up to polylogarithmic factors. For local Hamiltonian families with an inverse-polynomial gap and a supplied guiding state, exact Chern-number computation is in $\mathsf{FBQP}$ and is $\mathsf{BQP}$-hard, and merely deciding whether the Chern number is zero or one is already $\mathsf{BQP}$-complete. These results establish how efficiently quantum computers can estimate a quantized topological invariant and provide evidence for quantum advantage in characterizing topological phases.
AI Summary
The paper asks how efficiently quantum computers can determine an integer Chern number, and whether quantization makes this task classically tractable. It considers smooth Hamiltonian families on a two-dimensional parameter torus with a unique ground state, a supplied gap lower bound $\Delta_{\min}$, and derivative bounds $\|\partial_{k_\mu}H\|\leq L_\mu$, including interacting many-body families. The algorithm returns the exact integer with probability at least $1-\eta$ using Hamiltonian-oracle evolution time $\widetilde O(L_xL_y/\Delta_{\min}^3)$. A finite mesh of $\Theta(L_xL_y/\Delta_{\min}^2)$ cells expresses the invariant exactly through principal Bargmann phases. Generalized quantum signal processing implements ground-state reflections, direct rotations, and fractional loop phases. Two ground-state copies prepared at one reference point are transported and reused as each other’s energy references; fractional phase accumulation and inverse Fourier readout recover the integer. A continuous-time adversary argument using independently encoded topological defects proves a matching worst-case lower bound, including under the promise $C\in\{0,1\}$. For succinct constant-local descriptions with polynomial norm and derivative bounds, inverse-polynomial gap, and a supplied guiding-state circuit, exact computation lies in $\mathsf{FBQP}$ and is $\mathsf{BQP}$-hard; the binary restriction is $\mathsf{BQP}$-complete. Hardness uses a Feynman–Kitaev construction whose acceptance probability controls an effective QWZ mass, with Schrieffer–Wolff bounds preserving the invariant. Oracle-time bounds exclude state preparation and gate costs. Hardness is worst-case and does not establish hardness for geometrically local boundary-twist families. Degenerate ground manifolds and practical advantage over classical methods remain outside the results.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.