Scaling of the Hadamard Deformation Space in Concatenated 4,1,2 Iceberg Codes: Exact Counts, Skew Amplification, and Search Reduction

In the paper's words

Concatenated quantum error-correcting codes raise the effective distance of a joint code without requiring the discovery of new codes with desirable parameters, and the [[4,1,2]] Iceberg code is the smallest error-detecting building block and therefore the one with the lowest resource overhead. The Iceberg code carries an asymmetric number of X and Z checks, so concatenating it produces skewed logical error rates between the X and Z observables; Clifford-deforming individual blocks can mitigate this, but the space of Hadamard deformations grows doubly exponentially with the number of concatenation levels, and no closed-form account of that growth is available in the grounding literature. The deformation space is counted under two equivalent conventions that are shown to coincide.

The abstract, verbatim, and its opening sentence is the claim. Every line below is quoted from the text.

Numbers it reports

1. The paper derives the exact deformation-space size $N_{\mathrm{def}}(L) = 2^{(4^{L+1}-4)/3}$ for an $L$-level concatenation, giving $16$, $1{,}048{,}576$, and $\approx 1.93 \times 10^{25}$ candidate deformations at $L = 1, 2, 3$, and shows that a per-block greedy rule reduces the search at $L = 3$ from $2^{84}$ candidates to $336$ evaluations, a reduction factor of $\approx 5.76 \times 10^{22}$.

   from Abstract

2. Under a stated phenomenological code-capacity model, unmitigated observable skew grows as $\eta^{2^{L}}$ for physical bias $\eta$, and at $L = 2$, $\eta = 10$, $p_0 = 10^{-3}$ the projected total logical error rate is $2.160216 \times 10^{-6}$, more than $99.99\%$ of which lies in the $Z$ channel.

   from Abstract

3. A derivation of the physical-qubit overhead $n_L = 4^{L}$, the concatenation distance product rule $d_L = 2^{L}$, and the rate $4^{-L}$, with worked values (Section 4.2).

   from 1. Introduction

4. A phenomenological code-capacity model yielding the projected logical error rate $p_L = \alpha^{2^{L}-1} p_0^{2^{L}}$ and the skew amplification law $\eta^{2^{L}}$, with worked numbers under stated assumptions (Section 4.3).

   from 1. Introduction

5. A tractability frontier for exhaustive search as a function of a notional simulation budget (Section 4.4).

   from 1. Introduction

How it is done

1. No simulations were performed; all numbers are exact counts or labeled projections, and a minimal validation protocol is specified.

   from Abstract

2. Entry [9] (arXiv:2006.16817v2) concerns a proof of monotonic increase in the cost function for the Krotov algorithm for open quantum systems.

   from 2. Background and Related Work

3. The method is analytical combinatorics plus phenomenological modeling, applied to the concatenation structure described in the source study [1].

   from 3. Methods

4. The direct user is a designer of concatenated fault-tolerant quantum memories who is selecting an inner code and a deformation policy: the source study's setting is exactly a logical-memory experiment built from $[[4,1,2]]$ blocks [1].

   from 7. Practical Implications and Engineering Pathways

What would falsify it

1. Under a stated phenomenological code-capacity model, unmitigated observable skew grows as $\eta^{2^{L}}$ for physical bias $\eta$, and at $L = 2$, $\eta = 10$, $p_0 = 10^{-3}$ the projected total logical error rate is $2.160216 \times 10^{-6}$, more than $99.99\%$ of which lies in the $Z$ channel.

   from Abstract

2. A memory whose two logical error channels fail at visibly different rates cannot be characterized by a single error budget; calibration, decoding, and logical-operation scheduling must all be handled per observable, and the worse channel dominates the memory lifetime.

   from 1. Introduction

3. A critical discussion of the assumptions the results rest on, of falsification criteria, and of the minimal next test (Sections 6 and 7).

   from 1. Introduction

Where the claim stops

1. If a different deformation model were intended — for example, deformations restricted to a subset of qubits, or strategies that deform blocks jointly — the count would change, but any model in which each of $4^{\ell-1}$ blocks at level $\ell$ carries an independent binary-per-qubit choice gives the same count.

   from 6. Discussion

2. The equivalence result R2 shows the count does not depend on the choice between the two counting conventions.

   from 6. Discussion

3. The skew law $\eta^{2^{L}}$ and the projected rates rest on the $\alpha = 6$ leading-order approximation and Assumption A.

   from 6. Discussion

Where to read

1. Abstract240 words · 1 min
2. 1. Introduction529 words · 2 min
3. 2. Background and Related Work666 words · 3 min
4. 3. Methods833 words · 4 min
5. 4. Analysis1,511 words · 7 min
6. 5. Results380 words · 2 min
7. 6. Discussion770 words · 3 min
8. 7. Practical Implications and Engineering Pathways888 words · 4 min
9. 8. Conclusion432 words · 2 min
10. Provenance and AI Involvement197 words · 1 min