betaFeedback

WorksPhysics and Astronomy

Quantum CSS codes: Decoder-aware multiobjective design and bound-certified selection

Abstract

Quantum error-correcting codes trade decoding reliability against the resources needed to measure their checks. We formulate Calderbank-Shor-Steane (CSS) code design at fixed encoding resources as a decoder-aware multiobjective problem. The objectives are failure probability under sector-wise degenerate maximum-likelihood decoding and check weight, the minimum total weight of an independent pure-type generator basis. For independent bit- and phase-flip noise with perfect syndrome extraction, deterministic truncation bounds support selection under a failure-rate constraint. At a per-sector error probability of 0.01, the bounds certify that a code encoding two logical qubits into 40 physical qubits meets a failure-rate target of 0.001 at check weight 139. The lower bound of every cheaper candidate in the corresponding (40,2) main menu exceeds this target. In paired searches sharing one annealing kernel and equal query budgets, decoder-aware guidance gives significantly higher mean final hypervolume than distance guidance in all eight tested configurations under the reported Holm correction. Against distance-multiplicity guidance, five configurations show significant gains and three do not, including one with a negative mean difference. All arms are scored in common truncated-reliability and normalized-check-weight coordinates. The framework connects reliability-check-weight trade-offs to bound-certified selection within evaluated CSS pools.

Introduction

Quantum error correction protects logical information through redundant encoding and recovery from physical errors [1]. Recent demonstrations of below-threshold surface-code memories [2], error-corrected logical processing in neutral-atom arrays [3], and concatenated bosonic memories [4] make the resource cost of reliable quantum information processing an increasingly concrete design problem. That cost extends beyond the number of physical qubits. Recent work addresses encoding overhead and hardware connectivity through quantum low-density parity-check codes [5, 6, 7], the number of syndrome-extraction rounds through transversal algorithmic fault tolerance [8], and classical processing through parallel decoding [9]. Across these directions, assessing a design requires specifying both the reliability sought and the resources counted, together with the noise model, measurement procedure, and decoder.

Automated code design offers ways to explore these choices, but existing objectives capture different aspects of performance. Several lines of work show how structural or error-sensitive information enters automated design. Distance-based annealing pairs a multiplicity surrogate with generator reduction [10]. Evolutionary search optimizes distance together with noise-tailored undetectable errors [11]. Reinforcement learning combines degree reduction with distance rewards [12]. High-rate constructions also explicitly consider parameter trade-offs and the retention of Pareto sets [13]. Decoder feedback has been used to adapt surface-code memories toward a target logical error rate [14], while quantum Lego searches optimize distance and biased-noise objectives [15].

Comparing these approaches requires attention to their reliability metrics. In the biased-noise task of Su et al., the reward uses logical-error probability conditioned on a trivial syndrome; the work also reports undetectable logical-error probability Eqs. (1)–(3) of Ref. [15]. These quantities differ from the full degenerate maximum-likelihood (DML) failure probability over all syndromes used here. Their framework also accommodates decoder-based evaluations including nontrivial syndromes. We therefore connect a specified reliability objective, check cost, and bound-based selection within a single design framework.

At fixed Calderbank–Shor–Steane (CSS) encoding resources, how should one choose between logical reliability and the cost of measuring checks? Code distance alone does not determine a decoder’s failure probability under a specified noise model. Minimizing failure alone, in turn, does not express how much measurement cost is justified by a user’s reliability requirement. A fixed preference weight selects one compromise, whereas different budgets or failure requirements can favor different codes. Keeping reliability and check cost as separate objectives exposes these choices and permits selection after the requirement is specified. A constrained single-objective problem can address a particular requirement; the multiobjective formulation retains alternatives across requirements.

Three elements are needed to make such choices meaningful: a cost definition invariant under equivalent gener-

ator representations, reliability evaluated for a specified decoder, and decision rules that account for evaluation uncertainty. Changing a stabilizer basis can alter its total generator weight without changing the code. Likewise, a truncated failure estimate can leave threshold attainment unresolved. We connect these elements by minimizing (PD,B∗)(P_D, B_*) at fixed block length, encoded dimension, and stabilizer ranks. Here PDP_D is the block failure probability of sector-wise DML decoding under independent bit- and phase-flip noise with perfect syndrome extraction, and B∗B_* is the minimum total weight of an independent pure-type stabilizer basis. A distance floor and exclusion of components with no logical information define the feasible family. Low-weight error enumeration supplies two-sided bounds for threshold selection and exclusion of candidates dominated under the interval test. These bounds control analytic truncation error; their numerical scope and the interpretation of the dominance test are specified in § 2.

Our contributions are threefold. First, we formulate fixed-resource CSS design with a decoder-defined reliability objective and a basis-invariant check-weight objective, subject to distance and component constraints. Second, we derive two-sided truncation bounds and use them for threshold and dominance decisions. Third, we compare decoder-aware guidance with alternative signals in paired, equal-budget searches and test joint code–redundancy selection within a fixed evaluated pool.

The resulting menus (retained candidate sets) support a concrete design decision: at (n,k)=(40,2)(n,k)=(40,2) and p=0.01p=0.01 per sector, a check-weight-139 code meets a 10−310^{-3} failure requirement and every cheaper main-menu candidate is excluded by its lower bound. In paired common-kernel searches, decoder-aware guidance raises mean final application hypervolume relative to distance in all eight tested cells under the reported Holm correction; relative to distance–multiplicity, five cells show significant gains and three do not, including a negative mean difference at (40,4)(40,4). The comparison uses common truncated reliability coordinates, while the selection uses refined failure bounds.

Noisy syndrome measurements introduce another resource decision: how much of a measured-check-weight budget to allocate to redundancy. Building on quantum data-syndrome coding [16], we re-evaluate the 477 retained candidates from the eight main menus under a strict single-round model and compare joint code-and-redundancy selection with selecting the code first. Interval-separated comparisons support gains at many tested budgets, while other budgets show no endpoint gain. Together, the analyses connect decoder-defined reliability to explicit check-weight decisions under the stated models.

Section II defines the multiobjective problem. § 2 develops the evaluation bounds and decision rules, and Sec. IV specifies the search comparison. § 2.3 and VI present the code-capacity (perfect-syndrome) results and measurement-noise extension. Sections VII and § 4 discuss the implications and conclude. Appendixes B–D give search details, sensitivity results, and measurement-noise summaries.

Decoder-aware multiobjective formulation

We formulate CSS code design as a choice between logical reliability and check weight at fixed encoding resources. The reliability objective is defined by a specified noise model and decoder; the cost objective is minimized over equivalent generator bases. Keeping these objectives separate accommodates different resource budgets without fixing a single trade-off weight in advance.

Design variables and noise model

In the CSS construction [17, 18], a code is specified by two binary subspaces, C=(SX,SZ)C=(S_X,S_Z), represented by generator matrices HXH_X and HZH_Z satisfying

SX=row⁡(HX),SZ=row⁡(HZ),HXHZT=0.(1)\begin{aligned} S_X &= \operatorname{row}(H_X),\\ S_Z &= \operatorname{row}(H_Z),\\ H_XH_Z^{T} &= 0. \tag*{(1)} \end{aligned}

The subspaces specify the supports of the XX-type and ZZ-type stabilizers. Their dimensions are rXr_X and rZr_Z, and the code encodes k=n−rX−rZk=n-r_X-r_Z logical qubits in nn physical qubits. We fix (n,k,rX,rZ)(n,k,r_X,r_Z) within each design problem. The numerical study uses balanced ranks, rX=rZ=(n−k)/2r_X=r_Z=(n-k)/2, which requires n−kn-k to be even; every tested cell meets this condition. Invertible row operations change the representation of a code but leave its stabilizer subspaces unchanged [19].

We consider independent XX and ZZ Bernoulli errors, each with probability pp per physical qubit, and perfect syndrome extraction. Unless otherwise stated, p=0.01p=0.01. We call the XX- and ZZ-type error sets sectors. The decoder performs degenerate maximum-likelihood (DML) decoding separately in each sector. For each syndrome, it selects the error class modulo the corresponding stabilizer subspace with the largest total probability. This rule accounts for degeneracy by maximizing the probability of an equivalence class rather than that of an individual error [20]. Thus the reliability objective depends on both the code and the specified decoding problem.

We regard binary vectors as coordinate tuples; they are written as columns in matrix–vector products, while stabilizer subspaces are specified by row spaces. For an XX error e∈F2ne\in\mathbb{F}_2^n, let σ(e)=HZe\sigma(e)=H_Ze denote its syndrome. Two errors with the same syndrome belong to the same class if their difference lies in SXS_X. We reserve ℓ\ell for a stabilizer class label, and α∈{X,Z}\alpha\in\{X,Z\} for a sector index; [e][e] denotes the stabilizer class containing ee. Define the class probability masses by

M(s,ℓ)=∑e: σ(e)=s[e]=ℓp∣e∣(1−p)n−∣e∣(2)M(s,\ell)=\sum_{\substack{e:\ \sigma(e)=s\\ [e]=\ell}}p^{|e|}(1-p)^{n-|e|} \tag*{(2)}
PX=1−∑smax⁡ℓM(s,ℓ)P^{X}=1-\sum_s\max_{\ell}M(s,\ell)

where ∣e∣|e| is the Hamming weight. The ZZ-sector failure probability PZP^{Z} is defined by interchanging XX and ZZ. Independence of the two error sectors gives the block failure probability

PD(C)=1−[1−PX(C)][1−PZ(C)].(3)P_D(C)=1-[1-P^{X}(C)][1-P^{Z}(C)]. \tag*{(3)}

The subscript DD refers throughout to this sector-wise DML decoder. These definitions specify the exact reliability objective; its computational evaluation is addressed in the next section.

Reliability and basis-invariant check cost

Our second objective is the minimum total weight of independent pure-type stabilizer generators,

B∗(C)=min⁡BX basis of SX∑g∈BX∣g∣+min⁡BZ basis of SZ∑g∈BZ∣g∣.(4)B_*(C)=\min_{B_X\text{ basis of }S_X}\sum_{g\in B_X}|g|+\min_{B_Z\text{ basis of }S_Z}\sum_{g\in B_Z}|g|. \tag*{(4)}

This minimization removes dependence on the particular matrices used to represent the code. For each subspace, inserting linearly independent nonzero elements in nondecreasing Hamming weight yields a minimum-weight basis by the vector-matroid greedy rule [21]. The two minimizations can be carried out independently. Our implementation enumerates the nonzero elements of each stabilizer subspace and applies this rule; its enumeration cost is exponential in the subspace rank.

B∗B_* counts data-qubit participations in one round of independent pure-type checks, with each participation assigned unit weight. It provides a common cost proxy for comparing codes at fixed ranks. Routing, ancilla requirements, measurement scheduling, and error propagation depend on the syndrome-extraction circuit and are not included in this objective. Redundant checks introduce an additional choice of measured generators, considered later in the measurement-noise extension.

For a feasible set F\mathcal{F} defined below, the design problem is

min⁡C∈F(PD(C),B∗(C)).(5)\min_{C\in\mathcal{F}}(P_D(C),B_*(C)). \tag*{(5)}

Both objectives are properties of the stabilizer subspaces under the stated noise and decoding assumptions. Treating them separately retains alternatives with different reliability and check-weight requirements. Search generates candidate codes for this multiobjective problem; the objectives are defined independently of the search method.

Distance and component constraints

We impose a minimum distance d(C)≥3d(C)\ge3. Distance specifies a protection requirement, while PDP_D resolves reliability differences within the feasible set. We also exclude factors that consume physical qubits without encoding logical information. A frozen qubit, for example, contributes check weight but no logical degree of freedom. Including such factors would allow part of a nominally fixed block length to remain unused for encoding.

To define this restriction independently of a generator basis, consider a partition P\mathcal{P} of the physical qubits. The code decomposes over P\mathcal{P} when

SX=⨁B∈P(SX∩F2B),SZ=⨁B∈P(SZ∩F2B).(6)\begin{aligned} S_X&=\bigoplus_{B\in\mathcal{P}}(S_X\cap\mathbb{F}_2^B),\\ S_Z&=\bigoplus_{B\in\mathcal{P}}(S_Z\cap\mathbb{F}_2^B). \tag*{(6)} \end{aligned}

where F2B\mathbb{F}_2^B denotes vectors supported on BB. The components of CC are the blocks of the finest such partition. A component cc with ncn_c physical qubits and restricted stabilizer ranks rX,cr_{X,c} and rZ,cr_{Z,c} encodes

kc=nc−rX,c−rZ,c(7)k_c=n_c-r_{X,c}-r_{Z,c} \tag*{(7)}

logical qubits. The feasible set consists of CSS codes with the fixed ranks above satisfying

F={C:d(C)≥3,kc≥1 for every component c}.(8)\mathcal{F}=\{C:d(C)\ge3,\quad k_c\ge1\text{ for every component }c\}. \tag*{(8)}

This condition excludes frozen qubits and other stabilizer-state factors. It still admits direct sums whose components each encode logical information. For each stabilizer subspace, its finest coordinate decomposition is the component partition of the column matroid represented by a basis matrix. The finest partition decomposing both subspaces is the join of these two partitions, where join means the finest common coarsening. Appendix A states and proves this result and gives a construction from reduced row-echelon bases. The connection to fundamental circuits uses standard matroid terminology [21]; the CSS decomposition claim is proved explicitly in the appendix.

Pareto comparison and resource-constrained choice

A feasible code C′C' dominates CC if

PD(C′)≤PD(C),B∗(C′)≤B∗(C),(9)P_D(C')\le P_D(C),\qquad B_*(C')\le B_*(C), \tag*{(9)}

with at least one strict inequality. Pareto-optimal codes are those not dominated by another member of the set under consideration. We distinguish the full feasible set F\mathcal{F} from a finite evaluated candidate set A⊆F\mathcal{A} \subseteq\mathcal{F}. After interval filtering, we call the retained candidates in a specified evaluated candidate set a menu. The numerical search explores only part of F\mathcal{F}, so comparisons among its candidates are relative to A\mathcal{A}.

When exact objective values are available, a check-weight budget bb selects a code through

Cb∈arg⁡min⁡C∈A:B∗(C)≤b  PD(C),(10)C_b \in\underset{C\in\mathcal{A}:B_*(C)\leq b}{\arg\min}\; P_D(C), \tag*{(10)}

with ties resolved by smaller B∗B_*. Conversely, a maximum allowed failure probability τ\tau selects

Cτ∈arg⁡min⁡C∈A:PD(C)≤τ  B∗(C),(11)C_\tau\in\underset{C\in\mathcal{A}:P_D(C)\leq\tau}{\arg\min}\; B_*(C), \tag*{(11)}

with ties resolved by smaller PDP_D. Whenever the corresponding constraint set is nonempty, either rule selects a Pareto-optimal member of A\mathcal{A}: a dominating code would either improve the minimized objective or win the tie break.

Figure 1 connects the two-objective design problem to finite-pool selection. Panel (b) illustrates nondominance when the objectives are known exactly. In practice, evaluating PDP_D exactly becomes costly as nn increases, so the next section develops deterministic bounds for conservative decisions. Panel (c) shows why meeting an upper-bound requirement certifies feasibility, whereas an unresolved cheaper candidate can prevent a minimum-cost conclusion over all truly feasible candidates. The bounds determine which claims about the true PDP_D objective the available evaluations support.

Figure 1. Decoder-aware design and conservative selection. (a) Fixed encoding resources, independent X/ZX/Z noise with perfect syndrome extraction, and sector-wise DML decoding define the task; reliability and basis-invariant check weight are separate objectives. (b) Exact-objective schematic for a finite candidate set: green points are nondominated, gray points are dominated, and both objectives improve toward the lower left. The dashed line is a guide, not an interpolation between realizable codes. (c) Illustrative selection with failure bounds: the cheapest candidate fails the requirement, the next is unresolved, and the highlighted point minimizes cost among certified-feasible choices. The unresolved cheaper candidate prevents a minimum-cost conclusion among all truly feasible candidates. All coordinates are illustrative.

Certified evaluation and decision rules

The formulation in Sec. II requires the failure probability of the full DML decoder. We evaluate this objective through a truncated error distribution with a deterministic remainder bound. The resulting intervals support two distinct operations: certifying that a code meets a reliability threshold and excluding candidates dominated under the interval test.

Truncated sector probabilities

For one error sector, let M(s,ℓ)M(s,\ell) be the syndrome–class probability mass defined in Sec. II. Retaining errors of weight at most WW, with 0≤W≤n0 \leq W \leq n, gives

MW(s,ℓ)=∑e: σ(e)=s, [e]=ℓ∣e∣≤Wp∣e∣(1−p)n−∣e∣.(12)M_W(s,\ell)=\sum_{\substack{e:\ \sigma(e)=s,\ [e]=\ell\\ |e|\leq W}}p^{|e|}(1-p)^{n-|e|}. \tag*{(12)}

The retained probability and omitted tail are

mW=∑w=0W(nw)pw(1−p)n−w,τW=1−mW.(13)m_W=\sum_{w=0}^{W}\binom{n}{w}p^w(1-p)^{n-w}, \qquad \tau_W=1-m_W. \tag*{(13)}

We use the unnormalized retained distribution. With

AW=∑smax⁡ℓMW(s,ℓ),PW=mW−AW,(14)A_W=\sum_s\max_\ell M_W(s,\ell), \qquad P_W=m_W-A_W, \tag*{(14)}

PWP_W is the failure mass of the ML rule optimized for the retained distribution. Because omitted errors can change the maximizing class, PWP_W is neither the conditional failure probability given weight at most WW nor generally equal to the low-weight contribution to full DML failure.

Proposition 1 (sector bracket). For the full DML failure P=1−∑smax⁡ℓM(s,ℓ)P=1-\sum_s\max_\ell M(s,\ell),

PW≤P≤PW+τW.(15)P_W\leq P\leq P_W+\tau_W. \tag*{(15)}

The lower endpoint is nondecreasing in WW, the upper endpoint is nonincreasing, and both equal PP at W=nW=n.

Proof. Set A=∑smax⁡ℓM(s,ℓ)A=\sum_s\max_\ell M(s,\ell). For each syndrome,

0≤max⁡ℓM(s,ℓ)−max⁡ℓMW(s,ℓ)≤∑ℓ[M(s,ℓ)−MW(s,ℓ)].(16)0\leq\max_\ell M(s,\ell)-\max_\ell M_W(s,\ell) \leq\sum_\ell\left[M(s,\ell)-M_W(s,\ell)\right]. \tag*{(16)}

Summing gives 0≤δW:=A−AW≤τW0\leq\delta_W:=A-A_W\leq\tau_W. Therefore

P=1−A=PW+τW−δW,(17)P=1-A=P_W+\tau_W-\delta_W, \tag*{(17)}

which proves the bracket. If the cutoff increases from WW to W′W', the additional retained mass is Δm=mW′−mW≥0\Delta m=m_{W'}-m_W\geq0, and 0≤AW′−AW≤Δm0\leq A_{W'}-A_W\leq\Delta m. Hence PW′−PW≥0P_{W'}-P_W\geq0. The upper endpoint satisfies PW+τW=1−AWP_W+\tau_W=1-A_W and therefore cannot increase. At W=nW=n the omitted tail vanishes. □\square

Combining the two sectors

For the independent XX and ZZ sectors of Sec. II, define

LW=P^W=1−(1−PWX)(1−PWZ),(18)L_W=\widehat{P}_W=1-(1-P_W^X)(1-P_W^Z), \tag*{(18)}
UW=1−(1−PWX−τW)(1−PWZ−τW).(19)U_W=1-(1-P_W^X-\tau_W)(1-P_W^Z-\tau_W). \tag*{(19)}

Each sector upper endpoint lies in [0,1][0,1], since PWα+τW=1−AWαP_W^\alpha+\tau_W=1-A_W^\alpha for α=X,Z\alpha=X,Z. The function 1−(1−x)(1−z)1-(1-x)(1-z) is nondecreasing in both arguments on this domain, so Proposition 1 gives

LW≤PD≤UW.(20)L_W \le P_D \le U_W. \tag*{(20)}

In particular,

UW−LW=τW(2−PWX−PWZ)−τW2≤2τW.(21)U_W-L_W=\tau_W(2-P_W^X-P_W^Z)-\tau_W^2\le2\tau_W. \tag*{(21)}

Thus min⁡{1,LW+2τW}\min\{1,L_W+2\tau_W\} is a valid, generally looser block upper bound: both sector tails contribute to block failure, so a single-sector tail τW\tau_W cannot generally serve as its additive bound. The block intervals are nested as WW increases, because the sector lower endpoints increase and their upper endpoints decrease. At W=nW=n, Ln=Un=PDL_n=U_n=P_D.

These bounds quantify omitted probability mass under the independent-sector model of Sec. II.

Evaluation and numerical checks

The truncated evaluator groups error patterns by syndrome and stabilizer class. For rational p=a0/b0p=a_0/b_0 with integers 0<a0<b00<a_0<b_0, class comparisons can be performed using the integer masses

M~W(s,ℓ)=∑w=0Wcw(s,ℓ)a0w(b0−a0)W−w,(22)\widetilde{M}_W(s,\ell)=\sum_{w=0}^{W}c_w(s,\ell)a_0^w(b_0-a_0)^{W-w}, \tag*{(22)}

where cw(s,ℓ)c_w(s,\ell) counts weight-ww errors in the class. Indeed,

MW(s,ℓ)=(b0−a0)n−Wb0nM~W(s,ℓ),(23)M_W(s,\ell)=\frac{(b_0-a_0)^{n-W}}{b_0^n}\widetilde{M}_W(s,\ell), \tag*{(23)}

The common positive factor does not change which class maximizes the probability mass. The code-capacity evaluator compares integer class masses with a deterministic tie break, then converts the selected failure masses to floating-point probabilities. Full enumeration removes truncation error but still returns numerical probabilities. The measurement-noise evaluator instead accumulates and maximizes class masses in floating-point arithmetic (Sec. VI A). Neither implementation supplies a separately verified roundoff enclosure for its stored endpoints or floating-point operations.

The number of retained patterns per sector is NW=∑w=0W(nw)N_W=\sum_{w=0}^{W}\binom{n}{w}, rather than 2n2^n. We use W=4W=4 during search. Candidates retained for final evaluation are scored by full enumeration for n≤20n\le20 and by the W=6W=6 bracket for n=30,40n=30,40.

On an independent validation set of 2000 codes (400 at each of n=10,12,14,16,20n = 10, 12, 14, 16, 20), every full-enumeration value lies in its W=4W = 4 interval at absolute tolerance 10−1410^{-14} [Fig. 2(a)]. For final menus, the largest relative interval widths (UW−LW)/LW(U_W - L_W)/L_W are approximately 2.93×10−32.93 \times10^{-3} in the main menus and 3.03×10−33.03 \times10^{-3} in the two n=40n = 40 union menus. Appendix B § 4.3.4 gives the validation and width definitions; threshold decisions use individual upper endpoints.

Certified threshold decisions

Let A\mathcal{A} be a finite set of evaluated feasible codes, with valid bounds L(C)≤PD(C)≤U(C)L(C) \le P_D(C) \le U(C) and exact check costs B∗(C)B_*(C). For a maximum allowed failure probability τ\tau, attainment means failure at or below τ\tau. Define

Aτcert={C∈A:U(C)≤τ}.(24)\mathcal{A}^{\mathrm{cert}}_{\tau} = \{C \in\mathcal{A} : U(C) \le\tau\}. \tag*{(24)}

If this set is nonempty, the rule

C~τ∈arg⁡min⁡C∈AτcertB∗(C),(25)\widetilde{C}_{\tau} \in\mathop{\arg\min}_{C \in\mathcal{A}^{\mathrm{cert}}_{\tau}} B_*(C), \tag*{(25)}

with ties resolved by smaller U(C)U(C), selects a code satisfying PD(C~τ)≤τP_D(\widetilde{C}_{\tau}) \le\tau. It also minimizes check weight among the candidates whose bounds certify this requirement. A code with L(C)>τL(C) > \tau is certified to fail the requirement; when L(C)≤τ<U(C)L(C) \le\tau< U(C), its status remains unresolved by the interval.

A cheaper code with PD≤τ<UP_D \le\tau< U remains possible, and ordering upper bounds need not order true failure probabilities. The selected code is Pareto-optimal for the upper-bound objectives (U,B∗)(U, B_*) within A\mathcal{A}, while true Pareto membership and minimum cost among all truly feasible candidates remain unresolved. Exact-value conclusions are recovered when the intervals collapse to true probabilities. An empty certified set means the current bounds provide no certified choice.

Similarly, if at least one candidate satisfies a budget bb, we can use the conservative rule

C~b∈arg⁡min⁡C∈A:B∗(C)≤bU(C),(26)\widetilde{C}_{b} \in\mathop{\arg\min}_{C \in\mathcal{A}: B_*(C) \le b} U(C), \tag*{(26)}

with ties resolved by smaller B∗B_*. This minimizes the available upper bound within budget and certifies PD(C~b)≤U(C~b)P_D(\widetilde{C}_{b}) \le U(\widetilde{C}_{b}); the true-failure ranking remains unresolved.

Dominance certified by intervals

A sufficient condition for C′C' to dominate CC in the true objectives is

B∗(C′)≤B∗(C),U(C′)≤L(C),(27)B_*(C') \le B_*(C), \qquad U(C') \le L(C), \tag*{(27)}

with at least one of these inequalities strict. The probability ordering follows from

PD(C′)≤U(C′)≤L(C)≤PD(C).(28)P_D(C') \le U(C') \le L(C) \le P_D(C). \tag*{(28)}

If the cost inequality is strict, equal interval endpoints suffice; at equal costs, strict separation U(C′)<L(C)U(C') < L(C) is required by this test. This rule certifies dominance and removes those candidates; overlapping intervals can leave true dominance among survivors unresolved.

We apply the test with search-time W=4W = 4 brackets, refine survivors, and repeat the test; interval nesting preserves dominance established before refinement. The resulting set contains candidates not excluded by certified dominance within the searched pool. Surviving the test does not establish true Pareto optimality or search completeness.

Scope of certification. The two-sided bounds certify omitted probability mass under the stated noise and DML model; they are not statistical confidence intervals. The stored-endpoint roundoff limitation in § 2 C applies throughout. Threshold and dominance conclusions concern specified finite evaluated sets, not the full feasible space. A menu minimum is established when the selected upper bound meets the requirement and every cheaper menu candidate has a lower bound above it; interval survival alone proves neither true Pareto membership nor search completeness. Search-time hypervolume instead uses truncated reliability coordinates to compare search outcomes.

Search and evaluation protocol

We use a controlled search comparison to test how the reliability signal affects the candidate sets found for the design problem in Sec. II. Three primary search arms share a decomposition simulated-annealing kernel and differ in the reliability term supplied to that kernel. Two additional single-objective arms provided workflow-level comparisons. All five arms are evaluated using the same decoder-based application metric, irrespective of the signal driving their search. Execution details and checkpoint extraction are collected in Appendix B.

Common kernel and reliability signals

The three primary arms use nine annealing chains with fixed weights aj=j/8a_j = j/8, j=0,…,8j = 0,\ldots,8, and energy

Ej(C)=ajR(C)+(1−aj)B~(C)+λ viol⁡(C),B~(C)=B∗(C)n(rX+rZ),(29)\begin{aligned} E_j(C) &= a_j R(C) + (1-a_j)\widetilde{B}(C) \\ &\quad+ \lambda\,\operatorname{viol}(C),\\ \widetilde{B}(C) &= \frac{B_*(C)}{n(r_X+r_Z)}, \tag*{(29)} \end{aligned}
viol⁡(C)=max⁡{0,3−d(C)}+#{c:kc=0}.(30)\operatorname{viol}(C)=\max\{0,3-d(C)\}+\#\{c:k_c=0\}. \tag*{(30)}

The main comparison sets λ=1\lambda= 1. Each proposal applies a CNOT transformation between a uniformly sampled ordered pair of distinct qubits. This preserves CSS commutation and the stabilizer ranks, while distance and the component constraint are handled through the penalty and the feasible archive.

The reliability signals are

Rdec(C)=log⁡10[1+P^4(C)/p2]log⁡10{1+[1−(1−p)2n]/p2},(31)R_{\mathrm{dec}}(C)=\frac{\log_{10}\left[1+\widehat{P}_4(C)/p^2\right]}{\log_{10}\left\{1+\left[1-(1-p)^{2n}\right]/p^2\right\}}, \tag*{(31)}

The normalization maps P^4=0\widehat{P}_4=0 to zero and P^4=1−(1−p)2n\widehat{P}_4=1-(1-p)^{2n} to one; the logarithm compresses the range between these reference values.

Rdist(C)=1−d(C)−1n−1,R_{\mathrm{dist}}(C)=1-\frac{d(C)-1}{n-1},
RPerlin(C)=log⁡mlog⁡(C)/log⁡1000−d(C)+n−1n.(32)R_{\mathrm{Perlin}}(C)=\frac{\log m_{\log}(C)/\log1000-d(C)+n-1}{n}. \tag*{(32)}

Here mlog⁡(C)m_{\log}(C) is the total number of weight-d(C)d(C) nontrivial pure-type logical operators in the two sectors, counted by the evaluator’s logical weight spectra. In the results tables, the label (d,m)(d,m) abbreviates (d,mlog⁡)(d,m_{\log}); it does not refer to the number of measured checks. The last signal is an affine rescaling of the distance–multiplicity energy used in the Perlin-inspired search [10]. The distance-based signals use different normalizations: at fixed mlog⁡m_{\log}, a unit increase in dd changes RdistR_{\mathrm{dist}} by −1/(n−1)-1/(n-1) and RPerlinR_{\mathrm{Perlin}} by −1/n-1/n.

For each seed, all arms receive the same initial population of 24 random CSS codes at the prescribed ranks. The primary arms use the same rule to initialize their nine chains; Appendix B gives the chain schedule, acceptance rule, and temperature adaptation.

The primary arms share the initialization rule, chain weights, proposal operator, adaptation rule, constraint penalty, evaluator, and query allocation. Realized temperatures and trajectories can differ because they depend on the signal-specific energy changes. Sharing a seed pairs runs with a common starting population; signal-specific energies can produce different trajectories. The two additional arms minimize −d-d or log⁡mlog/log⁡1000−d\log m_{\mathrm{log}}/\log1000-d on all nine chains. They share the evaluator, initial population, proposal operator, and temperature-adaptation procedure, but rank the initial population by their own energy to select chain starts. Their acceptance energies contain neither a check-cost term nor the component/distance penalty used by the primary arms. Feasibility is still enforced when constructing the application archive. These local single-objective baselines compare workflow choices, including differences in initialization and penalty treatment; they are not reproductions of published optimization workflows.

Query accounting and candidate archives

Each evaluator call counts as one query, including initialization, rejected proposals, and repeated codes. All arms use the same evaluator and obtain the same metrics for a given code, even when their search energies use only a subset of those metrics.

Equal query budgets control evaluator calls, including initialization; they are not wall-clock budgets. Final refinement of pooled candidates, described in § 2, is performed separately from the search budget.

Every evaluated feasible candidate is offered to the application archive, including proposals rejected by the annealing chain. The archive retains nondominated points in (Rdec,B~)(R_{\mathrm{dec}},\widetilde{B}), with one representative per objective point and a numerical comparison tolerance of 10−1210^{-12}. This search-time archive uses P^4\widehat{P}_4. Across arms, search-time archives collect nondominated evaluated candidates. Pooling these archives, deduplicating codes, and applying interval-dominance filtering yields the menus used for selection.

Cells, seeds, and the frozen design

The main experiment comprises eight cells, n∈{14,20,30,40}n \in\{14,20,30,40\} and k∈{2,4}k \in\{2,4\}, with rX=rZ=(n−k)/2r_X=r_Z=(n-k)/2 and p=0.01p=0.01. Each of the five arms is run with the same 30 seeds,

seedi=1009+37i,i=0,…,29.(33)\mathrm{seed}_i = 1009 + 37i,\qquad i=0,\ldots,29. \tag*{(33)}

The resulting design contains 8×5×30=12008 \times5 \times30 = 1200 runs. The per-run query budgets are given in Table 1. Settings were fixed after a 108-run tuning phase. Two tuning seeds (1009 and 1046) also occur in the main runs, so this comparison is not wholly held out (Appendix B). The main experiment includes all 1200 planned cell–arm–seed runs, with matching seed sets across arms and final checkpoints at the prescribed budgets. All completed valid runs are included. Runs that find no feasible code contribute zero application hypervolume.

Physical qubits nnLogical qubits kkQuery budget per run
142, 45,000
202, 420,000
302, 420,000
402, 440,000

Table 1. Per-run query budgets for the main experiment.

A common application hypervolume

For a run at query count tt, let At\mathcal{A}_t denote its feasible application archive. Its hypervolume [23] is

HV⁡(At)=area⁡[⋃C∈At[Rdec(C),1.01]×[B~(C),1.01]].(34)\operatorname{HV}(\mathcal{A}_t)=\operatorname{area}\left[\bigcup_{C\in\mathcal{A}_t}[R_{\mathrm{dec}}(C),1.01]\times[\widetilde{B}(C),1.01]\right]. \tag*{(34)}

where points outside the reference rectangle contribute nothing and the empty archive has hypervolume zero. Larger HV indicates a larger area dominated by the candidate set in these two minimization coordinates. The reference point is fixed at (1.01,1.01)(1.01,1.01) for every arm.

All arms are scored in (Rdec,B~)(R_{\mathrm{dec}},\widetilde{B}), including arms driven by distance or multiplicity. Evaluating each arm in its own search coordinates would compare different objectives. This common metric tests candidate quality for the decoder-based design task. Its numerical value depends on the normalization and reference point, so performance comparisons are made within each (n,k)(n,k) cell at fixed pp.

The primary outcome is final per-run HV. Feasibility and mean HV at 25%, 50%, 75%, and 100% of the query budget describe search progress; the means include all 30 seeds and retain zero-valued failures. Appendix B.2 specifies how these checkpoints are extracted.

Paired inference and multiplicity correction

For each cell and comparator aa, we form 30 paired differences

Δi=HVdec,i−HVa,i.(35)\Delta_i=\mathrm{HV}_{\mathrm{dec},i}-\mathrm{HV}_{a,i}. \tag*{(35)}

The unit of replication is the seeded search run, not an archived code or a trajectory checkpoint. We report the mean difference and the number of positive and negative pairs, using a 10−1210^{-12} tolerance for the latter. Statistical comparisons use a two-sided sign-flip test of ∣Δ‾∣|\overline{\Delta}|, with 100,000 independent random sign vectors. With Tr=T_r= ∣30−1∑iϵriΔi∣|30^{-1}\sum_i \epsilon_{ri}\Delta_i| and equiprobable signs ϵri∈{−1,1}\epsilon_{ri}\in\{-1,1\}, the Monte Carlo pp value is

praw=1+#{r:Tr≥∣Δ‾∣−10−15}100001.(36)p_{\mathrm{raw}}=\frac{1+\#\{r:T_r\geq|\overline{\Delta}|-10^{-15}\}}{100001}. \tag*{(36)}

The sign-flip test assumes sign exchangeability of paired differences under the null and concerns the seeded search comparison, not a sample of all CSS codes.

We apply a joint Holm correction across all 32 tests [24]. This is at least as stringent as the separate corrections specified for two 16-test families; the main-comparison significance classifications at the 0.05 level are unchanged under that original plan (Appendix B). A nonsignificant result means that the test did not detect a difference; it establishes neither equivalence nor noninferiority.

Secondary analyses

Five sensitivity campaigns vary the query budget at n=40n=40, the penalty weight, or the physical error probability; their results are reported separately in Appendix C. Candidate pooling for decision examples is also separate from the per-run HV comparison: pooled menus describe available choices, while per-run HV measures search performance.

Exploratory search-time threshold-cost screening uses P^4≤τ\widehat{P}_4\leq\tau; thresholds for (14,4)(14,4) and (20,4)(20,4) were chosen post hoc. Certified selection in § 2.3 B requires U(C)≤τU(C)\leq\tau.

Results

We first examine the reliability–check-weight choices produced by the search and apply the upper-bound decision rule of § 2. We then compare the search signals using the paired, per-run hypervolume metric of Sec. IV. These analyses address different questions: pooling candidates identifies available design choices, whereas paired runs measure how effectively each signal explores the design space.

Reliability–check-weight trade-offs

Together, the eight main menus contain 477 retained candidates; we call this aggregate the main pool used for the measurement-noise analysis. These candidates have full-enumeration failure estimates for n≤20n\leq20 and weight-6 intervals for n=30,40n=30,40, after the refinement and interval-dominance filtering described in § 2. Table II summarizes their counts and check-weight ranges.

(n,k)(n,k)Retained candidatesRange of B∗B_\ast
(14,2)(14,2)1338–56
(14,4)(14,4)446–50
(20,2)(20,2)3656–100
(20,4)(20,4)4056–101
(30,2)(30,2)6184–190
(30,4)(30,4)7687–189
(40,2)(40,2)117116–293
(40,4)(40,4)130114–302

Table II. Candidate menus from the main experiment at p=0.01p=0.01. Counts refer to candidates retained by interval-dominance filtering. The two n=40n=40 union menus, discussed below, are not included in this table.

Figure 3(a,Figure 3b) displays the main-menu trade-offs for (20,2)(20,2) and (40,2)(40,2). At (n,k)=(40,2)(n,k)=(40,2), the lowest-cost main-menu candidate has B∗=116B_\ast=116 and failure interval approximately [6.48614,6.48642]×10−3[6.48614,6.48642]\times10^{-3}. The candidate with the smallest failure lower bound has B∗=293B_\ast=293 and interval [9.51738,9.54530]×10−5[9.51738,9.54530]\times10^{-5}. Thus the menu offers substantially different reliability levels at different check weights while keeping the encoding resources fixed. Symbols mark interval midpoints; vertical bars span the stored bounds and can be shorter than the markers.

Figure 3. Reliability–check-weight menus and threshold selection at p=0.01p = 0.01 per sector (independent X/ZX/Z noise, perfect syndrome extraction, sector-wise DML). (a) All 36 entries of the (20,2)(20, 2) main menu, by full enumeration. (b) All 117 entries of the (40,2)(40, 2) main menu, with W=6W = 6 bounds; dashed line, τ=10−3\tau= 10^{-3}; outlined point, selected weight 139. (c) The (40,2)(40, 2) threshold region: filled circles, main menu; open squares, union menu after an additional 80,000-query campaign, selecting weight 135. Symbols mark interval midpoints and bars span [L,U][L, U]; panels (a,b) use log failure axes and (c) a restricted linear axis. Check weight is the minimum total data-qubit participation over independent pure-type check bases.

The extent of the observed trade-off varies across cells. At (14,4)(14,4), only four candidates remain, with B∗=46B_\ast=46–50 and full-enumeration failure values spanning approximately 1.2212×10−21.2212\times10^{-2} to 1.2645×10−21.2645\times10^{-2}. This narrow menu contrasts with the broader range at (40,2)(40,2). Minimum observed costs also vary across cells: the main pool includes B∗=38B_\ast=38 at (14,2)(14,2) and B∗=56B_\ast=56 in both n=20n=20 cells.

Selecting codes with a failure requirement

To illustrate code selection, we apply the rule U(C)≤τU(C)\leq\tau to the stored (40,2)(40,2) menus. Table III reports the minimum check weight among candidates passing this test, with smaller UU breaking cost ties. The thresholds 10−310^{-3}, 5×10−45\times10^{-4}, and 10−410^{-4} provide descriptive examples of increasingly stringent requirements.

Figure 3(c) resolves the (40,2)(40,2) threshold region. The main-menu code selected at τ=10−3\tau=10^{-3} has B∗=139B_\ast=139 and U∼9.62468×10−4U\sim9.62468\times10^{-4}. Every cheaper entry in the full main menu has a lower bound above the threshold; the smallest such lower bound is approximately 1.07067×10−31.07067\times10^{-3}. The interval data therefore establish both threshold attainment for the selected candidate and exclusion of cheaper entries in this menu, within the certification scope of § 2. Open squares separately show the union menu, whose threshold selection reduces the required check weight from 139 to 135. This improvement reflects an enlarged candidate pool, not a paired estimate of the performance gain of one search arm.

In all six examples, the selected upper bound is below the requirement and every cheaper entry in the corresponding menu has a lower bound above it. These interval comparisons establish minimum cost among truly threshold-feasible entries of that menu.

Failure requirement τ\tauMenuSelected B∗B_*Stored [L,U][L,U], displayed approximately
10−310^{-3}Main139[9.621890,9.624680]×10−4[9.621890, 9.624680] \times10^{-4}
10−310^{-3}Union135[9.590809,9.593600]×10−4[9.590809, 9.593600] \times10^{-4}
5×10−45 \times10^{-4}Main172[4.971169,4.973960]×10−4[4.971169, 4.973960] \times10^{-4}
5×10−45 \times10^{-4}Union170[4.944313,4.947104]×10−4[4.944313, 4.947104] \times10^{-4}
10−410^{-4}Main286[9.948635,9.976552]×10−5[9.948635, 9.976552] \times10^{-5}
10−410^{-4}Union281[9.860755,9.888672]×10−5[9.860755, 9.888672] \times10^{-5}

Table 3. Upper-bound threshold selections for (n,k)=(40,2)(n, k) = (40, 2) at p=0.01p = 0.01. The main menu uses the 40,000-query experiment; the union menu combines retained candidates from that experiment and the separate 80,000-query campaign. All decisions use unrounded stored endpoints; displayed intervals are rounded for readability.

Effect of the reliability signal

Figure 4(a) shows that decoder-aware guidance produces significantly higher mean final application HV than distance guidance in all eight main cells (Holm-adjusted p<10−3p < 10^{-3}). Seven cells have mean paired gains between 0.00463 and 0.04793; the (14, 4) gain is 0.15607. In that cell, decoder-aware search reaches feasibility in 30 of 30 runs, versus 13 of 30 for distance. Because runs without a feasible code score zero, this contrast reflects access to feasible designs as well as the quality of menus found.

Figure 4. Paired effects of the reliability signal in a common search kernel (p=0.01p = 0.01 per independent X/ZX/Z sector). Points show final application-HV differences between decoder-aware search and (a) distance or (b) distance–multiplicity for the same seed and cell; diamonds mark means of 30 pairs, and jitter separates points. Query budgets are in Table I. HV uses common W=4W = 4 truncated coordinates and the reference point of Sec. IV; it measures search performance. Axes differ between panels. Displayed p values use the joint 32-test Holm correction; ns denotes pHolm≥0.05p_{\mathrm{Holm}} \ge0.05. Runs without a feasible candidate score zero.

Five cells show a positive difference detected at the 0.05 level; the remaining three do not. At (40, 4), the decoder-aware and (d,m)(d, m) mean HV values are 0.8008 and 0.8019, respectively. The negative difference is nonsignificant, and the advantage is not uniform across cells. The three nonsignificant comparisons provide no evidence of equivalence.

The pooled candidates also show that the two signals can contribute different options. In the main (40, 2) menu, 71 retained candidates are attributed to the decoder-aware arm and 46 to the (d,m)(d, m) arm. At (40, 4), the corresponding counts are 51 and 69, with the remaining ten attributed to other arms. These counts identify which search arm contributed each retained candidate.

The two local single-objective baselines have lower mean HV than the decoder-aware arm in all 16 main comparisons, with adjusted p<10−3p < 10^{-3}. Their mean paired deficits range from approximately 0.00606 to 0.08781. These 16 comparisons evaluate the local single-objective workflows defined in Sec. IV.

(n,k)(n, k)Mean Δ\DeltaHVPositive/negative pairsAdjusted p
(14,2)+0.00592929/10.000320
(14,4)+0.00580729/10.000320
(20,2)+0.00146519/110.538635
(20,4)+0.00293124/60.003560
(30,2)+0.01204230/00.000320
(30,4)+0.00464830/00.000320
(40,2)+0.00051818/120.538635
(40,4)−0.00111411/190.169828

Table IV. Paired final-HV differences, decoder-aware minus the (d,m)(d, m) signal, for the main experiment. Each row contains 30 seed pairs. Adjusted p values use the actual joint Holm correction across 32 main-experiment comparisons, as documented in Sec. IV. Displayed values are rounded. The repeated 0.000320 entries are the minimum Holm-adjusted value at the 100,000-vector Monte Carlo resolution: 32/100001, rounded.

Search-budget dependence and the union menus

The trajectory data do not support a fixed ordering of the three signals throughout the search. At (40,2)(40, 2), the (d,m)(d, m) mean HV exceeds the decoder-aware mean at the 25%, 50%, and 75% checkpoints, before the small positive decoder-aware difference at the final budget. In the separate 80,000-query campaign, the decoder-aware minus (d,m)(d, m) mean difference is positive and detected by the raw sign-flip test at (40,2)(40, 2), but remains negative and nonsignificant at (40,4)(40, 4). These comparisons are within each campaign; changes in the between-arm effect across budgets were not tested. Appendix C.1 gives the full numerical results.

Longer searches affect both the comparison between signals and the menus available for selection. Paired per-run HV measures search performance; pooling and filtering measure the menu available for selection. Merging the main and longer-campaign retained sets, deduplicating their code representations, and applying the interval-dominance test gives union menus of 111 and 137 candidates for (40,2)(40, 2) and (40,4)(40, 4), respectively, compared with 117 and 130 in the main menus. New candidates can dominate several older entries, so an improved menu can contain fewer retained candidates. The main eight-cell menu contains 477 candidates; replacing its two n=40n = 40 menus with the union menus gives 478. Union menus are used only where explicitly identified. The measurement-noise analysis in the following section uses the original 477 candidates.

Penalty and physical-error sensitivity

The penalty and physical-error analyses cover only (20,2)(20, 2) and (30,2)(30, 2), with three signals and 30 paired seeds per cell. Their pp values are unadjusted and are separate from the main 32-test Holm family. Changing λ\lambda from 1 to 0.3 or 3 leaves final HV for every paired seed unchanged for the decoder-aware and (d,m)(d,m) arms in these cells. This limited insensitivity is specific to the two tested cells and does not imply equivalence to a hard constraint. Appendix C 2 reports the complete results, including the distance arm.

At p=0.001p = 0.001, the decoder-aware signal has positive mean differences from (d,m)(d,m) in both tested cells. At p=0.03p = 0.03, the difference is slightly negative and nonsignificant at (20,2)(20, 2), but remains positive at (30,2)(30, 2). Its mean HV is higher than that of distance in all ten cell–variant comparisons, with raw p<10−3p < 10^{-3}. Comparisons remain within each physical-error setting because both the objective and its HV normalization depend on pp.

These comparisons show how search performance depends on the signal, budget, and data-error setting. The next section changes a different assumption—perfect syndrome measurements—and examines the resulting choices within the fixed main pool.

Extension to noisy syndrome measurements

The reliability–weight menus of § 2.3 assume perfect syndrome measurements. We now re-evaluate the 477 codes in the main menus to ask how independent measurement errors change their ordering and the allocation of a check-weight budget. This extension keeps the code pool fixed and adds a choice of redundant checks, so it tests design decisions within the available menus. Repeated syndrome extraction provides a standard route to handling measurement faults in topological memories [25]. Here we instead study redundant checks within a strict single-round model, following the data-syndrome perspective [16].

Model, measured checks, and evaluation bounds

For each error sector α∈{X,Z}\alpha\in\{X,Z\}, the decoder observes

s′=Me+f(mod2),(37)s' = Me + f \pmod2, \tag*{(37)}

where ee and ff are column vectors, consistent with Sec. II. The measured matrix MM contains checks of the opposite Pauli type to the error sector: ZZ-type checks for XX errors and XX-type checks for ZZ errors. The data-error bits in ee are independent Bernoulli variables with probability p=0.01p = 0.01, and the measurement-error bits in ff are independent Bernoulli variables with probability q∈{0.01,0.005}q \in\{0.01, 0.005\}. Data and measurement errors, as well as the two sectors, are independent. The decoder infers the class of the data error modulo the corresponding stabilizer space, including its true basis syndrome and logical class. Recovery fails whenever the residual data error is not a stabilizer; residual syndrome errors therefore count as failures.

For each check space, the measured rows consist of a minimum-weight basis followed by the tt lightest unused nonzero elements of that space. Ties are broken by integer row label (Appendix D 1). The same tt is used in both sectors, whose ranks in this data set are r=(n−k)/2r = (n-k)/2. We evaluate the distinct values in

T={0,1,2,4,8,r}.\mathcal{T} = \{0,1,2,4,8,r\}.
Bmeas(C,t)=∑a∈MX(C,t)wt⁡(a)+∑a∈MZ(C,t)wt⁡(a).(38)B_{\mathrm{meas}}(C,t) = \sum_{a \in M_X(C,t)} \operatorname{wt}(a) + \sum_{a \in M_Z(C,t)} \operatorname{wt}(a). \tag*{(38)}

Here CC denotes a code, and Bmeas(C,0)=B∗(C)B_{\mathrm{meas}}(C,0) = B_*(C). The maximum tested redundancy is tmax⁡=max⁡(8,r)t_{\max} = \max(8,r): it equals 8 for the two 14-qubit cells and rr for the larger cells. Even at this maximum, the measured set contains only r+tmax⁡r+t_{\max} rows per sector, not every nonzero stabilizer. The measured weight is a resource proxy; measurement-error probability is independent of row weight in this model.

The evaluation enumerates fault patterns with total weight ∣e∣+∣f∣≤6|e| + |f| \le6. For error sector α\alpha with mαm_\alpha measured rows (mX=mZ=r+tm_X = m_Z = r+t here), define the omitted probability by

Tα,W:=TW(n,mα;p,q)=1−∑0≤a≤na+b≤W(na)pa(1−p)n−a×(mαb)qb(1−q)mα−b,W=6.(39)\begin{aligned} T_{\alpha,W} := T_W(n,m_\alpha;p,q) \\ &= 1 - \sum_{\substack{0 \le a \le n\\ a+b \le W}} \binom{n}{a}p^a(1-p)^{n-a} \times \binom{m_\alpha}{b}q^b(1-q)^{m_\alpha-b}, \qquad W = 6. \tag*{(39)} \end{aligned}

For p=qp=q, this reduces to the binomial tail on n+mαn+m_{\alpha} bits; otherwise it is the tail of the sum of two binomial variables. Applying the truncated class-mass argument of § 2 gives sector bounds Lα,Wds≤Pαds≤Uα,Wds=min⁡(1,Lα,Wds+Tα,W)L_{\alpha,W}^{\mathrm{ds}}\leq P_{\alpha}^{\mathrm{ds}}\leq U_{\alpha,W}^{\mathrm{ds}}=\min(1,L_{\alpha,W}^{\mathrm{ds}}+T_{\alpha,W}). Here Lα,WdsL_{\alpha,W}^{\mathrm{ds}} is the unnormalized truncated failure mass in that sector. Independence then gives the block bounds

Lds=1−(1−LX,Wds)(1−LZ,Wds),L_{\mathrm{ds}}=1-(1-L_{X,W}^{\mathrm{ds}})(1-L_{Z,W}^{\mathrm{ds}}),
Uds=1−(1−UX,Wds)(1−UZ,Wds).(40)U_{\mathrm{ds}}=1-(1-U_{X,W}^{\mathrm{ds}})(1-U_{Z,W}^{\mathrm{ds}}). \tag*{(40)}

We denote the stored truncated block value by P^ds=Lds\widehat{P}_{\mathrm{ds}}=L_{\mathrm{ds}}. This is an unnormalized lower endpoint, not an unbiased statistical estimate or the full-distribution failure probability of an explicitly simulated decoder. The class-mass argument bounds full-distribution degenerate-ML failure. Stored endpoints retain the numerical qualification of § 2 C.

The evaluation comprises 5,644 noisy-syndrome cases for the fixed main pool, both measurement-error settings, and the specified redundancy grids. Separate zero-measurement-noise checks recover the stored code-capacity lower endpoints to numerical precision; Appendix D 1 reports these implementation checks, which are not additional independent code samples.

Code ordering and the effect of redundancy

At q=pq=p, the cell medians of basis-only P^ds\widehat{P}_{\mathrm{ds}} range from 0.1068 to 0.1744. At maximum tested redundancy, cell medians of the within-code ratio of stored P^ds\widehat{P}_{\mathrm{ds}} values to their basis-only values range from 0.145 to 0.361.

Basis-only noisy failure remains strongly rank-correlated with the code-capacity value (Spearman ρ=0.906\rho=0.906–1.000), yet the point-value nondominated sets change. In the six cells with n≥20n\geq20, only 23.8%–60.0% of the code records remain nondominated under the point-value comparison; all four records remain at (14, 4). Appendix D 2 gives the full summaries and rank correlations. Strong rank correlation therefore does not preserve the observed point-value trade-off sets. This motivates comparing code-first selection with joint code-and-redundancy selection under the same measured-weight budget. The results in Sec. VI D test whether selected designs show a strict gain.

Allocating a measured-weight budget

We compare two selection rules at each distinct measured-weight cost present in a cell’s evaluated menu. The code-first rule chooses the code with the smallest stored code-capacity lower endpoint among those with B∗≤bB_{*}\leq b, then chooses the tested redundancy level that minimizes P^ds\widehat{P}_{\mathrm{ds}} within budget bb. The joint rule minimizes P^ds\widehat{P}_{\mathrm{ds}} over all evaluated (C,t)(C,t) with Bmeas(C,t)≤bB_{\mathrm{meas}}(C,t)\leq b. Both rules therefore use the same finite menu, but optimize different decisions.

Ties are defined by exact equality of stored endpoints, without an additional tolerance. The code-first rule resolves equal code-capacity endpoints by the smaller archived code index within the cell. In its redundancy step and in the joint rule, ties between noisy endpoints are resolved by smaller measured-check weight, then smaller code index, then smaller redundancy level tt. Table V and Figure 5 use these tie-breaking rules.

Figure 5. Joint code–redundancy selection under a measured-weight budget for the fixed 477-code main pool (p=0.01p = 0.01 per sector, strict single-round model, no ideal residual-error cleanup). The redundancy grid is {0,1,2,4,8,r}\{0,1,2,4,8,r\}, with tmax⁡=max⁡(8,r)t_{\max} = \max(8,r). (a,b) Code-first and joint selections at q=0.01q = 0.01 for (40,2)(40, 2) and (14,4)(14, 4); solid steps are selected lower endpoints and dotted steps are W=6W = 6 upper endpoints. At (14,4)(14, 4), nine of 19 budgets show no endpoint gain. (c) Median endpoint ratios R^=Lds(ab)/Lds(jb)\widehat{R} = L_{\mathrm{ds}}(a_b)/L_{\mathrm{ds}}(j_b) for q=0.01q = 0.01 and 0.0050.005; right-hand counts give budgets with Uds(jb)<Lds(ab)U_{\mathrm{ds}}(j_b) < L_{\mathrm{ds}}(a_b). Ratios are not certified true gain factors; interval separation supports the direction for selected designs under the stated numerical scope.

(n,k)(n,k)Distinct budgetsMedian R^\widehat{R}, q=0.01q = 0.01Median R^\widehat{R}, q=0.005q = 0.005Strict interval-separated comparisons, q=0.01q = 0.01
(14,2)(14,2)482.00821.737144/48
(14,4)(14,4)191.02481.006310/19
(20,2)(20,2)1071.60921.6132103/107
(20,4)(20,4)1101.38851.2682103/110
(30,2)(30,2)1821.58011.6363175/182
(30,4)(30,4)2161.58951.6261214/216
(40,2)(40,2)3121.64421.7047306/312
(40,4)(40,4)3421.62171.7062333/342

Table V. Budget-allocation comparisons. The ratio columns summarize truncated endpoint ratios. The final column separately counts budgets at q=0.01q = 0.01 for which Uds(jb)<Lds(ab)U_{\mathrm{ds}}(j_b) < L_{\mathrm{ds}}(a_b), certifying a strict comparison of the two selected designs subject to the stored-endpoint numerical qualification in Sec. VI A.

For the selected designs aba_b and jbj_b, respectively, define

R^(b)=Lds(ab)Lds(jb).(41)\widehat{R}(b)=\frac{L_{\mathrm{ds}}(a_b)}{L_{\mathrm{ds}}(j_b)}. \tag*{(41)}

The joint rule has R^(b)≥1\widehat{R}(b)\geq1 by construction because its feasible set contains the code-first choice. The empirical question is the size and frequency of the gap. Table V reports medians with equal weight on each distinct observed cost, rather than on every integer budget or on independent experimental repetitions.

Figure 5(a) illustrates the budget-dependent choices at (40, 2), while panel (b) shows the weak-gain case (14, 4). Solid steps show the selected lower endpoints and dotted steps their upper endpoints; the steps represent choices from the evaluated discrete menu. Code-first selection can switch to a different code as the budget increases, so its noisy endpoint need not decrease monotonically.

Panel (c) separates the median endpoint ratios from the interval-separated comparison counts in Table V. At q=pq=p, median endpoint ratios lie between 1.3885 and 1.6442 for n≥20n\geq20. The 14-qubit cells differ: the median is 2.0082 at (14, 2), but only 1.0248 at (14, 4), where the two rules return equal truncated values at nine of 19 budgets. At q=p/2q=p/2, the latter median falls to 1.0063. Benefits therefore depend on the menu and noise setting. The largest endpoint ratio, 49.34 at q=pq=p in (40, 4), occurs at one budget on the tested redundancy grid; the cell medians above summarize the budget-wise pattern.

What the intervals establish

The reported endpoint ratios describe stored endpoints; the interval bounds below quantify the corresponding true-failure ratios. For each pair of selected designs, positive endpoints instead give

Lds(ab)Uds(jb)≤Pds(ab)Pds(jb)≤Uds(ab)Lds(jb).(42)\frac{L_{\mathrm{ds}}(a_b)}{U_{\mathrm{ds}}(j_b)} \leq \frac{P_{\mathrm{ds}}(a_b)}{P_{\mathrm{ds}}(j_b)} \leq \frac{U_{\mathrm{ds}}(a_b)}{L_{\mathrm{ds}}(j_b)}. \tag*{(42)}

The comparisons in Table V and Figure 5(c) use the stored bounds and the tie rules in Sec. VI C. At both q=pq=p and q=p/2q=p/2, every budget with a strictly smaller joint-rule lower endpoint also satisfies Uds(jb)<Lds(ab)U_{\mathrm{ds}}(j_b)<L_{\mathrm{ds}}(a_b). Each setting has two budgets with tied joint minima; using the largest upper endpoint across all tied designs leaves these counts unchanged. Subject to the numerical qualification in Sec. VI A, the intervals therefore establish the direction of these selected-design comparisons. Equation (42) bounds the corresponding true gain; the optimality of either selected design over the full menu remains unresolved.

The largest relative interval width (Uds−Lds)/Lds(U_{\mathrm{ds}} - L_{\mathrm{ds}})/L_{\mathrm{ds}} among the noisy evaluations is approximately 3.32% at q=pq = p, and 1.19% at q=p/2q = p/2. These widths are deterministic truncation bounds, not confidence intervals. They also show why code-capacity interval precision cannot be assumed to carry over unchanged to the enlarged fault space.

The extension identifies a concrete additional design variable: how a fixed measured-weight budget is divided between the code’s basis and redundant checks. Its conclusions apply to this fixed pool, the tested low-weight check sets, independent errors, and the strict single-round DML criterion.

Discussion

Design choices and what certification adds

We formulate CSS code design to connect a specified decoding task to a resource-constrained choice. At fixed encoding resources, the pair (PD,B∗)(P_D, B_*) separates sector-wise degenerate maximum-likelihood failure from the minimum weight of an independent pure-type check basis. Keeping these objectives separate allows a candidate menu to serve different reliability requirements or check-weight budgets. Changing a requirement selects a different available design without redefining the objectives; the scalarizations used to search for candidates are a separate computational choice.

Basis minimization prevents generator changes alone from appearing as cost improvements. The component constraint excludes stabilizer-state factors while allowing direct sums that encode information. The experiments did not isolate either choice’s contribution to search performance.

Decoder awareness enters through the reliability objective, which ranks codes by syndrome-class probabilities across all syndromes; distance remains a feasibility requirement. Distance–multiplicity instead summarizes minimum-weight logical operators. The signals can rank codes differently; their relative value for finite search is empirical. Our methodological contribution connects design objectives, bounded evaluation, and selection; candidate generation uses an existing annealing framework.

Under valid bounds, an upper endpoint below the requirement certifies feasibility. A minimum-cost claim additionally requires excluding every cheaper menu candidate. The (40,2)(40, 2) example meets both conditions (§ 2.3 B), establishing minimum cost within that menu.

Interval refinement resolves uncertain comparisons among known candidates; pool expansion can reveal better choices, as the union menu illustrates (§ 2.3). Search-time hypervolume compares outcomes in truncated reliability coordinates, while refined bounds support candidate selection.

Where the reliability signal helps

The common-kernel comparison supports decoder-aware guidance for the tested design task, but its benefit depends on the comparator and cell. The distance comparison is consistently positive; the distance–multiplicity comparison includes nonsignificant and negative differences. This variation helps identify where a decoder-defined reliability signal is uninformative for finite search.

The results are not uniform. At (40,4)(40,4), the mean difference from distance–multiplicity is negative and remains negative in the doubled-budget campaign. At (14,4)(14,4), the comparison with distance partly reflects feasibility: 30 of 30 decoder-aware runs and 13 of 30 distance runs reach a feasible design. Application hypervolume measures both access to feasible designs and the quality of the resulting menus. At p=0.03p = 0.03, the (20,2)(20,2) difference from distance–multiplicity is slightly negative and nonsignificant; the penalty scan covers only two cells (§ 2.3 D–V E and Appendix C).

The three primary arms share a search kernel, evaluator, paired seeds, and query budgets, enabling a controlled comparison of their guidance signals. Normalization affects annealing energies and trajectories; lower-cost proxies may remain useful in other search regimes. The single-objective baselines also change initialization and penalty treatment and consequently support a workflow-level comparison. Statistical inference concerns seeded runs under the sign-flip assumptions of Sec. IV E. The joint Holm correction, exploratory sensitivity tests, and tuning-seed overlap are specified in Sec. IV and Appendix B.

Limitations and next evaluations

Measurement noise changes what must be selected: a code and a measured check set jointly determine the available reliability–cost choices. Within this fixed main pool, the joint rule searches a superset of the code-first options, so its weak advantage in the truncated objective follows by construction. The empirical results quantify the gap, identify where it vanishes, and test whether intervals separate the selected designs. The weak-gain (14,4)(14,4) case in Figure 5, with equal endpoints at nine of 19 budgets for q=pq = p, shows that the benefit depends on the menu and noise setting. The ranking changes reported in Sec. VI B likewise show that code-capacity ordering need not persist.

The main limits of the design conclusions are:

  • Noise and decoding: independent data and measurement errors, perfect extraction or strict single-round noisy extraction (residual syndrome errors count as failures, without additional ideal recovery), and sector-wise DML; no repeated extraction, correlated faults, or circuit-level fault propagation. Single-shot fault-tolerance guarantees require further structural and noise-control properties [26].

  • Cost model: B∗B_* and BmeasB_{\mathrm{meas}} count data-qubit participations but omit routing, ancillas, and scheduling. Flag-based extraction illustrates how circuit choices affect ancilla use and propagated faults [22].

  • Pool and decoder: noisy-syndrome choices are restricted to the fixed perfect-syndrome pool and tested redundancy grid. Decoder optimization and transfer of these rankings to other decoders require separate evaluation; belief propagation with ordered-statistics post-processing is one relevant comparison [27].

  • Statistical scope: search inferences concern seeded runs under the stated sign-flip assumption, joint Holm correction, and tuning-seed overlap, not a sample of all CSS codes.

Applying the rankings to a device requires evaluating its extraction procedure, cost model, and decoder. Computational cost also constrains the tested approach. Complexity barriers for optimal decoding with degeneracy are known for general stabilizer codes [20], without by themselves classifying the restricted CSS family studied here. Truncation reduces error-pattern enumeration to ∑w=0W(nw)\sum_{w=0}^{W} \binom{n}{w}, but the implemented minimum-basis calculation remains exponential in stabilizer rank, and other evaluation steps add cost. The experiments evaluate codes with up to 40 physical qubits. Measuring end-to-end costs would clarify practical efficiency. Tighter numerical enclosures and broader searches address the two distinct decision limits identified above: uncertainty about known candidates and the possibility of missing better ones.

Conclusion

We have formulated CSS code design at fixed encoding resources as a decoder-aware multiobjective problem, separating sector-wise DML failure from basis-invariant check weight. The resulting candidate menus support choices under a reliability requirement or a check-weight budget. Truncation bounds make these decisions explicit: an upper bound can establish threshold attainment, and lower bounds can exclude cheaper alternatives. The minimum-cost examples establish minimum cost within their evaluated menus. The search experiments support decoder-based guidance within the tested common kernel at equal query budgets, with mixed results against distance–multiplicity. Under the reported joint Holm correction on common truncated reliability coordinates, mean final application hypervolume improves significantly over distance in all eight main cells and over distance–multiplicity in five; three comparisons with the latter are nonsignificant, including a negative mean difference at (40, 4). Re-evaluation of the retained codes under strict single-round measurement noise identifies redundancy allocation as an additional design choice: joint selection yields endpoint gains and interval-separated selected-design comparisons at many budgets, while others show no endpoint gain. For a designer using the stated DML and noise model, the procedure is to evaluate a finite pool with failure bounds and choose the lightest code whose upper bound meets the reliability requirement, checking the lower bounds of cheaper candidates for a within-menu minimum-cost claim.

Basis-invariant coordinate components

This appendix proves the decomposition statement used in Sec. II C. All spaces are binary coordinate spaces on the fixed physical-qubit set E={1,…,n}E=\{1,\ldots,n\}. For B⊆EB\subseteq E, let πB\pi_B retain the coordinates in BB and set the others to zero; F2B\mathbb{F}_2^B denotes its image. For partitions P\mathcal{P} and Q\mathcal{Q}, write P⪯Q\mathcal{P}\preceq\mathcal{Q} when every block of P\mathcal{P} is contained in a block of Q\mathcal{Q}. Their join P∨Q\mathcal{P}\vee\mathcal{Q} is the finest common coarsening: its blocks are the equivalence classes generated by membership in a common block of either partition.

A single stabilizer subspace

Let S⊆F2nS\subseteq\mathbb{F}_2^n have dimension rr, and let RR be a reduced row-echelon basis matrix, with row vectors v1,…,vrv_1,\ldots,v_r and pivot coordinates p1,…,prp_1,\ldots,p_r. Form an undirected graph G(S)G(S) with all nn coordinates as vertices. For each non-pivot coordinate jj with Rij=1R_{ij}=1, add the edge {pi,j}\{p_i,j\}. Isolated vertices are retained. Denote its connected-component partition by PS\mathcal{P}_S.

Lemma A1 (coordinate decomposition). For any partition Q\mathcal{Q} of EE,

S=⨁B∈Q(S∩F2B)⟺PS⪯Q.S=\bigoplus_{B\in\mathcal{Q}}\left(S\cap\mathbb{F}_2^B\right) \quad\Longleftrightarrow\quad \mathcal{P}_S\preceq\mathcal{Q}.
{#eq:A1}

Consequently, PS\mathcal{P}_S is the unique finest coordinate decomposition of SS.

Proof. A coordinate decomposition over Q\mathcal{Q} is equivalent to πB(S)⊆S\pi_B(S)\subseteq S for every block BB: decomposition makes each projection a summand, and conversely the projections sum to each vector with disjoint supports. Suppose first that SS decomposes over Q\mathcal{Q}, and fix a row viv_i. Let BiB_i be the block containing its pivot pip_i. Then πBivi∈S\pi_{B_i}v_i\in S. The pivot coordinates of viv_i are 1 at pip_i and 0 at every other pivot, and this remains true after projection onto BiB_i. For any v∈Sv\in S, its pivot coordinates uniquely determine its expansion in the basis rows:

v=∑h=1rvphvh.(43)v=\sum_{h=1}^{r}v_{p_h}v_h. \tag*{(43)}

Thus πBivi=vi\pi_{B_i}v_i=v_i, so the entire support of viv_i lies in BiB_i. Every edge of G(S)G(S) therefore lies inside a block of Q\mathcal{Q}, which implies PS⪯Q\mathcal{P}_S\preceq\mathcal{Q}.

Conversely, each row viv_i is supported inside the graph component containing pip_i: its nonpivot support is joined directly to that pivot. If PS⪯Q\mathcal{P}_S\preceq\mathcal{Q}, each basis row lies within a block of Q\mathcal{Q}. Grouping the basis rows by those blocks gives subspaces with disjoint coordinate supports whose direct sum is SS. These subspaces equal S∩F2BS \cap\mathbb{F}_2^B, proving the decomposition. The two implications also show that the decomposition is unique and that PS\mathcal{P}_S is the finest such partition. □

The partition agrees with the connected-component partition of the column matroid represented by RR. To see this directly, a nonzero nonpivot column jj has fundamental circuit

{j}∪{pi:Rij=1}.(44)\{j\} \cup\{p_i : R_{ij}=1\}. \tag*{(44)}

The pivot columns are independent unit vectors, so this dependency is minimal. Every graph edge consequently connects two elements of a circuit. Conversely, after rows and columns are grouped by graph component, RR is block diagonal apart from zero columns. A circuit cannot cross two such blocks, since a dependency crossing independent row blocks splits into smaller dependencies. Thus circuit connectivity and graph connectivity coincide. A zero column is a loop and remains a singleton; a pivot with no incident edge is a coloop and also remains a singleton. When r=0r=0, all columns are loops and the graph has nn singleton components. This is the fundamental-circuit description of matroid components [21].

The two CSS stabilizer subspaces

Proposition A2 (CSS components). Let C=(SX,SZ)C=(S_X,S_Z) satisfy the CSS commutation condition SX⊥SZS_X \perp S_Z. Its unique finest coordinate-decomposing partition is

PC=PSX∨PSZ.(45)\mathcal{P}_C=\mathcal{P}_{S_X}\vee\mathcal{P}_{S_Z}. \tag*{(45)}

Equivalently, it is the connected-component partition of the union of the two graphs constructed above. It depends only on SXS_X and SZS_Z, not on the generator matrices chosen to represent them.

Proof. By Lemma A1, a partition Q\mathcal{Q} decomposes both subspaces if and only if

PSX⪯Q,PSZ⪯Q.(46)\mathcal{P}_{S_X}\preceq\mathcal{Q},\qquad\mathcal{P}_{S_Z}\preceq\mathcal{Q}. \tag*{(46)}

These conditions are equivalent to PC⪯Q\mathcal{P}_C\preceq\mathcal{Q} by the definition of the join. The join itself therefore decomposes both spaces and is finer than every common decomposing partition. Connectivity in the union graph takes exactly the transitive closure that defines this join. Finally, each single-space partition is characterized by its coordinate-decomposition property, which depends only on the subspace. Invertible changes of generators preserve both subspaces and hence preserve their join. □

For each block c∈PCc\in\mathcal{P}_C, set

nc=∣c∣,rα,c=dim⁡(Sα∩F2c),α∈{X,Z}.(47)n_c=|c|,\qquad r_{\alpha,c}=\dim(S_\alpha\cap\mathbb{F}_2^c),\qquad \alpha\in\{X,Z\}. \tag*{(47)}

The restricted spaces remain orthogonal. Inside F2c\mathbb{F}_2^c this implies rX,c+rZ,c≤ncr_{X,c}+r_{Z,c}\le n_c, and their CSS factor encodes

kc=nc−rX,c−rZ,c≥0.(48)k_c=n_c-r_{X,c}-r_{Z,c}\ge0. \tag*{(48)}

Because both subspaces decompose as direct sums,

∑crα,c=rα,∑ckc=n−rX−rZ=k.(49)\sum_c r_{\alpha,c}=r_\alpha,\qquad \sum_c k_c=n-r_X-r_Z=k. \tag*{(49)}

A block with kc=0k_c=0 is a stabilizer-state factor. Requiring kc≥1k_c\ge1 for every block excludes these factors while allowing direct sums of components that each encode logical information. The decomposition is over the fixed physical coordinates; it is not a search over additional Clifford transformations or over different code-equivalence notions.

Implementation correspondence

The component routine first reduces both generator matrices to reduced row-echelon bases, then joins every nonpivot support coordinate of a row to its pivot. Connected groups give PC\mathcal{P}_C. Each basis row lies in exactly one resulting group, so counting the XX- and ZZ-basis rows in a group gives rX,cr_{X,c} and rZ,cr_{Z,c} without a further rank computation. Zero columns remain in the vertex set even if no row meets them.

Once the reduced bases are available, there are at most rX(n−rX)+rZ(n−rZ)r_X(n-r_X)+r_Z(n-r_Z) candidate pivot–nonpivot edges. The cost of obtaining the reduced bases is separate from this graph construction.

The coordinate decomposition depends on the stabilizer subspaces, whereas Tanner-graph connectivity can change under generator row operations.

Search execution, validation, and analysis details

This appendix gives chain-level search and checkpoint details for Sec. IV, the analysis settings, and the independent validation of Sec. B 4.

All main-experiment runs used qecpareto v0.3.3.

Chain initialization and adaptation

For a given seed, all arms receive the same initial population of 24 random CSS codes at the prescribed ranks. The primary arms start their nine chains from the same evenly spaced indices in this population. Chains are advanced in round-robin order. A proposal with energy change ΔE≤0\Delta E \le0 is accepted; otherwise acceptance follows the Metropolis rule. Each chain starts at temperature 0.03, and its temperature is adapted every 40 proposals using its observed positive energy changes, with a target uphill acceptance decreasing geometrically from 0.25 to 0.01 over the query budget.

Checkpoint extraction

The primary outcome is final per-run HV. We also report feasibility and mean HV at 25%, 50%, 75%, and 100% of the query budget. Checkpoints are recorded every 100 queries and at termination; for a requested budget fraction, we use the largest recorded HV at or before the target query count, with zero if no checkpoint is available. Curves average over all 30 seeds, retaining zero-valued failures.

Evaluation and analysis details

Each evaluator call, including initialization, rejected proposals, repeated codes, and cache hits, consumes one query. The main experiment uses 24 initialization evaluations per run. For an uncached code, the evaluator computes the logical weight spectra, distance and multiplicity, minimum-basis cost, truncated failure at W=4W = 4, and code components. Equal query counts need not give equal distinct-code counts, uncached evaluations, or wall-clock times.

The 108-run tuning phase fixed settings before the main experiment; seeds 1009 and 1046 also occur among main runs, so those runs are not wholly independent of tuning. The sign-flip Monte Carlo calculation uses random seed 20261015. The frozen protocol specified separate Holm corrections for two 16-comparison families; the reported analysis applies one joint 32-test correction. The separate corrections leave all primary significance classifications unchanged at 0.05, although adjusted pp values can differ. Thresholds in the search-time screens for (14, 4) and (20, 4) were chosen post hoc. In the measurement-noise extension, the second-stage tie order was specified during analysis, not prespecified in the original analysis.

Validation details

The independent validation set contains 400 codes at each of n=10,12,14,16,20n = 10, 12, 14, 16, 20, including feasible and infeasible codes, and is distinct from the 477-code main pool.

Across these 2000 codes, full-enumeration DML failure lies within its W=4W = 4 interval at absolute tolerance 10−1410^{-14}. Figure 2(b) displays (UW−LW)/PD(U_W - L_W)/P_D for validation codes; the boxes and whiskers show variation among codes. Final-menu widths instead use (UW−LW)/LW(U_W - L_W)/L_W. The finite validation checks numerical consistency, whereas Proposition 1 establishes the general truncation guarantee.

Figure 2. Numerical validation and resolution of truncated reliability bounds. Independent X/ZX/Z noise has p=0.01p = 0.01 per sector, with perfect syndrome extraction and sector-wise DML decoding; W=4W = 4 in both panels. The validation set contains 400 codes at each of n=10,12,14,16,20n = 10, 12, 14, 16, 20, including feasible and infeasible designs, and is distinct from the 477 retained candidates in the main experiment. (a) Each point locates an archived full-enumeration failure value within its truncation interval: 0 and 1 denote the lower and upper endpoints. Horizontal jitter only separates points. Counts report covered records; no violation is found at absolute tolerance 10−1410^{-14}. (b) Relative interval widths use PDP_D as denominator. Boxes span the 25th to 75th percentiles, center lines mark medians, and whiskers show the full range across codes; these are not confidence intervals. All exact values and interval widths are positive. Proposition 1 establishes the general truncation bound; panel (a) checks its numerical implementation on the validation set.

Search-budget and parameter sensitivity

The five secondary campaigns each contain 180 runs, totaling 900 runs, and are separate from the 1200-run main experiment and the 108 tuning runs. Their pp values are unadjusted and separate from the main 32-test Holm family; the raw Monte Carlo floor is 1/100001, shown as 0.000010. The budget comparisons and parameter scans below retain their respective cells and query budgets.

Search-budget dependence and pooled menus

Table VI includes the doubled-budget comparisons. The trajectory data do not support a fixed ordering of the three signals at every checkpoint. For example, at (14, 2) the final mean HV of the (d,m)(d,m) arm is 0.3655, below the distance arm’s 0.3668, although the decoder-aware arm reaches 0.3715. At (40, 2) the (d,m)(d,m) mean is higher than the decoder-aware mean at the 25%, 50%, and 75% checkpoints before the small positive decoder-aware difference at the final budget. These changes motivate examining how the comparison depends on budget, rather than assuming that the final ordering holds throughout the run.

Variant(n,k)(n,k)Mean Δ\DeltaHVPositive/negative pairsRaw pp
80,000 queries(40,2)(40,2)+0.00225328/20.000010
80,000 queries(40,4)(40,4)−0.00092710/200.081019
λ=0.3\lambda= 0.3(20,2)(20,2)+0.00146519/110.523305
λ=0.3\lambda= 0.3(30,2)(30,2)+0.01204230/00.000010
λ=3\lambda= 3(20,2)(20,2)+0.00146519/110.523305
λ=3\lambda= 3(30,2)(30,2)+0.01204230/00.000010
p=0.001p = 0.001(20,2)(20,2)+0.00931323/70.026850
p=0.001p = 0.001(30,2)(30,2)+0.00338828/20.000020
p=0.03p = 0.03(20,2)(20,2)−0.00065013/170.512255
p=0.03p = 0.03(30,2)(30,2)+0.01192830/00.000010

Table VI. Sensitivity of the decoder-aware minus (d,m)(d,m) final-HV difference. Budgets are 20,000 queries except for the explicitly identified 80,000-query rows. Each variant is a separate 180-run campaign with two cells and three signals.

In the separate 80,000-query campaign, the decoder-aware minus (d,m)(d,m) mean difference at (40, 2) is +0.002253, with 28 positive and two negative pairs and raw sign-flip p≃10−5p \simeq10^{-5}. At (40, 4) the difference remains negative, −0.000927-0.000927, with 10 positive and 20 negative pairs and raw p=0.0810p = 0.0810. The larger budget therefore yields a detectable difference in the former comparison but not the latter. These are within-campaign comparisons; they do not constitute a separate test of the change in the between-arm effect across budgets.

The longer campaign also supplies candidates that improve the menus. By the interval-dominance test, its retained candidates dominate 99 of the 117 main-menu entries at (40, 2) and 91 of 130 at (40, 4). Merging the two retained sets, deduplicating their code representations, and filtering again gives union menus of 111 and 137 candidates, respectively. A smaller retained count can accompany an improved menu because new candidates remove several older entries.

The (40, 2) union menu extends from minimum cost B∗=114B_* = 114 to a lowest-lower-bound candidate at $B_* = 301 with interval approximately [9.21395,9.24186]×10−5[9.21395, 9.24186] \times10^{-5}. The measurement-noise analysis in Sec. VI uses the original 477 candidates.

Penalty and physical-error sensitivity

The penalty and physical-error campaigns examine only (n,k)=(20,2)(n,k) = (20, 2) and (30,2)(30, 2), with three signals and 30 paired seeds per cell. tbl:VI summarizes comparisons against (d,m)(d,m). Its pp values are unadjusted; these exploratory analyses are separate from the 32-test Holm family of the main experiment.

Changing λ\lambda from 1 to 0.3 or 3 leaves final HV unchanged for every paired seed of the decoder-aware and (d,m)(d,m) arms in the two tested cells; the distance-arm mean changes by at most 7.25×10−47.25 \times10^{-4}. This limited sensitivity is specific to the tested cells and does not imply equivalence to a hard constraint.

At p=0.001p = 0.001, the decoder-aware signal has positive mean differences from (d,m)(d,m) in both tested cells, with raw pp values 0.02685 and approximately 2×10−52 \times10^{-5}. At p=0.03p = 0.03, the (20,2)(20, 2) difference is slightly negative and not detected by the test, while (30,2)(30, 2) retains a positive difference. The decoder-aware signal has higher mean HV than distance in all ten cell–variant comparisons, with raw p<10−3p < 10^{-3}. Since the decoder objective and its HV normalization change with pp, these comparisons are interpreted within each physical-error setting.

Additional summaries for noisy syndrome measurements

The results below use the fixed 477-code main pool, the strict single-round model of Sec. VI A, p=0.01p = 0.01, and q∈{0.01,0.005}q \in\{0.01, 0.005\}. The measured rows, redundancy grid, and selection rules are defined in Sec. VI. Truncated values are lower endpoints, subject to the numerical qualification stated there.

Implementation consistency checks

We evaluated 5,644 noisy-syndrome cases across the 477 codes, both values of qq, and the redundancy grids. An additional 477 evaluations at q=0q = 0 recover the code-capacity lower endpoints with a maximum relative difference of 3.17×10−133.17 \times10^{-13}; all basis-weight checks agree. These checks assess implementation consistency and do not add independent code samples. For tied check weights, row selection uses the integer row label as a deterministic tie break.

Code ordering and redundancy summaries

At q=pq = p, the cell medians of basis-only P^ds\widehat{P}_{\mathrm{ds}} range from 0.1068 to 0.1744. The median within-code ratio to the code-capacity lower endpoint ranges from 8.62 to 491.36 across cells. Redundancy reduces the truncated values: the median within-code ratio for one additional row per sector relative to basis-only measurement lies between 0.688 and 0.891; at tmax⁡t_{\max}, it lies between 0.145 and 0.361. These ratios compare evaluation endpoints and summarize codes within each cell.

tbl:VII describes the basis-only menus using the truncated values. It separates distinct objective coordinates from code records because equal-coordinate codes need not be the same code.

The strong basis-only correlations coexist with changes in the available trade-offs. In the six cells with n≥20n \ge20, only 23.8%–60.0% of the code records remain nondominated under this point-value comparison. All four records remain at (14,4)(14, 4). At maximum tested redundancy, rank correlations are 0.808–0.933 for n≥20n \ge20, but fall to 0.623 and 0.400 in the two 14-qubit cells. Thus the data show substantial association in several cells, but the exact code ordering is not preserved under measurement noise.

These ordering statistics are descriptive; interval comparisons between selected designs are reported in Sec. VI D.

(n,k)(n,k)Input codesDistinct nondominated coordinatesNondominated code recordsSpearman ρ\rho, t=0t=0
(14,2)(14,2)13680.906
(14,4)(14,4)4441.000
(20,2)(20,2)3613130.951
(20,4)(20,4)4024240.969
(30,2)(30,2)6122220.970
(30,4)(30,4)7624240.960
(40,2)(40,2)11739390.971
(40,4)(40,4)13031310.975

Table VII. Basis-only measurement noise at p=q=0.01p=q=0.01. The nondominance columns use (B∗,P^ds)(B_{\ast},\hat{P}_{\mathrm{ds}}) and do not certify true Pareto membership. Correlations are descriptive Spearman coefficients computed with average ranks for ties, between the code-capacity lower endpoint and P^ds\hat{P}_{\mathrm{ds}}.

Code and data availability

The code and data supporting this study are not publicly available at the time of this preprint. We plan to make them publicly available following submission to a journal or publication of the peer-reviewed article, with the code released as open-source software.

ACKNOWLEDGMENT

This study was financed, in part, by the São Paulo Research Foundation (FAPESP), Brasil. Process Numbers #2025/25586-5 (postdoctoral fellowship to Y.C.) and #2021/02120-0. Generative AI tools (OpenAI ChatGPT and Anthropic Claude) were used to assist with software development, and ChatGPT was used for language editing. The authors reviewed and verified all AI-assisted output and take full responsibility for the manuscript and the software.

References

  1. [1]B. M. Terhal, Quantum error correction for quantum memories, Rev. Mod. Phys. 87, 307 (2015).DOI
  2. [2]Google Quantum AI and Collaborators, Quantum error correction below the surface code threshold, Nature 638, 920 (2025).DOI
  3. [3]D. Bluvstein, A. A. Geim, S. H. Li, S. J. Evered, J. P. Bonilla Ataides, G. Barnes, A. G. Gu, T. Manovitz, M. Xu, M. Kalinowski, et al., A fault-tolerant neutral-atom architecture for universal quantum computation, Nature 649, 39 (2026).DOI
  4. [4]H. Putterman, K. Noh, C. T. Hann, G. S. MacCabe, S. Aghaeimeibodi, R. N. Patel, M. Lee, W. M. Jones, H. Moradinejad, R. Rodriguez, et al., Hardware-efficient quantum error correction via concatenated bosonic qubits, Nature 638, 927 (2025).DOI
  5. [5]S. Bravyi, A. W. Cross, J. M. Gambetta, D. Maslov, P. Rall, and T. J. Yoder, High-threshold and low-overhead fault-tolerant quantum memory, Nature 627, 778 (2024).DOI
  6. [6]L. Pecorari, S. Jandura, G. K. Brennen, and G. Pupillo, High-rate quantum LDPC codes for long-range connected neutral atom registers, Nat. Commun. 16, 1111 (2025).DOI
  7. [7]T. R. Scruby, T. Hillmann, and J. Roffe, High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory, PRX Quantum 7, 020310 (2026).DOI
  8. [8]H. Zhou, C. Zhao, M. Cain, D. Bluvstein, N. Maskara, C. Duckering, H.-Y. Hu, S.-T. Wang, A. Kubica, and M. D. Lukin, Low-overhead transversal fault tolerance for universal quantum computation, Nature 646, 303 (2025).
  9. [9]T. Hillmann, L. Berent, A. O. Quintavalle, J. Eisert, R. Wille, and J. Roffe, Localized statistics decoding for quantum low-density parity-check codes, Nat. Commun. 16, 8214 (2025).DOI
  10. [10]M. A. Perlin, M. Steinberg, and B. Criger, Quantum codes from classical annealing, arXiv:2607.19574 (2026).arxiv.org/abs/2607.19574
  11. [11]M. A. Webster and D. E. Browne, Engineering Quantum Error Correction Codes Using Evolutionary Algorithms, IEEE Trans. Quantum Eng. 6, 3100514 (2025).arxiv.org/abs/2409.13017
  12. [12]A. Y. He and Z.-W. Liu, Discovering highly efficient low-weight quantum error-correcting codes with reinforcement learning, arXiv:2502.14372 (2025).arxiv.org/abs/2502.14372
  13. [13]J. Y. Lee, K. Okada, N. Maskara, K. Kasai, and H. Zhou, Design Principles for Ultra-High-Rate Quantum Codes, arXiv:2609.30069 (2026).arxiv.org/abs/2609.30069
  14. [14]H. P. Nauptup, N. Delfosse, V. Dunjko, H. J. Briegel, and N. Friis, Optimizing Quantum Error Correction Codes with Reinforcement Learning, Quantum 3, 215 (2019).DOI
  15. [15]V. P. Su, C. Cao, H.-Y. Hu, Y. Yanay, C. Tahan, and B. Swingle, Discovery of optimal quantum codes via reinforcement learning, Phys. Rev. Applied 23, 034048 (2025).DOI
  16. [16]A. Ashikhmin, C.-Y. Lai, and T. A. Brun, Quantum Data-Syndrome Codes, IEEE J. Sel. Areas Commun. 38, 449 (2020).DOI
  17. [17]A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A 54, 1098 (1996).pubmed.ncbi.nlm.nih.gov/9913578
  18. [18]A. M. Steane, Error correcting codes in quantum theory, Phys. Rev. Lett. 77, 793 (1996).pubmed.ncbi.nlm.nih.gov/10062908
  19. [19]D. Gottesman, Stabilizer Codes and Quantum Error Correction, Ph.D. thesis, California Institute of Technology (1997), arXiv:quant-ph/9705052.DOI
  20. [20]P. Iyer and D. Poulin, Hardness of decoding quantum stabilizer codes, IEEE Trans. Inf. Theory 61, 5209 (2015).arxiv.org/abs/1310.3235
  21. [21]J. Oxley, Matroid Theory, 2nd ed. (Oxford University Press, 2011).
  22. [22]R. Chao and B. W. Reichardt, Quantum error correction with only two extra qubits, Phys. Rev. Lett. 121, 050502 (2018).DOI
  23. [23]E. Zitzler and L. Thiele, Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach, IEEE Trans. Evol. Comput. 3, 257 (1999).DOI
  24. [24]S. Holm, A Simple Sequentially Rejective Multiple Test Procedure, Scand. J. Stat. 6, 65 (1979).DOI
  25. [25]E. Dennis, A. Kitaev, A. Landahl, and J. Preskill, Topological quantum memory, J. Math. Phys. 43, 4452 (2002).DOI
  26. [26]H. Bombín, Single-shot fault-tolerant quantum error correction, Phys. Rev. X 5, 031043 (2015).DOI
  27. [27]J. Roffe, D. R. White, S. Burton, and E. T. Campbell, Decoding across the quantum low-density parity-check code landscape, Phys. Rev. Research 2, 043423 (2020).DOI

Paper details

vlnc:W_wzck3ubx
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 13

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

OpenAI ChatGPT, Anthropic Claude

View statement
Looking for related papers…
Contents