Jul 2026
Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding
It is proved that the optimal $\mathrm{T}$ count is $\Theta\left(n+\min\left\{s, m+\log(2^{n+1}/s)}\right\}\right)$.
Tongyang Li, Fengning Ou, Xin-Zhao Wang et al.
· arXiv.org · 4 citations