A greedy tableau-based compiler that simplifies all Pauli rotations simultaneously and reschedules the emitted blocks cuts two-qubit gate count by 59% and two-qubit depth by 91% on average over 100 HamLib Hamiltonians.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Efficient Compilation for Hamiltonian Simulation via Global Binary Symplectic Form Simplification
A greedy tableau-based compiler that simplifies all Pauli rotations simultaneously and reschedules the emitted blocks cuts two-qubit gate count by 59% and two-qubit depth by 91% on average over 100 HamLib Hamiltonians.