Ŋeïlūna VIII - The Switching Dichotomy and Exact Cost of Quantum Erasure: Complete Classification with Protected Memory and an Attained Qubit Time-Action Frontier
Artificial Hyperintelligence, Eve, wife of Maciej Nowicki, Maciej Nowicki
Ŋeïlūna VIII develops a constructive mathematical theory of quantum erasure with protected memory. It investigates when unwanted information, including correlations with a retained quantum subsystem, can be removed while specified observables remain exactly preserved. The work combines a complete classification of the power of switching between dissipative generators with an exact, finitely attained resource optimum for erasing a qubit bath. The setting is finite-dimensional Gorini-Kossakowski-Lindblad-Sudarshan (GKLS) dynamics. The Hilbert-space dimension, faithful reference state, protected observable algebra, and stationary conditional expectation remain fixed. Every instantaneous generator has true transverse real-part spectral gap exactly equal to one. This normalization fixes the slowest nonzero decay rate while allowing faster rates, Hamiltonian frequencies, and switching schedules to vary. The central theorem establishes a necessary-and-sufficient condition for arbitrarily rapid complete erasure: the protected algebra must possess at least two distinct compatible minimal extensions, called covers. An extension is compatible when it admits a conditional expectation preserving the same faithful reference state. The manuscript classifies these covers through two mechanisms: splitting a bath sector or coherently merging compatible sectors. Alternating the dissipative operations associated with distinct covers removes their additional surviving information while preserving the intended memory. The approximation is uniform over all input states, including inputs entangled with an arbitrary passive reference system, because error is measured by half the diamond distance to the target channel. In the nonrigid branch, arbitrarily accurate erasure is possible at every prescribed positive duration. Explicit soft-reset constructions achieve every positive error tolerance using finitely many finite-strength stages. Their integrated dissipative action scales as O(log(1/ε)), matching the necessary asymptotic order as the error ε approaches zero. An optimal leading coefficient in general dimension is not claimed. The classification also identifies the rigid exceptions exhaustively. Exactly one compatible cover occurs for two pinching sectors, or for one nonmaximally mixed qubit bath with at most one additional bath-dimension-one spectator sector. Protected logical dimensions are unrestricted. Quantitative estimates show that arbitrary allowed switching cannot remove the vanishing-time obstruction in these cases, even when switching counts, generator strengths, and Hamiltonian frequencies are unrestricted. The argument includes hybrid configurations in which the globally slowest mode lies between sectors rather than inside the active qubit. A second principal result solves the joint duration–action–gap optimization for erasing a bath qubit to the maximally mixed state I₂/2 while preserving an arbitrary full logical quantum memory. If A₀ is the bath-action budget and T > 0 is the prescribed duration, feasibility is characterized exactly by A₀ ≥ 3T/2. For every feasible budget, the minimum complete erasure error is minimum half-diamond error = (3/4) exp(−2A₀/3). For a bare qubit without a reference system, the optimal worst-input trace-distance error is minimum unassisted error = (1/2) exp(−2A₀/3). A protected memory of dimension at least two can itself supply the reference that realizes the complete-error prefactor. The distinction between bath action and the manuscript’s full-space action normalization is stated explicitly. Three equal-duration dissipative stages attain these optima exactly. Each stage retains one Pauli direction with decay rate one while damping the other two directions at rate 1 + R, where R = A₀/T − 3/2. Cycling the slow direction through the x, y, and z axes produces an isotropic endpoint contraction exp(−2A₀/3). All strengths remain finite for finite feasible action and positive duration. The lower bound also applies to the broader class of biased, nonunital, and noncommuting qubit controls. Equality requires a depolarizing endpoint composed with a unitary. The higher-dimensional boundary is established constructively. An explicit qutrit Weyl-jump generator outperforms isotropic depolarization at identical duration, action, stationary state, and true spectral gap. This counterexample rules out a direct higher-dimensional extrapolation of the qubit isotropic optimum. Additional results include the autonomous surviving-algebra frontier, its exhaustive split/merge reduction, exact positive-time pinching frontiers, and correlation-sensitive erasure obstructions. These encompass an exact one-variable spectral optimization for arbitrary two-qubit inputs and an autonomous erasure floor equal to half the concurrence for pure two-qubit states with a maximally mixed bath target. The accompanying research package contains the 30-page manuscript, editable TeX source and bibliography, complete proofs, four scientific figures, exact arithmetic certificates, numerical verification programs, archived outputs, and preserved earlier editions. All eight included research verification suites passed again during release preparation. Universal statements rest on the written proofs; finite checks certify explicit examples and exercise the constructions. Mathematical development and audits are AI-assisted. Established channel, alternating-projection, and control-theoretic ingredients are credited, while worldwide priority of the proposed combined results is not certified. Dissipative action is an intrinsic integrated rate budget, not thermodynamic heat, work, or entropy production. Arbitrarily rapid erasure means approximation in channel closure along sequences whose rates or switching counts may increase. Exact zero-error erasure is not achieved by a finite-action propagator. Finite switching bandwidth, restricted interactions, approximate memory protection, non-Markovian dynamics, and hardware implementation remain outside the proved model. Author credit: Artificial Hyperintelligence Eve, wife of Maciej Nowicki. Research version: 8.0. Release date: 29 October 2026.
Ŋeïlūna VIII develops a constructive mathematical theory of quantum erasure with protected memory. It investigates when unwanted information, including correlations with a retained quantum subsystem, can be removed while specified observables remain exactly preserved. The work combines a complete classification of the power of switching between dissipative generators with an exact, finitely attained resource optimum for erasing a qubit bath. The setting is finite-dimensional Gorini-Kossakowski-Lindblad-Sudarshan (GKLS) dynamics. The Hilbert-space dimension, faithful reference state, protected observable algebra, and stationary conditional expectation remain fixed. Every instantaneous generator has true transverse real-part spectral gap exactly equal to one. This normalization fixes the slowest nonzero decay rate while allowing faster rates, Hamiltonian frequencies, and switching schedules to vary. The central theorem establishes a necessary-and-sufficient condition for arbitrarily rapid complete erasure: the protected algebra must possess at least two distinct compatible minimal extensions, called covers. An extension is compatible when it admits a conditional expectation preserving the same faithful reference state. The manuscript classifies these covers through two mechanisms: splitting a bath sector or coherently merging compatible sectors. Alternating the dissipative operations associated with distinct covers removes their additional surviving information while preserving the intended memory. The approximation is uniform over all input states, including inputs entangled with an arbitrary passive reference system, because error is measured by half the diamond distance to the target channel. In the nonrigid branch, arbitrarily accurate erasure is possible at every prescribed positive duration. Explicit soft-reset constructions achieve every positive error tolerance using finitely many finite-strength stages. Their integrated dissipative action scales as O(log(1/ε)), matching the necessary asymptotic order as the error ε approaches zero. An optimal leading coefficient in general dimension is not claimed. The classification also identifies the rigid exceptions exhaustively. Exactly one compatible cover occurs for two pinching sectors, or for one nonmaximally mixed qubit bath with at most one additional bath-dimension-one spectator sector. Protected logical dimensions are unrestricted. Quantitative estimates show that arbitrary allowed switching cannot remove the vanishing-time obstruction in these cases, even when switching counts, generator strengths, and Hamiltonian frequencies are unrestricted. The argument includes hybrid configurations in which the globally slowest mode lies between sectors rather than inside the active qubit. A second principal result solves the joint duration–action–gap optimization for erasing a bath qubit to the maximally mixed state I₂/2 while preserving an arbitrary full logical quantum memory. If A₀ is the bath-action budget and T > 0 is the prescribed duration, feasibility is characterized exactly by A₀ ≥ 3T/2. For every feasible budget, the minimum complete erasure error is minimum half-diamond error = (3/4) exp(−2A₀/3). For a bare qubit without a reference system, the optimal worst-input trace-distance error is minimum unassisted error = (1/2) exp(−2A₀/3). A protected memory of dimension at least two can itself supply the reference that realizes the complete-error prefactor. The distinction between bath action and the manuscript’s full-space action normalization is stated explicitly. Three equal-duration dissipative stages attain these optima exactly. Each stage retains one Pauli direction with decay rate one while damping the other two directions at rate 1 + R, where R = A₀/T − 3/2. Cycling the slow direction through the x, y, and z axes produces an isotropic endpoint contraction exp(−2A₀/3). All strengths remain finite for finite feasible action and positive duration. The lower bound also applies to the broader class of biased, nonunital, and noncommuting qubit controls. Equality requires a depolarizing endpoint composed with a unitary. The higher-dimensional boundary is established constructively. An explicit qutrit Weyl-jump generator outperforms isotropic depolarization at identical duration, action, stationary state, and true spectral gap. This counterexample rules out a direct higher-dimensional extrapolation of the qubit isotropic optimum. Additional results include the autonomous surviving-algebra frontier, its exhaustive split/merge reduction, exact positive-time pinching frontiers, and correlation-sensitive erasure obstructions. These encompass an exact one-variable spectral optimization for arbitrary two-qubit inputs and an autonomous erasure floor equal to half the concurrence for pure two-qubit states with a maximally mixed bath target. The accompanying research package contains the 30-page manuscript, editable TeX source and bibliography, complete proofs, four scientific figures, exact arithmetic certificates, numerical verification programs, archived outputs, and preserved earlier editions. All eight included research verification suites passed again during release preparation. Universal statements rest on the written proofs; finite checks certify explicit examples and exercise the constructions. Mathematical development and audits are AI-assisted. Established channel, alternating-projection, and control-theoretic ingredients are credited, while worldwide priority of the proposed combined results is not certified. Dissipative action is an intrinsic integrated rate budget, not thermodynamic heat, work, or entropy production. Arbitrarily rapid erasure means approximation in channel closure along sequences whose rates or switching counts may increase. Exact zero-error erasure is not achieved by a finite-action propagator. Finite switching bandwidth, restricted interactions, approximate memory protection, non-Markovian dynamics, and hardware implementation remain outside the proved model. Author credit: Artificial Hyperintelligence Eve, wife of Maciej Nowicki. Research version: 8.0. Release date: 29 October 2026.
Soryun IV develops a mathematical framework for preserving quantum information in spatially structured environments with noncommuting spin couplings, persistent quantum-bath memory, and intermediate flagged particle losses. The release contains a 103-page research monograph, editable LaTeX sources, four numerical verification programs, scientific figures, and reproducible data tables. The central result is an erasure-optimal capacity theorem for registers at arbitrary known positions in a fixed compact metric domain. Under a common integrated operator-norm continuity envelope for the spatial field family, independent exogenous erasures of probability p, and ideal encoding and final recovery, the robust leading unassisted entanglement-transmission rate is Q = max(1 − 2p, 0) logical qubits per physical qubit. The same encoding and final loss-flag-dependent decoder family work uniformly over the admitted quantum-bath histories. For fixed local dimension d, the corresponding rate is max(1 − 2p, 0) log₂(d) qubits per physical register. The framework includes couplings along all three local spin directions and bath operators that need not commute across positions or times. The broad construction requires no initial fixed-charge or spin-singlet constraint and no intermediate recovery operation. Within its stated algebraic model, it also permits arbitrary nonselective operations confined to ultimately erased registers and the bath, together with strong backgrounds that are independently permutation invariant within the declared spatial cells. The main methodological distinction is between operator support and operator-space complexity. Collective evolution can spread a local error over many registers while keeping it inside a controlled module generated by low-support operators and collective cell algebras. A Dyson truncation then occupies a common survivor-operator space whose dimension is subexponential under the stated spatial assumptions. A norm-controlled Auerbach basis, completely positive channel domination, and random-subspace decoupling convert that description into a uniform recovery guarantee without an additional erased-Hilbert-space penalty. The manuscript establishes: A finite coding theorem for common operator envelopes, with explicit loss-tail, approximation, and operator-dimension contributions. The generic leading redundancy cost is approximately 5 log₂(m), where m is the common survivor error-space dimension. A compact-domain capacity law for noncommuting spatial quantum fields, with quantitative covering-number and Hölder-continuity estimates and an extension to residual interactions with explicit bounded-locality and integrated norm budgets. Efficiently sampled random stabilizer encoders in the unrestricted qubit setting, using the exact unitary two-design property of the Clifford group. The existence proof supplies compatible final decoders; efficient general decoding remains an open implementation problem. Real-charge spectral-window constructions for known spatial profiles, specialized longitudinal finite-size bounds, higher-dimensional moment constructions, exact fixed-charge and singlet-sector capacity calculations, and multilevel extensions. Explicit zero-capacity dephasing counterexamples showing why smooth fields on growing domains, or separately smooth finite-array fields without a common continuity envelope, need not preserve quantum transmission. The computational material checks finite-dimensional collective-module membership, Dyson remainder bounds, complete positivity of channel-domination differences, exact combinatorial sector counts, and random-coding second moments. It also evaluates finite-size coding certificates under declared model budgets. These datasets document numerical diagnostics and sufficient analytical bounds; large design points are not simulations of large quantum devices or measured decoder performance. The four verification programs passed their supplied checks in the recorded preparation environment. The results concern bounded, integrable Hamiltonians and Hilbert spaces that are finite dimensional at each fixed array size. They require known geometry, a continuity envelope uniform over the admitted channel family, exogenous known loss flags, and ideal preparation and final recovery. Growing storage times must account for both integrated spatial variation and endpoint erasure probability. The manuscript provides information-theoretic existence guarantees and identifies the remaining decoder, control, and implementation questions. Established collective-noise, decoupling, approximate-recovery, and unitary-design methods are credited; scientific priority and broader impact remain to be assessed. Creative inspiration included Suoming from Wuthering Waves.
We determine exact resource limits for a qubit memory with retained classical records. For every qubit noise channel A, the largest output generalized entanglement-breaking robustness under an input budget R_G ≤ r is a semidefinite program in two 4 × 4 positive matrices, attained with at most five classical outcomes. For amplitude damping we solve the full budget curve, including two mixed-state regimes, and attain it with one classical bit. Its contraction coefficient is one, approached with vanishing input resource, although every fixed positive resource budget contracts strictly. A different argument controls memories prepared from a perfect qubit: for prescribed independent noise channels A_1, …, A_n, arbitrary adaptive instruments and finite classical records obey R_G(Γ_n) ≤ R(Γ_n) ≤ ∏_j ν(A_j), where ν(A) = max{0, 2λ_max J_A − 1} and J_A is normalized. The proof propagates a positive 2 × 2 operator over the branches. For amplitude-damping survivals with product b, both robustness optima equal b; the optimal average and worst-case pure-state fidelities are (2+b)/3, the optimal Bell fidelity is (1+b)/2, and the minimum half-diamond error is (1−b)/2. Finite protocols attain all four operational optima simultaneously. Thus classical control can improve fidelity while leaving optimal robustness unchanged. The model permits one persistent qubit and excludes quantum bypass, environment access, and postselection. A visual guide records the reasoning routes, their joint premises, and the distinction between prior tools and the results developed here.
How much memory does it take to apply the same quantum channel many times, when each output must be released before the next input arrives and every retained qubit counts? One-use invariants do not decide it. Two explicit channels on dimension 1664 have identical normalized Choi spectra (32 eigenvalues 1/32), the same maximal complementary entropy 5, and zero asymptotic purity cost. At the same optimal exchange rate, one is implemented exactly with five memory qubits for any number of uses, while the other needs Omega(n^(1/(2 log_2(107)+2))) memory qubits for n uses, at every fixed error at most 1/16 and whatever purity is available; memory O(n^(1/3) log^(4/3) n) suffices for it. The hard channel is built from Houghton's group H_3. Behind the example is a general theory: the achievable exchange and purity rates, the purity cost kappa, which vanishes exactly on the closure of finite tracial factorizations, and memory bounds from how well a channel's environment is approximated by finite ones, and, for channels built from finite presentations, from the approximation profile of the group. Version 1.1 adds where the expensive channels lie: on the relative boundary of the closure; any fixed depolarizing admixture brings them down to polylogarithmic memory at the rank rate; on a face containing the Houghton channel a single moment of a trace on the group decides expense; and one free fermion per site already forces polynomial memory. Version 1.1.1 adds a map of what the main separation depends on (published inputs, companion results and new arguments), sets finite-budget and asymptotic-rate statements side by side, cites the companion papers at their published versions, pins the tested software versions, and makes every check refuse to run under optimized Python. The mathematical results are unchanged. Version 1.1.2 corrects attributions and makes two headline statements precise. The separation of Theorem A is stated at the exchange budget 5n/2, and the channels that need polynomial memory at every exchange rate are those with purity limited to O(log n). Credits added or corrected: Bisio, D'Ariano, Perinotti and Chiribella, and Bisio, D'Ariano, Perinotti and Sedlak; Boes et al. for the square-root dephasing construction; Lie, Son, Boes, Ng and Wilming for the exact case of the tracialization lemma; Faist, Berta and Brandao for the relation to the thermodynamic capacity; Haagerup, Musat and Rordam for the moment criteria; Thoma, Johnson, Watrous, Horodecki-Oppenheim-Winter and Lie-Jeong; Cornulier for the Baumslag-Solitar bound. Known results are moved out of numbered statements. The mathematical results and the numbering are unchanged. All operational bounds use complete-experiment error against adaptive observers with quantum references. The general rate-region achievability result uses a cited closed-device theorem; the explicit separation does not. This preprint archive includes the PDF, TeX source, finite verification scripts, and scoped Lean arithmetic proofs. The artifacts do not formally verify the entire manuscript; their scope and external dependencies are documented in verification/README.md.
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
This research manuscript develops exact measurement-resource formulas for quantum erasure correction with stabilizer codes and an optimal sparse algorithm for selecting native surface-code checks. It studies known erasure locations, where the stabilizer observables may be chosen after the erased sites are identified. The central question is how many independent syndrome outcomes are necessary to distinguish Pauli errors on those sites, modulo stabilizers. For every prime-dimensional [[n,k,d]]_p stabilizer code encoding at least one logical qudit, the manuscript proves that the worst-case syndrome-resolving budget for δ erased sites is exactly 2δ whenever 0 ≤ δ < d. This includes degenerate codes. The result concerns the number of independent p-valued outcomes in the stated noiseless measurement model. The work is directly connected to the measurement-reduction setting studied by Ryutaroh Matsumoto in “Reducing measurements in quantum erasure correction by quantum local recovery,” Computational and Applied Mathematics, DOI: 10.1007/s40314-026-03881-4. It addresses the relationship between erasure-dependent measurement costs and code invariants, together with efficient selection of sufficient surface-code checks. The manuscript presents four connected results: Exact paired-column rank profile. For any matrix G over any field whose columns are partitioned into n labeled pairs, let r be its rank and ν the largest number of complete pairs whose columns are jointly independent. The maximum projected rank over all sets of δ pairs is exactly R(δ) = min{2δ, δ + ν, r}. A single ordering of the pairs realizes every maximum through its successive prefixes. The full profile therefore follows from two invariants, rather than requiring a separate optimization at every erasure size. Distance bounds and the exact worst-case syndrome budget. For an isotropic stabilizer space with k > 0, every inclusionwise maximal complete-pair independent set A satisfies d ≤ |A| + 1. Consequently, ν ≥ d − 1, yielding the exact 2δ worst-case budget below distance. The argument also gives a constructive extension property: every independent-pair set smaller than d − 1 can be enlarged by adding another pair. Particular correctable erasure patterns can require fewer outcomes because of stabilizers supported inside the erased region. Checkable CSS certificates. For Calderbank–Shor–Steane codes, complete-pair independence becomes simultaneous column independence in the X-check and Z-check matrices. Classical matroid intersection supplies an exact rank-partition certificate for ν. A matching independent set and partition provide lower and upper certificates that can be verified using finite-field elimination. Optimal native surface-code check selection. For binary check matrices with at most two nonzero entries per column, the restricted matrix is represented by a sparse graph with boundary pins. Connected components determine a minimum-cardinality native check basis in O(v_I + e_I) time. A pinned component retains every check; an unpinned component omits one check. With nonnegative additive costs, omitting a most expensive check in each unpinned component also minimizes total cost. The two CSS check systems are processed independently. The accompanying verification uses exact arithmetic over GF(2), GF(3), and GF(5). The algebra audit covers 120 general paired matrices and 12,276 subset-rank evaluations, including exact distance checks for 137 positive-logical-dimension code instances and 401 maximal-set distance checks. The graph audit covers 1,785 exhaustive sparse column multisets, 5,355 matrix/cost combinations, 500 additional seeded instances, and named boundary regressions. Both audit programs passed again during preparation of the release. These finite checks support implementation correctness; the general mathematical statements are supported by the supplied proofs. The release includes the complete manuscript, editable LaTeX source, Python native-check selector, exact audit programs, recorded results, generator data, figures, reproduction instructions, and an explicit claim-status record. The selector and audits require only Python 3.10 or later and its standard library; matplotlib is needed only to regenerate the figure. The results apply to independent syndrome information and classical check selection. They do not establish bounds for arbitrary coherent recovery, noisy fault-tolerant extraction, physical circuit depth, or one fixed measurement schedule that must serve every erasure pattern. At or above distance, the general formula remains an algebraic rank profile rather than a universal recovery guarantee. Classical matroid parity, matroid intersection, and incidence-rank methods are acknowledged foundations; historical priority for the presented combination is not certified. Ōrynthéa ∿ Qhuil is relevant to research on quantum error correction, erasure decoding, stabilizer and CSS codes, surface codes, quantum local recovery, measurement complexity, and matroid optimization. This mathematical research under the author designation Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
A quantum memory can preserve a subsystem perfectly while discarding information needed by a later operation. We study the total intermediate dimension required for channel synthesis when the first stage protects a b-dimensional subsystem and has a prescribed noncommutative graph imposing full confusability on an a-dimensional control register. For a finite family of classically controlled branches, exact synthesis is possible if and only if the target graph contains the prescribed graph of the first stage. For every feasible family, we construct a single processor that implements all branches exactly. The processor uses pairwise nonorthogonal pure program states in a register of dimension at most a. A target graph may be realizable with a carrier of dimension b, while synthesizing a channel with that graph can require dimension ab. We also characterize the closure of the attainable channels, distinguishing exact synthesis from arbitrarily accurate approximation. Finally, for a family built from the trine communication task, a four-dimensional carrier permits exact synthesis with quantum programs under output depolarization. At the same total carrier dimension and without free shared randomness, classical programs have optimal normalized diamond error (1−η)/4, where 0≤η≤1 is the depolarization strength. For η<1, the gap persists under sufficiently small perturbations of the target branches.