arxiv: 2605.06284 · v1 · submitted 2026-05-07 · 🪐 quant-ph

Recognition: unknown

Local distillation from Reed Muller codes unfolding

Vivien Londe

Authors on Pith no claims yet

Pith reviewed 2026-05-08 11:19 UTC · model grok-4.3

classification 🪐 quant-ph

keywords magic state distillationReed-Muller codeslocal quantum circuitsT-state distillationCCZ statesquantum error correctionunfolding technique

0 comments

The pith

Unfolding Reed-Muller codes produces local 2D and 3D layouts for high-performance magic state distillation factories.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper generalizes the unfolding method for Reed-Muller code based distillation factories by revealing its algebraic foundation. It constructs a 2D local arrangement of Z stabilizers for a distance-4 factory and 3D arrangements for distance-4 and distance-7 factories. Simulations demonstrate that these local factories can reduce input infidelities of 10^{-3} for T states down to 8.256×10^{-9} for output CCZ states in 2D and 1.1811×10^{-17} for output T states in 3D. A reader would care because non-local connections are impractical on real quantum devices, so local layouts are essential for scalable implementation. If the method works as described, it provides a practical route to generating the high-fidelity magic states needed for universal fault-tolerant quantum computing.

Core claim

We generalize the unfolding of a Reed Muller distillation factory by exhibiting the algebraic structure that the unfolding is based on. We describe a 2D local layout for the Z stabilizers of a distance 4 Reed Muller distillation factory and a 3D local layout for the Z stabilizer of a distance 4 and a distance 7 Reed Muller distillation factory. Given input T states with infidelities p=10^{-3}, the 2D local distillation factory with distance 4 outputs a CCZ state with infidelity p=8.256 × 10^{-9} and the 3D local distillation factory with distance 7 outputs a T state with infidelity p=1.1811 × 10^{-17}.

What carries the argument

The algebraic unfolding of Reed-Muller codes that rearranges the Z stabilizer checks into a local 2D or 3D lattice geometry while preserving the code's error-suppressing and distillation properties.

If this is right

A distance-4 factory can be realized in 2D with local interactions for producing CCZ magic states.
Higher-distance distillation becomes feasible in 3D local geometries for T states.
The achieved output infidelities show effective error reduction by 6 to 14 orders of magnitude from the given inputs.
These factories support the production of magic states required for non-Clifford gates in fault-tolerant quantum circuits.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Integrating these local factories into surface code architectures could reduce the overall resource overhead for quantum algorithms.
The unfolding technique may apply to other quantum codes to create local implementations of various distillation protocols.
Hardware experiments with superconducting or trapped-ion qubits could validate the local stabilizer arrangements and measure real-world performance.

Load-bearing premise

The algebraic unfolding preserves the distillation capability of the Reed-Muller code while permitting a strictly local 2D or 3D layout of the Z stabilizers, with no additional errors introduced by the layout itself and with input noise remaining independent and identically distributed.

What would settle it

Measuring the output infidelity of a physical implementation of the 3D distance-7 local factory starting from T states with 0.1% infidelity and checking whether it reaches approximately 10^{-17} or remains higher due to unaccounted layout effects.

Figures

Figures reproduced from arXiv: 2605.06284 by Vivien Londe.

**Figure 1.** Figure 1: The squares of type {1, 3} (front and back) give translations along the 1st coordinate to the square right, of type {2, 3}. front corresponds to the polynomial X2 + 1, back corresponds to the polynomial X2, right corresponds to the polynomial X1 and left corresponds to the polynomial X1 + 1. The algebraic proof is elementary: (X2 + 1) + (X2) + (X1) = (X1 + 1) in F2[X1, X2, X3]. Proof of Lemma 2.12. Let FI … view at source ↗

**Figure 2.** Figure 2: Planar layout of a set of generators of the Z stabilizer group of view at source ↗

**Figure 3.** Figure 3: The cartesian product of a basis for edges in the 2-cube with coordinate indices view at source ↗

**Figure 4.** Figure 4: The 4 vertices of a 2-cube (i.e. a square) are grouped on a single axis (North view at source ↗

**Figure 4.** Figure 4: Thus, edges of the planar layout correspond to edges of the cube. view at source ↗

**Figure 5.** Figure 5: The 4 nodes on each subfigure represent the 4 coordinate indices of the 4-cube. view at source ↗

**Figure 6.** Figure 6: Planar layout of a set of generators of the Z stabilizer group of view at source ↗

**Figure 7.** Figure 7: Gray code ordering for edges in the 3-cube with coordinate indices 1, 2 and view at source ↗

**Figure 8.** Figure 8: Gray code ordering for edges in the 3-cube with coordinate indices 4, 5 and view at source ↗

**Figure 9.** Figure 9: Taking the cartesian product of the 7 edges that correspond to a basis of view at source ↗

**Figure 10.** Figure 10: The 6 nodes represent the 6 coordinate indices of the 6-cube. A type of view at source ↗

**Figure 11.** Figure 11: CCZ circuit from applying T or Te on the 15 logical qubits of QRM6(1, 2) (source: [1]) 31 view at source ↗

**Figure 12.** Figure 12: Planar layout of the big unfolded code. The set of Z stabilizer generators view at source ↗

**Figure 13.** Figure 13: The 6 nodes represent the 6 coordinate indices of the 6-cube. A type of view at source ↗

**Figure 14.** Figure 14: The big unfolded code has 3 of the 15 logical qubits of view at source ↗

**Figure 15.** Figure 15: A 3D interactive version can be generated with this script view at source ↗

**Figure 16.** Figure 16: 3D local layout for the Z stabilizers of view at source ↗

read the original abstract

We generalize the unfolding of a Reed Muller distillation factory of Ruiz et. al. by exhibiting the algebraic structure that the unfolding is based on. We describe a 2D local layout for the Z stabilizers of a distance 4 Reed Muller distillation factory and a 3D local layout for the Z stabilizer of a distance 4 and a distance 7 Reed Muller distillation factory. Given input T states with infidelities $p=10^{-3}$, the 2D local distillation factory with distance 4 outputs a CCZ state with infidelity $p=8.256 \times 10^{-9}$ and the 3D local distillation factory with distance 7 outputs a T state with infidelity $p=1.1811 \times 10^{-17}$.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Londe gives explicit 2D and 3D local Z-stabilizer layouts for Reed-Muller distillation factories plus the algebra behind unfolding, but the reported infidelities need checks that the layouts preserve logical weights and error independence.

read the letter

The main takeaway is that this paper works out concrete local placements for the Z stabilizers of distance-4 and distance-7 Reed-Muller distillation factories in 2D and 3D, while spelling out the algebraic structure that makes the unfolding work. It takes the earlier construction from Ruiz et al. and turns it into something that can actually be laid out on hardware with limited connectivity. The output infidelity numbers for input p=10^{-3} are stated directly from the code distances under the usual i.i.d. noise model. That is the practical part people can use right away. The paper does well by supplying the actual layouts instead of just proving existence. Once the stabilizers are written down, anyone can check the code parameters or run a small simulation. The algebraic framing also makes clear why the unfolding step works without extra assumptions. No free parameters or invented objects appear; everything traces back to standard Reed-Muller properties. The soft spot is whether the local unfolding keeps the minimum-weight logical operators and the error channels exactly the same. If the layout couples previously independent error locations or changes operator supports, the suppression factors (down to 10^{-9} or 10^{-17}) would shift even if the code distance stays the same. The abstract does not show the post-unfolding weight enumeration or circuit-level check, so that verification needs to be in the full text. This is aimed at quantum error-correction researchers who already know the distillation literature and want local implementations. A reader who has the Ruiz paper will see the incremental but usable step. It deserves peer review because the layouts are concrete and falsifiable; referees can confirm the algebra and the error-model assumptions in one pass.

Referee Report

1 major / 2 minor

Summary. The manuscript generalizes the unfolding technique for Reed-Muller (RM) codes used in magic state distillation factories, as introduced by Ruiz et al. It provides the algebraic structure underlying the unfolding and constructs 2D local layouts for Z-stabilizers of a distance-4 RM factory and 3D local layouts for distance-4 and distance-7 RM factories. Numerical results are presented showing that, for input T states with infidelity p = 10^{-3}, the 2D distance-4 factory produces a CCZ state with infidelity 8.256 × 10^{-9}, and the 3D distance-7 factory produces a T state with infidelity 1.1811 × 10^{-17}.

Significance. If the unfolding preserves the original distillation thresholds and error suppression orders without introducing layout-induced error correlations or altering logical operator weights, this work could facilitate the implementation of high-fidelity magic state distillation in geometrically local 2D and 3D quantum architectures, reducing the need for long-range interactions in fault-tolerant quantum computing. The algebraic generalization strengthens the theoretical foundation beyond the specific examples in prior work.

major comments (1)

[Abstract and numerical results section] The reported output infidelities (e.g., 8.256 × 10^{-9} for the 2D CCZ and 1.1811 × 10^{-17} for the 3D T) are computed under the assumption that the unfolded stabilizers maintain identical logical action and minimum-weight logical operators as the original RM codes, with no new error channels from the layout. The manuscript should explicitly verify or derive that the unfolding does not change the support of the logical CCZ/T operators or introduce spatial correlations beyond the i.i.d. input noise model, as this is load-bearing for the validity of the numerical suppression factors.

minor comments (2)

The abstract would benefit from a brief mention of the key algebraic structure used for the generalization.
Ensure all numerical values are accompanied by references to the specific code parameters or simulation methods used to obtain them.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for recognizing the potential of the algebraic generalization of unfolding for local magic state distillation. We address the major comment below and have revised the manuscript accordingly to strengthen the connection between the theoretical construction and the numerical results.

read point-by-point responses

Referee: [Abstract and numerical results section] The reported output infidelities (e.g., 8.256 × 10^{-9} for the 2D CCZ and 1.1811 × 10^{-17} for the 3D T) are computed under the assumption that the unfolded stabilizers maintain identical logical action and minimum-weight logical operators as the original RM codes, with no new error channels from the layout. The manuscript should explicitly verify or derive that the unfolding does not change the support of the logical CCZ/T operators or introduce spatial correlations beyond the i.i.d. input noise model, as this is load-bearing for the validity of the numerical suppression factors.

Authors: We agree that an explicit verification is necessary to confirm the validity of the reported infidelities. The algebraic structure we exhibit in the manuscript defines the unfolding as a linear isomorphism on the stabilizer group of the Reed-Muller code that preserves commutation relations, the code space, and the action of logical operators. Consequently, the supports and minimum weights of the logical CCZ and T operators remain identical to those in the original code, and the local layout of the unfolded stabilizers does not introduce new error channels or spatial correlations beyond the assumed i.i.d. noise model on physical qubits. To address the referee's concern directly, we have added a dedicated derivation (new subsection in the methods) that formally proves this preservation property via the homomorphism induced by the unfolding map. We have also updated the abstract and numerical results section to reference this derivation, ensuring the suppression factors are rigorously justified. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected; derivation is self-contained.

full rationale

The paper generalizes an external unfolding technique from Ruiz et al. to construct local 2D/3D Z-stabilizer layouts for specific-distance Reed-Muller codes, then reports numerical output infidelities under an i.i.d. input noise model. No load-bearing step reduces a prediction to a fitted parameter, self-definition, or self-citation chain by construction. The reported suppression factors follow from the algebraic preservation of code distance and logical operators rather than tautological re-expression of the inputs. This is the normal non-circular outcome for a paper whose central results are externally benchmarkable code properties and explicit numerical evaluation.

Axiom & Free-Parameter Ledger

1 free parameters · 2 axioms · 0 invented entities

The work rests on standard assumptions of quantum error correction and the known distillation properties of Reed-Muller codes. The input infidelity p=10^{-3} is a benchmark parameter chosen for numerical illustration rather than derived.

free parameters (1)

input infidelity p
Benchmark value supplied by the authors to illustrate performance; not derived from first principles.

axioms (2)

domain assumption Input T states are subject to independent identically distributed noise with the stated infidelity.
Standard modeling assumption for distillation protocol analysis.
domain assumption The Reed-Muller code distance determines the error suppression factor for the distilled output states.
Relies on established properties of Reed-Muller codes in magic-state distillation.

pith-pipeline@v0.9.0 · 5412 in / 1430 out tokens · 51776 ms · 2026-05-08T11:19:26.522582+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

27 extracted references · 7 canonical work pages · 2 internal anchors

[1]

Geo- metric structure and transversal logic of quantum reed–muller codes.IEEE Trans- actions on Information Theory, 2025

Alexander Barg, Nolan J Coble, Dominik Hangleiter, and Christopher Kang. Geo- metric structure and transversal logic of quantum reed–muller codes.IEEE Trans- actions on Information Theory, 2025

2025
[2]

Magic-state distillation with low overhead

Sergey Bravyi and Jeongwan Haah. Magic-state distillation with low overhead. Physical Review A—Atomic, Molecular, and Optical Physics, 86(5):052329, 2012

2012
[3]

Universal quantum computation with ideal clif- ford gates and noisy ancillas.Physical Review A—Atomic, Molecular, and Optical Physics, 71(2):022316, 2005

Sergey Bravyi and Alexei Kitaev. Universal quantum computation with ideal clif- ford gates and noisy ancillas.Physical Review A—Atomic, Molecular, and Optical Physics, 71(2):022316, 2005

2005
[4]

Unifying gate synthesis and magic state dis- tillation.Physical review letters, 118(6):060501, 2017

Earl T Campbell and Mark Howard. Unifying gate synthesis and magic state dis- tillation.Physical review letters, 118(6):060501, 2017

2017
[5]

Distilling one-qubit magic states into toffoli states.Physical Review A—Atomic, Molecular, and Optical Physics, 87(3):032321, 2013

Bryan Eastin. Distilling one-qubit magic states into toffoli states.Physical Review A—Atomic, Molecular, and Optical Physics, 87(3):032321, 2013

2013
[6]

Efficient magic state factories with a catalyzed ccz to 2t transformation.Quantum, 3:135, 2019

Craig Gidney and Austin G Fowler. Efficient magic state factories with a catalyzed ccz to 2t transformation.Quantum, 3:135, 2019

2019
[7]

Magic state cultivation: growing T states as cheap as CNOT gates

Craig Gidney, Noah Shutty, and Cody Jones. Magic state cultivation: growing t states as cheap as cnot gates.arXiv preprint arXiv:2409.17595, 2024

work page internal anchor Pith review arXiv 2024
[8]

Repetition cat qubits for fault-tolerant quantum computation.Physical Review X, 9(4):041053, 2019

J´ er´ emie Guillaud and Mazyar Mirrahimi. Repetition cat qubits for fault-tolerant quantum computation.Physical Review X, 9(4):041053, 2019

2019
[9]

Error rates and resource overheads of repetition cat qubits.Physical Review A, 103(4):042413, 2021

J´ er´ emie Guillaud and Mazyar Mirrahimi. Error rates and resource overheads of repetition cat qubits.Physical Review A, 103(4):042413, 2021

2021
[10]

Codes and protocols for distillingt, controlled-s, and toffoli gates.Quantum, 2:71, 2018

Jeongwan Haah and Matthew B Hastings. Codes and protocols for distillingt, controlled-s, and toffoli gates.Quantum, 2:71, 2018

2018
[11]

Magic state distillation with low space overhead and optimal asymptotic input count.Quantum, 1:31, 2017

Jeongwan Haah, Matthew B Hastings, David Poulin, and D Wecker. Magic state distillation with low space overhead and optimal asymptotic input count.Quantum, 1:31, 2017. 61

2017
[12]

Composite toffoli gate with two-round error detection.Physical Review A—Atomic, Molecular, and Optical Physics, 87(5):052334, 2013

Cody Jones. Composite toffoli gate with two-round error detection.Physical Review A—Atomic, Molecular, and Optical Physics, 87(5):052334, 2013

2013
[13]

Low-overhead constructions for the fault-tolerant toffoli gate.Physical Review A—Atomic, Molecular, and Optical Physics, 87(2):022328, 2013

Cody Jones. Low-overhead constructions for the fault-tolerant toffoli gate.Physical Review A—Atomic, Molecular, and Optical Physics, 87(2):022328, 2013

2013
[14]

Multilevel distillation of magic states for quantum computing.Physical Review A—Atomic, Molecular, and Optical Physics, 87(4):042305, 2013

Cody Jones. Multilevel distillation of magic states for quantum computing.Physical Review A—Atomic, Molecular, and Optical Physics, 87(4):042305, 2013

2013
[15]

Knill, Fault-tolerant postselected quantum computation: Schemes (2004), arXiv:quant-ph/0402171 [quant-ph]

Emanuel Knill. Fault-tolerant postselected quantum computation: Schemes.arXiv preprint quant-ph/0402171, 2004

work page arXiv 2004
[16]

Fault-Tolerant Postselected Quantum Computation: Threshold Analysis

Emanuel Knill. Fault-tolerant postselected quantum computation: Threshold anal- ysis.arXiv preprint quant-ph/0404104, 2004

work page Pith review arXiv 2004
[17]

Resilient quantum computation.Science, 279(5349):342–345, 1998

Emanuel Knill, Raymond Laflamme, and Wojciech H Zurek. Resilient quantum computation.Science, 279(5349):342–345, 1998

1998
[18]

The smallest code with transversal t.arXiv preprint arXiv:2210.14066, 2022

Stergios Koutsioumpas, Darren Banfield, and Alastair Kay. The smallest code with transversal t.arXiv preprint arXiv:2210.14066, 2022

work page arXiv 2022
[19]

Magic state distillation: Not as costly as you think.Quantum, 3:205, 2019

Daniel Litinski. Magic state distillation: Not as costly as you think.Quantum, 3:205, 2019

2019
[20]

Magic-state distillation with the four-qubit code.arXiv preprint arXiv:1204.4221, 2012

Adam M Meier, Bryan Eastin, and Emanuel Knill. Magic-state distillation with the four-qubit code.arXiv preprint arXiv:1204.4221, 2012

work page arXiv 2012
[21]

Dynamically protected cat-qubits: a new paradigm for universal quantum computation.New Journal of Physics, 16(4):045014, 2014

Mazyar Mirrahimi, Zaki Leghtas, Victor V Albert, Steven Touzard, Robert J Schoelkopf, Liang Jiang, and Michel H Devoret. Dynamically protected cat-qubits: a new paradigm for universal quantum computation.New Journal of Physics, 16(4):045014, 2014

2014
[22]

Application of boolean algebra to switching circuit design and to error detection.Transactions of the IRE professional group on electronic computers, (3):6–12, 1954

David E Muller. Application of boolean algebra to switching circuit design and to error detection.Transactions of the IRE professional group on electronic computers, (3):6–12, 1954

1954
[23]

Universal fault-tolerant quantum compu- tation with only transversal gates¡? format?¿ and error correction.Physical review letters, 111(9):090505, 2013

Adam Paetznick and Ben W Reichardt. Universal fault-tolerant quantum compu- tation with only transversal gates¡? format?¿ and error correction.Physical review letters, 111(9):090505, 2013

2013
[24]

Binary codes with specified minimum distance.IRE Transactions on Information Theory, 6(4):445–450, 1960

Morris Plotkin. Binary codes with specified minimum distance.IRE Transactions on Information Theory, 6(4):445–450, 1960

1960
[25]

Bias-preserving gates with stabilized cat qubits.Science advances, 6(34):eaay5901, 2020

Shruti Puri, Lucas St-Jean, Jonathan A Gross, Alexander Grimm, Nicholas E Frat- tini, Pavithran S Iyer, Anirudh Krishna, Steven Touzard, Liang Jiang, Alexandre Blais, et al. Bias-preserving gates with stabilized cat qubits.Science advances, 6(34):eaay5901, 2020. 62

2020
[26]

Unfolded distillation: very low-cost magic state preparation for biased-noise qubits.arXiv preprint arXiv:2507.12511, 2025

Diego Ruiz, J´ er´ emie Guillaud, Christophe Vuillot, and Mazyar Mirrahimi. Unfolded distillation: very low-cost magic state preparation for biased-noise qubits.arXiv preprint arXiv:2507.12511, 2025

work page arXiv 2025
[27]

Parity-unfolded distillation architecture for noise-biased platforms

Konstantin Tiurev, Christoph Fleckenstein, Christophe Goeller, Paul Schnabl, Matthias Traube, Nitica Sakharwade, Anette Messinger, Josua Unger, and Wolf- gang Lechner. Parity-unfolded distillation architecture for noise-biased platforms. arXiv preprint arXiv:2604.15436, 2026. 63

work page internal anchor Pith review Pith/arXiv arXiv 2026