Metraipolis › archive › dc_0330cbf2c2c2
Nearly Optimal T-Count for Symmetry-Based Quantum State Purification — arXiv:2610.12098
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.12098
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:39:14.651Z
- SHA-256 of the archived text
390b0ff9a11ff550e395cc4d1c2ab2771b2b6872a55820c9771d08bc95b12ae6- Stable URL of this page
https://metraipolis.com/documento/dc_0330cbf2c2c2
How to cite
Nearly Optimal T-Count for Symmetry-Based Quantum State Purification — arXiv:2610.12098 — arXiv (en), https://arxiv.org/abs/2610.12098 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0330cbf2c2c2 (Metraipolis archive dc_0330cbf2c2c2, sha256 390b0ff9a11ff550e395cc4d1c2ab2771b2b6872a55820c9771d08bc95b12ae6)
BibTeX
@misc{dc0330cbf2c2c2,
title = {Nearly Optimal T-Count for Symmetry-Based Quantum State Purification — arXiv:2610.12098},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.12098},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0330cbf2c2c2; sha256 390b0ff9a11ff550e395cc4d1c2ab2771b2b6872a55820c9771d08bc95b12ae6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.12098. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Protecting quantum information from noise is essential for reliable quantum computation and quantum memories. Quantum state purification addresses this challenge by processing multiple noisy copies of an unknown quantum state to produce an output state of higher fidelity. Here we establish nearly tight upper and lower bounds on the non-Clifford resources required to implement the symmetric-projection purification protocol. For $n$ copies of a $d$-dimensional system, we construct a Clifford+T circuit that block-encodes the symmetric projector with operator-norm error at most $\epsilon$ using $\widetilde{O}(n)$ T gates, where the tilde-$O$ notation suppresses polylogarithmic factors in $n$, $d$, and $1/\epsilon$. Conversely, using stabilizer nullity, we prove that any Clifford+T implementation of such a block encoding with error $\epsilon<\frac{1}{2}\sqrt{1-1/n}$ requires at least $2n-2$ T gates, even allowing arbitrary positive normalization and clean stabilizer ancillas. Taken together, these results establish the nearly optimal scaling of non-Clifford cost with the number of copies and uncover the fundamental resource requirements for coherent symmetry projection in quantum state purification.
Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.12098 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-09T05:58:46.998Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).