Papers
Topics
Authors
Recent
Search
2000 character limit reached

Nearly Optimal T-Count for Symmetry-Based Quantum State Purification

Published 8 Oct 2026 in quant-ph | (2610.12098v1)

Abstract: 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 nn copies of a dd-dimensional system, we construct a Clifford+T circuit that block-encodes the symmetric projector with operator-norm error at most εε using O~(n)\widetilde{O}(n) T gates, where the tilde-OO notation suppresses polylogarithmic factors in nn, dd, and $1/ε$. Conversely, using stabilizer nullity, we prove that any Clifford+T implementation of such a block encoding with error ε<121−1/nε<\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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 3 likes about this paper.