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

Resource-Observability Dual-Budget Control for QEC under Resource-Constrained Stages

Duy Hoang Nguyen

Published Mar 16, 2026• 0 citations
Publisher

Abstract

In some embodiments, disclosed systems and methods provide resource-aware scheduling of quantum error-correction (QEC) stabilizer measurements at a resource-constrained stage. A classical controller obtains stage state data indicative of resource availability and, for each control interval, determines a measurement execution policy constrained by the stage state data (in some embodiments, comprising a measurement schedule and/or per-stabilizer execution rates or probabilities). The controller computes one or more observability-risk indicators that quantify accumulated loss of observability (or a quantitative proxy thereof), mismatch between a predictive model and observed syndrome data, and/or uncertainty of a decoder or estimator output. An observability guard enforces bounded observability by causing a full-observation operation when elapsed time since a most recent full-observation operation reaches a threshold T_max and/or when drift or elevated risk is detected, and may do so even when a controller-layer resource guard would otherwise restrict execution due to reduced resource availability, while remaining subject to an independent physical safety interlock or absolute cutoff external to the controller, when provided. In some embodiments, the resource constraint is implemented using a resource model and a time-varying resource headroom value R(t) with predicted constrained-resource consumption constrained by R(t). In some embodiments, the resource constraint is implemented using a resource-availability indicator derived directly from stage state data and reactive adaptation without requiring prediction. In some embodiments, the resource-availability indicator is derived from a computed headroom value R(t), for example as a thresholded or quantized headroom class of R(t). In some embodiments, a dual-budget formulation tracks both resource-budget state and observability-risk budget state (e.g., resource tokens and QEC-risk tokens), optionally using a sentinel subset to maintain drift visibility and to update an error/noise model under constrained resources. In a non-limiting cryogenic embodiment, stage state data comprises cryogenic state data, R(t)=H(t) comprises cooling headroom, and resource-budget state may be represented using thermal tokens.In some embodiments, the observability-risk indicator comprises a model uncertainty measure.In some embodiments, the observability guard initiates the full-observation operation according to a predetermined or randomized refresh schedule that is independent of the stage state data and independent of the resource-availability indicator, while still being subject to any independent physical safety interlock or absolute cutoff external to the classical controller, when provided.In some embodiments, the observability guard initiates the full-observation operation based on a stochastic refresh mechanism in which inter-refresh intervals are drawn from a configured probability distribution and/or are generated by a pseudorandom process, without requiring a comparison of elapsed time to a fixed threshold. In some cases, the configured probability distribution has at least one parameter that is configurable based on a drift metric and/or the observability-risk indicator.In some embodiments, the system optionally includes an independent physical safety interlock or absolute cutoff external to the classical controller; when provided, initiation and/or execution of the full-observation operation is conditioned on the interlock or cutoff, and when not provided the observability guard may initiate the full-observation operation without such conditioning.In some embodiments, non-limiting method overview (example steps): (i) obtain stage state data; (ii) derive a resource constraint from the stage state data, including by computing resource headroom R(t) using a resource model or by deriving a resource-availability indicator without using a resource model; (iii) determine or update a measurement execution policy for a control interval subject to the resource constraint; (iv) compute one or more observability-risk indicators; (v) evaluate observability-guard conditions, including a time-based threshold T_max and/or drift/risk criteria; (vi) execute stabilizer measurements according to the measurement execution policy, optionally including a sentinel subset; (vii) when triggered, execute a full-observation operation, including as a multi-interval refresh sequence; (viii) compute deviation and/or drift metrics; (ix) update an error/noise model and optionally resource-model parameters and/or budget state; and (x) repeat for subsequent control intervals.

DOI
10.5281/zenodo.19041531

Related papers

Method and System for Gated Identifiability Validation of Phase Offset and/or Phase Lag in a Quantum System Prior to Parameter Update

Duy Hoang Nguyen

The invention relates to calibration, validation, and control of a quantum system, such as a quantum processor, a quantum sensor, or a quantum measurement apparatus. More particularly, the invention provides a computer-implemented method and system for determining whether a phase-offset and/or phase-lag indicator derived from at least two observation streams is sufficiently identifiable for use in inference and/or parameter update. Rather than permitting direct use of the indicator once computed, the invention requires passage of a machine-enforceable identifiability gate Iφ before the indicator is admitted for downstream use. In preferred implementations, the method defines at least a first measurement role and a second measurement role, acquires observation data under the two roles according to a role-activation schedule that prevents simultaneous access within the same acquisition step, and computes at least one phase-offset/phase-lag indicator over a candidate lag window. The identifiability gate Iφ then applies multiple technical checks, including calibration or estimation of acquisition-chain latency, instrument swap and/or acquisition-chain swap to test invariance of the indicator, at least one negative control, and explicit failure criteria for declaring the indicator not identifiable. Only when the indicator passes the gate is it used to generate a validated output and to update at least one control, acquisition, or signal pre-processing parameter of the quantum system. Upon failure of the gate, any parameter update based on the indicator is blocked and diagnostic data are output. In more specific embodiments, role switching is accepted only when predefined micro-invariants Q are preserved within tolerance, and a Van-proxy role-switch action is selected only if it passes a Van-proxy audit configured to reject actions that perturb relevant micro-dynamics of the quantum system. Additional embodiments may employ an adaptive role-activation schedule, a macro-entropy-based drift or instability signal, a frozen configuration manifest with version-specific hash binding, and a parameter-update lock that remains active until a new identifiability cycle passes after drift or failure. The invention thereby reduces artifact-driven parameter updates, improves robustness against acquisition-chain asymmetry and processing artifacts, and provides controlled requalification before re-enabling update.

•Mar 16, 2026•0 citations

The Subordinator Renormalization Problem: When Markovian Error Models Misidentify Quantum Memory

Marcos Eduardo Elias Eliashberg Elias

A quantum processor is controlled through a sequence of operations distributed across time. Its reliability therefore depends on more than the decay observed when the device is left undisturbed. Environmental correlations, stochastic timing, intervention history, acceptance rules, and the observable being computed can all change which errors matter and which protection strategy is justified. The Subordinator Renormalization Problem examines this dependence through an integrated treatment of stochastic clocks, fractional dynamics, multi-time quantum processes, task-specific protection, and finite-sample certification. Its central question is precise: how can temporal resolution be changed and environmental memory compressed while preserving the predictions required by a specified quantum task, including the effects of permitted interventions and their full physical cost? Scientific motivation Coherence time, average gate fidelity, qubit count, and scalar measures of non-Markovianity characterize different aspects of a quantum device. They do not individually determine whether a particular computation can deliver a reliable answer within a given resource budget. A reduced model may reproduce uncontrolled relaxation while omitting correlations that become consequential under pulses, measurements, resets, or subsequent gates. This manuscript investigates the information that must survive a reduction of the noise description. It develops task-sufficient memory as an operational requirement: two process descriptions may be treated as equivalent only when they preserve the declared output expectations, acceptance probabilities, and costs for every allowed future continuation. Stochastic clocks and fractional quantum dynamics The mathematical framework connects Lévy subordinators, Bernstein functions, inverse stable clocks, renewal processes, Caputo fractional derivatives, and Mittag–Leffler relaxation with completely positive quantum dynamics. A central distinction concerns direct and inverse time changes. Direct Bochner subordination of a quantum dynamical semigroup can preserve the semigroup composition law while modifying its generator. An inverse stable clock generally produces a fractional evolution family without that composition law. Fractional powers of generators and fractional derivatives in physical time consequently represent different constructions and cannot be interpreted interchangeably. The manuscript also separates a change of time units from a physical change of the clock law. It derives an exact scaling identity within a fixed stable family and specifies the dimensions of the corresponding relaxation parameter. This identifies what scale covariance establishes and what would require additional evidence of physical control over the environment. The clock-reset problem For inverse stable relaxation, uninterrupted evolution and evolution with an independently renewed hidden clock generally yield different predictions. The paper derives a short-time expansion quantifying the difference between the coherence multiplier after uninterrupted evolution for twice a given duration and the product obtained from two independently renewed intervals. This result makes an otherwise hidden modeling assumption experimentally meaningful. A reset assumption changes the predicted observable response. Whether a real operation renews the relevant environmental variables must therefore be part of the physical model. The analysis includes closed-form calculations for the half-order Mittag–Leffler relaxation, checks of scale covariance, and verification of the deterministic-clock limit. Identical decoherence curves and different control responses An explicit Gaussian dephasing construction provides a separate identification counterexample. A continuum of noise processes produces exactly the same uncontrolled quantum channel at every time, while displaying different responses to spin echo. The entire family has zero Breuer–Laine–Piilo backflow in its uncontrolled reduced dynamics. Nevertheless, its temporal correlations determine whether an echo helps or harms once pulse imperfections are included. The construction shows why uncontrolled channel information alone can be insufficient for an intervention-dependent decision. The relevant distinction is operational: noise processes that look identical during idle evolution can require different control choices. The Gaussian construction and the inverse stable clock analysis are distinct models. Together, they expose complementary requirements on a predictive description, without identifying either construction as a universal microscopic model of a quantum device. Task-sufficient representations and mathematical guarantees The paper formulates exact equivalence of multi-time processes relative to a specified family of interventions, terminal observables, acceptance rules, and resource costs. For a finite linear family, it characterizes the corresponding task quotient and establishes its minimal dimension within linear encoders admitting exact recovery of the contract predictions. Approximate reductions are treated through explicit stability bounds. These bounds show how errors in unnormalized output moments, acceptance probabilities, and attempt costs propagate into conditional expectations and cost per accepted outcome. Low acceptance can amplify a small modeling error and erase an apparent resource advantage. A robust-selection result identifies the feasibility margins required when choosing a policy from approximate predictions. The framework thereby connects process reduction to a concrete accuracy requirement. Finite-sample certification and resource accounting The manuscript derives simultaneous finite-sample certificates for conditional task bias and expected cost per accepted outcome. The guarantees remain valid after data-dependent selection within a fixed finite candidate family, under the stated assumptions of independent reset attempts, bounded observations and costs, and an independently trusted ideal reference. The accounting includes rejected attempts and distinguishes systematic task bias from statistical sampling uncertainty. It also charges characterization, compilation, classical computation, and revalidation to the total resource objective. This distinction matters because a nominal reduction in the cost of one execution can require an unaffordable calibration campaign. A useful controller must improve the complete calculation at matched task accuracy and confidence. Reproducible numerical investigation A classical numerical study evaluates ten pulse policies across three correlation regimes and two contracted observables. The calculations include analytic population predictions, Gaussian trajectory sampling, density-matrix consistency checks, and repeated finite-shot calibration experiments. The results exhibit task-dependent protection choices: a sequence beneficial for one observable can introduce unnecessary error for another. They also distinguish the absence of a certified policy from a general claim that no feasible control exists. Conventional calibrated Hahn echo and the corresponding two-pulse sequence match the best control performance in this benchmark. The study establishes identification and certification results within its declared models; scalable compression, hardware advantage, and reductions in fault-tolerance overhead remain open research objectives. Meaning of the subordinator renormalization problem The title names an operational research problem: construct a change of temporal resolution together with a compressed memory representation and a consistent update rule that preserve all contracted predictions under the permitted controls. The challenge includes causality, complete positivity where applicable, normalization, conditional updates, approximation error, and total resource cost. A small collection of fitted moments is insufficient unless these properties can be maintained through subsequent interventions. The manuscript uses renormalization in the sense of scale change and retention of operationally relevant information. It formulates the conditions a useful reduction must satisfy rather than claiming a completed Wilsonian flow or a new universality class. Relevance and readership The work is intended for researchers in quantum computing, open quantum systems, quantum control, noise characterization, quantum error correction, stochastic processes, fractional calculus, and mathematical model reduction. Its broader engineering relevance is the connection between a model’s predictive sufficiency and the reliable computational output obtained for the resources consumed. The proposed research direction is to identify physical families in which the memory relevant to a useful task can be represented, learned, and updated more efficiently than a full process description. Manuscript contents Version 2.0 comprises 23 pages, four figures, four propositions, one corollary, a finite-sample certification theorem, mathematical appendices, a glossary of 47 terms, and 49 bibliographic references. The bibliography covers stochastic clocks and fractional analysis, quantum dynamical semigroups, environmental memory, process tensors, noise spectroscopy, control, fault tolerance, and statistical certification. About the author Dr. Marcos Eduardo Elias is a Brazilian engineer, mathematician, computer scientist, and entrepreneur based in São Paulo. He is Chairman of Instituto Ramanujan and works with Holosystems on quantum algorithms, stochastic modeling, and the connection between mathematical research and physical computation. His interests include open quantum systems, adaptive quantum–classical optimization, cryptography, and decision-making under uncertainty. Acknowledgments The author gratefully acknowledges Holosystems Quantum Computing Systems for the institutional and intellectual setting in which the

•Nov 10, 2026•0 citations

SYSTEM AND METHOD OF OPTIMIZING INSTRUCTIONS FOR QUANTUM COMPUTERS

Frederic T. Chong, I. Yunong Shi, Nelson Leung +3 more

A quantum computing system includes a quantum processor having a plurality of qubits, a classical memory, and a classical processor. The classical processor is configured to compile a quantum program into logical assembly instructions in an intermediate language, aggregate the logical assembly instructions together into a plurality of logical blocks of instructions, generate a logical schedule for the quantum program based on commutativity between the plurality of logical blocks, generate a tentative physical schedule based on the logical schedule, the tentative physical schedule includes a mapping of the logical assembly instructions in the logical schedule onto the plurality of qubits of the quantum processor, aggregate instructions together within the tentative physical schedule that do not reduce parallelism, thereby generating an updated physical schedule; generate optimized control pulses for the aggregated instructions, and execute the quantum program on the quantum processor with the optimized control pulses and the updated physical schedule.

•Sep 12, 2019•0 citations

SAGE-QEC: Structure-Aware Gated Error Correction for Surface-Code Memories Under Structured Noise

Asia Alhammadi, Mohammed Al-Absi

Abstract Quantum error-correction decoders must convert noisy syndrome records into logical decisions while operating under strict latency and reliability constraints. Minimum-weight perfect matching (MWPM) remains a strong baseline for surface-code decoding because it is fast, interpretable, and exact for its graphlike optimization problem [1–8]. However, the graphlike independent-error approximation can become mismatched when syndrome records contain temporal drift, measurement corruption, crosstalk, bursts, or mixtures of mechanisms [9–18]. We introduce SAGE-QEC, a failure-aware selective decoder that retains nominal PyMatching as its default decision and learns when an observable syndrome structure warrants an alternative candidate. SAGE-QEC uses train-frozen structure thresholds, a candidate ranker, validation-only policy selection, and a paired blind evaluation. Across 45 simulator conditions, SAGE-QEC reduced the aggregate logical error rate from 27.1285% for PyMatching to 24.8320%, corresponding to an 8.47% relative reduction. The campaign used rotated surface-code memory circuits at distances 3, 5, and 7, nominal circuit parameters 0.002, 0.003, and 0.005, five seeds, and four test regimes withheld from training: Burst-3, Temporal Drift, Crosstalk, and Mixed Noise. The test set contained 81,000 paired shots. All twelve distance-by-regime aggregate comparisons favored SAGE-QEC in the executed campaign, with paired bootstrap intervals below zero for SAGE-QEC minus PyMatching. The result is evidence of a reproducible simulator-level improvement, not a claim of universal decoder superiority. SAGE-QEC currently uses logical-output proxy candidates rather than a complete physical correction search, and its intervention rate remains high under distribution shift. It has not yet been compared with a fully calibrated correlated-noise space-time PyMatching baseline or hardware calibration data. We therefore characterize SAGE-QEC as a strong qualification-stage prototype and release a complete audit protocol for the next industrial validation stage.

•Sep 9, 2026•0 citations

System and method of optimizing instructions for quantum computers

Frederic T. Chong, I. Yunong Shi, Nelson Leung +3 more

A quantum computing system includes a quantum processor having a plurality of qubits, a classical memory, and a classical processor. The classical processor is configured to compile a quantum program into logical assembly instructions in an intermediate language, aggregate the logical assembly instructions together into a plurality of logical blocks of instructions, generate a logical schedule for the quantum program based on commutativity between the plurality of logical blocks, generate a tentative physical schedule based on the logical schedule, the tentative physical schedule includes a mapping of the logical assembly instructions in the logical schedule onto the plurality of qubits of the quantum processor, aggregate instructions together within the tentative physical schedule that do not reduce parallelism, thereby generating an updated physical schedule; generate optimized control pulses for the aggregated instructions, and execute the quantum program on the quantum processor with the optimized control pulses and the updated physical schedule.

•Sep 12, 2019•0 citations

Temporal Susceptibility Feedback for Hardware-efficient Bosonic Quantum Error Correction beyond Markovian Approximation

Isamu Ohnishi

•Jan 1, 2026•0 citations
In some embodiments, disclosed systems and methods provide resource-aware scheduling of quantum error-correction (QEC) stabilizer measurements at a resource-constrained stage. A classical controller obtains stage state data indicative of resource availability and, for each control interval, determines a measurement execution policy constrained by the stage state data (in some embodiments, comprising a measurement schedule and/or per-stabilizer execution rates or probabilities). The controller computes one or more observability-risk indicators that quantify accumulated loss of observability (or a quantitative proxy thereof), mismatch between a predictive model and observed syndrome data, and/or uncertainty of a decoder or estimator output. An observability guard enforces bounded observability by causing a full-observation operation when elapsed time since a most recent full-observation operation reaches a threshold T_max and/or when drift or elevated risk is detected, and may do so even when a controller-layer resource guard would otherwise restrict execution due to reduced resource availability, while remaining subject to an independent physical safety interlock or absolute cutoff external to the controller, when provided. In some embodiments, the resource constraint is implemented using a resource model and a time-varying resource headroom value R(t) with predicted constrained-resource consumption constrained by R(t). In some embodiments, the resource constraint is implemented using a resource-availability indicator derived directly from stage state data and reactive adaptation without requiring prediction. In some embodiments, the resource-availability indicator is derived from a computed headroom value R(t), for example as a thresholded or quantized headroom class of R(t). In some embodiments, a dual-budget formulation tracks both resource-budget state and observability-risk budget state (e.g., resource tokens and QEC-risk tokens), optionally using a sentinel subset to maintain drift visibility and to update an error/noise model under constrained resources. In a non-limiting cryogenic embodiment, stage state data comprises cryogenic state data, R(t)=H(t) comprises cooling headroom, and resource-budget state may be represented using thermal tokens.In some embodiments, the observability-risk indicator comprises a model uncertainty measure.In some embodiments, the observability guard initiates the full-observation operation according to a predetermined or randomized refresh schedule that is independent of the stage state data and independent of the resource-availability indicator, while still being subject to any independent physical safety interlock or absolute cutoff external to the classical controller, when provided.In some embodiments, the observability guard initiates the full-observation operation based on a stochastic refresh mechanism in which inter-refresh intervals are drawn from a configured probability distribution and/or are generated by a pseudorandom process, without requiring a comparison of elapsed time to a fixed threshold. In some cases, the configured probability distribution has at least one parameter that is configurable based on a drift metric and/or the observability-risk indicator.In some embodiments, the system optionally includes an independent physical safety interlock or absolute cutoff external to the classical controller; when provided, initiation and/or execution of the full-observation operation is conditioned on the interlock or cutoff, and when not provided the observability guard may initiate the full-observation operation without such conditioning.In some embodiments, non-limiting method overview (example steps): (i) obtain stage state data; (ii) derive a resource constraint from the stage state data, including by computing resource headroom R(t) using a resource model or by deriving a resource-availability indicator without using a resource model; (iii) determine or update a measurement execution policy for a control interval subject to the resource constraint; (iv) compute one or more observability-risk indicators; (v) evaluate observability-guard conditions, including a time-based threshold T_max and/or drift/risk criteria; (vi) execute stabilizer measurements according to the measurement execution policy, optionally including a sentinel subset; (vii) when triggered, execute a full-observation operation, including as a multi-interval refresh sequence; (viii) compute deviation and/or drift metrics; (ix) update an error/noise model and optionally resource-model parameters and/or budget state; and (x) repeat for subsequent control intervals.
The invention relates to calibration, validation, and control of a quantum system, such as a quantum processor, a quantum sensor, or a quantum measurement apparatus. More particularly, the invention provides a computer-implemented method and system for determining whether a phase-offset and/or phase-lag indicator derived from at least two observation streams is sufficiently identifiable for use in inference and/or parameter update. Rather than permitting direct use of the indicator once computed, the invention requires passage of a machine-enforceable identifiability gate Iφ before the indicator is admitted for downstream use. In preferred implementations, the method defines at least a first measurement role and a second measurement role, acquires observation data under the two roles according to a role-activation schedule that prevents simultaneous access within the same acquisition step, and computes at least one phase-offset/phase-lag indicator over a candidate lag window. The identifiability gate Iφ then applies multiple technical checks, including calibration or estimation of acquisition-chain latency, instrument swap and/or acquisition-chain swap to test invariance of the indicator, at least one negative control, and explicit failure criteria for declaring the indicator not identifiable. Only when the indicator passes the gate is it used to generate a validated output and to update at least one control, acquisition, or signal pre-processing parameter of the quantum system. Upon failure of the gate, any parameter update based on the indicator is blocked and diagnostic data are output. In more specific embodiments, role switching is accepted only when predefined micro-invariants Q are preserved within tolerance, and a Van-proxy role-switch action is selected only if it passes a Van-proxy audit configured to reject actions that perturb relevant micro-dynamics of the quantum system. Additional embodiments may employ an adaptive role-activation schedule, a macro-entropy-based drift or instability signal, a frozen configuration manifest with version-specific hash binding, and a parameter-update lock that remains active until a new identifiability cycle passes after drift or failure. The invention thereby reduces artifact-driven parameter updates, improves robustness against acquisition-chain asymmetry and processing artifacts, and provides controlled requalification before re-enabling update.
A quantum processor is controlled through a sequence of operations distributed across time. Its reliability therefore depends on more than the decay observed when the device is left undisturbed. Environmental correlations, stochastic timing, intervention history, acceptance rules, and the observable being computed can all change which errors matter and which protection strategy is justified. The Subordinator Renormalization Problem examines this dependence through an integrated treatment of stochastic clocks, fractional dynamics, multi-time quantum processes, task-specific protection, and finite-sample certification. Its central question is precise: how can temporal resolution be changed and environmental memory compressed while preserving the predictions required by a specified quantum task, including the effects of permitted interventions and their full physical cost? Scientific motivation Coherence time, average gate fidelity, qubit count, and scalar measures of non-Markovianity characterize different aspects of a quantum device. They do not individually determine whether a particular computation can deliver a reliable answer within a given resource budget. A reduced model may reproduce uncontrolled relaxation while omitting correlations that become consequential under pulses, measurements, resets, or subsequent gates. This manuscript investigates the information that must survive a reduction of the noise description. It develops task-sufficient memory as an operational requirement: two process descriptions may be treated as equivalent only when they preserve the declared output expectations, acceptance probabilities, and costs for every allowed future continuation. Stochastic clocks and fractional quantum dynamics The mathematical framework connects Lévy subordinators, Bernstein functions, inverse stable clocks, renewal processes, Caputo fractional derivatives, and Mittag–Leffler relaxation with completely positive quantum dynamics. A central distinction concerns direct and inverse time changes. Direct Bochner subordination of a quantum dynamical semigroup can preserve the semigroup composition law while modifying its generator. An inverse stable clock generally produces a fractional evolution family without that composition law. Fractional powers of generators and fractional derivatives in physical time consequently represent different constructions and cannot be interpreted interchangeably. The manuscript also separates a change of time units from a physical change of the clock law. It derives an exact scaling identity within a fixed stable family and specifies the dimensions of the corresponding relaxation parameter. This identifies what scale covariance establishes and what would require additional evidence of physical control over the environment. The clock-reset problem For inverse stable relaxation, uninterrupted evolution and evolution with an independently renewed hidden clock generally yield different predictions. The paper derives a short-time expansion quantifying the difference between the coherence multiplier after uninterrupted evolution for twice a given duration and the product obtained from two independently renewed intervals. This result makes an otherwise hidden modeling assumption experimentally meaningful. A reset assumption changes the predicted observable response. Whether a real operation renews the relevant environmental variables must therefore be part of the physical model. The analysis includes closed-form calculations for the half-order Mittag–Leffler relaxation, checks of scale covariance, and verification of the deterministic-clock limit. Identical decoherence curves and different control responses An explicit Gaussian dephasing construction provides a separate identification counterexample. A continuum of noise processes produces exactly the same uncontrolled quantum channel at every time, while displaying different responses to spin echo. The entire family has zero Breuer–Laine–Piilo backflow in its uncontrolled reduced dynamics. Nevertheless, its temporal correlations determine whether an echo helps or harms once pulse imperfections are included. The construction shows why uncontrolled channel information alone can be insufficient for an intervention-dependent decision. The relevant distinction is operational: noise processes that look identical during idle evolution can require different control choices. The Gaussian construction and the inverse stable clock analysis are distinct models. Together, they expose complementary requirements on a predictive description, without identifying either construction as a universal microscopic model of a quantum device. Task-sufficient representations and mathematical guarantees The paper formulates exact equivalence of multi-time processes relative to a specified family of interventions, terminal observables, acceptance rules, and resource costs. For a finite linear family, it characterizes the corresponding task quotient and establishes its minimal dimension within linear encoders admitting exact recovery of the contract predictions. Approximate reductions are treated through explicit stability bounds. These bounds show how errors in unnormalized output moments, acceptance probabilities, and attempt costs propagate into conditional expectations and cost per accepted outcome. Low acceptance can amplify a small modeling error and erase an apparent resource advantage. A robust-selection result identifies the feasibility margins required when choosing a policy from approximate predictions. The framework thereby connects process reduction to a concrete accuracy requirement. Finite-sample certification and resource accounting The manuscript derives simultaneous finite-sample certificates for conditional task bias and expected cost per accepted outcome. The guarantees remain valid after data-dependent selection within a fixed finite candidate family, under the stated assumptions of independent reset attempts, bounded observations and costs, and an independently trusted ideal reference. The accounting includes rejected attempts and distinguishes systematic task bias from statistical sampling uncertainty. It also charges characterization, compilation, classical computation, and revalidation to the total resource objective. This distinction matters because a nominal reduction in the cost of one execution can require an unaffordable calibration campaign. A useful controller must improve the complete calculation at matched task accuracy and confidence. Reproducible numerical investigation A classical numerical study evaluates ten pulse policies across three correlation regimes and two contracted observables. The calculations include analytic population predictions, Gaussian trajectory sampling, density-matrix consistency checks, and repeated finite-shot calibration experiments. The results exhibit task-dependent protection choices: a sequence beneficial for one observable can introduce unnecessary error for another. They also distinguish the absence of a certified policy from a general claim that no feasible control exists. Conventional calibrated Hahn echo and the corresponding two-pulse sequence match the best control performance in this benchmark. The study establishes identification and certification results within its declared models; scalable compression, hardware advantage, and reductions in fault-tolerance overhead remain open research objectives. Meaning of the subordinator renormalization problem The title names an operational research problem: construct a change of temporal resolution together with a compressed memory representation and a consistent update rule that preserve all contracted predictions under the permitted controls. The challenge includes causality, complete positivity where applicable, normalization, conditional updates, approximation error, and total resource cost. A small collection of fitted moments is insufficient unless these properties can be maintained through subsequent interventions. The manuscript uses renormalization in the sense of scale change and retention of operationally relevant information. It formulates the conditions a useful reduction must satisfy rather than claiming a completed Wilsonian flow or a new universality class. Relevance and readership The work is intended for researchers in quantum computing, open quantum systems, quantum control, noise characterization, quantum error correction, stochastic processes, fractional calculus, and mathematical model reduction. Its broader engineering relevance is the connection between a model’s predictive sufficiency and the reliable computational output obtained for the resources consumed. The proposed research direction is to identify physical families in which the memory relevant to a useful task can be represented, learned, and updated more efficiently than a full process description. Manuscript contents Version 2.0 comprises 23 pages, four figures, four propositions, one corollary, a finite-sample certification theorem, mathematical appendices, a glossary of 47 terms, and 49 bibliographic references. The bibliography covers stochastic clocks and fractional analysis, quantum dynamical semigroups, environmental memory, process tensors, noise spectroscopy, control, fault tolerance, and statistical certification. About the author Dr. Marcos Eduardo Elias is a Brazilian engineer, mathematician, computer scientist, and entrepreneur based in São Paulo. He is Chairman of Instituto Ramanujan and works with Holosystems on quantum algorithms, stochastic modeling, and the connection between mathematical research and physical computation. His interests include open quantum systems, adaptive quantum–classical optimization, cryptography, and decision-making under uncertainty. Acknowledgments The author gratefully acknowledges Holosystems Quantum Computing Systems for the institutional and intellectual setting in which the
A quantum computing system includes a quantum processor having a plurality of qubits, a classical memory, and a classical processor. The classical processor is configured to compile a quantum program into logical assembly instructions in an intermediate language, aggregate the logical assembly instructions together into a plurality of logical blocks of instructions, generate a logical schedule for the quantum program based on commutativity between the plurality of logical blocks, generate a tentative physical schedule based on the logical schedule, the tentative physical schedule includes a mapping of the logical assembly instructions in the logical schedule onto the plurality of qubits of the quantum processor, aggregate instructions together within the tentative physical schedule that do not reduce parallelism, thereby generating an updated physical schedule; generate optimized control pulses for the aggregated instructions, and execute the quantum program on the quantum processor with the optimized control pulses and the updated physical schedule.
Abstract Quantum error-correction decoders must convert noisy syndrome records into logical decisions while operating under strict latency and reliability constraints. Minimum-weight perfect matching (MWPM) remains a strong baseline for surface-code decoding because it is fast, interpretable, and exact for its graphlike optimization problem [1–8]. However, the graphlike independent-error approximation can become mismatched when syndrome records contain temporal drift, measurement corruption, crosstalk, bursts, or mixtures of mechanisms [9–18]. We introduce SAGE-QEC, a failure-aware selective decoder that retains nominal PyMatching as its default decision and learns when an observable syndrome structure warrants an alternative candidate. SAGE-QEC uses train-frozen structure thresholds, a candidate ranker, validation-only policy selection, and a paired blind evaluation. Across 45 simulator conditions, SAGE-QEC reduced the aggregate logical error rate from 27.1285% for PyMatching to 24.8320%, corresponding to an 8.47% relative reduction. The campaign used rotated surface-code memory circuits at distances 3, 5, and 7, nominal circuit parameters 0.002, 0.003, and 0.005, five seeds, and four test regimes withheld from training: Burst-3, Temporal Drift, Crosstalk, and Mixed Noise. The test set contained 81,000 paired shots. All twelve distance-by-regime aggregate comparisons favored SAGE-QEC in the executed campaign, with paired bootstrap intervals below zero for SAGE-QEC minus PyMatching. The result is evidence of a reproducible simulator-level improvement, not a claim of universal decoder superiority. SAGE-QEC currently uses logical-output proxy candidates rather than a complete physical correction search, and its intervention rate remains high under distribution shift. It has not yet been compared with a fully calibrated correlated-noise space-time PyMatching baseline or hardware calibration data. We therefore characterize SAGE-QEC as a strong qualification-stage prototype and release a complete audit protocol for the next industrial validation stage.
A quantum computing system includes a quantum processor having a plurality of qubits, a classical memory, and a classical processor. The classical processor is configured to compile a quantum program into logical assembly instructions in an intermediate language, aggregate the logical assembly instructions together into a plurality of logical blocks of instructions, generate a logical schedule for the quantum program based on commutativity between the plurality of logical blocks, generate a tentative physical schedule based on the logical schedule, the tentative physical schedule includes a mapping of the logical assembly instructions in the logical schedule onto the plurality of qubits of the quantum processor, aggregate instructions together within the tentative physical schedule that do not reduce parallelism, thereby generating an updated physical schedule; generate optimized control pulses for the aggregated instructions, and execute the quantum program on the quantum processor with the optimized control pulses and the updated physical schedule.