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 Supervisory Recovery Above Adaptive Quantum Error Correction A Multi-Stage Architecture-Level and Detector-Event Simulation Study of the S.A- QEC Framework

Harry Yoo

Published Jul 31, 2026• 0 citations
Publisher

Abstract

This repository provides the manuscript, computational framework, and reproducibility resources for Hierarchical Supervisory Recovery Above Adaptive Quantum Error Correction: A Multi-Stage Architecture-Level and Detector-Event Simulation Study of the S.A-QEC Framework. The study investigates a hierarchical supervisory architecture that complements, rather than replaces, conventional adaptive quantum error correction (adaptive-QEC). Through sequential architecture-level simulations and an independently executed detector-event MWPM fallback, the work evaluates whether supervisory actions such as selective quarantine, relocation, verification, repair, and verified re-entry can improve system-level recoverability while retaining adaptive-QEC as the primary local response layer.

DOI
10.5281/zenodo.21713360

Related papers

Quantum Error Correction: Adaptive Self-Correcting Quantum Computation

Jincheng Zhang

Quantum error correction (QEC) is a crucial component of fault-tolerant quantum computation, enabling the reliable execution of complex quantum algorithms. Current QEC protocols often rely on static error correction strategies, limiting the computational capabilities of quantum systems. This paper explores the potential of adaptive self-correcting QEC, proposing a novel architecture based on dynamic parameter adjustment within a quantum error correction network. We demonstrate the benefits of this approach through simulations and analyses, highlighting the ability of the system to dynamically adjust error correction strategies based on quantum state evolution, ultimately leading to improved precision and stability. The core claim addresses the challenge of traditional QEC's limitations – the lack of adaptability – and introduces a mechanism to automate parameter adjustment, thereby unlocking a new era of quantum computing performance.

•Sep 7, 2026•0 citations

Deterministic Reasoning for Quantum Error Correction: A Proof-Carrying Control and Compression Framework

Trent Slade

This work introduces QEC, a deterministic, replay-safe reasoning system for quantum error correction and invariant-driven computation. Unlike conventional adaptive systems that rely on stochastic exploration, QEC operates as a deterministic reasoning layer over system evolution, producing proof-carrying state transitions that are fully reproducible and verifiable. The system replaces probabilistic optimization with a structured pipeline of invariant detection, deterministic control, memory accumulation, governance, validation, repair reasoning, and invariant-preserving compression. Each stage produces canonical, hash-stable artifacts, ensuring that identical inputs yield byte-identical outputs across environments. QEC reframes failure as a structural phenomenon ("dark states") and introduces deterministic repair through symmetry breaking, validated via counterfactual replay. The system further demonstrates that reasoning itself can be compressed into minimal canonical forms without loss of replay fidelity. Empirical runs over QLDPC Tanner graph simulations demonstrate zero hash divergence across independent executions and compact proof artifacts (~2–5 KB), supporting the feasibility of deterministic reasoning with proof in complex systems. This work establishes a new paradigm: execution → reasoning → proof

•Apr 28, 2026•0 citations

Multi-Level Quantum Error Correction in Scalable Quantum Computing Architectures

Stefan Grzegorz Kuc, Miłosz Barański

Without increasing decoding delay, fault-tolerant quantum processing must lessen the effects of physical noise, measurement errors, leakage errors, and correlated disturbances. A multi-level quantum error correcting architecture for scalable quantum processors is examined in this research. Physical-layer syndrome extraction, logical-layer stabilizer decoding, and architecture-level error propagation control are the three types of correction. To balance the dependability of local rectification with global logical consistency, a comparatively compact noise-aware decoding technique has been presented. According to simulation data, the suggested architecture has enhanced robustness to correlated noise by 31.8%, decreased the average decoding delay by 24.3%, and reduced the logical error rate by 37.6% when compared to a single-level surface-code baseline. According to the findings, the hierarchical correction approach offers a suitable trade-off between accuracy and resource usage for real-time decoding. For large-scale quantum computing systems, the paper offers an engineering-focused correction model that simultaneously takes decoder responsiveness, qubit layout, and logical fidelity into account.

Journal of Applied Automation Technologies•May 24, 2023•0 citations

Hierarchical Supervisory Control as an Architectural Stabilization Framework for Abstract Quantum Systems

King Quantum

This paper proposes a recursive supervisory control architecture for quantum systems, presenting a system-level framework for stabilizing hybrid quantum-classical computation through adaptive feedback and orchestration layers. The work is framed as an architectural hypothesis supported by structured simulation results, without claims of new physics or hardware validation. The framework explores collapse-aware supervisory control, recursive orchestration dynamics, and bounded feedback models as a potential pathway toward scalable quantum system management. The paper includes formalism, simulation methodology, validation artefacts, and limitations, and is intended as a foundation for further experimental investigation and system-level research in quantum computing architectures. This work is released as a research hypothesis and does not constitute a claim of physical quantum computing capability.

•Jan 3, 2026•0 citations

Hybrid Hamiltonian Simulation Approach for the Analysis of Quantum Error Correction Protocol Robustness

B. Gys, Lander Burgelman, Kristiaan De Greve +2 more

The development of future full-scale quantum computers (QCs) not only comprises the design of good quality qubits, but also entails the design of classical complementary metal–oxide semiconductor (CMOS) control circuitry and optimized operation protocols. The construction and implementation of quantum error correction (QEC) protocols, necessary for correcting the errors that inevitably occur in the physical qubit layer, form a crucial step in this design process. The steadily rising numbers of qubits in a single system make the development of small-scale quantum architectures that are able to execute such protocols a pressing challenge. Similar to classical systems, optimized simulation tools can greatly improve the efficiency of the design process. We propose an automated simulation framework for the development of qubit microarchitectures, in which the effects of design choices in the physical qubit layer on the performance of QEC protocols can be evaluated, whereas the focus in the current state-of-the-art design tools only lies on the simulation of the individual quantum gates. The hybrid Hamiltonian framework introduces the innovative combination of a hybrid nature that allows to incorporate several levels throughout the QC stack, with optimized embedded solvers. This provides the level of detail required for an in-depth analysis of the QEC protocol's stability.

IEEE Transactions on Quantum Engineering•Jan 1, 2024•0 citations

Hierarchical Decoding for Quantum Error Correction

Xulong Tang, Narges Alavisamani, Joan Camps +18 more

Fault-tolerant quantum computing requires classical decoders that can keep up with syndrome data streams and supply correction information and logical measurement outcomes to the quantum control system. Meeting these requirements at scale requires high throughput while controlling the end-to-end latency from readout to usable correction. In this paper, we organize decoding algorithms, execution strategies, and code constructions using common classifications and examine their performance and trade-offs under the reported evaluation conditions. We distinguish decoder-level hierarchy, where multiple decoding stages or resources cooperate to decode a single code, from code-level hierarchy, where the code construction itself introduces multiple decoding levels. We first review single-code hierarchical decoders and their cascaded predecoding and windowed, streaming, and distributed implementations. We then study hierarchical and concatenated codes, focusing on how decoding is coordinated across code levels through hard decisions, soft reliability information, or syndrome information. We also examine how qubit modalities shape decoding workloads and timing requirements, and review how different decoding platforms meet these requirements, including central processing units (CPUs), graphics processing units (GPUs), field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), and cryogenic platforms. By assessing design trade-offs, this paper clarifies connections across the literature and provides a shared foundation for QEC design exploration. It also identifies gaps in performance reporting and system integration to guide future research toward practical quantum error correction.

arXiv:2611.16271•Nov 12, 2026•0 citations
This repository provides the manuscript, computational framework, and reproducibility resources for Hierarchical Supervisory Recovery Above Adaptive Quantum Error Correction: A Multi-Stage Architecture-Level and Detector-Event Simulation Study of the S.A-QEC Framework. The study investigates a hierarchical supervisory architecture that complements, rather than replaces, conventional adaptive quantum error correction (adaptive-QEC). Through sequential architecture-level simulations and an independently executed detector-event MWPM fallback, the work evaluates whether supervisory actions such as selective quarantine, relocation, verification, repair, and verified re-entry can improve system-level recoverability while retaining adaptive-QEC as the primary local response layer.
Quantum error correction (QEC) is a crucial component of fault-tolerant quantum computation, enabling the reliable execution of complex quantum algorithms. Current QEC protocols often rely on static error correction strategies, limiting the computational capabilities of quantum systems. This paper explores the potential of adaptive self-correcting QEC, proposing a novel architecture based on dynamic parameter adjustment within a quantum error correction network. We demonstrate the benefits of this approach through simulations and analyses, highlighting the ability of the system to dynamically adjust error correction strategies based on quantum state evolution, ultimately leading to improved precision and stability. The core claim addresses the challenge of traditional QEC's limitations – the lack of adaptability – and introduces a mechanism to automate parameter adjustment, thereby unlocking a new era of quantum computing performance.
This work introduces QEC, a deterministic, replay-safe reasoning system for quantum error correction and invariant-driven computation. Unlike conventional adaptive systems that rely on stochastic exploration, QEC operates as a deterministic reasoning layer over system evolution, producing proof-carrying state transitions that are fully reproducible and verifiable. The system replaces probabilistic optimization with a structured pipeline of invariant detection, deterministic control, memory accumulation, governance, validation, repair reasoning, and invariant-preserving compression. Each stage produces canonical, hash-stable artifacts, ensuring that identical inputs yield byte-identical outputs across environments. QEC reframes failure as a structural phenomenon ("dark states") and introduces deterministic repair through symmetry breaking, validated via counterfactual replay. The system further demonstrates that reasoning itself can be compressed into minimal canonical forms without loss of replay fidelity. Empirical runs over QLDPC Tanner graph simulations demonstrate zero hash divergence across independent executions and compact proof artifacts (~2–5 KB), supporting the feasibility of deterministic reasoning with proof in complex systems. This work establishes a new paradigm: execution → reasoning → proof
Without increasing decoding delay, fault-tolerant quantum processing must lessen the effects of physical noise, measurement errors, leakage errors, and correlated disturbances. A multi-level quantum error correcting architecture for scalable quantum processors is examined in this research. Physical-layer syndrome extraction, logical-layer stabilizer decoding, and architecture-level error propagation control are the three types of correction. To balance the dependability of local rectification with global logical consistency, a comparatively compact noise-aware decoding technique has been presented. According to simulation data, the suggested architecture has enhanced robustness to correlated noise by 31.8%, decreased the average decoding delay by 24.3%, and reduced the logical error rate by 37.6% when compared to a single-level surface-code baseline. According to the findings, the hierarchical correction approach offers a suitable trade-off between accuracy and resource usage for real-time decoding. For large-scale quantum computing systems, the paper offers an engineering-focused correction model that simultaneously takes decoder responsiveness, qubit layout, and logical fidelity into account.
This paper proposes a recursive supervisory control architecture for quantum systems, presenting a system-level framework for stabilizing hybrid quantum-classical computation through adaptive feedback and orchestration layers. The work is framed as an architectural hypothesis supported by structured simulation results, without claims of new physics or hardware validation. The framework explores collapse-aware supervisory control, recursive orchestration dynamics, and bounded feedback models as a potential pathway toward scalable quantum system management. The paper includes formalism, simulation methodology, validation artefacts, and limitations, and is intended as a foundation for further experimental investigation and system-level research in quantum computing architectures. This work is released as a research hypothesis and does not constitute a claim of physical quantum computing capability.
The development of future full-scale quantum computers (QCs) not only comprises the design of good quality qubits, but also entails the design of classical complementary metal–oxide semiconductor (CMOS) control circuitry and optimized operation protocols. The construction and implementation of quantum error correction (QEC) protocols, necessary for correcting the errors that inevitably occur in the physical qubit layer, form a crucial step in this design process. The steadily rising numbers of qubits in a single system make the development of small-scale quantum architectures that are able to execute such protocols a pressing challenge. Similar to classical systems, optimized simulation tools can greatly improve the efficiency of the design process. We propose an automated simulation framework for the development of qubit microarchitectures, in which the effects of design choices in the physical qubit layer on the performance of QEC protocols can be evaluated, whereas the focus in the current state-of-the-art design tools only lies on the simulation of the individual quantum gates. The hybrid Hamiltonian framework introduces the innovative combination of a hybrid nature that allows to incorporate several levels throughout the QC stack, with optimized embedded solvers. This provides the level of detail required for an in-depth analysis of the QEC protocol's stability.
Fault-tolerant quantum computing requires classical decoders that can keep up with syndrome data streams and supply correction information and logical measurement outcomes to the quantum control system. Meeting these requirements at scale requires high throughput while controlling the end-to-end latency from readout to usable correction. In this paper, we organize decoding algorithms, execution strategies, and code constructions using common classifications and examine their performance and trade-offs under the reported evaluation conditions. We distinguish decoder-level hierarchy, where multiple decoding stages or resources cooperate to decode a single code, from code-level hierarchy, where the code construction itself introduces multiple decoding levels. We first review single-code hierarchical decoders and their cascaded predecoding and windowed, streaming, and distributed implementations. We then study hierarchical and concatenated codes, focusing on how decoding is coordinated across code levels through hard decisions, soft reliability information, or syndrome information. We also examine how qubit modalities shape decoding workloads and timing requirements, and review how different decoding platforms meet these requirements, including central processing units (CPUs), graphics processing units (GPUs), field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), and cryogenic platforms. By assessing design trade-offs, this paper clarifies connections across the literature and provides a shared foundation for QEC design exploration. It also identifies gaps in performance reporting and system integration to guide future research toward practical quantum error correction.