发表机构
Imperial College London（帝国理工学院）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文证明并行 Toffoli 层（m 个 CCZ 门）在无 Hadamard Clifford+T 电路中需要恰好 6m+1 个 T 门，基于各向同性约束给出一般对角三级门的最优 T 计数下界，并验证了 TODD 优化器输出中多数块的最优性。
AI 中文摘要
$T$ 计数是容错 Clifford+$T$ 计算中的主要成本。我们证明，在任意无 Hadamard 的 Clifford+$T$ 电路（含干净辅助比特）中，一层 $m$ 个不相交的 CCZ 门（即并行 Toffoli 层的对角核心）恰好需要 $6m+1$ 个 $T$ 门。Campbell 和 Howard 给出了匹配的构造。据我们所知，这是首次证明该结果对一般 $m$ 是最优的（对于 $m=1$，值 $7$ 是经典的，Campbell 和 Howard 在 $m=2$ 时给出值 $13$）。在任意受控酉上，同样的下界与他们的精确计数相差不超过 1，并且该下界恢复了他们关于从单个控制位扇出 $m$ 个 Toffoli 门的 $4m+3$ 的结果。证明基于一个各向同性约束：对于纯三次相位，记录每个 $T$ 门接触哪些量子比特的向量张成一个完全各向同性子空间。一般情况下，该约束对每个对角三级门给出各向同性下界 $\delta\ge2(n-d^{\ast})-r$，该下界可在多项式时间内从相位多项式计算。该下界从不低于稳定子零度 $\nu$（在此类门上等于 $n-d^{\ast}$），并且一个单独的奇偶性论证将其在非 Clifford 纯三次门上提升到 $2\nu+1$。在 TODD 优化器对 $24$ 个基准电路的输出上，该下界证明了其 $311$ 个合并相位多项式块中的 $193$ 个在其 Hadamard 分层下是最优的（在五个优化器种子中为 $186$ 到 $193$），而零度只能证明 $113$ 个。在所述条件下，该下界也适用于内部 Hadamard 仅形成酉未计算的临时 AND 块的电路，而在自适应前馈下仅证明了 $t\ge\nu$。
英文摘要
The $T$-count is a dominant cost of fault-tolerant Clifford$+T$ computation. We prove that a layer of $m$ disjoint CCZ gates, the diagonal core of a parallel Toffoli layer, needs exactly $6m+1$ $T$ gates in every Hadamard-free Clifford$+T$ circuit with clean ancillas. Campbell and Howard gave the matching construction, and to our knowledge this is the first proof that it is optimal for general $m$. The proof rests on a novel isotropy bound. When a gate's phase polynomial has only cubic terms, the vectors recording which $T$ gates touch each qubit span a self-orthogonal subspace over $\mathbb{F}_2$, and this forces the $T$-count to be at least twice its dimension. This argument gives a lower bound, computable by Gaussian elimination, on the $T$-count of every diagonal gate in the third level of the Clifford hierarchy. It is never below the stabilizer nullity $ν$ and reaches $2ν+1$ on non-Clifford cubic gates. No bound that also holds for circuits with measurement and feedforward can do this, since such circuits implement CCZ ($ν=3$) with four $T$ gates, while the floor gives seven. It also recovers Campbell and Howard's count $4m+3$ for a fan-out of Toffolis. On the output of PyZX's TODD-based optimizer, relative to its Hadamard placement, it certifies $193$ of $311$ phase-polynomial blocks $T$-optimal, against $113$ for nullity, including $37$ of the $72$ blocks too large for exhaustive search.
Comments77 pages, 8 figures, 13 tables. v2: retitled; appendices reorganized (A-L merged into A-F); prior-art discussion of Campbell-Howard expanded; benchmark certificates added
