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

The Adelic Qubit: Manufacturable Hardware/Software Architecture Specification v1.1

Rowan Brad Quni-Gudzinas

Published Jul 6, 2026• 0 citations
Publisher

Abstract

Complete hardware and software architecture for the adelic qubit. Five-layer stack: physical (Al-InAs tetrons), Archimedean (topological gap), 2-adic (ZBW Z2 invariant), p-adic (braid compilation 12,000x Solovay-Kitaev speedup), and classical compiler. Red-team audited: 6/6 claims survive negative verification. Includes tested simulation framework.

DOI
10.5281/zenodo.21221822

Related papers

Room-Temperature Adelic Nuclear-Spin Qubit: p-adic Compilation and Dynamical Decoupling for Number-Theoretic Error Correction — v2.0

Rowan Brad Quni-Gudzinas

We propose and numerically validate a room-temperature (300 K) variant of the Adelic Qubit Architecture that replaces the Archimedean topological gap (requiring T < 30 mK) with dynamical decoupling and NV-center nuclear-spin readout. The p-adic braid compilation (12,000x Solovay-Kitaev speedup via Hensel lifting) and 2-adic Z2 Zitterbewegung invariant are shown to be temperature-independent. Six open questions from prior work are addressed with numerical simulation results.

•Jul 12, 2026•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

Kepler Program: Complete Framework for Adelic Quantum Computing — Iteration 3 (Corrected)

Rowan Brad Quni-Gudzinas

The Kepler Program establishes that fault-tolerant quantum computing requires departure from purely Archimedean (Boolean) representations. Through Ostrowski's theorem, we prove that any complete quantum error correction scheme must encode logical information in an adelic representation — simultaneously well-defined in both Archimedean and p-adic metrics. BUNDLE CONTENTS (10 Phases): - Phase 1: OFT Theorem Proof (Ostrowski → Fault Tolerance) - Phase 2: QEC Architecture + Provisional Patent (20 claims) - Phase 3: Multi-Prime Hensel Codec (GPU/SIMD, 73K enc/s) - Phase 4: Quantum Hardware Lab Identification + Collaboration Proposals - Phase 5: Silent Radix Defense + Braided Memory Patent + LoF↔Ultrametric - Phase 6: Planck Derivation (19→3 params) + Informational Universe + Infomatics - Phase 7: 2-adic Signal Confirmation (p<0.001) + Posner Molecule Protocol - Phase 8: Re-Entry + Ultrametric Signatures + Autaxys Falsification + Time-as-Tree-Depth - Phase 9: Infrastructure Decommission + Archive Migration + Discovery Momentum - Phase 10: 7 Synthesis Papers + Kepler Program Capstone CORRECTIVE NOTICE: This publication replaces a previous incorrect DOI claim (10.5281/zenodo.21304674 — which belongs to an unrelated ML paper by Zhang, Jincheng). The Kepler Program bundle was never properly published in Iteration 2. This Iteration 3 publication is the first verified Kepler Program bundle on Zenodo.

•Jul 11, 2026•0 citations

QC-Stack: A Layered Reference Model for Quantum Computers

Ashutosh Bhatia, Sainath Bitragunta, Kamlesh Tiwari

This paper presents a layered architecture QC-Stack for the quantum computing domain. It is a comprehensive framework explaining quantum computing systems by identifying three fundamental layers: the physical, system, and application layers. Each plays a crucial role in implementing quantum computing systems in practice. The physical layer evaluates quantum hardware technologies based on crucial performance parameters such as qubit quality, connectivity, and scalability. The system layer, which includes quantum firmware, compilers, operating systems, and software development tools, bridges the gap between the physical and application layers. The application layer incorporates Quantum Programming Languages and algorithms, emphasizing their significance in leveraging quantum computing potential across various domains. The paper provides a comparative analysis at a higher level of existing quantum algorithms, protocols, and hardware and software technologies within each sub-layer. It also highlights the strengths and weaknesses of different technologies at each layer. This holistic model can guide researchers and practitioners, offering insights into the ever-evolving landscape of quantum technology.

International Conference on Communication Systems & Networks (COMSNETS)•Jan 3, 2024•0 citations

The Adelic ZBW Programme: ZBW-Majorana Hypothesis, Ostrowski-QEC Synthesis, and Cross-Programme Consilience

Rowan Brad Quni-Gudzinas

Capstone synthesis of the ZBW-Majorana-TQC research programme (P1-P4). Establishes 6 interconnected claims: (1) vanishing Majorana ZBW current correlator, (2) Z2 topological invariant, (3) intrinsic topological protection, (4) 57% Bruhat-Tits edge reduction, (5) three experimental protocols, (6) hardware-level TQC implications. Includes falsifiability matrix and integrated experimental roadmap.

•Jul 25, 2026•0 citations

Quantum Accelerator Stack: A Research Roadmap

Koen Bertels, Aritra Sarkar, Anna M. Krol +7 more

This paper presents the definition and implementation of a quantum computer architecture to enable creating a new computational device - a quantum computer as an accelerator In this paper, we present explicitly the idea of a quantum accelerator which contains the full stack of the layers of an accelerator. Such a stack starts at the highest level describing the target application of the accelerator. Important to realise is that qubits are defined as perfect qubits, implying they do not decohere and perform good quantum gate operations. The next layer abstracts the quantum logic outlining the algorithm that is to be executed on the quantum accelerator. In our case, the logic is expressed in the universal quantum-classical hybrid computation language developed in the group, called OpenQL. We also have to start thinking about how to verify, validate and test the quantum software such that the compiler generates a correct version of the quantum circuit. The OpenQL compiler translates the program to a common assembly language, called cQASM. We need to develop a quantum operating system that manages all the hardware of the micro-architecture. The layer below the micro-architecture is responsible of the mapping and routing of the qubits on the topology such that the nearest-neighbour-constraint can be be respected. At any moment in the future when we are capable of generating multiple good qubits, the compiler can convert the cQASM to generate the eQASM, which is executable on a particular experimental device incorporating the platform-specific parameters. This way, we are able to distinguish clearly the experimental research towards better qubits, and the industrial and societal applications that need to be developed and executed on a quantum device.

arXiv:2102.02035•Feb 3, 2021•6 citations
Complete hardware and software architecture for the adelic qubit. Five-layer stack: physical (Al-InAs tetrons), Archimedean (topological gap), 2-adic (ZBW Z2 invariant), p-adic (braid compilation 12,000x Solovay-Kitaev speedup), and classical compiler. Red-team audited: 6/6 claims survive negative verification. Includes tested simulation framework.
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 ---
The Kepler Program establishes that fault-tolerant quantum computing requires departure from purely Archimedean (Boolean) representations. Through Ostrowski's theorem, we prove that any complete quantum error correction scheme must encode logical information in an adelic representation — simultaneously well-defined in both Archimedean and p-adic metrics. BUNDLE CONTENTS (10 Phases): - Phase 1: OFT Theorem Proof (Ostrowski → Fault Tolerance) - Phase 2: QEC Architecture + Provisional Patent (20 claims) - Phase 3: Multi-Prime Hensel Codec (GPU/SIMD, 73K enc/s) - Phase 4: Quantum Hardware Lab Identification + Collaboration Proposals - Phase 5: Silent Radix Defense + Braided Memory Patent + LoF↔Ultrametric - Phase 6: Planck Derivation (19→3 params) + Informational Universe + Infomatics - Phase 7: 2-adic Signal Confirmation (p<0.001) + Posner Molecule Protocol - Phase 8: Re-Entry + Ultrametric Signatures + Autaxys Falsification + Time-as-Tree-Depth - Phase 9: Infrastructure Decommission + Archive Migration + Discovery Momentum - Phase 10: 7 Synthesis Papers + Kepler Program Capstone CORRECTIVE NOTICE: This publication replaces a previous incorrect DOI claim (10.5281/zenodo.21304674 — which belongs to an unrelated ML paper by Zhang, Jincheng). The Kepler Program bundle was never properly published in Iteration 2. This Iteration 3 publication is the first verified Kepler Program bundle on Zenodo.
This paper presents a layered architecture QC-Stack for the quantum computing domain. It is a comprehensive framework explaining quantum computing systems by identifying three fundamental layers: the physical, system, and application layers. Each plays a crucial role in implementing quantum computing systems in practice. The physical layer evaluates quantum hardware technologies based on crucial performance parameters such as qubit quality, connectivity, and scalability. The system layer, which includes quantum firmware, compilers, operating systems, and software development tools, bridges the gap between the physical and application layers. The application layer incorporates Quantum Programming Languages and algorithms, emphasizing their significance in leveraging quantum computing potential across various domains. The paper provides a comparative analysis at a higher level of existing quantum algorithms, protocols, and hardware and software technologies within each sub-layer. It also highlights the strengths and weaknesses of different technologies at each layer. This holistic model can guide researchers and practitioners, offering insights into the ever-evolving landscape of quantum technology.
This paper presents the definition and implementation of a quantum computer architecture to enable creating a new computational device - a quantum computer as an accelerator In this paper, we present explicitly the idea of a quantum accelerator which contains the full stack of the layers of an accelerator. Such a stack starts at the highest level describing the target application of the accelerator. Important to realise is that qubits are defined as perfect qubits, implying they do not decohere and perform good quantum gate operations. The next layer abstracts the quantum logic outlining the algorithm that is to be executed on the quantum accelerator. In our case, the logic is expressed in the universal quantum-classical hybrid computation language developed in the group, called OpenQL. We also have to start thinking about how to verify, validate and test the quantum software such that the compiler generates a correct version of the quantum circuit. The OpenQL compiler translates the program to a common assembly language, called cQASM. We need to develop a quantum operating system that manages all the hardware of the micro-architecture. The layer below the micro-architecture is responsible of the mapping and routing of the qubits on the topology such that the nearest-neighbour-constraint can be be respected. At any moment in the future when we are capable of generating multiple good qubits, the compiler can convert the cQASM to generate the eQASM, which is executable on a particular experimental device incorporating the platform-specific parameters. This way, we are able to distinguish clearly the experimental research towards better qubits, and the industrial and societal applications that need to be developed and executed on a quantum device.