Structure-aware approximate compilation for Hamiltonian dynamics on NISQ devices produces shallower circuits with higher observed fidelity than generic exact synthesis.
Faster and shorter synthesis of Hamiltonian simulation circuits
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
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.
The Shortest Path in Pauli Forest algorithm decomposes Pauli exponentials into quantum circuits with improved CNOT counts and runtime for random cases and molecular ansatze.
citing papers explorer
-
Hardware-Efficient Hamiltonian Simulation via Trotter-Initialized Variational Optimization with Native Placement
Structure-aware approximate compilation for Hamiltonian dynamics on NISQ devices produces shallower circuits with higher observed fidelity than generic exact synthesis.
-
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.
-
Shortest Path in Pauli Forest -- An Algorithm for Decomposing Pauli Exponentials to Quantum Circuits
The Shortest Path in Pauli Forest algorithm decomposes Pauli exponentials into quantum circuits with improved CNOT counts and runtime for random cases and molecular ansatze.