A Boolean function of algebraic degree k can be computed by a Clifford+T quantum circuit with T depth ceil(log2 k), and this depth is optimal.
Jones, Phys
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimal T depth quantum circuits for implementing arbitrary Boolean functions
A Boolean function of algebraic degree k can be computed by a Clifford+T quantum circuit with T depth ceil(log2 k), and this depth is optimal.