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.
On the controlled-NOT complexity of controlled-NOT–phase circuits
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3roles
method 1polarities
use method 1representative citing papers
A new method for unitary synthesis on quantum hardware cuts CNOT gates by up to 36% and compiles up to 553 times faster than standard tools on square and heavy-hex lattices.
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
-
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.
-
Architecture-aware Unitary Synthesis
A new method for unitary synthesis on quantum hardware cuts CNOT gates by up to 36% and compiles up to 553 times faster than standard tools on square and heavy-hex lattices.
-
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.