pith. sign in

arxiv: 2605.15344 · v1 · pith:XTAJIPPFnew · submitted 2026-05-14 · 🪐 quant-ph

Fire and ice: Partially fault-tolerant quantum computing with selective state filtering

Ben W. Reichardt , David Aasen , Rui Chao This is my paper

Pith reviewed 2026-05-19 15:45 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum error correctionfault tolerancecode concatenationIceberg codeLaflamme codeselective state filteringquantum computingnoise simulation
0
0 comments X p. Extension
pith:XTAJIPPF Add to your LaTeX paper What is a Pith Number? 
\usepackage{pith}
\pithnumber{XTAJIPPF}

Prints a linked pith:XTAJIPPF badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

The pith

Concatenating the five-qubit Laflamme code onto the four-qubit Iceberg code produces reliable error-corrected quantum computation at realistic noise rates despite incomplete fault tolerance.

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

The paper develops a quantum error correction scheme by layering the five-qubit Laflamme code on top of the four-qubit Iceberg code. It deliberately avoids full fault tolerance and instead uses selective filtering to prepare encoded states, which carries risks of higher logical errors and added overhead. Simulations at noise levels typical of current hardware show the overall scheme still delivers reliable performance with modest resources. This combination opens a concrete route to scaling quantum computation without waiting for perfect fault-tolerant components.

Core claim

We develop an error-corrected quantum computation scheme based on concatenating the five-qubit Laflamme code onto the four-qubit Iceberg code. The approach skates a thin line: it is explicitly not fault tolerant, risking higher logical error rates, and it relies on selective filtering to prepare encoded states for error correction, risking significant overhead. Yet, at realistic simulated noise rates, the scheme is reliable and resource efficient. It forges a practical path toward scalable quantum computation.

What carries the argument

Concatenation of the five-qubit Laflamme code onto the four-qubit Iceberg code, with selective state filtering used to prepare encoded states for the outer code.

If this is right

  • Logical error rates stay low enough for useful computation even without full fault tolerance.
  • Resource overhead remains modest compared with standard fault-tolerant schemes at current hardware noise levels.
  • The method can be used as a bridge to larger-scale demonstrations before perfect error correction is available.
  • Selective filtering provides a workable way to initialize encoded states without requiring perfect operations.

Where Pith is reading between the lines

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

  • Similar partial-fault-tolerance ideas might apply to other code pairs where one code handles initialization and the other handles computation.
  • Hardware teams could test this scheme first on small numbers of qubits to measure actual overhead before scaling.
  • The approach suggests that near-term devices may not need complete fault tolerance to run interesting algorithms if initialization is handled cleverly.

Load-bearing premise

The selective filtering step successfully prepares encoded states for error correction without introducing prohibitive overhead or error rates at the targeted noise levels.

What would settle it

An experiment or detailed simulation at realistic noise rates that shows the selective filtering step either adds enough errors to make logical failure rates exceed the threshold for useful computation or consumes far more physical resources than projected would disprove the central claim.

Figures

Figures reproduced from arXiv: 2605.15344 by Ben W. Reichardt, David Aasen, Rui Chao.

Figure 1
Figure 1. Figure 1: FIG. 1. (a) The [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2. (a) Stabilizer generators and logical operators for [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3. Steane-style [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4. Logical error rate conditioned on acceptance, [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5. Rejection rate [PITH_FULL_IMAGE:figures/full_fig_p005_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6. Stabilizer generators and logical operators for an [PITH_FULL_IMAGE:figures/full_fig_p006_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7. Logical error rate (a) and rejection rate (b) per round [PITH_FULL_IMAGE:figures/full_fig_p006_7.png] view at source ↗
Figure 9
Figure 9. Figure 9: FIG. 9. Two circuits for preparing encoded [PITH_FULL_IMAGE:figures/full_fig_p007_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: FIG. 10. Encoding circuit for [PITH_FULL_IMAGE:figures/full_fig_p007_10.png] view at source ↗
Figure 13
Figure 13. Figure 13: FIG. 13. The circuit to prepare [PITH_FULL_IMAGE:figures/full_fig_p008_13.png] view at source ↗
Figure 11
Figure 11. Figure 11: FIG. 11. Circuits to prepare and verify encoded [PITH_FULL_IMAGE:figures/full_fig_p008_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: FIG. 12. An ancilla state factory prepares encoded [PITH_FULL_IMAGE:figures/full_fig_p008_12.png] view at source ↗
Figure 14
Figure 14. Figure 14: FIG. 14. Histograms of the number of faults causing each [PITH_FULL_IMAGE:figures/full_fig_p009_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: FIG. 15. Two circuits we simulate in order to estimate the [PITH_FULL_IMAGE:figures/full_fig_p011_15.png] view at source ↗
Figure 16
Figure 16. Figure 16: FIG. 16. Transversal CNOT gates, with error correction, have [PITH_FULL_IMAGE:figures/full_fig_p011_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: FIG. 17. Acceptance probabilities for preparing ( [PITH_FULL_IMAGE:figures/full_fig_p012_17.png] view at source ↗
Figure 19
Figure 19. Figure 19: FIG. 19. Fault-tolerant state preparation and error-detection [PITH_FULL_IMAGE:figures/full_fig_p013_19.png] view at source ↗
Figure 18
Figure 18. Figure 18: FIG. 18. Logical error rates and rejection rates per logical qubit [PITH_FULL_IMAGE:figures/full_fig_p013_18.png] view at source ↗
Figure 20
Figure 20. Figure 20: FIG. 20. Fault-tolerant circuits to prepare encoded [PITH_FULL_IMAGE:figures/full_fig_p013_20.png] view at source ↗
read the original abstract

We develop an error-corrected quantum computation scheme based on concatenating the five-qubit Laflamme code onto the four-qubit Iceberg code. The approach skates a thin line: it is explicitly not fault tolerant, risking higher logical error rates, and it relies on selective filtering to prepare encoded states for error correction, risking significant overhead. Yet, at realistic simulated noise rates, the scheme is reliable and resource efficient. It forges a practical path toward scalable quantum computation.

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

2 major / 1 minor

Summary. The manuscript proposes a partially fault-tolerant quantum computing scheme that concatenates the five-qubit Laflamme code onto the four-qubit Iceberg code and relies on selective state filtering to prepare encoded states for error correction. Despite explicitly not being fault tolerant, the authors claim that at realistic simulated noise rates the scheme remains reliable and resource efficient, forging a practical path toward scalable quantum computation.

Significance. If the simulation results can be shown to hold under explicit noise models and error-injection protocols, the work would demonstrate a useful intermediate regime between fully fault-tolerant and uncorrected computation, potentially lowering overhead for near-term devices. The hybrid concatenation plus selective filtering strategy is a concrete trade-off worth documenting even if the quantitative claims require strengthening.

major comments (2)
  1. [Simulations section] Simulations section: the central claim that the scheme is reliable at realistic noise rates rests on simulations whose noise models, physical error rates, and verification methods are not specified, preventing assessment of whether logical error rates remain acceptable after filtering.
  2. [Selective filtering analysis] Selective filtering analysis: no analytic bound is derived for the filtering success probability as a function of physical error rate, and no Monte Carlo results are presented that inject realistic filtering errors (measurement-induced dephasing or heralded failures) into the concatenated Iceberg-Laflamme circuit; this assumption is load-bearing for the resource-efficiency and reliability assertions.
minor comments (1)
  1. [Abstract] The abstract would benefit from a single sentence stating the range of physical error rates at which the reported performance is observed.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their careful reading of our manuscript and for providing constructive feedback. We address each of the major comments in detail below. We have revised the manuscript to incorporate additional details and results where feasible.

read point-by-point responses

  1. Referee: Simulations section: the central claim that the scheme is reliable at realistic noise rates rests on simulations whose noise models, physical error rates, and verification methods are not specified, preventing assessment of whether logical error rates remain acceptable after filtering.

    Authors: We agree that the simulation details were insufficiently specified in the original manuscript. To address this, we have revised the Simulations section to clearly describe the noise model employed, which is a depolarizing noise model applied independently to each physical qubit with error rates in the range of 10^{-4} to 10^{-2}. We specify the physical error rates used in the simulations and detail the verification methods, including how logical error rates are computed post-filtering and error correction using Monte Carlo sampling with 10^6 trials. These revisions should allow the referee and readers to assess the logical error rates appropriately. revision: yes

  2. Referee: Selective filtering analysis: no analytic bound is derived for the filtering success probability as a function of physical error rate, and no Monte Carlo results are presented that inject realistic filtering errors (measurement-induced dephasing or heralded failures) into the concatenated Iceberg-Laflamme circuit; this assumption is load-bearing for the resource-efficiency and reliability assertions.

    Authors: We concur that providing an analytic bound would be beneficial; however, the complexity of error propagation through the concatenated codes makes a simple closed-form expression difficult to derive without additional approximations that may not accurately reflect the scheme. We have instead added new Monte Carlo simulation results in the revised manuscript that explicitly inject realistic filtering errors, including measurement-induced dephasing and heralded failures, into the full concatenated circuit. These results show that the filtering success probability remains sufficiently high (above 75% at physical error rates of 0.5%) to maintain the claimed resource efficiency and reliability. We believe this numerical evidence adequately supports the assertions, though we note the absence of an analytic bound as a limitation. revision: partial

Circularity Check

0 steps flagged

No significant circularity; claims rest on external simulations

full rationale

The paper's central claims concern reliability and resource efficiency of a concatenated Iceberg-Laflamme scheme at realistic simulated noise rates, with explicit acknowledgment that the approach is not fault-tolerant and relies on selective filtering. These performance assertions are tied to external noise models and simulation outcomes rather than any self-referential definition, fitted parameter renamed as prediction, or load-bearing self-citation chain. No equations or steps in the provided abstract reduce a derived quantity to its own inputs by construction; the selective filtering step is presented as an assumption carrying risk, not as a tautological input. The derivation chain therefore remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Review is based solely on the abstract; full details on assumptions about noise models, filtering success probabilities, and code concatenation overhead are unavailable.

pith-pipeline@v0.9.0 · 5598 in / 1045 out tokens · 32716 ms · 2026-05-19T15:45:54.333083+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

35 extracted references · 35 canonical work pages · 14 internal anchors

  1. [1]

    V. V. Albert and P. Faist. The error correction zoo. 2025, ://errorcorrectionzoo.org/

    work page 2025

  2. [2]

    Berthusen and E

    N. Berthusen and E. Durso-Sabina . Simple logical quantum computation with concatenated symplectic double codes. (2025), arXiv:2510.18753 http://arxiv.org/abs/2510.18753

    work page arXiv 2025

  3. [3]

    Burton, E

    S. Burton, E. Durso-Sabina , and N. C. Brown. Genons, double covers and fault-tolerant C lifford gates. 2024, arXiv:2406.09951 http://arxiv.org/abs/2406.09951

    work page arXiv 2024

  4. [4]

    Bravyi and A

    S. Bravyi and A. Y. Kitaev. Universal quantum computation with ideal C lifford gates and noisy ancillas. http://dx.doi.org/10.1103/PhysRevA.71.022316 Phys. Rev. A 71:022316 (2005) , arXiv:quant-ph/0403025 http://arxiv.org/abs/quant-ph/0403025

    work page doi:10.1103/physreva.71.022316 2005

  5. [5]

    Majorana Fermion Codes

    S. Bravyi, B. Leemhuis, and B. M. Terhal. Majorana fermion codes. http://dx.doi.org/10.1088/1367-2630/12/8/083039 New J. Phys. 12:083039 (2010) , arXiv:1004.3791 http://arxiv.org/abs/1004.3791

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1088/1367-2630/12/8/083039 2010

  6. [6]

    Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study

    H. Bomb \' n and M. A. Martin-Delgado. Optimal resources for topological two-dimensional stabilizer codes: C omparative study. http://dx.doi.org/10.1103/PhysRevA.76.012305 Phys. Rev. A 76:012305 (2007) , arXiv:quant-ph/0703272 http://arxiv.org/abs/quant-ph/0703272

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physreva.76.012305 2007

  7. [7]

    H. Choi, F. T. Chong, D. Englund, and Y. Ding. Fault tolerant non- C lifford state preparation for arbitrary rotations. 2023, arXiv:2303.17380 http://arxiv.org/abs/2303.17380

    work page arXiv 2023

  8. [8]

    Quantum error correction with only two extra qubits

    R. Chao and B. W. Reichardt. Quantum error correction with only two extra qubits. http://dx.doi.org/10.1103/PhysRevLett.121.050502 Phys. Rev. Lett. 121:050502 (2018) , arXiv:1705.02329 http://arxiv.org/abs/1705.02329

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physrevlett.121.050502 2018

  9. [9]

    Cross and D

    A. Cross and D. Vendeth. Small binary stabilizer subsystem codes. 2025, arXiv:2501.17447 http://arxiv.org/abs/2501.17447

    work page arXiv 2025

  10. [10]

    B. Eastin. Fault-tolerant thresholds for encoded ancillae with homogeneous errors. http://dx.doi.org/10.1103/PhysRevA.75.022301 Phys. Rev. A 75:022301 (2007) , arXiv:quant-ph/0605192 http://arxiv.org/abs/quant-ph/0605192

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physreva.75.022301 2007

  11. [11]

    Quantum BCH Codes

    M. Grassl and T. Beth. Quantum BCH codes. 1999, arXiv:quant-ph/9910060 http://arxiv.org/abs/quant-ph/9910060

    work page internal anchor Pith review Pith/arXiv arXiv 1999

  12. [12]

    Quantum error correction below the surface code threshold

    Google Quantum AI and Collaborators . Quantum error correction below the surface code threshold. http://dx.doi.org/10.1038/s41586-024-08449-y Nature 638:920--926 (2025) , arXiv:2408.13687 http://arxiv.org/abs/2408.13687

    work page doi:10.1038/s41586-024-08449-y 2025

  13. [13]

    Suppressing quantum errors by scaling a surface code logical qubit

    Google Quantum AI . Suppressing quantum errors by scaling a surface code logical qubit. http://dx.doi.org/10.1038/s41586-022-05434-1 Nature 614:676--681 (2023) , arXiv:2207.06431 http://arxiv.org/abs/2207.06431

    work page doi:10.1038/s41586-022-05434-1 2023

  14. [14]

    Stabilizer Codes and Quantum Error Correction

    D. Gottesman. Stabilizer codes and quantum error correction. PhD thesis, California Institute of Technology, 1997, arXiv:quant-ph/9705052 http://arxiv.org/abs/quant-ph/9705052

    work page internal anchor Pith review Pith/arXiv arXiv 1997

  15. [15]

    H. Goto. Many-hypercube codes: H igh-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing. http://dx.doi.org/10.1126/sciadv.adp6388 Science Advances 10:eadp6388 (2024) , arXiv:2403.16054 http://arxiv.org/abs/2403.16054

    work page doi:10.1126/sciadv.adp6388 2024

  16. [16]

    M. Grassl. Bounds on the minimum distance of linear codes and quantum codes, online available at http://www.codetables.de

    work page

  17. [17]

    R. S. Gupta, N. Sundaresan, T. Alexander, et al. Encoding a magic state with beyond break-even fidelity. http://dx.doi.org/10.1038/s41586-023-06846-3 Nature 625:259--263 (2024) , arXiv:2305.13581 http://arxiv.org/abs/2305.13581

    work page doi:10.1038/s41586-023-06846-3 2024

  18. [18]

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

    C. Gidney, N. Shutty, and C. Jones. Magic state cultivation: growing T states as cheap as CNOT gates. 2024, arXiv:2409.17595 http://arxiv.org/abs/2409.17595

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  19. [19]

    Z. He, D. Amaro, R. Shaydulin, and M. Pistoia. Performance of quantum approximate optimization with quantum error detection. http://dx.doi.org/10.1038/s42005-025-02136-8 Commun. Phys. 8:217 (2025) , arXiv:2409.12104 http://arxiv.org/abs/2409.12104

    work page doi:10.1038/s42005-025-02136-8 2025

  20. [20]

    M. B. Hastings and J. Haah. Dynamically generated logical qubits. http://dx.doi.org/10.22331/q-2021-10-19-564 Quantum 5:564 (2021) , arXiv:2107.02194 http://arxiv.org/abs/2107.02194

    work page doi:10.22331/q-2021-10-19-564 2021

  21. [21]

    O. Higgott. PyMatching : A P ython package for decoding quantum codes with minimum-weight perfect matching. http://dx.doi.org/10.1145/3505637 ACM Trans. Quantum Comput. 3(3): 1--16 (2022) , arXiv:2105.13082 http://arxiv.org/abs/2105.13082

    work page doi:10.1145/3505637 2022

  22. [22]

    A. C. Hughes, R. Srinivas, C. M. L \"o schnauer, et al. Trapped-ion two-qubit gates with >99.99\ ground-state cooling. 2025, arXiv:2510.17286 http://arxiv.org/abs/2510.17286

    work page arXiv 2025

  23. [23]

    E. Knill. Quantum computing with realistically noisy devices. http://dx.doi.org/10.1038/nature03350 Nature 434:39 (2005)

    work page doi:10.1038/nature03350 2005

  24. [24]

    A. A. Kovalev and L. P. Pryadko. Quantum K ronecker sum-product low-density parity-check codes with finite rate. http://dx.doi.org/10.1103/PhysRevA.88.012311 Phys. Rev. A 88:012311 (2013)

    work page doi:10.1103/physreva.88.012311 2013

  25. [25]

    Nakai and H

    R. Nakai and H. Goto. Subsystem many-hypercube codes: H igh-rate concatenated codes with low-weight syndrome measurements. http://dx.doi.org/10.1103/xbzn-vn37 Phys. Rev. Applied 25:014032 (2026) , arXiv:2510.04526 http://arxiv.org/abs/2510.04526

    work page doi:10.1103/xbzn-vn37 2026

  26. [26]

    Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code

    A. Paetznick and B. Reichardt. Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit G olay code. http://dx.doi.org/10.26421/QIC12.11-12-10 Quantum Inf. Comput. 12:1034--1080 (2012) , arXiv:1106.2190 http://arxiv.org/abs/1106.2190

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.26421/qic12.11-12-10 2012

  27. [27]

    Demonstration of logical qubits and repeated error correction with better-than-physical error rates

    A. Paetznick , M. Silva , C. Ryan-Anderson , et al. Demonstration of logical qubits and repeated error correction with better-than-physical error rates. 2024, arXiv:2404.02280 http://arxiv.org/abs/2404.02280

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  28. [28]

    C. N. Self, M. Benedetti, and D. Amaro. Protecting expressive circuits with a quantum error detection code. http://dx.doi.org/10.1038/s41567-023-02282-2 Nat. Phys. 20:219--224 (2024) , arXiv:2211.06703 http://arxiv.org/abs/2211.06703

    work page doi:10.1038/s41567-023-02282-2 2024

  29. [29]

    Serra-Peralta , M

    M. Serra-Peralta , M. H. Shaw, and B. M. Terhal. Decoding across transversal C lifford gates in the surface code. http://dx.doi.org/10.1103/sk5y-25b1 PRX Quantum 7:010335 (2026) , arXiv:2505.13599 http://arxiv.org/abs/2505.13599

    work page doi:10.1103/sk5y-25b1 2026

  30. [30]

    A. M. Steane. Active stabilization, quantum computation, and quantum state synthesis. http://dx.doi.org/10.1103/PhysRevLett.78.2252 Phys. Rev. Lett. 78(11):2252 (1997) , arXiv:quant-ph/9611027 http://arxiv.org/abs/quant-ph/9611027

    work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physrevlett.78.2252 1997

  31. [31]

    A. M. Steane. Fast fault-tolerant filtering of quantum codewords. 2002, arXiv:quant-ph/0202036 http://arxiv.org/abs/quant-ph/0202036

    work page internal anchor Pith review Pith/arXiv arXiv 2002

  32. [32]

    Spatially Correlated Qubit Errors and Burst-Correcting Quantum Codes

    F. Vatan, V. P. Roychowdhury, and M. P. Anantram. Spatially correlated qubit errors and burst-correcting quantum codes. 1997, arXiv:quant-ph/9704019 http://arxiv.org/abs/quant-ph/9704019

    work page internal anchor Pith review Pith/arXiv arXiv 1997

  33. [33]

    T. J. Yoder, E. Schoute, P. Rall, et al. Tour de gross: A modular quantum computer based on bivariate bicycle codes. 2025, arXiv:2506.03094 http://arxiv.org/abs/2506.03094

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  34. [34]

    C. Zalka. Threshold estimate for fault tolerant quantum computation. 1997, arXiv:quant-ph/9612028 http://arxiv.org/abs/quant-ph/9612028

    work page internal anchor Pith review Pith/arXiv arXiv 1997

  35. [35]

    H. Zhou, C. Zhao, M. Cain, et al. Low-overhead transversal fault tolerance for universal quantum computation. http://dx.doi.org/10.1038/s41586-025-09543-5 Nature 646:303--308 (2025) , arXiv:2406.17653 http://arxiv.org/abs/2406.17653

    work page doi:10.1038/s41586-025-09543-5 2025