Universal magic state concentration
Abstract
Magic plays a dual role in quantum computation: it promotes stabilizer dynamics from efficient classical simulability to computational universality, but also challenges fault-tolerant architectures, since non-stabilizer operations are harder to protect against noise. Magic state distillation addresses this issue, yet existing protocols remain largely tailored to specific assumptions about the input or noise model and, more fundamentally, no general information-theoretic theory of optimal magic-state conversion currently exists. Here we develop such a characterization for pure qubit states through 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 impossibility of exact T-state concentration, we build six- and eight-copy protocols producing an exact CCZ state, with six copies being minimal. Their success probabilities are governed by the linearized order-three stabilizer Rényi entropy Mlin3. We show that this connection is structural: for up to nine input copies, Mlin3 fully determines the success probability of every universal Clifford-invariant stabilizer protocol. Remarkably, this characterization persists asymptotically: our constructions achieve optimal rates among universal single-output protocols and remain optimal up to logarithmic factors among arbitrary stabilizer protocols. As a corollary, we show that any unknown pure non-stabilizer state suffices for universal quantum computation via probabilistic CCZ-state injection. Together, these results identify the stabilizer Rényi entropy as a fundamental operational quantity in magic state distillation.
Related
- Universal entanglement embezzlement and divergent nonlocal magic from generic local chaotic quantum evolution
- The Magic Barrier: A Universal Feature of Quantum Thermalization
- Universal computation with magic Hamiltonians
- Magic-Free Certification of Logical Error Rates in Universal Fault-Tolerant Circuits
- The limits of magic-state distillation
BibTeX
@misc{rizzo2026universal,
title = {{Universal magic state concentration}},
author = {Jacopo Rizzo and Lorenzo Leone},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2608.13376},
eprint = {2608.13376},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.13376},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Universal magic state concentration
AU - Jacopo Rizzo
AU - Lorenzo Leone
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2608.13376
UR - https://arxiv.org/abs/2608.13376
AB - Magic plays a dual role in quantum computation: it promotes stabilizer dynamics from efficient classical simulability to computational universality, but also challenges fault-tolerant architectures, since non-stabilizer operations are harder to protect against noise. Magic state distillation addresses this issue, yet existing protocols remain largely tailored to specific assumptions about the input or noise model and, more fundamentally, no general information-theoretic theory of optimal magic-state conversion currently exists. Here we develop such a characterization for pure qubit states through 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 impossibility of exact T-state concentration, we build six- and eight-copy protocols producing an exact CCZ state, with six copies being minimal. Their success probabilities are governed by the linearized order-three stabilizer Rényi entropy M^lin_3. We show that this connection is structural: for up to nine input copies, M^lin_3 fully determines the success probability of every universal Clifford-invariant stabilizer protocol. Remarkably, this characterization persists asymptotically: our constructions achieve optimal rates among universal single-output protocols and remain optimal up to logarithmic factors among arbitrary stabilizer protocols. As a corollary, we show that any unknown pure non-stabilizer state suffices for universal quantum computation via probabilistic CCZ-state injection. Together, these results identify the stabilizer Rényi entropy as a fundamental operational quantity in magic state distillation.
ER -