Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.13376

Universal magic state concentration

Jacopo Rizzo, Lorenzo Leone

quant-phSubmitted Aug 13, 2026• Announced Aug 14, 2026• 2 citations• Revised Sep 30, 2026 (v2)
v1 · Aug 13, 2026v2 · Sep 30, 2026
arXivHTMLPDF

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 $\mathrm{CCZ}$ state, with six copies being minimal. Their success probabilities are governed by the linearized order-three stabilizer Rényi entropy $M^{\mathrm{lin}}_3$. We show that this connection is structural: for up to nine input copies, $M^{\mathrm{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 $\mathrm{CCZ}$-state injection. Together, these results identify the stabilizer Rényi entropy as a fundamental operational quantity in magic state distillation.

Related papers

Extremizing Measures of Magic on Pure States by Clifford-stabilizer States

Muhammad Erew, Moshe Goldstein

Magic states enable universal, fault-tolerant quantum computation within the stabilizer framework. Their non-stabilizerness supplies the resource needed to bypass the Eastin-Knill theorem while allowing fault-tolerant distillation. Although many measures of magic exist, not every nonzero-magic state is known to be distillable, and many of currently known distillable states are special cases of Clifford-stabilizer states, defined as pure states uniquely stabilized by finite Clifford subgroups. We develop a general framework for group-covariant functionals on Hermitian operators, introducing the notions of $G$-stabilizer spaces, states, and codes for arbitrary finite subgroups $G \subset \mathrm{U}(\mathcal{H})$. We define analytic families of $G$-covariant functionals and prove that any $G$-invariant pure state is extremal for a broad class of derived functionals, including symmetric, max-type, and Rényi-type functionals, whenever the underlying family is $G$-covariant. This extremality holds for purity-preserving variations orthogonal to the stabilized subspace. Specializing to the Pauli and Clifford groups, we recover the extremality structure of canonical magic measures such as mana, stabilizer Rényi entropies, generalized Rényi entropies, and stabilizer fidelity, and show that Clifford-stabilizer states extremize them. We classify such states for qubits, qutrits, ququints, and two-qubit systems, identifying new candidates for magic distillation. We further propose an inefficient distillation protocol for a two-qubit magic state with stabilizer fidelity exceeding standard benchmarks, and conjecture that SIC-POVM fiducial states are Clifford-stabilizer states.

quant-pharXiv:2512.19657•Dec 23, 2025•3 citations

Computational entanglement distillation beyond pure states: efficient protocols and fundamental limitations

Takeru Utsumi, Jacopo Rizzo, Ryuji Takagi +1 more

The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.

quant-pharXiv:2610.06787•Oct 6, 2026•0 citations

Universal Quantum Computation Based on a Magic States Distillation

Sergey B. Bravyi, Alexei Kitaev

We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state $|0>$, and qubit measurement in the computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state $\\rho$, which should be regarded as a parameter of the model. Our goal is to determine for which $\\rho$ universal quantum computation (UQC) can be efficiently simulated. To answer this question, we construct purification protocols that consume several copies of $\\rho$ and produce a single output qubit with higher polarization. The protocols allow one to increase the polarization only along certain ``magic'' directions. If the polarization of $\\rho$ along a magic direction exceeds a threshold value (about 65%), the purification asymptotically yields a pure state, which we call a magic state. We show that the Clifford group operations combined with magic states preparation are sufficient for UQC. The connection of our results with the Gottesman-Knill theorem is discussed.

•Mar 3, 2004•6 citations

A Nonstabilizerness Resource Law for Universal Quantum State Purification

Keming He, Enji Xiong, Xin Wang

Quantum state purification aims to recover higher-fidelity quantum states from multiple noisy copies and is a fundamental primitive for quantum information processing. Magic resources enable operations beyond classically simulable dynamics and are central to universal fault-tolerant quantum computation. Recent no-go results show that classically simulable operations cannot achieve a nontrivial universal fidelity gain. This motivates a quantitative theory of the magic required for purification at prescribed success probability and target fidelity. For universal purification with two input copies, we prove an exact linear mana law in odd dimensions and a two-sided linear robustness law for multi-qubit systems, which becomes exact for a single qubit. We also identify an explicit successful purification map that makes the tradeoff transparent. These results establish universal purification as a task obeying a quantitative magic-fidelity law and link magic resources to error mitigation and fault-tolerant quantum information processing.

quant-pharXiv:2607.08626•Jul 10, 2026•1 citation

The limits of magic-state distillation

Llorenç Balada Gaggioli, Jakub Mareček

Magic-state factories are a major cost of fault-tolerant quantum computing, yet how few noisy inputs they need is known only for restricted protocols. We show that, for tolerating input faults, any stabilizer protocol, however adaptive, postselected or multistage, is no better than a projection onto one stabilizer code, and that for rational targets a fault pattern is harmful exactly when its complement is. Searches over all codes show that quadratic distillation of one T state needs exactly nine inputs and that the eight-input CCZ factory is optimal. At order $d$, one T state needs $n\geq2d$.

quant-pharXiv:2610.31115•Oct 23, 2026•0 citations

Qutrit magic state distillation

Hussain Anwar, Earl T. Campbell, Dan E. Browne

Magic state distillation (MSD) is a purification protocol that plays an important role in fault-tolerant quantum computation. Repeated iteration of the steps of an MSD protocol generates pure single non-stabilizer states, or magic states, from multiple copies of a mixed resource state using stabilizer operations only. Thus mixed resource states promote the stabilizer operations to full universality. MSD was introduced for qubit-based quantum computation, but little has been known concerning MSD in higher-dimensional qudit-based computation. Here, we describe a general approach for studying MSD in higher dimensions. We use it to investigate the features of a qutrit MSD protocol based on the five-qutrit stabilizer code. We show that this protocol distils non-stabilizer magic states, and identify two types of states that are attractors of this iteration map. Finally, we show how these states may be converted, via stabilizer circuits alone, into a state suitable for state-injected implementation of a non-Clifford phase gate, enabling non-Clifford unitary computation.

arXiv:1202.2326•New Journal of Physics•Jun 7, 2012•110 citations
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 TTT-state concentration, we build six- and eight-copy protocols producing an exact CCZ\mathrm{CCZ}CCZ state, with six copies being minimal. Their success probabilities are governed by the linearized order-three stabilizer Rényi entropy M3linM^{\mathrm{lin}}_3M3lin​. We show that this connection is structural: for up to nine input copies, M3linM^{\mathrm{lin}}_3M3lin​ 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\mathrm{CCZ}CCZ-state injection. Together, these results identify the stabilizer Rényi entropy as a fundamental operational quantity in magic state distillation.
Magic states enable universal, fault-tolerant quantum computation within the stabilizer framework. Their non-stabilizerness supplies the resource needed to bypass the Eastin-Knill theorem while allowing fault-tolerant distillation. Although many measures of magic exist, not every nonzero-magic state is known to be distillable, and many of currently known distillable states are special cases of Clifford-stabilizer states, defined as pure states uniquely stabilized by finite Clifford subgroups. We develop a general framework for group-covariant functionals on Hermitian operators, introducing the notions of GGG-stabilizer spaces, states, and codes for arbitrary finite subgroups G⊂U(H)G \subset \mathrm{U}(\mathcal{H})G⊂U(H). We define analytic families of GGG-covariant functionals and prove that any GGG-invariant pure state is extremal for a broad class of derived functionals, including symmetric, max-type, and Rényi-type functionals, whenever the underlying family is GGG-covariant. This extremality holds for purity-preserving variations orthogonal to the stabilized subspace. Specializing to the Pauli and Clifford groups, we recover the extremality structure of canonical magic measures such as mana, stabilizer Rényi entropies, generalized Rényi entropies, and stabilizer fidelity, and show that Clifford-stabilizer states extremize them. We classify such states for qubits, qutrits, ququints, and two-qubit systems, identifying new candidates for magic distillation. We further propose an inefficient distillation protocol for a two-qubit magic state with stabilizer fidelity exceeding standard benchmarks, and conjecture that SIC-POVM fiducial states are Clifford-stabilizer states.
The information-theoretic approach to entanglement typically relies on arbitrarily many input copies and unboundedly complex operations; however, the available resources are constrained in reality. This motivates the study of entanglement theory with limited resources. One of its central questions is which quantities characterize entanglement manipulations, and so far, only the idealized case of pure states has been well explored. In this work, we address entanglement distillation from mixed states and identify the Rényi coherent information as the quantity determining the optimal rate in the worst case under two distinct resource constraints. We first characterize the sample-efficient regime, in which unbounded computational power is allowed. Our universal protocol achieves this rate without knowledge of the input state under certain polynomial rank constraints. This rate is optimal among universal protocols: we construct states whose distillable entanglement is nearly extensive, yet from which no universal sample-efficient protocol attains a rate above their Rényi coherent information. We then push this characterization to the computationally efficient frontier: the same bound holds for any efficient protocol even when the input state is known, and another universal protocol achieves this rate efficiently under additional polynomial constraints on the marginal ranks. Overall, our results give the Rényi coherent information a novel operational meaning in two computational settings: universal distillation with limited copies and efficient distillation even with knowledge of the input state.
We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state ∣0>|0>∣0>, and qubit measurement in the computational basis. In addition, we allow the creation of a one-qubit ancilla in a mixed state rho\\rhorho, which should be regarded as a parameter of the model. Our goal is to determine for which rho\\rhorho universal quantum computation (UQC) can be efficiently simulated. To answer this question, we construct purification protocols that consume several copies of rho\\rhorho and produce a single output qubit with higher polarization. The protocols allow one to increase the polarization only along certain ``magic'' directions. If the polarization of rho\\rhorho along a magic direction exceeds a threshold value (about 65%), the purification asymptotically yields a pure state, which we call a magic state. We show that the Clifford group operations combined with magic states preparation are sufficient for UQC. The connection of our results with the Gottesman-Knill theorem is discussed.
Quantum state purification aims to recover higher-fidelity quantum states from multiple noisy copies and is a fundamental primitive for quantum information processing. Magic resources enable operations beyond classically simulable dynamics and are central to universal fault-tolerant quantum computation. Recent no-go results show that classically simulable operations cannot achieve a nontrivial universal fidelity gain. This motivates a quantitative theory of the magic required for purification at prescribed success probability and target fidelity. For universal purification with two input copies, we prove an exact linear mana law in odd dimensions and a two-sided linear robustness law for multi-qubit systems, which becomes exact for a single qubit. We also identify an explicit successful purification map that makes the tradeoff transparent. These results establish universal purification as a task obeying a quantitative magic-fidelity law and link magic resources to error mitigation and fault-tolerant quantum information processing.
Magic-state factories are a major cost of fault-tolerant quantum computing, yet how few noisy inputs they need is known only for restricted protocols. We show that, for tolerating input faults, any stabilizer protocol, however adaptive, postselected or multistage, is no better than a projection onto one stabilizer code, and that for rational targets a fault pattern is harmful exactly when its complement is. Searches over all codes show that quadratic distillation of one T state needs exactly nine inputs and that the eight-input CCZ factory is optimal. At order ddd, one T state needs n≥2dn\geq2dn≥2d.
Magic state distillation (MSD) is a purification protocol that plays an important role in fault-tolerant quantum computation. Repeated iteration of the steps of an MSD protocol generates pure single non-stabilizer states, or magic states, from multiple copies of a mixed resource state using stabilizer operations only. Thus mixed resource states promote the stabilizer operations to full universality. MSD was introduced for qubit-based quantum computation, but little has been known concerning MSD in higher-dimensional qudit-based computation. Here, we describe a general approach for studying MSD in higher dimensions. We use it to investigate the features of a qutrit MSD protocol based on the five-qutrit stabilizer code. We show that this protocol distils non-stabilizer magic states, and identify two types of states that are attractors of this iteration map. Finally, we show how these states may be converted, via stabilizer circuits alone, into a state suitable for state-injected implementation of a non-Clifford phase gate, enabling non-Clifford unitary computation.