Tree Geometry Protects Quantum Information Without Measurements

In the paper's words

We formalize a proposal for passive quantum error correction (QEC) in which logical qudits are encoded on the vertices of a ball of the Bruhat–Tits tree T_p+1, the incidence geometry of the p‑adic numbers Q_p, with Hecke‑type operators acting as the natural gate set. The non‑Archimedean inequality \|x+y\|_p≤max(\|x\|_p,\|y\|_p) forces the tree’s balls to be either nested or disjoint, so localized errors confined to one ball cannot accumulate coherently across distinct branches. We prove a nesting lemma, use it to show that every error set of weight ≤ t on a protected ball is correctable under the Knill–Laflamme conditions, and derive the code parameters n_t=1+(p+1)(p^t-1)/(p-1) and d=2t+1.

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

Numbers it reports

1. A QNFO entry benchmarks 17 qubit‑based platforms against a qudit architecture on a joules‑per‑solution energy metric, noting all 17 use two‑level systems [10].

   from 2. Background and Related Work

2. Under independent depolarizing noise at physical error rate $\varepsilon=10^{-3}$ we compute, with full arithmetic, a passive logical failure probability $P_{\mathrm{pass}}\approx9.98\times10^{-6}$, a suppression factor of $\approx100.2$ over an unencoded qudit, and, as an explicitly labeled projection, a $\approx4.08$‑fold advantage over an active distance‑3 baseline with noisy syndrome extraction.

   from Abstract

3. No simulation, measurement, or hardware experiment is performed or reported in this paper; the comparison to active correction in Section 4.4 is a projection under stated assumptions, and the pseudo‑threshold in Section 4.5 is a projection under a stated dominant‑term approximation.

   from 3.5 Computational method

4. Suppression factor relative to the unencoded qudit (failure probability $\varepsilon=10^{-3}$): $$ \frac{\varepsilon}{P_{\mathrm{pass}}} =\frac{10^{-3}}{9.980015\times10^{-6}}\approx100.2. $$ Case $p=3$, $t=2$ ($n_2=17$, $d=5$).

   from 4.3 Passive failure probability (exact computation)

5. Linear interpolation gives $$ \varepsilon_{\mathrm{th}}\approx0.32+0.01\times\frac{1.00618-1}{1.00618-0.99252} =0.32+0.01\times0.4524=0.3245. $$ Hence the pseudo‑threshold under the dominant‑term approximation is $\varepsilon_{\mathrm{th}}\approx0.3245$; this is a projection, since higher‑order terms are ignored.

   from 4.5 Pseudo‑threshold (projection)

6. Passive logical failure (exact computation, $p=3$, $t=1$, $\varepsilon=10^{-3}$). $P_{\mathrm{pass}}\approx9.98\times10^{-6}$ per protection epoch, a suppression factor $\varepsilon/P_{\mathrm{pass}}\approx100.2$ over an unencoded qudit.

   from 5. Results

How it is done

1. We prove a nesting lemma, use it to show that every error set of weight $\le t$ on a protected ball is correctable under the Knill–Laflamme conditions, and derive the code parameters $n_t=1+(p+1)(p^{t}-1)/(p-1)$ and $d=2t+1$.

   from Abstract

2. First, we formalize “ultrametric geometric QEC”: we define the code, the error model, and the correctable error sets, and we prove a nesting lemma (Lemma 1) from which correctability of all weight‑$\le t$ errors follows.

   from 1. Introduction

3. The defining combinatorial fact, used repeatedly, is the nesting lemma : Lemma 1 (nesting/disjointness).

   from 3.1 The geometry

4. Errors are vertex‑localised Weyl operators $X^{a}Z^{b}$ acting on single‑vertex qudits, matching the standard decomposition of general noise into Pauli‑type operators [5].

   from 3.3 Error model

What would falsify it

1. All figures are analytic projections under stated assumptions; limitations and falsification criteria are discussed.

   from Abstract

2. The central claims would be falsified if: (a) an explicit encoder on $B_t(v_0)$ fails the Knill–Laflamme conditions for some weight‑$\le t$ Weyl error set, contradicting Proposition 1; (b) two distinct equal‑radius balls of $T_{p+1}$ overlap without coinciding, contradicting Lemma 1; or (c) a fault‑tolerant simulation of the code under the stated noise model yields logical failure rates inconsistent with the binomial computation of Section 4.3.

   from 6. Discussion

3. The outcome that would falsify the passive‑failure prediction is a measured logical failure rate $P_{\mathrm{exp}}$ that deviates from the analytically computed $P_{\mathrm{pass}}\approx9.98\times10^{-6}$ by more than a factor of two, after accounting for statistical uncertainty.

   from 7. Practical Implications and Engineering Pathways

Where the claim stops

1. Proposition 1, however, is conditional: the branch‑permutation symmetry of the code states is a design requirement, and no explicit encoder (state vectors, stabilizer generators, or logical operators) is constructed in this paper.

   from 6. Discussion

2. If no symmetric encoder exists for a given ball, the weight‑$\le t$ correctability claim and the distance $d=2t+1$ fail.

   from 6. Discussion

3. (iii) The active‑baseline comparison rests on assumptions (A1)–(A4), in particular the pessimistic choice $\varepsilon_m=\varepsilon$ and the simple combination rule of (A3); a real baseline may have a smaller $\varepsilon_m$, which would shrink the $\approx4.08$ factor toward unity, or may require multiple syndrome‑extraction rounds, which would enlarge it.

   from 6. Discussion

Where to read

1. Abstract181 words · 1 min
2. 1. Introduction389 words · 2 min
3. 2. Background and Related Work626 words · 3 min
4. 3. Methods484 words · 2 min
5. 4. Analysis616 words · 3 min
6. 5. Results100 words · 1 min
7. 6. Discussion372 words · 2 min
8. 7. Practical Implications and Engineering Pathways474 words · 2 min
9. 8. Conclusion139 words · 1 min
10. Provenance and AI Involvement225 words · 1 min