Entanglement-Dependent Error Bounds for Hamiltonian Simulation
Prateek P. Kulkarni

TL;DR
This paper links entanglement entropy to Hamiltonian simulation error bounds, showing that structured low-entanglement systems require significantly fewer resources for accurate quantum simulation.
Contribution
It provides the first entanglement-dependent error bounds for Trotter formulas, improving resource estimates for structured quantum systems and establishing fundamental entanglement-based separation results.
Findings
Error bounds scale with entanglement entropy $S_{max}$ instead of system size $n$.
One-dimensional area-law systems require $ ilde{ ext{O}}(n^2)$ fewer Trotter steps.
Volume-law entangled systems need $ ilde{ ext{O}}(n)$ more steps than area-law systems.
Abstract
We establish tight connections between entanglement entropy and the approximation error in Trotter-Suzuki product formulas for Hamiltonian simulation. Product formulas remain the workhorse of quantum simulation on near-term devices, yet standard error analyses yield worst-case bounds that can vastly overestimate the resources required for structured problems. For systems governed by geometrically local Hamiltonians with maximum entanglement entropy across all bipartitions, we prove that the first-order Trotter error scales as rather than the worst-case , where is the system size and is the number of Trotter steps. This yields improvements of for one-dimensional area-law systems and for two-dimensional systems. We extend these bounds to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum many-body systems · Quantum Computing Algorithms and Architecture · Quantum Information and Cryptography
