Ultrametric Quantum Error Correction on Bruhat–Tits Trees: Energy Barriers, Classical Evidence, and the Quantization Question

In the paper's words

We study a conjectured passive fault-tolerance scheme in which logical qubits are encoded on a Bruhat–Tits tree, the infinite homogeneous tree associated with a non-Archimedean local field, whose natural metric satisfies the strong (ultrametric) triangle inequality. The conjecture states that the energy barrier against a logical error grows as E_barrier(d) = 2^d in tree depth d, yielding passive protection without active syndrome extraction, with thresholds allegedly exceeding those of surface codes. The motivating evidence is classical: an unverified report from the authors' notebook notes (not documented in any supplied bibliography entry, and treated throughout this paper as a labeled assumption rather than an established empirical finding) states that simulations of majority-vote decoding on classical bits found zero logical errors at a physical error rate of $p = 0.4$ for depth d ≥ 3. [...]

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

Numbers it reports

1. Requiring this to be at least $0.05$ (95% one-sided confidence) gives $$ p_L \leq 1 - 0.05^{1/N} \approx \frac{\ln 20}{N}, $$ using $-\ln(0.05) = \ln 20 = 2.995732$.

   from 4.3 Statistical interpretation of "zero logical errors"

2. The motivating evidence is classical: an unverified report from the authors' notebook notes (not documented in any supplied bibliography entry, and treated throughout this paper as a labeled assumption rather than an established empirical finding) states that simulations of majority-vote decoding on classical bits found zero logical errors at a physical error rate of $p = 0.4$ for depth $d \geq 3$.

   from Abstract

3. We formalize the encoding, derive the barrier scaling from the ultrametric geometry, and analyze by explicit computation what the classical evidence does and does not establish: one level of eight-fold majority voting maps $p = 0.4$ to a failure probability of $0.1736704$, two concatenated levels give $\approx 5.55 \times 10^{-3}$, and three levels give $\approx 2.9 \times 10^{-10}$, confirming a genuine recursive threshold mechanism.

   from Abstract

4. An explicit arithmetic analysis of the classical majority-vote evidence, showing that iterated majority voting on an eight-leaf tree constitutes a genuine recursive threshold mechanism at $p = 0.4$, with computed suppression levels (Section 4).

   from 1. Introduction

5. The single empirical input is the reported simulation result, taken from the source notebook notes: zero logical errors at $40\%$ physical error rate ($p = 0.4$) for $d \geq 3$, under majority-vote decoding on classical bits.

   from 4. Analysis

6. Sum: $$ f(0.4) = 0.12386304 + 0.04128768 + 0.00786432 + 0.00065536 = 0.1736704. $$ So one level of eight-fold majority voting maps $p = 0.4$ to $p^{(1)} = 0.1736704$ — a suppression factor of $0.4 / 0.1736704 \approx 2.303$.

   from 4.1 Single-level majority vote at $p = 0.4$

How it is done

1. We reinterpret "zero logical errors" as a confidence bound rather than proof of a vanishing error rate, derive a thermal-activation bound $e^{-2^{d}}$ under a stated barrier model, and identify the central open question: whether the strong triangle inequality confines quantum errors — superpositions, entanglement, coherent noise — or whether the advantage evaporates under full quantum channels.

   from Abstract

2. A statistical reinterpretation of "zero logical errors" as a confidence bound, not a proof of a vanishing error rate (Section 4).

   from 1. Introduction

3. No entry in the supplied bibliography contains a threshold theorem for ultrametric geometries, a quantum Monte Carlo study of tree codes, or a proof that the strong triangle inequality confines quantum error operators.

   from 2. Background and Related Work

4. We use only the tree structure.

   from 3.1 The Bruhat–Tits tree and its ultrametric

What would falsify it

1. We give labeled projections under declared assumptions, state falsification criteria, and outline the quantum Monte Carlo and tensor-network tests that would settle the question.

   from Abstract

2. Three ways the proposal can fail: (i) the repetition-like quantum encoding does not correct $X$-type errors, so the classical threshold does not transfer; (ii) coherent error paths interfere across branches, effectively reconverging paths that the ultrametric separates classically — this would falsify Hypothesis Q; (iii) the barrier is over-the-barrier only, and resonant tunnelling through the $2^{d}$-site cut restores a depth-independent error channel.

   from 6. Discussion

3. A quantum Monte Carlo simulation of the depolarizing channel $\mathcal{E}_p$ on $\mathcal{T}_d$ showing a logical error rate that does not decrease with $d$ at fixed $p \leq 0.4$ would falsify the transfer of the classical threshold.

   from 6. Discussion

Where the claim stops

1. The thermal-activation projections assume $k_{\mathrm{B}}T = 1$ and no tunnelling; the confidence bounds assume independence of trials and unstated $N$.

   from 6. Discussion

2. Three ways the proposal can fail: (i) the repetition-like quantum encoding does not correct $X$-type errors, so the classical threshold does not transfer; (ii) coherent error paths interfere across branches, effectively reconverging paths that the ultrametric separates classically — this would falsify Hypothesis Q; (iii) the barrier is over-the-barrier only, and resonant tunnelling through the $2^{d}$-site cut restores a depth-independent error channel.

   from 6. Discussion

3. A quantum Monte Carlo simulation of the depolarizing channel $\mathcal{E}_p$ on $\mathcal{T}_d$ showing a logical error rate that does not decrease with $d$ at fixed $p \leq 0.4$ would falsify the transfer of the classical threshold.

   from 6. Discussion

Where to read

1. Abstract277 words · 1 min
2. 1. Introduction578 words · 3 min
3. 2. Background and Related Work1,032 words · 4 min
4. 3. Methods469 words · 2 min
5. 4. Analysis1,242 words · 5 min
6. 5. Results197 words · 1 min
7. 6. Discussion419 words · 2 min
8. 7. Conclusion118 words · 1 min
9. Appendix A. Divergence report140 words · 1 min
10. Appendix B. Claim attribution116 words · 1 min