Near-Optimal Quantum Time Evolution Circuits via Provably Convergent Compression
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917504915341312 |
|---|---|
| author | Karacan, Erenay Le, Isabel Nha Minh D'Anna, Matteo Carasquilla, Juan Mendl, Christian B. Rojkov, Ivan |
| author_facet | Karacan, Erenay Le, Isabel Nha Minh D'Anna, Matteo Carasquilla, Juan Mendl, Christian B. Rojkov, Ivan |
| contents | Variational compression can significantly lower implementation overheads for encoding the time evolution of Hamiltonians into quantum circuits. However, they usually lack global convergence guarantees and well-established scaling behavior. In this work, we provide a recipe for choosing the initial point of such variational optimizations that guarantees convergence to a quantum circuit with near-optimal gate complexity $\mathcal{O}\left( N \, t \, \text{polylog}(N \, t/ε) \right)$ for all local and translationally invariant Hamiltonians. We demonstrate our method by encoding the globally controlled time evolution of a Heisenberg antiferromagnet on a Kagome lattice. For $N = 48$ sites, evolution time $t=0.1$ and infidelity $ε\approx1\%$, the controlled time-evolution circuit requires 960 two-qubit B gates, for which we propose a straightforward implementation scheme for ion-trap setups. Thereby, our recipe extends digital quantum simulators toward system sizes and geometries that are challenging for classical computation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_17067 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Near-Optimal Quantum Time Evolution Circuits via Provably Convergent Compression Karacan, Erenay Le, Isabel Nha Minh D'Anna, Matteo Carasquilla, Juan Mendl, Christian B. Rojkov, Ivan Quantum Physics Variational compression can significantly lower implementation overheads for encoding the time evolution of Hamiltonians into quantum circuits. However, they usually lack global convergence guarantees and well-established scaling behavior. In this work, we provide a recipe for choosing the initial point of such variational optimizations that guarantees convergence to a quantum circuit with near-optimal gate complexity $\mathcal{O}\left( N \, t \, \text{polylog}(N \, t/ε) \right)$ for all local and translationally invariant Hamiltonians. We demonstrate our method by encoding the globally controlled time evolution of a Heisenberg antiferromagnet on a Kagome lattice. For $N = 48$ sites, evolution time $t=0.1$ and infidelity $ε\approx1\%$, the controlled time-evolution circuit requires 960 two-qubit B gates, for which we propose a straightforward implementation scheme for ion-trap setups. Thereby, our recipe extends digital quantum simulators toward system sizes and geometries that are challenging for classical computation. |
| title | Near-Optimal Quantum Time Evolution Circuits via Provably Convergent Compression |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2605.17067 |