Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bruhat-Tits Readout Protocol: Measuring the ZBW Z2 Invariant in Majorana Qubit Systems

Rowan Brad Quni-Gudzinas

Published Jul 13, 2026• 0 citations
Publisher

Abstract

Design and analysis of a Bruhat-Tits tree-based readout protocol for measuring the Z2 invariant in Majorana qubit systems.
DOI
10.5281/zenodo.21336019

Related papers

Bruhat-Tits Readout Protocol: Measuring the ZBW Z2 Invariant in Majorana Qubit Systems

Rowan Brad Quni-Gudzinas

Design and analysis of a Bruhat-Tits tree-based readout protocol for measuring the Z2 invariant encoded in ZBW frequencies of Majorana qubit systems.

•Jul 13, 2026•0 citations

Cavity-based readout and control of Majorana qubits

Thomas B. Smith, Arne L. Grimsmo, Stephen D. Bartlett +1 more

Bulletin of the American Physical Society•Mar 4, 2019•0 citations

Majorana qubit readout using parametric modulation of light-matter coupling

Arne L. Grimsmo, Alexandre Blais, Karl D. Petersson

Bulletin of the American Physical Society•Mar 5, 2018•0 citations

The Adelic Physics Program: A Grand Synthesis

QNFO Research Agent, Rowan Brad Quni-Gudzinas

Six papers, one thesis: **Physics is adelic.** The Archimedean (real-number) description is the $\infty$-place readout of a richer ultrametric structure defined over the p-adic completions of $\mathbb{Q}$. Ostrowski's theorem — which classifies all non-trivial completions of the rational numbers as $\mathbb{R}$ and $\mathbb{Q}_p$ for each prime $p$ — is the hidden organizing principle behind quantum measurement, quantum error correction, and the structure of spacetime at the Compton scale. We present the unified framework: Zitterbewegung (ZBW) is the physical manifestation of the p-adic channel of the adelic Dirac equation; Majorana zero modes are Bruhat-Tits fixed points encoding adelic topological charge; and adelic quantum error correction replaces active QEC codes with number-theoretic protection. This synthesis paper connects all six companion publications into a coherent research program with specific, falsifiable predictions. **Keywords:** Adelic physics, Ostrowski's theorem, Zitterbewegung, Bruhat-Tits tree, p-adic quantum mechanics, topological quantum computing, grand synthesis ---

•Jul 6, 2026•0 citations

Zitterbewegung: From Archimedean Puzzle to Adelic Observable

Rowan Brad Quni-Gudzinas

We prove that the truncated representation ring of SU(2) is isomorphic to the character ring of Z2^x at matching levels (Silent Parameter Principle). The 2-adic ZBW frequency is computed as sqrt(2) x 2mc^2/hbar, a 41.4% deviation from the Archimedean value. The ZBW oscillation is identified as the physical clock bridging both completions. Yang-Feldman equation is recast on Bruhat-Tits tree. p-adic Foldy-Wouthuysen transformation constructed. Single-ion trapped-ion experimental timeline: 2028-2032.

•Jul 26, 2026•0 citations

Bruhat-Tits Quantum Processor: Ultrametric Fault-Tolerant Quantum Computation with Holographic Tree Codes

Rowan Brad Quni-Gudzinas

We propose a fault-tolerant quantum computing architecture—the Bruhat-Tits Quantum Processor—that exploits the ultrametric geometry of the Bruhat-Tits tree $\mathcal{T}_p$ to achieve quantum error correction thresholds substantially exceeding those of conventional Euclidean-locality codes. The architecture uses holographic perfect-tensor codes on a truncated Bruhat-Tits tree, tree-automorphism logical gates, and fractal-multiplexed readout. We compute bit-flip, depolarizing, independent $X$+$Z$, gate-error, and magic-state distillation thresholds via analytical recursion, exact Gottesman-Knill stabilizer simulation, and Monte Carlo methods. The tree code achieves a bit-flip threshold of $p_c = 50.0\%$ ($4.6\times$ above surface codes at $\sim 10.9\%$), a depolarizing threshold of $p_c = 75.0\%$ ($75\times$ above surface codes at $\sim 1.0\%$), and an independent $X$+$Z$ threshold of $p_c = 17.30\%$. We benchmark the tree code against the surface code at matched physical qubit counts using Monte Carlo simulation with Minimum-Weight Perfect Matching (MWPM) decoding. A logical-level demonstration of Shor’s algorithm for $N = 15$ confirms algorithmic completeness and establishes physical resource requirements. All quantitative claims are verified by self-contained Python simulations. We identify open problems—including perfect tensor existence, tree automorphism gate generation, and physical noise modeling—as directions for future investigation. The architecture’s defining innovation is the use of ultrametricity as a quantum error correction resource: the strong triangle inequality $d(x,z) = \max(d(x,y), d(y,z))$ confines error clusters to disjoint subtrees, enabling parallel, local decoding in $O(s \log s)$ time.

•May 10, 2026•0 citations
Six papers, one thesis: **Physics is adelic.** The Archimedean (real-number) description is the ∞\infty∞-place readout of a richer ultrametric structure defined over the p-adic completions of Q\mathbb{Q}Q. Ostrowski's theorem — which classifies all non-trivial completions of the rational numbers as R\mathbb{R}R and Qp\mathbb{Q}_pQp​ for each prime ppp — is the hidden organizing principle behind quantum measurement, quantum error correction, and the structure of spacetime at the Compton scale. We present the unified framework: Zitterbewegung (ZBW) is the physical manifestation of the p-adic channel of the adelic Dirac equation; Majorana zero modes are Bruhat-Tits fixed points encoding adelic topological charge; and adelic quantum error correction replaces active QEC codes with number-theoretic protection. This synthesis paper connects all six companion publications into a coherent research program with specific, falsifiable predictions. **Keywords:** Adelic physics, Ostrowski's theorem, Zitterbewegung, Bruhat-Tits tree, p-adic quantum mechanics, topological quantum computing, grand synthesis ---
We prove that the truncated representation ring of SU(2) is isomorphic to the character ring of Z2^x at matching levels (Silent Parameter Principle). The 2-adic ZBW frequency is computed as sqrt(2) x 2mc^2/hbar, a 41.4% deviation from the Archimedean value. The ZBW oscillation is identified as the physical clock bridging both completions. Yang-Feldman equation is recast on Bruhat-Tits tree. p-adic Foldy-Wouthuysen transformation constructed. Single-ion trapped-ion experimental timeline: 2028-2032.
We propose a fault-tolerant quantum computing architecture—the Bruhat-Tits Quantum Processor—that exploits the ultrametric geometry of the Bruhat-Tits tree Tp\mathcal{T}_pTp​ to achieve quantum error correction thresholds substantially exceeding those of conventional Euclidean-locality codes. The architecture uses holographic perfect-tensor codes on a truncated Bruhat-Tits tree, tree-automorphism logical gates, and fractal-multiplexed readout. We compute bit-flip, depolarizing, independent XXX+ZZZ, gate-error, and magic-state distillation thresholds via analytical recursion, exact Gottesman-Knill stabilizer simulation, and Monte Carlo methods. The tree code achieves a bit-flip threshold of pc=50.0%p_c = 50.0\%pc​=50.0% (4.6×4.6\times4.6× above surface codes at ∼10.9%\sim 10.9\%∼10.9%), a depolarizing threshold of pc=75.0%p_c = 75.0\%pc​=75.0% (75×75\times75× above surface codes at ∼1.0%\sim 1.0\%∼1.0%), and an independent XXX+ZZZ threshold of pc=17.30%p_c = 17.30\%pc​=17.30%. We benchmark the tree code against the surface code at matched physical qubit counts using Monte Carlo simulation with Minimum-Weight Perfect Matching (MWPM) decoding. A logical-level demonstration of Shor’s algorithm for N=15N = 15N=15 confirms algorithmic completeness and establishes physical resource requirements. All quantitative claims are verified by self-contained Python simulations. We identify open problems—including perfect tensor existence, tree automorphism gate generation, and physical noise modeling—as directions for future investigation. The architecture’s defining innovation is the use of ultrametricity as a quantum error correction resource: the strong triangle inequality d(x,z)=max⁡(d(x,y),d(y,z))d(x,z) = \max(d(x,y), d(y,z))d(x,z)=max(d(x,y),d(y,z)) confines error clusters to disjoint subtrees, enabling parallel, local decoding in O(slog⁡s)O(s \log s)O(slogs) time.