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.
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.