Physics Guided Generative Optimization for Trotter Suzuki Decomposition
On the map: Diffusion models → Diffusion foundations and sampling
Abstract (arXiv)
Trotter Suzuki product formulas are the standard route to Hamiltonian evolution on noisy intermediate-scale quantum (NISQ) hardware, but their accuracy depends on three coupled choices: term grouping, product-formula order, and time-step allocation. Grouping and order are discrete, which makes direct gradient optimization infeasible and forces existing compilers to rely on static heuristics. We describe P-GONE, a method that combines a conditional diffusion model (D3PM + DDPM), a graph neural network (GNN) encoder, and closed-loop REINFORCE fine-tuning to jointly learn grouping, order, and time-step optimization over a mixed discrete-continuous space. Under fidelity-matched conditions (F ≥ 0.95), the method achieves circuit depth 86 versus 1673 for Qiskit fourth-order (ungrouped, Suzuki-4), about 19.4× compression, and 141 for Paulihedral (first-order Trotter), about 1.6× compression. At T=0.90 the method also beats the Qiskit group-commuting teacher (65 vs 103, 1.6× compression), though at T=0.95 the teacher still leads -- a stratified pattern that points toward fidelity-aware fine-tuning. Under a standard depolarizing noise model, the method achieves noisy fidelity roughly 2× the Qiskit fourth-order baseline (0.743 vs 0.380). Ablation shows a clear hierarchy: order learning > time allocation > grouping. Best-of-N sampling (N=32 is a practical sweet spot) and CFG guidance give flexible fidelity-depth trade-offs at inference. The method works well on structured Hamiltonians (TFIM, Heisenberg), but random Pauli Hamiltonians fail entirely at T ≥ 0.95 -- a boundary that defines where the method applies.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Diffusion foundations and sampling, one of 14 directions in Diffusion models. Builds on 15 of its 47 references that are in the map. First posted on arXiv 13 May 2026.
Builds on
15 of 47 references.
Closest ancestors · 5
Same direction, newest first
- 2025Synthesis of discrete-continuous quantum circuits with multimodal diffusion models2 Jun
- 2022Classifier-Free Diffusion Guidance26 Jul
- 2021Structured Denoising Diffusion Models in Discrete State-Spaces7 Jul
- 2020Score-Based Generative Modeling through Stochastic Differential Equations26 Nov
- 2020Denoising Diffusion Probabilistic Models19 Jun
Other references · 10
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,200
- 2021E(n) Equivariant Graph Neural Networkscited by 965
- 2022Equivariant Diffusion for Molecule Generation in 3Dcited by 677
- 2020When and why PINNs fail to train: A neural tangent kernel perspectivecited by 634
- 2022Scientific Machine Learning through Physics-Informed Neural Networks: Where we are and What's nextcited by 608
- 2017SchNet: A continuous-filter convolutional neural network for modeling quantum interactionscited by 571
- 2019Quantum Graph Neural Networkscited by 66
- 2018Tetris: Re-architecting Convolutional Neural Network Computation for Machine Learning Acceleratorscited by 2
- 2025PHOENIX: Pauli-Based High-Level Optimization Engine for Instruction Execution on NISQ Devicescited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024AltGraph: Redesigning Quantum Circuits Using Generative Graph Models for Efficient Optimization
- 2023Quantum circuit synthesis with diffusion models
- 2026Beyond Reinforcement Learning: Fast and Scalable Quantum Circuit Synthesis
- 2026AlphaClifford: Efficient Clifford Synthesis and Transpilation with Model-based RL
- 2026One More Time: Revisiting Neural Quantum States from a Reinforcement Learning Perspective
- 2026QERNEL: a Scalable Large Electron Model
- 2026Scalable quantum simulation of continuous-time generative models via tensor networks
- 2023Tetra-AML: Automatic Machine Learning via Tensor Networks