Quantum
Chern-number estimation: nearly optimal quantum algorithm and provable quantum speedup
Publication: quant-ph updates on arXiv.org
Author: Soichiro Imamura, Shintaro Ae, Kazuki Sakamoto, Ryu Hayakawa, Chusei Kiumi
Source published: 30/09/2026, 04:00:00 UTC
Briefing created: 01/10/2026, 03:01:18 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 01/10/2026, 02:58:24 UTC.
Briefings
A new quantum algorithm estimates the Chern number of a smooth Hamiltonian family on a 2D parameter torus using two ground-state copies and generalized quantum signal processing. The method achieves a Hamiltonian-oracle evolution time of O(LxLy/Delta_min^3), where Lx and Ly bound parameter derivatives and Delta_min is a known spectral gap. The authors prove a matching worst-case oracle lower bound, establishing optimality up to polylogarithmic factors. Local Hamiltonian families with an inverse-polynomial gap allow exact Chern-number computation in FBQP, while deciding whether the Chern number is zero or one is BQP-complete.
Key points
- The algorithm estimates the Chern number of a smooth Hamiltonian family on a 2D parameter torus using two ground-state copies and generalized quantum signal processing.
- The Hamiltonian-oracle evolution time is O(LxLy/Delta_min^3), where Lx and Ly bound parameter derivatives and Delta_min is a known spectral gap lower bound.
Context and limitations
Results apply to smooth Hamiltonian families with unique, gapped ground states; local Hamiltonian families with inverse-polynomial gaps allow exact computation in FBQP, while deciding zero-or-one status is BQP-complete.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 01/10/2026, 03:01:18 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeicrkkqmi2hwl7hwlfztvic3llvvecmjqekz36eldm45ugpbqiaovm