Quantum
Learning Trotter Orderings for Heisenberg Hamiltonians with a Ranking Transformer
Publication: quant-ph updates on arXiv.org
Author: Shamminuj Aktar, Reuben Tate, Stephan Eidenbenz
Source published: 29/09/2026, 04:00:00 UTC
Briefing created: 29/09/2026, 05:16:37 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 29/09/2026, 05:13:24 UTC.
Briefings
A new physics-aware ranking transformer learns optimal term orderings for Heisenberg Hamiltonians using simulated annealing as a reference. The model predicts Trotter orderings by assigning scores to terms and sorting them, achieving median gaps below 10^-4 on 16-20 qubit chains and matching fidelity to SA references on 34% of first-order cases. Training uses commutator-biased attention and anticommutation-weighted losses on 14-qubit chains and 12-qubit lattices, with separate models for first and second-order Trotterization.
Key points
- The model learns optimal term orderings for Heisenberg Hamiltonians using a physics-aware ranking transformer that assigns scalar scores to terms and predicts orderings by sorting them.
- At first order, the model predicts orderings that match fidelity to simulated annealing references on 34% of first-order chain instances and 8% of second-order instances.
Context and limitations
Results are limited to 1D and 2D Heisenberg-style Hamiltonians; evaluation uses simulated annealing as a reference for fidelity comparison; models were trained on chains up to 14 qubits and lattices up to 12 qubits.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 29/09/2026, 05:16:37 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeiaonhjx3h767lz2oiktn3a2m3kth62qczaalyzi7zsa3243tdyut4