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.
Quantum algorithms for electronic structure calculations: Particle-hole hamiltonian and optimized wave-function expansions
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
A compiler automates constant-depth GHZ and CZ chains plus logarithmic-depth CNOT chains, trading higher gate counts for reduced depth in quantum subroutines.
Fermion mappings combined with Z2 tapering and frozen-core approximations reduce qubit counts by up to 50%, gate counts by up to 27.5x, and Pauli strings by up to 2.75x for VQE on small molecules.
citing papers explorer
-
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.
-
Automated Circuit Depth Reduction of Quantum Subroutines via Compilation
A compiler automates constant-depth GHZ and CZ chains plus logarithmic-depth CNOT chains, trading higher gate counts for reduced depth in quantum subroutines.
-
Resource Estimation for VQE on Small Molecules: Impact of Fermion Mappings and Hamiltonian Reductions
Fermion mappings combined with Z2 tapering and frozen-core approximations reduce qubit counts by up to 50%, gate counts by up to 27.5x, and Pauli strings by up to 2.75x for VQE on small molecules.