Characterizing multi-qubit $T$-count beyond denominator-exponent certificates
Characterize the minimal $T$-count of multi-qubit Clifford+$T$ elements by a closed, possibly grammar-dependent criterion—particularly one adapted to the structure of quantum-Shannon-decomposition output—rather than only by per-instance denominator-exponent certificates.
References
Whether some closed characterization exists at $n \ge 2$, perhaps one that is grammar-dependent, keyed to the specific structure of QSD output rather than to arbitrary Clifford+$T$ words, is open, and it is the natural next target for anyone wishing to extend the single-qubit rigidity story to a genuine multi-qubit formula.
Both rest on sketches and numerics (Appendix~\ref{sec:layered}). Do they hold, and does $CCZ\,H{\otimes3}\,CCZ$ cost $14$ at three Hadamards, one above that floor, as the realizable parity sets suggest?
Is the $\mathrm{GF}(8)$ oracle's $T$-count $20$, $23$, or strictly between?
The exact $T$-count of the multi-controlled $Z$ lies between the nullity $n$ (Corollary~\ref{cor:mctoffoli}) and the known $O(n)$ constructions, and we leave it open for three reasons.
The permutation's own $\delta_T(\pi)$ is open, since Proposition~\ref{thm:reduce} applies only to circuits that implement a diagonal gate.
On $CCZ\,H{\otimes3}\,CCZ$ the floor is $13$, while the minimum coset weight over the parity sets realizable by a prefix of the Hadamard order is $14$ for all six orders, which suggests a cost of $14$ at $h=n$. The prefix sets are not exhaustive, so this remains a conjecture.