Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification
quant-ph
Submitted: 2026-08-12
Updated: 2026-10-29
Comments: 17 pages, 10 figures, 6 tables, with appendices; Open-sourced on GitHub; A conference paper at PPoPP 2027
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
- Pauli Network Circuit Synthesis with Reinforcement Learning
- A Quantum Approximate Optimization Algorithm
- A generic multi-Pauli compilation framework for limited connectivity
- Faster and shorter synthesis of Hamiltonian simulation circuits
- Non-Clifford Fusion: T-Gate Optimization for Quantum Simulation
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements