Holographic Quantum Error Correction as AdS/CFT Renormalization‑Group Flow on Bruhat–Tits Trees: A Conditional Threshold Analysis at $10^{-4}$

In the paper's words

Quantum error‑correction (QEC) thresholds determine whether physical error rates can be suppressed to arbitrarily low logical error probabilities. A recent proposal encodes logical information as a renormalization‑group (RG) flow on a p‑adic Bruhat–Tits tree T_p, with a bosonic cat‑code inner layer and a p‑ary majority‑vote outer layer. We ask whether this architecture can sustain a threshold of at least 10^-4 per logical qubit per cycle.

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

What it claims

The architecture meets a logical‑error threshold ≥10^-4 under the central‑case hardware budget, with the binding practical constraint being the readout‑dominated margin 19.2× and the correlated‑burst survivability condition p_rm corr≤7.7×10^-6.

Numbers it reports

1. Using the Tianyan‑287 superconducting processor error rates ($p_{2q}=4.4\times10^{-3}$, $p_{1q}=1.0\times10^{-3}$, $p_{\rm ro}=1.3\times10^{-2}$) and a cat‑code mean photon number $\bar n=6$, we derive an exact recursion $f(p)=3p^{2}-2p^{3}$ for a ternary tree, locate its non‑trivial fixed point $p^{\ast}=1/4$, and propagate the hardware budget through the stack.

   from Abstract

2. A depth‑2 concatenation yields a logical error $1.4\times10^{-29}$ under the independence assumption, while a conservative correlated‑error floor is $8.0\times10^{-8}$ per cycle.

   from Abstract

3. The tightest margin (readout‑dominated dephasing) is $19.2\times$, and the threshold holds provided correlated bursts satisfy $p_{\rm corr}\le7.7\times10^{-6}$ per subtree per cycle.

   from Abstract

4. Present‑day cloud‑accessible superconducting processors, such as the Tianyan‑287 device, report a two‑qubit gate error of $4.4\times10^{-3}$, which is only a factor of $44$ above $10^{-4}$ and can be bridged by a single layer of bosonic encoding.

   from 1. Introduction

5. If a holographic QEC architecture based on a Bruhat–Tits tree $\mathcal{T}_p$ can achieve a threshold $\ge10^{-4}$, then existing hardware could be upgraded to fault‑tolerant operation with modest additional resources.

   from 1. Introduction

How it is done

1. Correction (version 2.0.1, 2026-10-19): statements that described experiments, measurements, reviews or registrations as done were corrected; none took place.

   from Holographic Quantum Error Correction as AdS/CFT Renormalization‑Group Flow on Bruhat–Tits Trees: A Conditional Threshold Analysis at $10^{-4}$

2. Using the Tianyan‑287 superconducting processor error rates ($p_{2q}=4.4\times10^{-3}$, $p_{1q}=1.0\times10^{-3}$, $p_{\rm ro}=1.3\times10^{-2}$) and a cat‑code mean photon number $\bar n=6$, we derive an exact recursion $f(p)=3p^{2}-2p^{3}$ for a ternary tree, locate its non‑trivial fixed point $p^{\ast}=1/4$, and propagate the hardware budget through the stack.

   from Abstract

3. Conversely, failure to meet this bound would indicate that the ultrametric RG encoding does not provide a practical advantage over conventional concatenated codes.

   from 1. Introduction

4. The experiment of [1] measured holographic entanglement entropy on a programmable quantum simulator, demonstrating that key observables of AdS/CFT are accessible on near‑term hardware.

   from 2. Background and Related Work

What would falsify it

1. If $p_{\rm corr}\gt 7.7\times10^{-6}$, the $10^{-4}$ threshold claim is falsified unless an outer corrective layer is added.

   from Outlook and falsifiable tests

2. On a trapped‑ion simulator, measure hierarchical clustering of logical syndromes as predicted by the $p$‑adic geometry; a negative result would refute the holographic interpretation of the code [10].

   from Outlook and falsifiable tests

3. These results are analytic, fully documented, and identify concrete falsifiable tests on superconducting and trapped‑ion platforms.

   from Abstract

Where the claim stops

1. The independence assumption neglects realistic crosstalk and leakage; a burst that defeats cat suppression entirely yields a floor $1.3\times10^{-2}$, far above the target.

   from Limitations

2. The $1.4\times10^{-29}$ figure arises from iterating the recursion under strict independence and does not account for prefactors that grow with depth.

   from Limitations

3. While the analysis rests on several design assumptions, it delineates a clear engineering pathway and a falsifiable experimental target for realizing holographic QEC at fault‑tolerant thresholds.

   from 8. Conclusion

Where to read

1. Abstract183 words · 1 min
2. 1. Introduction181 words · 1 min
3. 2. Background and Related Work248 words · 1 min
4. 3. Methods287 words · 1 min
5. 4. Analysis395 words · 2 min
6. 5. Results140 words · 1 min
7. 6. Discussion223 words · 1 min
8. 7. Practical Implications and Engineering Pathways308 words · 1 min
9. 8. Conclusion123 words · 1 min
10. Correction Notice380 words · 2 min
11. Provenance and AI Involvement237 words · 1 min
12. Appendix A. Divergence report86 words · 1 min