Reducing the Gate Count with Efficient Trotter-Suzuki Schemes
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_ | 1866912924065333248 |
|---|---|
| author | Maležič, Marko Ostmeyer, Johann |
| author_facet | Maležič, Marko Ostmeyer, Johann |
| contents | Hamiltonian formulations of lattice field theories provide access to real-time dynamics, but their simulation is difficult to implement efficiently. Trotter-Suzuki decompositions are at the center of time evolution computation, either on quantum hardware or classically, for instance with the use of tensor networks. While low-order Trotterizations remain the standard choice due to their simplicity, higher-order schemes offer the potential for improved efficiency. In this work we outline a short guide to Trotter-Suzuki schemes and their implementations in general. To help with this, we highlight new efficient schemes found by our optimization framework, and demonstrate their performance on the Heisenberg model. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_21145 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Reducing the Gate Count with Efficient Trotter-Suzuki Schemes Maležič, Marko Ostmeyer, Johann High Energy Physics - Lattice Quantum Physics Hamiltonian formulations of lattice field theories provide access to real-time dynamics, but their simulation is difficult to implement efficiently. Trotter-Suzuki decompositions are at the center of time evolution computation, either on quantum hardware or classically, for instance with the use of tensor networks. While low-order Trotterizations remain the standard choice due to their simplicity, higher-order schemes offer the potential for improved efficiency. In this work we outline a short guide to Trotter-Suzuki schemes and their implementations in general. To help with this, we highlight new efficient schemes found by our optimization framework, and demonstrate their performance on the Heisenberg model. |
| title | Reducing the Gate Count with Efficient Trotter-Suzuki Schemes |
| topic | High Energy Physics - Lattice Quantum Physics |
| url | https://arxiv.org/abs/2602.21145 |