We study the number of independent stabilizer syndrome outcomes needed to resolve errors at known erased locations. For every matrix with paired columns, rank r, and maximum independent-pair cardinality ν, we prove the exact profile max |I|=δ rankGI = min{2δ,δ +ν,r}. One ordering of the pairs attains every entry of this profile. For an isotropic stabilizer space encoding at least one logical qudit, every inclusionwise maximal independent-pair set A satisfies d ≤|A|+1. Consequently, in the declared syndrome model, the worst-case measurement budget for δ < d erasures is exactly 2δ, including for degenerate codes. A CSS specialization gives matching and rank-partition certificates. For binary surface-code check matrices, we replace dense elimination with connected-component selection of an optimal native check set, in linear time in the sparse affected incidence input. Complete proofs, exact finite-field audits, and executable code accompany the manuscript.
We study the number of independent stabilizer syndrome outcomes needed to resolve errors at known erased locations. For every matrix with paired columns, rank r, and maximum independent-pair cardinality ν, we prove the exact profile max |I|=δ rankGI = min{2δ,δ +ν,r}. One ordering of the pairs attains every entry of this profile. For an isotropic stabilizer space encoding at least one logical qudit, every inclusionwise maximal independent-pair set A satisfies d ≤|A|+1. Consequently, in the declared syndrome model, the worst-case measurement budget for δ < d erasures is exactly 2δ, including for degenerate codes. A CSS specialization gives matching and rank-partition certificates. For binary surface-code check matrices, we replace dense elimination with connected-component selection of an optimal native check set, in linear time in the sparse affected incidence input. Complete proofs, exact finite-field audits, and executable code accompany the manuscript.
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.
Correlated faults from shared control can have dense physical support yet low rank over a base field, motivating rank-metric quantum codes for stacked architectures. We prove an asymmetric rank-metric Singleton bound for Calderbank--Shor--Steane codes, including degenerate codes, and characterize equality through commuting maximum-rank-distance matrix codes. Optimal pairs exist for every admissible parameter triple and are necessarily pure. Comparison with erasure bounds establishes an exact advantage in stacked rank distance for general stabilizer codes at fixed physical resources on certain tall layouts. We determine whether relaxing the recovery target enlarges the worst-case correctable radius. For Singleton-optimal pairs with positive logical dimension, the measured syndrome determines the projected error modulo stabilizers exactly at radii strictly below half the sector rank distance, on every layout and for every nonzero projector. The projected syndrome is recoverable at arbitrary radii exactly when the complementary check space is invariant under the adjoint projector; otherwise, the same radius limit applies. For nontrivial idempotents, this invariance requires more rows than columns or sector distance one. For trace-self-adjoint projectors, linear ambient projected-syndrome interfaces in both sectors exist exactly when the code splits as a tensor product across the projector. Designs placing the two check spaces in complementary projector images are necessarily one-sided whenever they encode logical information. Two explicit families realize the extreme cases of the equality structure, including a two-sided family with an efficient certifying decoder attaining the optimal unique-decoding radius.
How much time is fundamentally required to extract the syndrome of a stabilizer code on hardware with a given connectivity graph? Previous bounds answer through a chosen list of checks (Delfosse, Beverland, and Tremblay, 2021) or through the global code parameters (Baspin, Fawzi, and Shayeghi, 2023). Here, we show that neither determines the interaction that a particular hardware cut requires. We therefore define the intrinsic cut cost, χ, directly from the stabilizer group, independent of the generating set used to describe the code. It is computable from the check matrix alone, and equals the mutual information across the cut in the maximally mixed code state. We show that every exact extraction circuit, however adaptive, needs at least χ/2 two-qubit operations across the cut, and alternatively with free local processing exactly χ shared Bell pairs. Guided by this intrinsic cut cost, we construct annular surface codes with constant-depth local extraction that give a counterexample to Corollary 1 of Delfosse, Beverland, and Tremblay. Furthermore, for a fixed quantum Tanner family, χ grows at least linearly with the size of every sufficiently small region, giving a depth guarantee at each corresponding bottleneck in every layout. This strengthens the global perspective of Baspin, Fawzi, and Shayeghi and, together with our matching square-grid construction, yields a tight space--depth tradeoff. Our results connect the interaction required by syndrome extraction to hardware communication capacity and thus provide a way to assess unavoidable circuit costs before committing to a particular layout.
For an erasure pattern in a binary CSS code, the logical ambiguity supported on the erased coordinates is a finite-dimensional quotient. We give an explicit account of how its dimension becomes a decoder output, an exact conditional success probability, and a verifiable combinato- rial certificate. A restricted-rank formula yields the complement identity dZ (E) + dX (Ec) = k for every CSS code. For a cellulation of a connected closed orientable surface, the same index is computed by two graph component counts. We couple these counts to forest peeling, specify independently checkable component witnesses, and derive finite ambiguity-enumerator identi- ties. Complete enumeration on the square tori of sizes two and three gives exact sector and joint logical-success statistics. A register-transfer implementation is assessed through 1,462,400 recorded reference comparisons, scoped formal contracts, 72,000 specified single-run force injec- tions, and a separate persistent-fault experiment. The latter exhibits the distinction between an algebraic identity and an effective runtime audit: complementary indices derived from shared corrupted counters can still sum to the correct constant. Independent recounts and modular residues detect specified fault classes, while correlated value-and-residue changes remain un- detected. Mathematical exactness, computational checking, and empirical fault coverage are stated separately throughout.
Lụneï ∿ Oryun presents an exact characterization of optimal deterministic recovery for every finite-dimensional complex Schur channel, together with constructive decoders, matching converse bounds, and structural results for quantum erasure-correcting subspaces. The release includes an 18-page mathematical manuscript, editable LaTeX source, four numerical verification programs, recorded computational results, and reproducibility materials. The central result identifies the smallest achievable diamond-norm recovery error and the largest achievable worst-case entanglement fidelity through a single semidefinite optimization. One explicitly constructed recovery channel attains both optima. A common adversarial input proves optimality against every deterministic completely positive trace-preserving recovery, including recoveries outside the Schur and unitary classes. PureOne/LUNEI-Complex-Schur-Recovery · Datasets at Hugging Face The work also develops sharp code-repair bounds, an analytic separation between general recovery and mixed-unitary correction, and an obstruction to completing approximately maximum-dimension codes. Exact optimal recovery for arbitrary complex Schur channels Let (C) be a complex positive semidefinite matrix with unit diagonal. Its associated Schur channel acts by entrywise multiplication: [\mathcal M_C(X)=C\circ X.] Choose unit Gram vectors (c_i\in\mathbb C^r), where (r=\operatorname{rank}C), satisfying (c_i^\dagger c_j=C_{ij}). Define \min_{q\in\Delta}\lambda_{\max}!\left(\sum_iq_i c_ic_i^\dagger\right),] where (\Delta) is the probability simplex. The manuscript proves the operational identities [\inf_{\mathcal R}\left|\mathcal R\circ\mathcal M_C-\mathrm{id}\right|_\diamond=2[1-v(C)]] and [\sup_{\mathcal R}\inf_\rhoF_e!\left(\rho,\mathcal R\circ\mathcal M_C\right)=v(C).] Both optimizations range over all deterministic completely positive trace-preserving recovery channels on the fixed logical space. The diamond norm is unhalved, and entanglement fidelity uses the squared-overlap convention. These identities characterize optimal approximate recovery; perfect recovery occurs when (v(C)=1). The optimization uses an (r\times r) density matrix, or an equivalent spectral minimization over classical probabilities. This replaces an unrestricted search over recovery channels with a smaller problem on the Gram span. Constructive decoder and universal optimality witness An optimal density matrix (\sigma) determines a recovery correlation matrix explicitly. Writing [M_{ij}=c_i^\dagger\sigma c_j,\qquad f_i=M_{ii},] the construction is \frac{v(C)\overline{M_{ij}}}{f_if_j}+\delta_{ij}\left(1-\frac{v(C)}{f_i}\right).] The resulting Schur recovery (\mathcal M_A) attains both operational optima. Its recovered channel satisfies [C\circ A\succeq v(C)J,] where (J) is the all-ones matrix. This yields a convex decomposition containing an identity-channel component of weight (v(C)). The decomposition describes the deterministic channel; it does not assert an experimentally heralded successful branch. A dual-optimal probability distribution supplies a single reference-entangled input witnessing the converse bound against every competing recovery. Feasible primal and dual solutions also provide quantitative bounds on the optimal value and achievable recovery error. Connection to established semidefinite packing theory For the rank-one projectors (P_i=c_ic_i^\dagger), the reciprocal (1/v(C)) equals the established classical–quantum semidefinite packing number. The manuscript credits the packing framework studied by Duan and Winter rather than claiming the parameter as a new construction. The proposed contribution is its precise deterministic recovery interpretation: 2\left(1-\frac{1}{\mathsf A(P)}\right),\qquadF_{\mathrm{opt}}=\frac{1}{\mathsf A(P)},] together with the explicit common optimal decoder and universal adversarial witness. This interpretation concerns ordinary deterministic recovery and does not require a no-signalling assistance resource. Further operational and structural results Tensor-product recovery. The value obeys [ v(C\otimes E)=v(C)v(E). ] Product optimal decoders therefore attain the optimum against arbitrary collective recovery on the fixed tensor-product logical input space. This statement does not optimize additional redundant encodings across channel uses. Strict advantage over mixed-unitary correction. An explicitly solved tetrahedral tight-frame family exhibits a recovery channel that strictly outperforms every mixed-unitary recovery. For the four-dimensional family (C_t=(1-t)I+tG), the exact values are [ v(C_t)=\frac{1+t}{4}, \qquad D_{\mathrm{opt}}=\frac{3-t}{2}. ] The strict separation holds for (t>0). A convex quadratic subclass. For real entrywise nonnegative correlation matrices, [ v(C)=\min_{q\in\Delta}q^{T}Cq, ] and identity recovery is optimal. The general complex theorem covers phases for which this simpler conclusion fails. 1- \frac{ \sqrt{(1+a)(1+b)} + \sqrt{(1-a)(1-b)} }{2}. ] A sharp consequence is [ D_{\mathrm{opt}}\le1-\sqrt{1-\varepsilon^2} ] when the compression has operator norm at most (\varepsilon). Complete classification at maximum dimension. For complement-invariant binary supports of size (2K\ge4) and minimum Hamming distance at least two, every dimension-(K) code correcting any one known-coordinate erasure is classified by phase-weighted complementary pairs. Sharp constructive repair. Every rank-(K) trial projector on such a support admits an explicitly constructed closest exact code. Its squared Frobenius distance is bounded by the centered local compression defect divided by the support’s minimum Hamming distance. The uniform coefficient is globally sharp. Operator-norm repair. In the full central excitation sector, a complementary stability theorem controls the distance to an exact maximum-dimension code using local operator-norm defects. Its coefficient depends on physical blocklength rather than logical dimension. Failure of uniform near-capacity completion. A family of exactly erasure-correcting codes approaches the maximum dimension ratio while remaining far from every maximum-dimension code within the specified support. This establishes a limitation on extending the rank-half rigidity theorem to smaller ranks. Computational verification and release contents The accompanying programs record 157 case-level checks: 47 rigidity cases, 50 real minimax-recovery cases, 17 structural-extension cases, and 43 complex-recovery cases. Coverage includes explicit decoders, independent semidefinite formulations, primal–dual comparisons, tensor products, tight-frame examples, sharpness witnesses, and noncompletion constructions. The release contains the manuscript and source, verification scripts, full JSON reports, a consolidated verification table, dependency specifications, citation metadata, and integrity checksums. The prepared repository also provides a runner that preserves the recorded results while writing regenerated reports separately. These computations supplement the analytic proofs. They are finite floating-point checks rather than formal verification or interval-arithmetic certificates. Solver statuses and numerical residuals are retained in the reports. Research status and scope The proposed novelty concerns the precise operational equivalence, constructive optimal recovery, mixed-unitary separation, and stated structural theorems. Established packing parameters, packing multiplicativity, complement-pair constructions, and recovery methods are credited in the manuscript. Worldwide priority remains unconfirmed. The principal recovery theorem applies to finite-dimensional Schur channels on a fixed logical space. The erasure and rigidity results require their stated support and rank assumptions. The release makes no claim of solving unrestricted quantum recovery or demonstrating a physical fault-tolerant device. Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki. Version: Consolidated edition 3, 2 November 2026.
Recent work established that, for independent erasures, storing K logical qubits for S time steps with error at most ε requires a spacetime cost of Ω(S(K+log(S/ε))). A matching construction was also given, but assumes ideal error correction. Here we show that the same scaling can be achieved with an explicit noisy error-correction circuit and efficient decoding, counting all state-preparation, gate, measurement, and wait locations, provided that the hardware supports long-range qubit connectivity and fast, reliable classical processing. Thus, reliability adds only a logarithmic overhead shared by all stored qubits. The construction works for sufficiently weak but otherwise general circuit noise, including faults during syndrome extraction and correlated faults, and for independent erasures it matches the best known lower bound up to constant factors. We attain this scaling using quantum Tanner codes, with each memory step consisting of one round of syndrome extraction followed by a fixed number of parallel classical decoder steps that reduce the residual error enough to keep later faults correctable, regardless of memory size, storage time, or target accuracy. Together, this gives exponentially small failure probability per step while keeping the cost of each memory step linear in the code size. The same analysis also extends to certain constant-depth logical Clifford operations.