pith. sign in

arxiv: 2606.24170 · v1 · pith:WOV4HJGInew · submitted 2026-06-23 · 🪐 quant-ph

Low Spatial Cost CCZ Magic State Factory

Sungyeon Kook , Yujin Kang , Ilkwon Sohn , Jun Heo This is my paper

Pith reviewed 2026-06-26 00:36 UTC · model grok-4.3

classification 🪐 quant-ph
keywords CCZ distillationmagic state factorysurface codejoint measurementfault toleranceerror suppressionquantum error correctionresource optimization
0
0 comments X

The pith

Reduced surface-code patches enable lower spatial cost for CCZ magic state distillation while preserving error detection.

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

The paper develops a framework to convert gate-based magic state distillation protocols into compact joint-measurement architectures on the surface code. For the specific case of an eight-to-three CCZ distillation protocol, this yields a factory design that uses smaller patches and achieves lower spatial cost than the Gidney and Fowler design. The new architecture maintains the single-fault-detection property and the leading-order error suppression of the original protocol. This reduction in resource requirements addresses a key bottleneck in implementing non-Clifford operations within fault-tolerant quantum computation. The same reconstruction approach is indicated to apply to T-state factories and other multiqubit non-Clifford resource states.

Core claim

By reconstructing the eight-to-three CCZ distillation protocol as a joint-measurement architecture using smaller surface-code patches, the proposed design produces CCZ magic states at lower spatial cost than previous constructions while preserving the protocol's single-fault-detection and leading-order error suppression properties.

What carries the argument

The reduced joint-measurement architecture for the eight-to-three CCZ distillation protocol implemented with smaller surface-code patches.

If this is right

  • The factory produces CCZ magic states with lower spatial cost than the Gidney and Fowler design.
  • The single-fault-detection property of the original protocol is retained.
  • Leading-order error suppression is preserved.
  • The reconstruction method extends to T-state factories and other multiqubit non-Clifford resource-state factories.

Where Pith is reading between the lines

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

  • Lower spatial cost per CCZ state could reduce the total qubit overhead required for algorithms that use many non-Clifford gates.
  • The same joint-measurement reconstruction might be tested on other distillation protocols to identify further resource savings.
  • Hardware implementations would need to confirm that patch interconnections do not create error pathways outside the protocol's detection guarantees.

Load-bearing premise

Smaller surface-code patches can be wired together via joint measurements without introducing new undetectable error channels that would violate the original protocol's error-detection structure.

What would settle it

A resource-count comparison or error-rate simulation of the proposed factory versus the Gidney and Fowler design that either shows no spatial-cost reduction or detects a loss of single-fault detection would falsify the central claim.

read the original abstract

We propose a design framework for reconstructing gate-based magic state distillation protocols as compact joint-measurement architectures implementable with the surface code. The goal is to reduce the surface-code resource cost of a magic state factory while preserving the logical function and error-detection structure of the distillation protocol. We construct a reduced architecture for implementing an eight-to-three CCZ distillation protocol using smaller surface-code patches. The proposed factory preserves the single-fault-detection property and the leading-order error suppression of the protocol, while producing CCZ magic states with lower spatial cost than the design of Gidney and Fowler. The proposed design perspective can also be applied to T-state factories and other multiqubit non-Clifford resource-state factories. Our approach provides a framework for extending the design space of surface-code magic state factories beyond a single CCZ layout optimization.

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.

Referee Report

1 major / 0 minor

Summary. The paper proposes a design framework for reconstructing gate-based magic state distillation protocols as compact joint-measurement architectures on the surface code. It constructs a reduced architecture for the eight-to-three CCZ distillation protocol using smaller surface-code patches, claiming lower spatial cost than the Gidney-Fowler design while preserving the single-fault-detection property and leading-order error suppression of the original protocol. The approach is presented as extensible to T-state and other multiqubit non-Clifford factories.

Significance. If the error-detection preservation holds under the new wiring, the work would meaningfully expand the design space for surface-code magic-state factories by demonstrating a systematic reduction in spatial overhead without sacrificing the protocol's leading-order performance. This is relevant to resource estimates for fault-tolerant quantum computation.

major comments (1)
  1. [Abstract / reconstruction framework] Abstract (paragraph on reconstruction framework): The central claim that the joint-measurement architecture on smaller patches preserves single-fault detection and leading-order suppression rests on the assumption that the new wiring introduces no undetectable logical error channels. The manuscript asserts this preservation but supplies no explicit verification (e.g., error-rate tables, circuit diagrams, or analysis of the measurement schedule) showing that all single physical errors remain detectable or do not produce undetectable faults. This verification is load-bearing for both the single-fault-detection property and the cost-comparison claim.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their detailed review and valuable comments on our manuscript. We have carefully considered the major comment regarding the need for explicit verification of the single-fault-detection property and have revised the manuscript to address this concern.

read point-by-point responses

  1. Referee: The central claim that the joint-measurement architecture on smaller patches preserves single-fault detection and leading-order suppression rests on the assumption that the new wiring introduces no undetectable logical error channels. The manuscript asserts this preservation but supplies no explicit verification (e.g., error-rate tables, circuit diagrams, or analysis of the measurement schedule) showing that all single physical errors remain detectable or do not produce undetectable faults. This verification is load-bearing for both the single-fault-detection property and the cost-comparison claim.

    Authors: We thank the referee for this observation. The reconstruction framework is constructed such that the joint-measurement schedule directly implements the logical gates and checks of the original distillation protocol, thereby inheriting its single-fault detection property without introducing new undetectable error channels. Nevertheless, we concur that an explicit verification would be beneficial for the reader. In the revised manuscript, we have added circuit diagrams of the measurement schedule, an analysis of single physical error propagation, and a table demonstrating that all single faults produce detectable syndromes or are suppressed at leading order. These additions confirm that the leading-order error suppression and single-fault-detection property are preserved, bolstering the spatial cost comparison with the Gidney-Fowler design. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper proposes a reconstruction framework that maps an eight-to-three CCZ distillation protocol onto joint-measurement surface-code patches, asserting lower spatial cost versus the external Gidney-Fowler design while preserving single-fault detection and leading-order suppression. No equations, fitted parameters, or self-citations appear in the provided text that reduce these claims to redefinitions or inputs by construction. The cost comparison references external prior work, and the preservation claim is presented as a consequence of the new layout rather than a tautology. The derivation is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The proposal rests on standard surface-code properties and the error-detection structure of the original distillation protocol; no new free parameters, invented entities, or ad-hoc axioms are visible in the abstract.

axioms (1)
  • domain assumption Surface-code patches support the required joint measurements while retaining single-fault detection
    Invoked when the abstract states that the reduced architecture preserves the single-fault-detection property.

pith-pipeline@v0.9.1-grok · 5669 in / 1296 out tokens · 26693 ms · 2026-06-26T00:36:02.614184+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

21 extracted references · 12 canonical work pages

  1. [1]

    Quantum3, 135 (2019) https://doi.org/10.22331/ q-2019-04-30-135

    Gidney, C., Fowler, A.G.: Efficient magic state factories with a catalyzed |CCZ⟩to 2|T⟩transformation. Quantum3, 135 (2019) https://doi.org/10.22331/ q-2019-04-30-135

    2019

  2. [2]

    Bravyi, S., Kitaev, A.: Universal quantum computation with ideal Clifford gates and noisy ancillas. Phys. Rev. A71(2), 022316 (2005) https://doi.org/10.1103/ PhysRevA.71.022316

    2005

  3. [3]

    Bravyi, S., Haah, J.: Magic-state distillation with low overhead. Phys. Rev. A 86(5), 052329 (2012) https://doi.org/10.1103/PhysRevA.86.052329

    work page doi:10.1103/physreva.86.052329 2012

  4. [4]

    Nature549, 172–179 (2017) https://doi.org/10.1038/ nature23460

    Campbell, E.T., Terhal, B.M., Vuillot, C.: Roads towards fault-tolerant univer- sal quantum computation. Nature549, 172–179 (2017) https://doi.org/10.1038/ nature23460

    2017

  5. [5]

    A game of surface codes: Large-scale quan- tum computing with lattice surgery,

    Litinski, D.: A game of surface codes: Large-scale quantum computing with lattice surgery. Quantum3, 128 (2019) https://doi.org/10.22331/q-2019-03-05-128

    work page doi:10.22331/q-2019-03-05-128 2019

  6. [6]

    Dennis, E., Kitaev, A., Landahl, A., Preskill, J.: Topological quantum memory. J. Math. Phys.43(9), 4452–4505 (2002) https://doi.org/10.1063/1.1499754

    work page doi:10.1063/1.1499754 2002

  7. [7]

    Raussendorf, R., Harrington, J., Goyal, K.: Topological fault-tolerance in cluster state quantum computation. New J. Phys.9, 199 (2007) https://doi.org/10.1088/ 1367-2630/9/6/199 17

    2007

  8. [8]

    Fowler, A.G., Mariantoni, M., Martinis, J.M., Cleland, A.N.: Surface codes: Towards practical large-scale quantum computation. Phys. Rev. A86(3), 032324 (2012) https://doi.org/10.1103/PhysRevA.86.032324

    work page doi:10.1103/physreva.86.032324 2012

  9. [9]

    Horsman, C., Fowler, A.G., Devitt, S., Van Meter, R.: Surface code quantum computing by lattice surgery. New J. Phys.14(12), 123011 (2012) https://doi. org/10.1088/1367-2630/14/12/123011

    work page doi:10.1088/1367-2630/14/12/123011 2012

  10. [10]

    Quantum5, 433 (2021) https://doi.org/10.22331/ q-2021-04-15-433

    Gidney, C., Eker˚ a, M.: How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum5, 433 (2021) https://doi.org/10.22331/ q-2021-04-15-433

    2048

  11. [11]

    Gidney, C.: How to factor 2048 bit RSA integers with less than a million noisy qubits (2025)

    2048

  12. [12]

    PRX Quantum2(3), 030305 (2021) https://doi.org/10.1103/ PRXQuantum.2.030305

    Lee, J., Berry, D.W., Gidney, C., Huggins, W.J., McClean, J.R., Wiebe, N., Bab- bush, R.: Even more efficient quantum computations of chemistry through tensor hypercontraction. PRX Quantum2(3), 030305 (2021) https://doi.org/10.1103/ PRXQuantum.2.030305

    2021

  13. [13]

    npj Quantum Inf.11, 100 (2025) https://doi.org/10.1038/s41534-025-01091-0

    Symons, J.,et al.: Resource-optimized fault-tolerant simulation of the Fermi- Hubbard model and high-temperature superconductors. npj Quantum Inf.11, 100 (2025) https://doi.org/10.1038/s41534-025-01091-0

    work page doi:10.1038/s41534-025-01091-0 2025

  14. [14]

    Jones, C.: Low-overhead constructions for the fault-tolerant Toffoli gate. Phys. Rev. A87(2), 022328 (2013) https://doi.org/10.1103/PhysRevA.87.022328

    work page doi:10.1103/physreva.87.022328 2013

  15. [15]

    Fowler, A.G., Devitt, S.J., Jones, C.: Surface code implementation of block code state distillation. Sci. Rep.3, 1939 (2013) https://doi.org/10.1038/srep01939

    work page doi:10.1038/srep01939 1939

  16. [16]

    O’Gorman, J., Campbell, E.T.: Quantum computation with realistic magic-state factories. Phys. Rev. A95(3), 032338 (2017) https://doi.org/10.1103/PhysRevA. 95.032338

    work page doi:10.1103/physreva 2017

  17. [17]

    Quantum Inf

    Kang, Y., Lee, J., Ha, J., Heo, J.: Fault-tolerant quantum computation using low- cost joint measurements. Quantum Inf. Process.23, 190 (2024) https://doi.org/ 10.1007/s11128-024-04389-8

    work page doi:10.1007/s11128-024-04389-8 2024

  18. [18]

    Cambridge University Press, Cambridge (2010)

    Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, 10th anniversary edn. Cambridge University Press, Cambridge (2010)

    2010

  19. [19]

    Gottesman, D.: The Heisenberg representation of quantum computers (1998)

    1998

  20. [20]

    In: Pro- ceedings of the 19th ACM International Conference on Computing Frontiers, pp

    Lao, L., Criger, B.: Magic state injection on the rotated surface code. In: Pro- ceedings of the 19th ACM International Conference on Computing Frontiers, pp. 113–120. ACM, ??? (2022). https://doi.org/10.1145/3528416.3530237

    work page doi:10.1145/3528416.3530237 2022

  21. [21]

    Bombin, H.: Topological order with a twist: Ising anyons from an Abelian model. 18 Phys. Rev. Lett.105(3), 030403 (2010) https://doi.org/10.1103/PhysRevLett. 105.030403 Appendix A Derivations for Pauli-Rotation Conversion This appendix summarizes the Pauli-rotation identities used in Sec. 3. For a Pauli operatorP, we define Pθ = exp −i θ 2 P .(A1) For two...

    work page doi:10.1103/physrevlett 2010