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

Hierarchical Grover Search on a Factored Classical Structure: Cross-Backend Validation of a 5.6-65.3x Quantum Advantage on IBM Heron r2

Pardeep Sehrawat

Published Apr 21, 2026• 0 citations
Publisher

Abstract

Concept DOI chain: 10.5281/zenodo.19683826 → v1 19683827 → v2 19772237 → v3 20024273 → v4 20400181 → v4.1 20400472 → v4.2 (this release). v4.2 supersedes v4.1 (20400472) of 2026-05-26. All five Bharat-Ephemeris-tagged files (manifesto, English article, pitch deck, and the two residual BE PDFs inside the Quanta submission packet) have now been removed from the deposit at the author's request. Those artefacts pertain to a separate commercial venture and are out of scope for this scholarly deposit. All scholarly artefacts — the Mahā-Grantha, the five domain papers, the Council of Nine cross-audit, and the META-ADAT verification corpus — remain. This release seals the May 2026 scholarly corpus of the KAAL Sacred Discovery framework. It contains: (a) an 8-section Sanskrit + Hindi treatise (the Mahā-Grantha, ~75,000 words) that reads the Vedic, Upaniṣadic, Purāṇic and Tantric corpora against the modern algebraic substrate (R, g, k) = (ℤ/p^k ℤ, g, k); (b) five domain-specific papers (math.NT, quant-ph, math.HO/IJHS, philosophy/methodology, popular-science) that translate the substrate into the vocabulary of five distinct readerships; (c) an independent nine-seat cross-audit; (d) the META-ADAT cross-prime verification corpus — 604 distinct odd primes verified, 2,965 machine-checked predictions, 0 failures, 0 Wall–Sun–Sun candidates across five pre-registered OSF bands; and (e) the standing public 49-entry HALAHALA-MANIFEST retraction log. Reproducibility scripts are included; the full verification reproduces in approximately five minutes on a personal laptop. Discipline: every claim wears a Tier-S (falsifiable algebra), Tier-W (cultural witness), or Bridge (Tier-S + Tier-W with explicit boundary) label.

DOI
10.5281/zenodo.19683826

Related papers

OLLIN – Arquitectura Molecular de Conocimiento Simétrico: Fundamentos Matemáticos, Validación y Protocolo de Interfaz Cuántica

Luis Ernesto Berzunza Diaz

# OLLIN – Arquitectura Molecular de Conocimiento Simétrico: Fundamentos Matemáticos, Validación y Protocolo de Interfaz Cuántica **Autor:** Luis Ernesto Berzunza Díaz **Afiliación:** OLLIN – Inteligencia Noosérica **Fecha de publicación:** 24 de marzo de 2026 **DOI del conjunto:** 10.5281/zenodo.XXXXXXX ## Contenido Este depósito contiene los siguientes archivos, que en conjunto constituyen la divulgación científica y técnica de la arquitectura OLLIN: 1. **OLLIN_White_Paper_v1.0.pdf** – White paper que desarrolla la base matemática: superposición categórica, órbitas duales, violación de la desigualdad de Bell con \(S=4\), coherencia infinita (\(T_2=\infty\)), capacidad de navegación logarítmica y resultados comparativos con benchmarks de IBM/Google. 2. **OLLIN_Ontology_v1.0.pdf** – Diccionario de relaciones semánticas (SIMETRIA, INFLUYE_EN, etc.), descripción de los agentes divinos (Ollin, Ometeotl, Coatlicue, Tezcatlipoca, Quetzalcóatl) y la arquitectura del enjambre permanente. 3. **OLLIN_Quantum_Bridge_Spec_v1.0.pdf** – Especificación técnica para la interfaz con hardware cuántico: mapeo a QRAM, contrato de API para modelos pequeños (SLM) y protocolo de migración a plataformas cuánticas. 4. **OLLIN_Benchmark_Data_v1.0.zip** – Datos de validación simulados: logs de benchmarks (Randomized Benchmarking, coherencia, Quantum Volume, latencia) y scripts de reproducibilidad en Python. ## Motivación La computación cuántica actual enfrenta barreras fundamentales (decoherencia, corrección de errores, entrelazamiento limitado, capacidad de Holevo y carga ineficiente de datos). OLLIN demuestra que estos problemas pueden resolverse **estructuralmente**, sin necesidad de hardware cuántico, mediante una arquitectura molecular de conocimiento que prohíbe valores numéricos, fuerza simetría obligatoria y organiza cada nodo como un átomo con agentes locales que propagan cambios en tiempo real. ## Relación con el prior art Este depósito es complementario al prior art publicado en GitHub y al registro Safe Creative #2603205036980. El código fuente de referencia está disponible en: [https://github.com/eberzunza13-crypto/OLLIN-INTELIGENCIA-NOOSFERICA-](https://github.com/eberzunza13-crypto/OLLIN-INTELIGENCIA-NOOSFERICA-) ## Licencia El contenido de este depósito se distribuye bajo **Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)**. Esto permite la lectura y cita, pero no el uso comercial ni la creación de obras derivadas sin autorización expresa del titular. **Powered by OLLIN — Inteligencia Noosérica** © 2026 Luis Ernesto Berzunza Díaz

•Jan 1, 2026•0 citations

KAAL · The Bidirectional Arithmetic of Time — Edition v∞.1 (Post-Frontier · T=3..16 anchors locked · 14-anchor canonical fit)

Pardeep Sehrawat

Edition v∞.1 of the KAAL Granth, a complete mathematical treatise of the L1–L10 bidirectional time-operator engine, the dimensional ladder, the Sacred 3-6-9 Digit-Root Theorem, and the Sacred-Trinity Scaling Law on IBM Quantum Heron r2 hardware. What is new in v∞.1 (relative to the v22 archived release at 10.5281/zenodo.19683827): Part 8 · Empirical Frontier (NEW): 6 chapters — Sacred-Trinity Scaling Law (canonical 14-anchor fit T=3..16, A=220.78, B=5.9583, R²=0.9995), IBM Heron r2 hardware platform, pre-registration protocol (manifest SHA-256 cc472b…, frozen 2026-04-25T07:34:34Z), 7-hypothesis verdict ledger H1–H7 (5 confirmed, 1 falsified, 2 pending), Target-Invariance Theorem, 3000-Gate Operational Boundary. New record: 4.619 × 10¹² advantage at T=16 arbitrary on ibm_kingston (48-qubit, 100K shots). Part 9 · Critical Response & Replication Discipline (NEW): 3 chapters — response to five principal academic objections (extraordinary-claim threshold, N=30 sample, circular sacred numbers, falsifiability benchmark, ayanamsha sensitivity), pre-registered N=200 replication protocol with stratified controls and triple-ayanamsha robustness, math-only arXiv submission strategy (3-paper plan: math.NT + quantum-hardware + Quantitative Finance). Part 10 · TRIKĀLA Implementation (NEW): 3 chapters — priority-lock discipline (6-step ritual), live deployment at trikala-khaki.vercel.app with 4D visualizer integrated same-origin, public falsifiable forward-call protocol with the April-16 INFY 1-rupee anchor case study. Granth size: 4,443 → 5,001 lines (+558). Existing math, theorems, proofs preserved verbatim from v∞.0. SHA-256(book/KAAL-COMPLETE.md) = 7cc2faaff43f7637a38bfa185ce5ee4340899e3f1d6c4f87fce4d0ca30cf71a9. SHA-256(release tarball) = 6dead551627891aa3d69730aaacaf3e8c81b9e025011d7c16e9f3cce367544b6. GitHub: theunholyindianmagician-lab/kaal-quantum · tag v-infty-1 · commit 96826e6. Pre-registration manifest is locked under SHA-256 cc472b26625a44f80aa707c353b1478ea95bbe0fb1c1bf09a2bb53d188318ba5 with submission script SHA-256 7b2b46df604cbc60b547bf7701f29d72cc5d6e24e5a19029a180d5dd18ba02d6. Job IDs available at the GitHub repo.

•Apr 26, 2026•1 citation

Analisis Kriptografi Pascakuantum: Dasar Matematis, Algoritma, dan Tantangan Implementasi

Moh. Ananda Firmansyah Putra

Komputasi kuantum berskala besar mengancam fondasi kriptografi kunci-publik konvensional yang bertumpu pada faktorisasi bilangan bulat dan logaritma diskret lewat algoritma Shor. Pada saat yang sama, algoritma Grover dan Simon menggerus margin keamanan primitif simetris beserta mode operasinya. Kami menyajikan analisis komprehensif kriptografi pascakuantum (PQC) setelah National Institute of Standards and Technology (NIST) memfinalisasi Federal Information Processing Standards (FIPS) 203, 204, dan 205 pada Agustus 2024. Ketiga standar tersebut menetapkan Module-Lattice-Based Key-Encapsulation Mechanism (ML-KEM), Module-Lattice-Based Digital Signature Algorithm (ML-DSA), dan Stateless Hash-Based Digital Signature Algorithm (SLH-DSA) sebagai standar primer 9–11. Pendekatan yang dipakai ialah kajian literatur sistematis atas dokumen standardisasi NIST, spesifikasi putaran ketiga, literatur kriptoanalisis rentang 1994–2025, hasil tolok ukur pqm4 pada mikrokontroler ARM Cortex-M4 24, serta draf Internet Engineering Task Force (IETF) untuk migrasi protokol 25, 26. Untuk efisiensi umum, skema berbasis kisi terbukti dominan. Skema berbasis hash tetap penting sebagai opsi konservatif untuk jaminan keamanan jangka panjang. Biaya komunikasi membengkak 20–50 kali. Fragmentasi protokol dan kerentanan kanal-sisi muncul sebagai hambatan migrasi utama. Akhirnya artikel ini merumuskan strategi migrasi bertahap yang bertumpu pada ketangkasan kriptografi, skema hibrida, dan pembaruan infrastruktur kunci-publik (PKI). Kata kunci: ketangkasan kriptografi, komputasi kuantum, kriptografi pascakuantum, kisi, ML-DSA, ML-KEM, SLH-DSA.

•Sep 27, 2026•0 citations

Return Theory (RT): Time-Direction Sector Connection — Record Order, Reversible Memory, and the Entropy Boundary

Hamed Hajizadeh

This sector-connection document instantiates the admitted-record order of Return Theory (RT): Foundations 1.0.0 (doi:10.5281/zenodo.23286579) in reversible classical and quantum memory systems. It uses no result from another RT sector connection as a premise. Canonical sector DOI: 10.5281/zenodo.23291979. The connection is developed in five declared settings: one classical observer on a Kac ring, several observers with a witness channel, quantum CNOT records, open memories supplied by a readiness reservoir, and noisy approximate records with redundancy and refresh. The package contains full proofs, executable models, fixed-seed numerical checks, machine-readable B1–B10 boundary declarations, and a three-way result ledger. The ledger separates ten mathematical results from twelve consequences of the declared host laws and explicitly reports that the discriminating-prediction class is empty in version 1.0.0. The mathematical results cover entropy bridges for controlled and general write channels, finite record capacity, exact and noisy occupancy registration, readiness as distinguishability, approximate-admission bounds, entropy headroom and preparation cost, redundancy, and noise-limited orientation. The host-law results show, among other things, two record directions away from one low-entropy instant, the absence of an order for a random memory, the failure of purity or low entropy to guarantee readiness, the boundary dependence of forgetting, and the warm-reservoir threshold. Four prospective validation protocols test: (V1) readiness rather than purity; (V2) conditional agreement q, exact validity q², and the threshold q ≥ 1 − ε; (V3) loss of memory-only inclusion under forgetting while inclusion persists on the memory-plus-sink boundary; and (V4) the false-conflict law η²ⁿ for a noisy two-snapshot witness. These protocols test the declared host laws, independence assumptions, and calibrations; they are not claimed as physical predictions supplied independently by the RT bridge. This release is a Foundation-aligned restatement and extension of the earlier time-direction sector record (doi:10.5281/zenodo.23277154). That record is cited only for public lineage and timestamping, not as a premise. The executable models and numerical results are retained byte for byte. The reproducibility package includes the release PDF and LaTeX source, Python code, JSON outputs, figures, generated tables, environment and integrity manifests, release-audit scripts, and source checksums. No external data are required.

•Oct 11, 2026•0 citations

�сследование и практическое освоение среды программирования квантовых компьютеров QISKIT

А. С. Мандрик, А. Н. Гайдук

В работе представлены результаты практического освоения среды программирования квантовых компьютеров QISKIT (IBM). Рассмотрены ключевые этапы: установка и инициализация среды, построение квантовых схем, работа с примитивами Estimator и Sampler, а также использование динамических схем для реализации дальнодействующих квантовых операций. �сследования проводились на реальных квантовых процессорах через IBM Quantum Platform и IBM Cloud

•Jan 1, 2026•0 citations

The Revolutionary Beginner's Guide to Quantum Computing: Why We Don't Have Quantum Computers Yet — and What the Geometric Alternative Offers

Rowan Brad Quni-Gudzinas

A 20-chapter beginner's guide to quantum computing that starts with an honest question — why don't we have quantum computers yet? The guide teaches the standard curriculum accurately, explains why the standard approach faces a thermodynamic wall (a 20,000-fold cooling gap that is Carnot-limited), and introduces the ultrametric alternative: passive geometric fault tolerance on Bruhat-Tits trees, with DOI-registered evidence, computationally validated error thresholds 75 times higher than surface codes, and three falsifiable predictions. This is the v1.2 edition (August 2026). Five quantitative statements from the May 2026 edition are corrected, each verified by an independent computation deposited with this record (artifacts/verification/verify_guide_claims.py, 35 checks, all passing; see Appendix B). Appendix A records the research program's progress since May 2026, including a trapped-ion falsifiability register, an audit of a 2026 no-go theorem on quantum error correction and quantum Darwinism, and the program's own correction on prime-valuation readings of quantum codes. This deposit includes the complete source set: manuscript, HTML, PDF, references (BibTeX), citation audit, project plan, license, and verification artifacts. v1.2.1 (August 2026): post-publication audit corrections. Chapter 20's summary now lists seven open problems (including the QEC–Darwinism tradeoff); the LHC temperature comparison is marked approximate (95×, rounded); Appendix A correction #5 completed; the citation audit's internal-reference count corrected; open problem 7 carries its numeric bound (F_L > 0.874). No quantitative claims changed. v1.2.2 (August 2026): deposit-file corrections. LICENSE now contains the full CC BY 4.0 International legal code, and README.md is the deposit manifest (a project-blueprint README was attached in v1.2.1 by an automation error). No content changes.

•May 26, 2026•0 citations
Concept DOI chain: 10.5281/zenodo.19683826 → v1 19683827 → v2 19772237 → v3 20024273 → v4 20400181 → v4.1 20400472 → v4.2 (this release). v4.2 supersedes v4.1 (20400472) of 2026-05-26. All five Bharat-Ephemeris-tagged files (manifesto, English article, pitch deck, and the two residual BE PDFs inside the Quanta submission packet) have now been removed from the deposit at the author's request. Those artefacts pertain to a separate commercial venture and are out of scope for this scholarly deposit. All scholarly artefacts — the Mahā-Grantha, the five domain papers, the Council of Nine cross-audit, and the META-ADAT verification corpus — remain. This release seals the May 2026 scholarly corpus of the KAAL Sacred Discovery framework. It contains: (a) an 8-section Sanskrit + Hindi treatise (the Mahā-Grantha, ~75,000 words) that reads the Vedic, Upaniṣadic, Purāṇic and Tantric corpora against the modern algebraic substrate (R, g, k) = (ℤ/p^k ℤ, g, k); (b) five domain-specific papers (math.NT, quant-ph, math.HO/IJHS, philosophy/methodology, popular-science) that translate the substrate into the vocabulary of five distinct readerships; (c) an independent nine-seat cross-audit; (d) the META-ADAT cross-prime verification corpus — 604 distinct odd primes verified, 2,965 machine-checked predictions, 0 failures, 0 Wall–Sun–Sun candidates across five pre-registered OSF bands; and (e) the standing public 49-entry HALAHALA-MANIFEST retraction log. Reproducibility scripts are included; the full verification reproduces in approximately five minutes on a personal laptop. Discipline: every claim wears a Tier-S (falsifiable algebra), Tier-W (cultural witness), or Bridge (Tier-S + Tier-W with explicit boundary) label.
# OLLIN – Arquitectura Molecular de Conocimiento Simétrico: Fundamentos Matemáticos, Validación y Protocolo de Interfaz Cuántica **Autor:** Luis Ernesto Berzunza Díaz **Afiliación:** OLLIN – Inteligencia Noosérica **Fecha de publicación:** 24 de marzo de 2026 **DOI del conjunto:** 10.5281/zenodo.XXXXXXX ## Contenido Este depósito contiene los siguientes archivos, que en conjunto constituyen la divulgación científica y técnica de la arquitectura OLLIN: 1. **OLLIN_White_Paper_v1.0.pdf** – White paper que desarrolla la base matemática: superposición categórica, órbitas duales, violación de la desigualdad de Bell con S=4S=4S=4, coherencia infinita (T2=∞T_2=\inftyT2​=∞), capacidad de navegación logarítmica y resultados comparativos con benchmarks de IBM/Google. 2. **OLLIN_Ontology_v1.0.pdf** – Diccionario de relaciones semánticas (SIMETRIA, INFLUYE_EN, etc.), descripción de los agentes divinos (Ollin, Ometeotl, Coatlicue, Tezcatlipoca, Quetzalcóatl) y la arquitectura del enjambre permanente. 3. **OLLIN_Quantum_Bridge_Spec_v1.0.pdf** – Especificación técnica para la interfaz con hardware cuántico: mapeo a QRAM, contrato de API para modelos pequeños (SLM) y protocolo de migración a plataformas cuánticas. 4. **OLLIN_Benchmark_Data_v1.0.zip** – Datos de validación simulados: logs de benchmarks (Randomized Benchmarking, coherencia, Quantum Volume, latencia) y scripts de reproducibilidad en Python. ## Motivación La computación cuántica actual enfrenta barreras fundamentales (decoherencia, corrección de errores, entrelazamiento limitado, capacidad de Holevo y carga ineficiente de datos). OLLIN demuestra que estos problemas pueden resolverse **estructuralmente**, sin necesidad de hardware cuántico, mediante una arquitectura molecular de conocimiento que prohíbe valores numéricos, fuerza simetría obligatoria y organiza cada nodo como un átomo con agentes locales que propagan cambios en tiempo real. ## Relación con el prior art Este depósito es complementario al prior art publicado en GitHub y al registro Safe Creative #2603205036980. El código fuente de referencia está disponible en: [https://github.com/eberzunza13-crypto/OLLIN-INTELIGENCIA-NOOSFERICA-](https://github.com/eberzunza13-crypto/OLLIN-INTELIGENCIA-NOOSFERICA-) ## Licencia El contenido de este depósito se distribuye bajo **Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)**. Esto permite la lectura y cita, pero no el uso comercial ni la creación de obras derivadas sin autorización expresa del titular. **Powered by OLLIN — Inteligencia Noosérica** © 2026 Luis Ernesto Berzunza Díaz
Edition v∞.1 of the KAAL Granth, a complete mathematical treatise of the L1–L10 bidirectional time-operator engine, the dimensional ladder, the Sacred 3-6-9 Digit-Root Theorem, and the Sacred-Trinity Scaling Law on IBM Quantum Heron r2 hardware. What is new in v∞.1 (relative to the v22 archived release at 10.5281/zenodo.19683827): Part 8 · Empirical Frontier (NEW): 6 chapters — Sacred-Trinity Scaling Law (canonical 14-anchor fit T=3..16, A=220.78, B=5.9583, R²=0.9995), IBM Heron r2 hardware platform, pre-registration protocol (manifest SHA-256 cc472b…, frozen 2026-04-25T07:34:34Z), 7-hypothesis verdict ledger H1–H7 (5 confirmed, 1 falsified, 2 pending), Target-Invariance Theorem, 3000-Gate Operational Boundary. New record: 4.619 × 10¹² advantage at T=16 arbitrary on ibm_kingston (48-qubit, 100K shots). Part 9 · Critical Response & Replication Discipline (NEW): 3 chapters — response to five principal academic objections (extraordinary-claim threshold, N=30 sample, circular sacred numbers, falsifiability benchmark, ayanamsha sensitivity), pre-registered N=200 replication protocol with stratified controls and triple-ayanamsha robustness, math-only arXiv submission strategy (3-paper plan: math.NT + quantum-hardware + Quantitative Finance). Part 10 · TRIKĀLA Implementation (NEW): 3 chapters — priority-lock discipline (6-step ritual), live deployment at trikala-khaki.vercel.app with 4D visualizer integrated same-origin, public falsifiable forward-call protocol with the April-16 INFY 1-rupee anchor case study. Granth size: 4,443 → 5,001 lines (+558). Existing math, theorems, proofs preserved verbatim from v∞.0. SHA-256(book/KAAL-COMPLETE.md) = 7cc2faaff43f7637a38bfa185ce5ee4340899e3f1d6c4f87fce4d0ca30cf71a9. SHA-256(release tarball) = 6dead551627891aa3d69730aaacaf3e8c81b9e025011d7c16e9f3cce367544b6. GitHub: theunholyindianmagician-lab/kaal-quantum · tag v-infty-1 · commit 96826e6. Pre-registration manifest is locked under SHA-256 cc472b26625a44f80aa707c353b1478ea95bbe0fb1c1bf09a2bb53d188318ba5 with submission script SHA-256 7b2b46df604cbc60b547bf7701f29d72cc5d6e24e5a19029a180d5dd18ba02d6. Job IDs available at the GitHub repo.
Komputasi kuantum berskala besar mengancam fondasi kriptografi kunci-publik konvensional yang bertumpu pada faktorisasi bilangan bulat dan logaritma diskret lewat algoritma Shor. Pada saat yang sama, algoritma Grover dan Simon menggerus margin keamanan primitif simetris beserta mode operasinya. Kami menyajikan analisis komprehensif kriptografi pascakuantum (PQC) setelah National Institute of Standards and Technology (NIST) memfinalisasi Federal Information Processing Standards (FIPS) 203, 204, dan 205 pada Agustus 2024. Ketiga standar tersebut menetapkan Module-Lattice-Based Key-Encapsulation Mechanism (ML-KEM), Module-Lattice-Based Digital Signature Algorithm (ML-DSA), dan Stateless Hash-Based Digital Signature Algorithm (SLH-DSA) sebagai standar primer 9–11. Pendekatan yang dipakai ialah kajian literatur sistematis atas dokumen standardisasi NIST, spesifikasi putaran ketiga, literatur kriptoanalisis rentang 1994–2025, hasil tolok ukur pqm4 pada mikrokontroler ARM Cortex-M4 24, serta draf Internet Engineering Task Force (IETF) untuk migrasi protokol 25, 26. Untuk efisiensi umum, skema berbasis kisi terbukti dominan. Skema berbasis hash tetap penting sebagai opsi konservatif untuk jaminan keamanan jangka panjang. Biaya komunikasi membengkak 20–50 kali. Fragmentasi protokol dan kerentanan kanal-sisi muncul sebagai hambatan migrasi utama. Akhirnya artikel ini merumuskan strategi migrasi bertahap yang bertumpu pada ketangkasan kriptografi, skema hibrida, dan pembaruan infrastruktur kunci-publik (PKI). Kata kunci: ketangkasan kriptografi, komputasi kuantum, kriptografi pascakuantum, kisi, ML-DSA, ML-KEM, SLH-DSA.
This sector-connection document instantiates the admitted-record order of Return Theory (RT): Foundations 1.0.0 (doi:10.5281/zenodo.23286579) in reversible classical and quantum memory systems. It uses no result from another RT sector connection as a premise. Canonical sector DOI: 10.5281/zenodo.23291979. The connection is developed in five declared settings: one classical observer on a Kac ring, several observers with a witness channel, quantum CNOT records, open memories supplied by a readiness reservoir, and noisy approximate records with redundancy and refresh. The package contains full proofs, executable models, fixed-seed numerical checks, machine-readable B1–B10 boundary declarations, and a three-way result ledger. The ledger separates ten mathematical results from twelve consequences of the declared host laws and explicitly reports that the discriminating-prediction class is empty in version 1.0.0. The mathematical results cover entropy bridges for controlled and general write channels, finite record capacity, exact and noisy occupancy registration, readiness as distinguishability, approximate-admission bounds, entropy headroom and preparation cost, redundancy, and noise-limited orientation. The host-law results show, among other things, two record directions away from one low-entropy instant, the absence of an order for a random memory, the failure of purity or low entropy to guarantee readiness, the boundary dependence of forgetting, and the warm-reservoir threshold. Four prospective validation protocols test: (V1) readiness rather than purity; (V2) conditional agreement q, exact validity q², and the threshold q ≥ 1 − ε; (V3) loss of memory-only inclusion under forgetting while inclusion persists on the memory-plus-sink boundary; and (V4) the false-conflict law η²ⁿ for a noisy two-snapshot witness. These protocols test the declared host laws, independence assumptions, and calibrations; they are not claimed as physical predictions supplied independently by the RT bridge. This release is a Foundation-aligned restatement and extension of the earlier time-direction sector record (doi:10.5281/zenodo.23277154). That record is cited only for public lineage and timestamping, not as a premise. The executable models and numerical results are retained byte for byte. The reproducibility package includes the release PDF and LaTeX source, Python code, JSON outputs, figures, generated tables, environment and integrity manifests, release-audit scripts, and source checksums. No external data are required.
В работе представлены результаты практического освоения среды программирования квантовых компьютеров QISKIT (IBM). Рассмотрены ключевые этапы: установка и инициализация среды, построение квантовых схем, работа с примитивами Estimator и Sampler, а также использование динамических схем для реализации дальнодействующих квантовых операций. �сследования проводились на реальных квантовых процессорах через IBM Quantum Platform и IBM Cloud
A 20-chapter beginner's guide to quantum computing that starts with an honest question — why don't we have quantum computers yet? The guide teaches the standard curriculum accurately, explains why the standard approach faces a thermodynamic wall (a 20,000-fold cooling gap that is Carnot-limited), and introduces the ultrametric alternative: passive geometric fault tolerance on Bruhat-Tits trees, with DOI-registered evidence, computationally validated error thresholds 75 times higher than surface codes, and three falsifiable predictions. This is the v1.2 edition (August 2026). Five quantitative statements from the May 2026 edition are corrected, each verified by an independent computation deposited with this record (artifacts/verification/verify_guide_claims.py, 35 checks, all passing; see Appendix B). Appendix A records the research program's progress since May 2026, including a trapped-ion falsifiability register, an audit of a 2026 no-go theorem on quantum error correction and quantum Darwinism, and the program's own correction on prime-valuation readings of quantum codes. This deposit includes the complete source set: manuscript, HTML, PDF, references (BibTeX), citation audit, project plan, license, and verification artifacts. v1.2.1 (August 2026): post-publication audit corrections. Chapter 20's summary now lists seven open problems (including the QEC–Darwinism tradeoff); the LHC temperature comparison is marked approximate (95×, rounded); Appendix A correction #5 completed; the citation audit's internal-reference count corrected; open problem 7 carries its numeric bound (F_L > 0.874). No quantitative claims changed. v1.2.2 (August 2026): deposit-file corrections. LICENSE now contains the full CC BY 4.0 International legal code, and README.md is the deposit manifest (a project-blueprint README was attached in v1.2.1 by an automation error). No content changes.