A Tradeoff in Quantum Codes Is Tested on Tree Shapes

In the paper's words

(arXiv:2608.03944, 2026) proved that quantum error correction and Quantum Darwinism cannot coexist above a critical logical fidelity F_L > 0.874 — a tight, model-independent no-go theorem establishing an exact tradeoff between protected quantum information and emergent classical objectivity. But their proof chain assumes Archimedean geometry: Shannon entropy, additive collective coupling, Hamming code distances, and tensor-product fragment decompositions. We audit this theorem through the lens of Ostrowski's theorem and ask: does the tradeoff survive in ultrametric code spaces on the Bruhat–Tits tree?

The abstract, verbatim; every line below is quoted from the text.

What it claims

the boundary between established physics and speculative mathematics is

Numbers it reports

1. For any qubit block state $\rho_B$ with bare logical fidelity $F_{\text{bare}} = \langle \bar{z}_+ | \rho_B | \bar{z}_+ \rangle$, the von Neumann entropy satisfies $$S(\rho_B) \leq H_2(F_{\text{bare}}),$$ where $H_2(x) = -x \log_2 x - (1-x) \log_2 (1-x)$ is the binary entropy.

   from 3.3 Lemma 1 — Block Entropy Bound (Archimedean)

2. For the imperfect-recovery model, the no-go threshold becomes: $$F_L(N) \gt \eta + (1-\eta) \cdot H_2^{-1}[(1-\delta)\ln 2] \quad \Longrightarrow \quad R_\delta = 0.$$ Operational example: For $\delta = 0.10$ and $\eta = 0.60$, the threshold is $$F_L(N) \gt 0.874 \quad \Longrightarrow \quad \text{zero Darwinistic redundancy}.$$ Any logical qubit protected with fidelity exceeding 87.4% produces ZERO redundant classical records — the qubit is quantum-coherent but classically invisible.

   from 3.5 Corollary — Imperfect Recovery

3. With collective fragments, $R_\delta$ first becomes positive at $F_L \approx 0.83$–$0.85$ (p=2: 0.833–0.837; p=3: 0.847–0.849), up from $\approx 0.80$ in the single-qubit model — a 45–65% reduction in the gap to the theorem boundary $F_L = 0.874$.

   from 6.4.1 New Open Questions Opened by the v1.4 Investigation (v1.5)

4. Archimedean: $S(\rho_B) \leq H_2(F_{\text{bare}})$, where $H_2(x) = -x\log_2 x - (1-x)\log_2(1-x)$ is a SMOOTH function on $[0,1]$.

   from 5.2 The Entropy Bound — Discrete vs. Continuous

5. (arXiv:2608.03944, 2026) proved that quantum error correction and Quantum Darwinism cannot coexist above a critical logical fidelity $F_L \gt 0.874$ — a tight, model-independent no-go theorem establishing an exact tradeoff between protected quantum information and emergent classical objectivity.

   from Abstract

6. (arXiv:2608.03944) have established the first quantitative connection between these paradigms: an exact information-theoretic tradeoff $$R(f) \cdot F_L \leq C$$ where $R(f)$ is Darwinistic redundancy (the number of environment fragments that carry the full system information) and $F_L$ is the post-recovery logical fidelity (how well the logical qubit survives after syndrome extraction and correction).

   from 1. Introduction: A Tradeoff Born in One Completion

How it is done

1. (arXiv:2608.03944, 2026) proved that quantum error correction and Quantum Darwinism cannot coexist above a critical logical fidelity $F_L \gt 0.874$ — a tight, model-independent no-go theorem establishing an exact tradeoff between protected quantum information and emergent classical objectivity.

   from Abstract

2. A model-independent no-go theorem further shows that $F_L$ exceeding a critical threshold $F_L^{\text{crit}}$ precludes redundant classical records entirely.

   from 1. Introduction: A Tradeoff Born in One Completion

3. §3 summarizes the Maity et al. theorem: model, derivation, and the no-go bound §4 introduces ultrametric code spaces: Bruhat-Tits geometry, p-adic sphere packings, and the Ostrowski diagnostics §5 reformulates redundancy in ultrametric terms and derives how the tradeoff relation transforms §6 discusses implications: could ultrametric QEC circumvent the Darwinism bottleneck?

   from 1.1 Structure

4. (arXiv:2608.03944) proved a tight, model-independent no-go theorem: above logical fidelity $F_L \gt 0.874$, quantum error correction and Quantum Darwinism cannot coexist.

   from 2. So What? Why Should a Reader Care About This Research?

What would falsify it

1. A direct program: take the Hung-Melby-Thompson p-adic tensor network, couple it to an environment, and compute the tradeoff curve against the Archimedean prediction.

   from 6.4 Partial Progress on the Open Questions (v1.4)

2. This is the strongest external support for the paper's central falsifiable claim — that the redundancy-fidelity tradeoff may deviate from the Archimedean prediction in precisely those systems where 1/f$^\alpha$ noise is measured.

   from 6.4 Partial Progress on the Open Questions (v1.4)

3. Albeverio & Karwowski [28] computed the generator and spectrum of the random walk on p-adics : the spectrum is countable, indexed by the p-adic valuation hierarchy, and the associated relaxation times form the discrete geometric ladder $\tau_n \sim p^{n}$ — precisely the discrete time-scale structure that §5.3 predicts for the redundancy staircase.

   from 6.4 Partial Progress on the Open Questions (v1.4)

Where the claim stops

1. Maity et al. proved that quantum error correction and Quantum Darwinism are in exact quantitative tension — redundancy in the environment comes at the expense of logical quantum coherence, and beyond a threshold ($F_L \gt 0.874$), redundancy cannot exist.

   from 7. Conclusion

2. In an ultrametric space — the Bruhat–Tits tree, the native geometry for $p$-adic information — the strong triangle inequality forces three consequences that the Archimedean theory does not anticipate: Quantized redundancy.

   from 7. Conclusion

3. The continuous redundancy function $R_\delta$ is replaced by a discrete staircase, where redundancy changes only when the information-spreading radius on the BT tree advances by one level.

   from 7. Conclusion

Where to read

1. Abstract276 words · 1 min
2. 1. Introduction: A Tradeoff Born in One Completion554 words · 2 min
3. 2. So What? Why Should a Reader Care About This Research?617 words · 3 min
4. 3. The No-Go Theorem (Summary of Maity et al.)636 words · 3 min
5. 4. Ultrametric Code Spaces566 words · 2 min
6. 5. The Tradeoff Under Ultrametric Transformation842 words · 4 min
7. 6. Implications3,538 words · 15 min
8. 7. Conclusion352 words · 2 min
9. Declarations56 words · 1 min