Derives explicit Clifford+T resource bounds for large Toffoli gates with one clean ancilla, demonstrating T-depth reduction via 4-input relative-phase Toffoli gates and dynamic uncomputation while keeping ancilla count low.
qSAT: Design of an efficient quantum satisfiability solver for hardware equivalence checking,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Dynamic adaptive decompositions for multi-controlled Toffoli gates reduce resource overhead via measurements and feedforward while preserving fault tolerance.
citing papers explorer
-
Adaptive Clifford+T Decomposition of Large Toffoli Gates with One Clean Ancilla
Derives explicit Clifford+T resource bounds for large Toffoli gates with one clean ancilla, demonstrating T-depth reduction via 4-input relative-phase Toffoli gates and dynamic uncomputation while keeping ancilla count low.
-
Measurement-Driven Adaptive Low-Overhead Implementation of Multi-Controlled Toffoli Gates
Dynamic adaptive decompositions for multi-controlled Toffoli gates reduce resource overhead via measurements and feedforward while preserving fault tolerance.