A new compilation framework treats quantum channels as first-class objects via ChannelIR and LindFront, achieving up to 99% gate count reduction on Lindbladian benchmarks versus unoptimized and Stinespring baselines.
Random compiler for fast hamiltonian simulation
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3representative citing papers
A structure-aware transformer trained on 3-14 qubit systems predicts Trotter orderings for 16-20 qubit 1D Heisenberg Hamiltonians with a mean fidelity gap of 0.00115 to the best of 24 candidates.
MonteQ applies Monte Carlo Tree Search in a two-level framework to optimize Pauli rotation orderings for Hamiltonian simulation, cutting CNOT counts by up to 53% versus prior compilers.
citing papers explorer
-
A Compilation Framework for Quantum Simulation of Non-unitary Dynamics
A new compilation framework treats quantum channels as first-class objects via ChannelIR and LindFront, achieving up to 99% gate count reduction on Lindbladian benchmarks versus unoptimized and Stinespring baselines.
-
Structure-Aware Transformers for Learning Near-Optimal Trotter Orderings with System-Size Generalization in 1D Heisenberg Hamiltonians
A structure-aware transformer trained on 3-14 qubit systems predicts Trotter orderings for 16-20 qubit 1D Heisenberg Hamiltonians with a mean fidelity gap of 0.00115 to the best of 24 candidates.
-
MonteQ: A Monte Carlo Tree Search Based Quantum Circuit Synthesis Framework
MonteQ applies Monte Carlo Tree Search in a two-level framework to optimize Pauli rotation orderings for Hamiltonian simulation, cutting CNOT counts by up to 53% versus prior compilers.