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:2501.10163

Invariant Theory, Magic State Distillation, and Bounds on Classical Codes

Amolak Ratan Kalra, Shiroman Prakash

Published Jan 17, 2025• 6 citations
arXivHTMLPDF

Abstract

We show that the physical consistency of magic state distillation imposes new constraints on the weight enumerators of classical error-correcting codes. We establish that for $|T\rangle$-state distillation protocols based on linear self-orthogonal $GF(4)$ codes, the distillation threshold and noise-suppression exponent are directly determined by the code's simple weight enumerator. By enforcing the physical consistency of the distillation process -- specifically, that the probability of successfully projecting onto the target state must be non-negative -- we derive a new set of constraints on classical weight enumerators. These ``quantum consistency'' constraints prove to be strictly stronger than those derived from classical invariant theory, yielding new upper bounds on the minimum distance of certain classical and quantum codes. Most notably, we show that these new constraints resolve a long-standing open problem in classical coding theory by proving the non-existence of extremal Hermitian self-dual codes over $GF(4)$ with parameters $[12m, 6m, 4m+2]$. Additionally, we use our formalism to perform an exhaustive search of distillation protocols based on linear $GF(4)$ codes with $n < 20$, finding no protocols with thresholds exceeding the 5-qubit code, and we derive analytic upper bounds on the noise-suppression exponents of such distillation routines as a function of $n$.

DOI
10.48550/arxiv.2501.10163

Related papers

Search for high-threshold qutrit magic-state distillation routines

Shiroman Prakash, Rishabh Singhal

Determining the best attainable threshold for qudit magic state distillation is directly related to the question of whether or not contextuality is sufficient for universal quantum computation. We show that the performance of a qudit correcting code for magic state distillation is captured by its complete weight enumerator. For the qutrit strange state -- a maximally magic non-stabilizer state -- the performance of a code is captured by its simple weight enumerator. This result allows us to carry out an extensive search for high-threshold magic state distillation routines for the strange state. Our search covers all $[[n,1]]_3$ qutrit stabilizer codes with a complete set of transversal Clifford gates for $n\leq 23$, and all $[[n,1]]_3$ stabilizer codes with a transversal $H^2$ gate with $n \leq 9$ qudits. For $n=23$, we find over 600 CSS codes that can distill the qutrit strange state with cubic noise suppression. While none of these codes surpass the threshold of the 11-qutrit Golay code, their existence suggests that, for large codes, the ability to distill the qutrit strange state is somewhat generic.

arXiv:2408.00436•Physical Review A•Feb 3, 2026•6 citations

Exploring the landscape of compact magic-state distillation factories

Hugo Jacinto, Xavier Valcarce, Victor Barizien +2 more

Producing high-fidelity magic states using the smallest possible number of physical qubits and operations stands as a very important challenge to achieve fault-tolerant quantum computation at scale. Besides emerging proposals for alternative methods such as cultivation, magic state distillation remains essential for achieving very low error rates. Known distillation protocols are usually built through quantum codes derived from triorthogonal matrices. Here, exploiting the specific noise structure present in magic state distillation protocols, we show that classical error-correcting codes offer a simpler framework for deriving these protocols. This formulation is particularly well suited to systematic numerical and analytical studies of distillation protocols involving a fixed number of qubits. Specifically, we use a SAT solver to derive a series of no-go theorems that relate key figures of merit, including the number of qubits and the factory distance. In particular, considering the standard implementation as a circuit of Z-diagonal Pauli product rotations followed by measurements, we show that no $T$-to-$T$ distillation protocol on fewer than eight qubits can exceed distance 3, and no $T$-to-$\mathrm{CC}Z$ protocol distance 2. Our results also include new such distillation protocols with the smallest number of qubits for a given distance in the literature, namely distance 4 and 5 $T$-to-$T$ protocols supported on 10 and 11 qubits, as well as distance 3 and 4 $T$-to-$\mathrm{CC}Z$ distillation protocols supported on 9 and 10 qubits. Finally, going beyond unitary circuits by recycling qubits through mid-circuit measurement and reinitialization, we obtain an implementation of the distance-5 $49T$-to-$1T$ protocol on only 5 active qubits.

quant-pharXiv:2606.07734•Jun 9, 2026•10 citations

Signed quantum weight enumerators characterize qubit magic state distillation

Patrick Rall

Many proposals for fault-tolerant quantum computation require injection of 'magic states' to achieve a universal set of operations. Some qubit states are above a threshold fidelity, allowing them to be converted into magic states via 'magic state distillation', a process based on stabilizer codes from quantum error correction. We define quantum weight enumerators that take into account the sign of the stabilizer operators. These enumerators completely describe the magic state distillation behavior when distilling T-type magic states. While it is straightforward to calculate them directly by counting exponentially many operator weights, it is also an NP-hard problem to compute them in general. This suggests that finding a family of distillation schemes with desired threshold properties is at least as hard as finding the weight distributions of a family of classical codes. Additionally, we develop search algorithms fast enough to analyze all useful 5 qubit codes and some 7 qubit codes, finding no codes that surpass the best known threshold.

arXiv:1702.06990•Feb 22, 2017•17 citations

On Constructing and Decoding Quantum Triorthogonal Codes

Alessio Baldelli, Olai Å. Mostad, Hsuan-Yin Lin +2 more

Triorthogonal codes are a basic ingredient in magic-state distillation, as they enable transversal implementation of logical $\mathsf{T}$ gates. As a non-Clifford operation, the $\mathsf{T}$ gate enables universal fault-tolerant quantum computation when combined with Clifford operations. We derive an existence criterion for even-weight triorthogonal generator matrices with a target dual minimum distance. The criterion combines triorthogonality constraints with MacWilliams identities via Krawtchouk-polynomial conditions on the dual weight distribution, yielding an integer linear programming formulation for the construction problem. We find novel nontrivial triorthogonal codes (degenerate and non-degenerate) that are not necessarily constructed from triply even binary linear codes. By imposing automorphism-group constraints, the formulation also recovers the known [[49,1,5]] and [[95,1,7]] triorthogonal codes. We also evaluate the performance of the obtained high-distance triorthogonal codes over the dephasing channel using different decoding methods, showing that automorphism ensemble decoding (AED) and guessing random additive-noise decoding (GRAND) are promising options.

quant-pharXiv:2605.24519•May 26, 2026•9 citations

Near-threshold qudit stabilizer codes with efficient encoding circuits for magic-state distillation

Abhi Kumar Sharma, Shayan Srinivasa Garani

Magic-state distillation is a protocol to purify noisy quantum states using quantum stabilizer codes. In this paper, we provide conditions for identifying magic states along with analytical expressions for computing the noise threshold. Through quantum entropic results, we prove the convergence of the magic-state distillation procedure. We derive analytical results to show how the noise threshold scales as a function of the minimum distance and the number of physical qudits of the underlying quantum stabilizer code. We distill $|T\ensuremath{\rangle}$ and $|S\ensuremath{\rangle}$ states with thresholds 0.498 (theoretical limit is 0.5) and 0.71 (theoretical limit is 0.75) over the depolarizing channel using ${[[31,1,16]]}_{2}$ quantum Bose-Chaudhuri-Hocquenghem code and ${[[29,1,15]]}_{3}$ quantum qutrit code, respectively. Finally, encoding algorithms based on quantum Calderbank-Shor-Steane (CSS) and non-CSS qudit stabilizer codes along with circuits are proposed for magic-state distillation.

Physical Review A•Jun 18, 2024•3 citations

Magic state distillation with permutation-invariant codes and a two-qubit example

Heather Leitch, Yingkai Ouyang

Magic states, by allowing non-Clifford gates through gate teleportation, are important building blocks of fault-tolerant quantum computation. Magic state distillation protocols aim to create clean copies of magic states from many noisier copies. However, the prevailing protocols require substantial qubit overhead. We present a distillation protocol based on permutation-invariant gnu codes, as small as two qubits. The two-qubit protocol achieves a 0.5 error threshold and 1/2 distillation rate, surpassing prior schemes for comparable codes. Our protocol furthermore distils magic states with arbitrary magic by varying the position of the ideal input states on the Bloch sphere. We achieve this by departing from the usual magic state distillation formalism, allowing the use of non-Clifford gates in the distillation protocol, and allowing the form of the output state to differ from the input state. Our protocol is compatible for use in tandem with existing magic state distillation protocols to enhance their performance.

quant-pharXiv:2603.04310•Mar 5, 2026•1 citation
We show that the physical consistency of magic state distillation imposes new constraints on the weight enumerators of classical error-correcting codes. We establish that for ∣T⟩|T\rangle∣T⟩-state distillation protocols based on linear self-orthogonal GF(4)GF(4)GF(4) codes, the distillation threshold and noise-suppression exponent are directly determined by the code's simple weight enumerator. By enforcing the physical consistency of the distillation process -- specifically, that the probability of successfully projecting onto the target state must be non-negative -- we derive a new set of constraints on classical weight enumerators. These ``quantum consistency'' constraints prove to be strictly stronger than those derived from classical invariant theory, yielding new upper bounds on the minimum distance of certain classical and quantum codes. Most notably, we show that these new constraints resolve a long-standing open problem in classical coding theory by proving the non-existence of extremal Hermitian self-dual codes over GF(4)GF(4)GF(4) with parameters [12m,6m,4m+2][12m, 6m, 4m+2][12m,6m,4m+2]. Additionally, we use our formalism to perform an exhaustive search of distillation protocols based on linear GF(4)GF(4)GF(4) codes with n<20n < 20n<20, finding no protocols with thresholds exceeding the 5-qubit code, and we derive analytic upper bounds on the noise-suppression exponents of such distillation routines as a function of nnn.
Determining the best attainable threshold for qudit magic state distillation is directly related to the question of whether or not contextuality is sufficient for universal quantum computation. We show that the performance of a qudit correcting code for magic state distillation is captured by its complete weight enumerator. For the qutrit strange state -- a maximally magic non-stabilizer state -- the performance of a code is captured by its simple weight enumerator. This result allows us to carry out an extensive search for high-threshold magic state distillation routines for the strange state. Our search covers all [[n,1]]3[[n,1]]_3[[n,1]]3​ qutrit stabilizer codes with a complete set of transversal Clifford gates for n≤23n\leq 23n≤23, and all [[n,1]]3[[n,1]]_3[[n,1]]3​ stabilizer codes with a transversal H2H^2H2 gate with n≤9n \leq 9n≤9 qudits. For n=23n=23n=23, we find over 600 CSS codes that can distill the qutrit strange state with cubic noise suppression. While none of these codes surpass the threshold of the 11-qutrit Golay code, their existence suggests that, for large codes, the ability to distill the qutrit strange state is somewhat generic.
Producing high-fidelity magic states using the smallest possible number of physical qubits and operations stands as a very important challenge to achieve fault-tolerant quantum computation at scale. Besides emerging proposals for alternative methods such as cultivation, magic state distillation remains essential for achieving very low error rates. Known distillation protocols are usually built through quantum codes derived from triorthogonal matrices. Here, exploiting the specific noise structure present in magic state distillation protocols, we show that classical error-correcting codes offer a simpler framework for deriving these protocols. This formulation is particularly well suited to systematic numerical and analytical studies of distillation protocols involving a fixed number of qubits. Specifically, we use a SAT solver to derive a series of no-go theorems that relate key figures of merit, including the number of qubits and the factory distance. In particular, considering the standard implementation as a circuit of Z-diagonal Pauli product rotations followed by measurements, we show that no TTT-to-TTT distillation protocol on fewer than eight qubits can exceed distance 3, and no TTT-to-CCZ\mathrm{CC}ZCCZ protocol distance 2. Our results also include new such distillation protocols with the smallest number of qubits for a given distance in the literature, namely distance 4 and 5 TTT-to-TTT protocols supported on 10 and 11 qubits, as well as distance 3 and 4 TTT-to-CCZ\mathrm{CC}ZCCZ distillation protocols supported on 9 and 10 qubits. Finally, going beyond unitary circuits by recycling qubits through mid-circuit measurement and reinitialization, we obtain an implementation of the distance-5 49T49T49T-to-1T1T1T protocol on only 5 active qubits.
Many proposals for fault-tolerant quantum computation require injection of 'magic states' to achieve a universal set of operations. Some qubit states are above a threshold fidelity, allowing them to be converted into magic states via 'magic state distillation', a process based on stabilizer codes from quantum error correction. We define quantum weight enumerators that take into account the sign of the stabilizer operators. These enumerators completely describe the magic state distillation behavior when distilling T-type magic states. While it is straightforward to calculate them directly by counting exponentially many operator weights, it is also an NP-hard problem to compute them in general. This suggests that finding a family of distillation schemes with desired threshold properties is at least as hard as finding the weight distributions of a family of classical codes. Additionally, we develop search algorithms fast enough to analyze all useful 5 qubit codes and some 7 qubit codes, finding no codes that surpass the best known threshold.
Triorthogonal codes are a basic ingredient in magic-state distillation, as they enable transversal implementation of logical T\mathsf{T}T gates. As a non-Clifford operation, the T\mathsf{T}T gate enables universal fault-tolerant quantum computation when combined with Clifford operations. We derive an existence criterion for even-weight triorthogonal generator matrices with a target dual minimum distance. The criterion combines triorthogonality constraints with MacWilliams identities via Krawtchouk-polynomial conditions on the dual weight distribution, yielding an integer linear programming formulation for the construction problem. We find novel nontrivial triorthogonal codes (degenerate and non-degenerate) that are not necessarily constructed from triply even binary linear codes. By imposing automorphism-group constraints, the formulation also recovers the known [[49,1,5]] and [[95,1,7]] triorthogonal codes. We also evaluate the performance of the obtained high-distance triorthogonal codes over the dephasing channel using different decoding methods, showing that automorphism ensemble decoding (AED) and guessing random additive-noise decoding (GRAND) are promising options.
Magic-state distillation is a protocol to purify noisy quantum states using quantum stabilizer codes. In this paper, we provide conditions for identifying magic states along with analytical expressions for computing the noise threshold. Through quantum entropic results, we prove the convergence of the magic-state distillation procedure. We derive analytical results to show how the noise threshold scales as a function of the minimum distance and the number of physical qudits of the underlying quantum stabilizer code. We distill $|T\ensuremath{\rangle}$ and $|S\ensuremath{\rangle}$ states with thresholds 0.498 (theoretical limit is 0.5) and 0.71 (theoretical limit is 0.75) over the depolarizing channel using [[31,1,16]]2{[[31,1,16]]}_{2}[[31,1,16]]2​ quantum Bose-Chaudhuri-Hocquenghem code and [[29,1,15]]3{[[29,1,15]]}_{3}[[29,1,15]]3​ quantum qutrit code, respectively. Finally, encoding algorithms based on quantum Calderbank-Shor-Steane (CSS) and non-CSS qudit stabilizer codes along with circuits are proposed for magic-state distillation.
Magic states, by allowing non-Clifford gates through gate teleportation, are important building blocks of fault-tolerant quantum computation. Magic state distillation protocols aim to create clean copies of magic states from many noisier copies. However, the prevailing protocols require substantial qubit overhead. We present a distillation protocol based on permutation-invariant gnu codes, as small as two qubits. The two-qubit protocol achieves a 0.5 error threshold and 1/2 distillation rate, surpassing prior schemes for comparable codes. Our protocol furthermore distils magic states with arbitrary magic by varying the position of the ideal input states on the Bloch sphere. We achieve this by departing from the usual magic state distillation formalism, allowing the use of non-Clifford gates in the distillation protocol, and allowing the form of the output state to differ from the input state. Our protocol is compatible for use in tandem with existing magic state distillation protocols to enhance their performance.