Papers › Rise of conditionally clean ancillae for efficient quantum circuit constructions
Rise of conditionally clean ancillae for efficient quantum circuit constructions
Tanuj Khattar, Craig Gidney
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We introduce conditionally clean ancilla qubits, a new quantum resource, recently explored by [NZS24], that bridges the gap between traditional clean and dirty ancillae. Like dirty ancillae, they begin and end in an unknown state and can be borrowed from existing system qubits, avoiding the space overhead of explicit qubit allocation. Like clean ancillae, they can be treated as initialized in a known state within specific computations, thus avoiding the overhead of toggle detection required for dirty ancillae. We present new circuit constructions leveraging conditionally clean ancillae to achieve lower gate counts and depths, particularly with limited ancilla availability. Specifically, we provide constructions for: (a) n-controlled NOT using 2n Toffolis and O(logn) depth given 2 clean ancillae. (b) n-qubit incrementer using 3n Toffolis given log₂^*n clean ancillae. (c) n-qubit quantum-classical comparator using 3n Toffolis given log₂^*n clean ancillae. (d) unary iteration over [0,N) using 2.5N Toffolis given log₂^*n clean ancillae. (e) unary iteration via skew tree over [0, N) using 1.25N Toffolis given n dirty ancillae. We also introduce laddered toggle detection, a technique to replace clean ancillae with dirty ancillae in all our constructions, incurring a 2x Toffoli gate overhead. Our results demonstrate that conditionally clean ancillae are a valuable tool for quantum circuit design, especially in the resource-constrained early fault-tolerant era.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections