Toward Optimal Circuit Depth for Geometrically Local Hamiltonian Simulation

@misc{shen2026toward,
  title = {{Toward Optimal Circuit Depth for Geometrically Local Hamiltonian Simulation}},
  author = {Zheyu Shen and Yusen Wu and Penghui Yao and Xiao Yuan and Yukun Zhang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.01839},
  eprint = {2610.01839},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.01839},
}

TY  - UNPB
TI  - Toward Optimal Circuit Depth for Geometrically Local Hamiltonian Simulation
AU  - Zheyu Shen
AU  - Yusen Wu
AU  - Penghui Yao
AU  - Xiao Yuan
AU  - Yukun Zhang
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2610.01839
UR  - https://arxiv.org/abs/2610.01839
AB  - Understanding the dynamics of interacting quantum systems is a central goal of quantum simulation. For geometrically local Hamiltonians, locality suggests that digital simulation should retain much of the parallelism of the underlying dynamics. For a target accuracy ε, we construct a nearest-neighbor quantum circuit that simulates the dynamics of an n-qubit, time-independent, finite-range Hamiltonian with normalized local interaction strength on a fixed-dimensional lattice for time T≥1, with circuit depth O(Tlog(nT/ε)) and gate count O(nTlog(nT/ε)). This reduces the polylogarithmic overhead of Haah, Hastings, Kothari, and Low to a single logarithm. On logarithmic-scale blocks from the Lieb--Robinson decomposition, a shallow but highly accurate implementation is essential for reducing the circuit depth. Our key observation is that spatial localization also controls the cost of high precision. In each block, the error of a constant-order product formula is compensated for by a correction, yielding exponential accuracy. The correction can be implemented with depth proportional to the block diameter, introducing no additional asymptotic depth scale beyond that required by spatial localization. Furthermore, we prove an unconditional circuit-depth lower bound for uniform XXZ Hamiltonians: at fixed evolution time T in the stated regime and sufficiently small fixed error ε, any nearest-neighbor quantum circuit simulating these dynamics requires depth Ω(log n/loglog n). This matches our O(log n) upper bound up to a doubly logarithmic factor, establishing near-optimal circuit depth for lattice Hamiltonian simulation in this regime. Together, these results clarify the role of locality and precision in determining the circuit complexity of quantum dynamics and suggest broader principles for spatially constrained quantum computation.
ER  -