Prove optimality of the symmetric-projector purification protocol for arbitrary copy number and dimension
Prove that, for arbitrary numbers of input copies n and local dimensions d, the symmetric-projector purification protocol achieves the optimal probability–fidelity trade-off represented by the pair (p_n,f_n) defined by the paper’s recursive formulas.
References
Its optimality was numerically verified in Ref. for $n\leq 8$ and $d\leq 10$ and conjectured for arbitrary $n$ and $d$.
— Nearly Optimal T-Count for Symmetry-Based Quantum State Purification
(2610.12098 - Tang et al., 8 Oct 2026) in Section 2.3, subsection “Symmetric projector operator and block encoding”
Extending the lower bound to arbitrary purification maps specified by a probability--fidelity trade-off also remains open: the present optimality result concerns uniform operator-norm approximation of the symmetric projector.
— Nearly Optimal T-Count for Symmetry-Based Quantum State Purification
(2610.12098 - Tang et al., 8 Oct 2026) in Section 5, Summary