Structure-Aware Transformers for Learning Near-Optimal Trotter Orderings with System-Size Generalization in 1D Heisenberg Hamiltonians
Shamminuj Aktar, Reuben Tate, Stephan Eidenbenz

TL;DR
This paper introduces a transformer-based model that predicts near-optimal Trotter orderings for 1D Heisenberg Hamiltonians, enabling system-size generalization and reducing computational costs in quantum simulations.
Contribution
It presents the first learned model for Trotter ordering that generalizes across system sizes, trained on small systems to predict orderings for larger ones without fidelity evaluation.
Findings
Model achieves a mean fidelity gap of 0.00115 on out-of-range systems.
Generalization improves when training includes systems up to 8 qubits.
First application of machine learning to Trotter ordering with cross-system size generalization.
Abstract
Trotterization is a standard approach for simulating quantum time evolution on quantum computers, where the Hamiltonian is split into local terms and each term is applied in sequence. The order of these terms affects the fidelity of the simulation when they do not commute, so the choice of ordering directly impacts the accuracy of the simulation. We study this problem for one-dimensional XXZ Heisenberg Hamiltonians using a structured set of 24 candidate orderings derived from colorings of the Hamiltonian's commutation graph and their group permutations. Finding the best candidate for large systems becomes prohibitive because fidelity evaluation is computationally expensive. In this work, we train a transformer encoder on smaller systems to predict the best candidate ordering for larger systems directly from Hamiltonian and Trotter-configuration features, without computing candidate…
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.
