A depth-aware heuristic scheduler, Bona, automatically reuses dirty ancilla qubits in quantum circuits, reducing dirty-ancilla usage by up to 99% on tested benchmarks, with a claimed proof that the general borrowing problem is NP-hard.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Bona: Automatic Management of Dirty Ancilla Borrowing in Quantum Circuits
A depth-aware heuristic scheduler, Bona, automatically reuses dirty ancilla qubits in quantum circuits, reducing dirty-ancilla usage by up to 99% on tested benchmarks, with a claimed proof that the general borrowing problem is NP-hard.