Papers
Topics
Authors
Recent
Search
2000 character limit reached

Universal magic state concentration

Published 13 Aug 2026 in quant-ph | (2608.13376v1)

Abstract: Magic plays a dual role in quantum computation: it promotes stabilizer dynamics from efficient classical simulability to universality, but it presents a central challenge for fault tolerance, since non-stabilizer operations are harder to protect against noise. Magic state distillation addresses this issue; however, existing protocols typically assume prior structure in the input, such as proximity to the target or a specified noise model. Here we introduce universal magic state concentration: a fixed stabilizer protocol that converts a few copies of an unknown pure non-stabilizer qubit state into an exact target magic state. Motivated by the obstruction to exact TT-state concentration, we show that CCZ\mathrm{CCZ} states behave fundamentally differently. Six input copies are necessary and sufficient to distill one exact CCZ\mathrm{CCZ} state, with an optimal success probability determined by the linearized order-three stabilizer Rényi entropy M<sup>lin3M<sup>{\mathrm{lin}}_3. Beyond this, we show that M<sup>lin3M<sup>{\mathrm{lin}}_3 governs the optimal state dependence of any protocol up to nine input copies, and we showcase an eight-copy protocol with improved success probability. Furthermore, block repetition of our protocols yields asymptotic distillation rates that achieve optimal scaling up to logarithmic factors. As a corollary, any unknown pure qubit magic state suffices for universal quantum computation via exact CCZ\mathrm{CCZ} injection. Together, these results identify the stabilizer Rényi entropy as a fundamental operational quantity in magic state distillation.

Authors (2)

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.