Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.29438

The resource cost of magic in a code block

Jiachen Shen, Hui Zhong

quant-phSubmitted Aug 29, 2026• Announced Sep 1, 2026• 0 citations• Revised Sep 1, 2026 (v2)
v1 · Aug 29, 2026v2 · Sep 1, 2026
arXivHTMLPDF

Abstract

We bound the magic of a post-selected logical measurement by the resource that produced it. The setting is one code block with one logical qubit and an adaptive protocol that measures, feeds forward and accepts. The witness reads the accepted effect against the free set of the resource theory of magic, outcome by outcome and not on the averaged channel, since a channel can be free while one of its outcomes measures the magic axis. Our first bound is unconditional. The accepted magic is at most a constant times the summed distance of the cells from the free set. The second is the main result. When the resource cells sit inside a bounded-spread exact-recovery skeleton, the recovery puts every insertion history below a threshold onto a single free branch, transcript by transcript, so only connected clusters reaching the threshold contribute and an exact-component expansion controls their weight. With a threshold linear in the code distance, polynomially many cells of bounded insertion degree and per-cell dilation amplitude $O(1/d)$, the accepted magic times the acceptance probability is at most $\exp[-Ω(d\log d)]$. Post-selection is disposed of before accepted transcripts are summed, so a branch of vanishing probability cannot be amplified into a magic effect. The threshold is certified from a circuit, and we run it on one exact round of stabilizer measurement followed by a split readout, which measures logical $X$ on the accepted fibre and logical $Z$ on the rejected ones. That certifies a threshold equal to the code distance for every single-layer pattern of weak $Z$-rotations, one per data qubit, so the hypotheses are met by a family and not one design. A member carries magic only if its support contains a logical $Z$ string. One member attains the exponent, again at the level of the accepted effect. Suppression is set by the threshold and not by the topology of the block.

AI Summary

The paper asks how much non-stabilizer resource is needed to implement a post-selected logical measurement on one encoded qubit, motivated by magic-axis checks in surface-code cultivation. It measures magic through the accepted effect $F_A$: with $p_A=\operatorname{Tr}(F_A)/2$, the quantity bounded is $p_A D_{\rm stab}$, where $D_{\rm stab}$ is the Bloch-vector $\ell_1$ distance of the normalized effect from the stabilizer octahedron. Freeness is imposed outcome by outcome, since forgetting outcomes can hide a magic measurement. An unconditional hybrid argument gives $p_A D_{\rm stab}\le(\sqrt3/2)\sum_x\varepsilon_x$, with $\varepsilon_x$ the cell’s diamond distance to free instruments. The main bound assumes an exact-recovery skeleton, a bounded-degree insertion graph, and transcript-wise factorization of all insertion histories whose connected components contain fewer than $D$ cells onto a common free branch. An exact-component expansion bounds the remaining contribution. For polynomially many cells, $D=\Omega(d)$ and dilation amplitudes $O(1/d)$, this yields $p_A D_{\rm stab}\le e^{-\Omega(d\log d)}$. A circuit-level absorption criterion certifies $D=d_Z$ for a single layer of single-qubit $Z$-diagonal deviations followed by exact syndrome measurement and split readout: logical $X$ on the accepted syndrome fibre, logical $Z$ otherwise. Weak rotations along a minimum logical string attain $-\log(p_A D_{\rm stab})=d\log d+O(d)$ with $p_A\to1/2$. The results concern effects, not complete measurement instruments. Certification for multi-qubit cells, off-axis deviations and resource accumulated across rounds remains open. Noisy recovery requires an aggregate approximate-factorization estimate; the suppression proof uses no topology-specific properties.

Likely largely AI-generatedStrong assumptionsUnclear novelty

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Where magic-state cultivation pays in early fault-tolerant quantum computing: a single-clock cost model of logical error mitigation and magic-state supply

Hikaru Wakaura, Taiki Tanimae

Abstract Error-corrected quantum computers limited to small code distances trade physical qubits against the number of logical operations they can run. Two tools set that trade-off in the early fault-tolerant era: logical-level error mitigation, which cancels residual logical errors at a sampling cost exponential in the total error, and magic-state cultivation, which prepares non-Clifford resource states far more cheaply than distillation. Their resource estimates use different accountings of time, idle error, and consumption, so their combination has not been costed consistently. Here we build one cost model in which data block, factory, and sampling overhead share one clock and precision target, and show that whether cultivation pays is decided by two architectural numbers: the $T$-state demand per time step, $\rho=n_L u f_T$, which sets the factory area, and the exposure $N/u$, which sets the idle error, where $u$ is the fraction of the $n_L$ logical qubits acted on per step and $f_T$ the $T$ fraction. At $\rho\approx1$ adding cultivation to error mitigation saves $6$--$9\%$ of physical qubits; at $\rho\approx30$ it saves $71$--$85\%$ because factories dominate the footprint. The feasible circuit size grows by at most $1.8$--$2.7\times$ and never reaches $10^{10}$ operations at $d\le13$. We also identify a storage-limited error floor for 15-to-1 distillation confined to patch distance $d_X\le11$ ($3.7\times10^{-6}$ at error rate $10^{-3}$), compute the exact floor of the $d_1=3$ cultivation stage ($6.8\times10^{-7}$), show that escaping to $d_2=7$--$11$ costs $25$--$56\%$ of the published volume, and find that the error of a cultivated state given its decoder gap follows one curve per $d_1$ to within $2\times$. On reported logical error suppression factors, today's hardware supports only tens of mitigated logical operations; the regime opens below a physical error rate of $2\times10^{-3}$.

•Oct 5, 2026•0 citations

Theory of Magic Phase Transitions in Encoding-Decoding Circuits

Piotr Sierant, Xhek Turkeshi

Quantum magic resources, or nonstabilizerness, are a central ingredient for universal quantum computation. In noisy many-body systems, the interplay between these resources and errors leads to sharp magic phase transitions. However, the microscopic mechanism behind these critical phenomena is still an open question, especially since early empirical evidence showed conflicting results regarding their universality classes. In this work, we provide a comprehensive picture of magic phase transitions for the class of encoding-decoding quantum circuits to resolve these ambiguities. We analytically show that the behavior of magic resources is fundamentally dictated by the chosen measurement protocol. When we fix, or post-select, the class of measurement syndromes, the magic transition inherits the universal features of the error-resilience phase transition in the circuits. Interestingly, this clean transition survives even for fully random Haar encoders showing that it is a consequence of initial's state retrieval, and not an artifact of the Clifford encoders. On the other hand, if we consider realistic Born-rule sampling, the intrinsic statistical fluctuations of a given syndrome measurement act as a relevant perturbation. This brings in strong finite-size drifts and an apparent multifractality, which end up altering the critical behavior of the system. We reveal that magic phase transitions are actually direct manifestations of error-resilience thresholds, rather than independent critical phenomena, reconciling conflicting observations from the earlier literature. Ultimately, our framework clarifies how the quantum computational power can survive, or be irreversibly destroyed, due to the competition between scrambling, measurements, and errors.

quant-pharXiv:2603.00235•Mar 3, 2026•15 citations

A conditional no-go for resource-free magic-axis measurement on a static surface code

J P Shen, Hui Zhong

Under stated assumptions, a static surface-code patch that adds no fold or \mbox{self-dual} structure cannot perform the magic-axis check that magic-state cultivation relies on while still accepting often. This is a conditional no-go. Fault-tolerant machines spend much of their cost making magic states, and cultivation makes them in place by measuring the magic axis, which every known construction does through a fold or \mbox{self-dual} patch that it is folklore to call necessary. We test the folklore. The no-go says that a useful check must pay for the magic axis somewhere. It can add a charge-converting resource, it can leave the dilute regime of its accepted history, or it can accept only exponentially rarely. For a single stabilizer-measurement transcript this is proved outright, from a topological reading of the accepted outcome. For adaptive, post-selected protocols in a bounded-depth (polynomial spacetime-volume) model, it holds under two structural assumptions plus a subcriticality assumption. We isolate the one open assumption, show that protection alone does not force it, and give the threshold any resolution must address. What remains is a single conjecture.

arXiv:2607.16968•Jul 18, 2026•2 citations

Zeno-Enhanced Probabilistic Error Cancellation with Quantum Error Detection Codes

Yi Yuan, Yuanchen Zhao, Dong E. Liu

Probabilistic error cancellation (PEC) is unbiased but suffers exponential sampling overhead set by noise-weighted circuit volume, whereas quantum error-detecting codes (QEDCs) remove many physical faults by stabilizer post-selection but leave an undetectable logical residue. We exploit this complementarity by using post-selection to map physical noise to a weaker accepted logical channel, and then applying PEC only to the residual channel. The resulting feedback-free QED+PEC scheme interleaves Clifford logical blocks, stabilizer measurements, post-selection, and probabilistic cancellation on accepted trajectories, without real-time decoding or active recovery. A key complication is that post-selection correlates accepted fault branches through stabilizer-commutation constraints, so the sparse Pauli-Lindblad factorization underlying bare PEC no longer applies directly. We therefore construct the inverse channel perturbatively: for fixed order $K$, only accepted fault branches up to order $K$ are retained, reducing preprocessing from $2^m$ branches to $O(m^K)$ per block. The order-$K$ protocol cancels the normalized post-selected channel through degree $K$, leaving a per-block error $O(W^{K+1})$ that accumulates at most linearly. For logical GHZ-state preparation with the $[[n,n-2,2]]$ Iceberg code under circuit-level depolarizing noise and ideal stabilizer measurements, first-order QED+PEC reaches $n=200$ physical qubits and lowers sampling overhead by three to four orders of magnitude relative to standard PEC while maintaining $F\simeq0.956$. Syndrome-noise tests show that readout-only flips mainly increase post-selection cost, whereas noisy GHZ-assisted global stabilizer extraction can remove the advantage. This identifies a discrete-Zeno trade-off: cheap detection reshapes the effective channel PEC must invert, rather than simply adding overhead.

quant-pharXiv:2605.12149•Quantum Science and Technology•May 13, 2026•5 citations

Magic-Free Certification of Logical Error Rates in Universal Fault-Tolerant Circuits

Gebrat Porta-San Miguel, Shahram Panahiyan, Dieter Jaksch

As quantum hardware enters the fault-tolerant regime, algorithms are beginning to be executed on encoded qubits, yet scalable certification of how well they run remains an open problem. Here we introduce magic-free certification, a certification protocol for universal fault-tolerant circuits that consumes no magic, the resource that generally places them beyond efficient classical simulation and is by far the most expensive element of a fault-tolerant computation. The protocol is code- and decoder-agnostic, runs interleaved with the target circuit on the same device, and has a sample complexity that grows linearly with the number of logical qubits and non-Clifford gates while remaining decoupled from the logical error rate itself. Given a predefined error tolerance $p_L^*$, the protocol determines at a chosen confidence level whether the device executes the target circuit at a logical error rate below $p_L^*$. The method relies on trap circuits, copies of the target with every magic state replaced by a stabilizer state, whose outcomes are deterministic and which, being indistinguishable from the target to stochastic Pauli noise, fail at the same rate. We illustrate the protocol in Steane-code simulations of a magic state injection gadget and a quantum Fourier transform.

quant-pharXiv:2610.16401•Oct 13, 2026•0 citations

Coded Clifford Measurements for Multiqubit Magic-State Cultivation

Gunsik Min, Jun Heo

Magic-state cultivation suppresses errors by measuring logical Clifford checks and discarding inconsistent outcomes. For an entangled resource, several measurement branches are usable, so their outcomes form a multibit classical record whose corruption can produce a logical-frame error. We show that this measurement record can be protected as a binary linear code. For any third-level Clifford-hierarchy unitary $U\in\mathcal C_3$, every parity of the branch bits can be measured by a commuting Hermitian Clifford check $C(v)=UX(v)U^\dagger$. Choosing which parities to measure therefore defines a binary code $y(a)=aG$. If the valid records have minimum distance $d$, at least $d$ readout-bit flips are required to confuse one valid branch with another, giving $P_{\rm wv}=O(q^d)$. A Plotkin bound limits the length of any binary branch record, and the Clifford schedules attain this limit: at distance four, six logical measurements suffice for $|CS\rangle$ and seven for $|CCZ\rangle$, compared with eight and twelve under independent repetition. Thus restricting the logical schedule to Clifford parities requires no additional measurements. In a native-CZZ-assisted Steane implementation, the $[6,2,4]$ CS schedule is also the unique minimum-cost distance-four solution within the compiled Clifford-check family, reducing the cultivation core by $26.6\%$ in active locations. State-vector simulations without a final ideal code-space projection further show higher acceptance and approximately half the residual error weight on the two Steane blocks. Coding the logical measurement record therefore reduces both measurement redundancy and compiled fault-tolerant overhead.

quant-pharXiv:2609.09994•Sep 10, 2026•2 citations
We bound the magic of a post-selected logical measurement by the resource that produced it. The setting is one code block with one logical qubit and an adaptive protocol that measures, feeds forward and accepts. The witness reads the accepted effect against the free set of the resource theory of magic, outcome by outcome and not on the averaged channel, since a channel can be free while one of its outcomes measures the magic axis. Our first bound is unconditional. The accepted magic is at most a constant times the summed distance of the cells from the free set. The second is the main result. When the resource cells sit inside a bounded-spread exact-recovery skeleton, the recovery puts every insertion history below a threshold onto a single free branch, transcript by transcript, so only connected clusters reaching the threshold contribute and an exact-component expansion controls their weight. With a threshold linear in the code distance, polynomially many cells of bounded insertion degree and per-cell dilation amplitude O(1/d)O(1/d)O(1/d), the accepted magic times the acceptance probability is at most exp⁡[−Ω(dlog⁡d)]\exp[-Ω(d\log d)]exp[−Ω(dlogd)]. Post-selection is disposed of before accepted transcripts are summed, so a branch of vanishing probability cannot be amplified into a magic effect. The threshold is certified from a circuit, and we run it on one exact round of stabilizer measurement followed by a split readout, which measures logical XXX on the accepted fibre and logical ZZZ on the rejected ones. That certifies a threshold equal to the code distance for every single-layer pattern of weak ZZZ-rotations, one per data qubit, so the hypotheses are met by a family and not one design. A member carries magic only if its support contains a logical ZZZ string. One member attains the exponent, again at the level of the accepted effect. Suppression is set by the threshold and not by the topology of the block.
The paper asks how much non-stabilizer resource is needed to implement a post-selected logical measurement on one encoded qubit, motivated by magic-axis checks in surface-code cultivation. It measures magic through the accepted effect FAF_AFA​: with pA=Tr⁡(FA)/2p_A=\operatorname{Tr}(F_A)/2pA​=Tr(FA​)/2, the quantity bounded is pADstabp_A D_{\rm stab}pA​Dstab​, where DstabD_{\rm stab}Dstab​ is the Bloch-vector ℓ1\ell_1ℓ1​ distance of the normalized effect from the stabilizer octahedron. Freeness is imposed outcome by outcome, since forgetting outcomes can hide a magic measurement.
An unconditional hybrid argument gives pADstab≤(3/2)∑xεxp_A D_{\rm stab}\le(\sqrt3/2)\sum_x\varepsilon_xpA​Dstab​≤(3​/2)∑x​εx​, with εx\varepsilon_xεx​ the cell’s diamond distance to free instruments. The main bound assumes an exact-recovery skeleton, a bounded-degree insertion graph, and transcript-wise factorization of all insertion histories whose connected components contain fewer than DDD cells onto a common free branch. An exact-component expansion bounds the remaining contribution. For polynomially many cells, D=Ω(d)D=\Omega(d)D=Ω(d) and dilation amplitudes O(1/d)O(1/d)O(1/d), this yields pADstab≤e−Ω(dlog⁡d)p_A D_{\rm stab}\le e^{-\Omega(d\log d)}pA​Dstab​≤e−Ω(dlogd).
A circuit-level absorption criterion certifies D=dZD=d_ZD=dZ​ for a single layer of single-qubit ZZZ-diagonal deviations followed by exact syndrome measurement and split readout: logical XXX on the accepted syndrome fibre, logical ZZZ otherwise. Weak rotations along a minimum logical string attain −log⁡(pADstab)=dlog⁡d+O(d)-\log(p_A D_{\rm stab})=d\log d+O(d)−log(pA​Dstab​)=dlogd+O(d) with pA→1/2p_A\to1/2pA​→1/2.
The results concern effects, not complete measurement instruments. Certification for multi-qubit cells, off-axis deviations and resource accumulated across rounds remains open. Noisy recovery requires an aggregate approximate-factorization estimate; the suppression proof uses no topology-specific properties.
Abstract Error-corrected quantum computers limited to small code distances trade physical qubits against the number of logical operations they can run. Two tools set that trade-off in the early fault-tolerant era: logical-level error mitigation, which cancels residual logical errors at a sampling cost exponential in the total error, and magic-state cultivation, which prepares non-Clifford resource states far more cheaply than distillation. Their resource estimates use different accountings of time, idle error, and consumption, so their combination has not been costed consistently. Here we build one cost model in which data block, factory, and sampling overhead share one clock and precision target, and show that whether cultivation pays is decided by two architectural numbers: the TTT-state demand per time step, ρ=nLufT\rho=n_L u f_Tρ=nL​ufT​, which sets the factory area, and the exposure N/uN/uN/u, which sets the idle error, where uuu is the fraction of the nLn_LnL​ logical qubits acted on per step and fTf_TfT​ the TTT fraction. At ρ≈1\rho\approx1ρ≈1 adding cultivation to error mitigation saves 666--9%9\%9% of physical qubits; at ρ≈30\rho\approx30ρ≈30 it saves 717171--85%85\%85% because factories dominate the footprint. The feasible circuit size grows by at most 1.81.81.8--2.7×2.7\times2.7× and never reaches 101010^{10}1010 operations at d≤13d\le13d≤13. We also identify a storage-limited error floor for 15-to-1 distillation confined to patch distance dX≤11d_X\le11dX​≤11 (3.7×10−63.7\times10^{-6}3.7×10−6 at error rate 10−310^{-3}10−3), compute the exact floor of the d1=3d_1=3d1​=3 cultivation stage (6.8×10−76.8\times10^{-7}6.8×10−7), show that escaping to d2=7d_2=7d2​=7--111111 costs 252525--56%56\%56% of the published volume, and find that the error of a cultivated state given its decoder gap follows one curve per d1d_1d1​ to within 2×2\times2×. On reported logical error suppression factors, today's hardware supports only tens of mitigated logical operations; the regime opens below a physical error rate of 2×10−32\times10^{-3}2×10−3.
Quantum magic resources, or nonstabilizerness, are a central ingredient for universal quantum computation. In noisy many-body systems, the interplay between these resources and errors leads to sharp magic phase transitions. However, the microscopic mechanism behind these critical phenomena is still an open question, especially since early empirical evidence showed conflicting results regarding their universality classes. In this work, we provide a comprehensive picture of magic phase transitions for the class of encoding-decoding quantum circuits to resolve these ambiguities. We analytically show that the behavior of magic resources is fundamentally dictated by the chosen measurement protocol. When we fix, or post-select, the class of measurement syndromes, the magic transition inherits the universal features of the error-resilience phase transition in the circuits. Interestingly, this clean transition survives even for fully random Haar encoders showing that it is a consequence of initial's state retrieval, and not an artifact of the Clifford encoders. On the other hand, if we consider realistic Born-rule sampling, the intrinsic statistical fluctuations of a given syndrome measurement act as a relevant perturbation. This brings in strong finite-size drifts and an apparent multifractality, which end up altering the critical behavior of the system. We reveal that magic phase transitions are actually direct manifestations of error-resilience thresholds, rather than independent critical phenomena, reconciling conflicting observations from the earlier literature. Ultimately, our framework clarifies how the quantum computational power can survive, or be irreversibly destroyed, due to the competition between scrambling, measurements, and errors.
Under stated assumptions, a static surface-code patch that adds no fold or \mbox{self-dual} structure cannot perform the magic-axis check that magic-state cultivation relies on while still accepting often. This is a conditional no-go. Fault-tolerant machines spend much of their cost making magic states, and cultivation makes them in place by measuring the magic axis, which every known construction does through a fold or \mbox{self-dual} patch that it is folklore to call necessary. We test the folklore. The no-go says that a useful check must pay for the magic axis somewhere. It can add a charge-converting resource, it can leave the dilute regime of its accepted history, or it can accept only exponentially rarely. For a single stabilizer-measurement transcript this is proved outright, from a topological reading of the accepted outcome. For adaptive, post-selected protocols in a bounded-depth (polynomial spacetime-volume) model, it holds under two structural assumptions plus a subcriticality assumption. We isolate the one open assumption, show that protection alone does not force it, and give the threshold any resolution must address. What remains is a single conjecture.
Probabilistic error cancellation (PEC) is unbiased but suffers exponential sampling overhead set by noise-weighted circuit volume, whereas quantum error-detecting codes (QEDCs) remove many physical faults by stabilizer post-selection but leave an undetectable logical residue. We exploit this complementarity by using post-selection to map physical noise to a weaker accepted logical channel, and then applying PEC only to the residual channel. The resulting feedback-free QED+PEC scheme interleaves Clifford logical blocks, stabilizer measurements, post-selection, and probabilistic cancellation on accepted trajectories, without real-time decoding or active recovery. A key complication is that post-selection correlates accepted fault branches through stabilizer-commutation constraints, so the sparse Pauli-Lindblad factorization underlying bare PEC no longer applies directly. We therefore construct the inverse channel perturbatively: for fixed order KKK, only accepted fault branches up to order KKK are retained, reducing preprocessing from 2m2^m2m branches to O(mK)O(m^K)O(mK) per block. The order-KKK protocol cancels the normalized post-selected channel through degree KKK, leaving a per-block error O(WK+1)O(W^{K+1})O(WK+1) that accumulates at most linearly. For logical GHZ-state preparation with the [[n,n−2,2]][[n,n-2,2]][[n,n−2,2]] Iceberg code under circuit-level depolarizing noise and ideal stabilizer measurements, first-order QED+PEC reaches n=200n=200n=200 physical qubits and lowers sampling overhead by three to four orders of magnitude relative to standard PEC while maintaining F≃0.956F\simeq0.956F≃0.956. Syndrome-noise tests show that readout-only flips mainly increase post-selection cost, whereas noisy GHZ-assisted global stabilizer extraction can remove the advantage. This identifies a discrete-Zeno trade-off: cheap detection reshapes the effective channel PEC must invert, rather than simply adding overhead.
As quantum hardware enters the fault-tolerant regime, algorithms are beginning to be executed on encoded qubits, yet scalable certification of how well they run remains an open problem. Here we introduce magic-free certification, a certification protocol for universal fault-tolerant circuits that consumes no magic, the resource that generally places them beyond efficient classical simulation and is by far the most expensive element of a fault-tolerant computation. The protocol is code- and decoder-agnostic, runs interleaved with the target circuit on the same device, and has a sample complexity that grows linearly with the number of logical qubits and non-Clifford gates while remaining decoupled from the logical error rate itself. Given a predefined error tolerance pL∗p_L^*pL∗​, the protocol determines at a chosen confidence level whether the device executes the target circuit at a logical error rate below pL∗p_L^*pL∗​. The method relies on trap circuits, copies of the target with every magic state replaced by a stabilizer state, whose outcomes are deterministic and which, being indistinguishable from the target to stochastic Pauli noise, fail at the same rate. We illustrate the protocol in Steane-code simulations of a magic state injection gadget and a quantum Fourier transform.
Magic-state cultivation suppresses errors by measuring logical Clifford checks and discarding inconsistent outcomes. For an entangled resource, several measurement branches are usable, so their outcomes form a multibit classical record whose corruption can produce a logical-frame error. We show that this measurement record can be protected as a binary linear code. For any third-level Clifford-hierarchy unitary U∈C3U\in\mathcal C_3U∈C3​, every parity of the branch bits can be measured by a commuting Hermitian Clifford check C(v)=UX(v)U†C(v)=UX(v)U^\daggerC(v)=UX(v)U†. Choosing which parities to measure therefore defines a binary code y(a)=aGy(a)=aGy(a)=aG. If the valid records have minimum distance ddd, at least ddd readout-bit flips are required to confuse one valid branch with another, giving Pwv=O(qd)P_{\rm wv}=O(q^d)Pwv​=O(qd). A Plotkin bound limits the length of any binary branch record, and the Clifford schedules attain this limit: at distance four, six logical measurements suffice for ∣CS⟩|CS\rangle∣CS⟩ and seven for ∣CCZ⟩|CCZ\rangle∣CCZ⟩, compared with eight and twelve under independent repetition. Thus restricting the logical schedule to Clifford parities requires no additional measurements. In a native-CZZ-assisted Steane implementation, the [6,2,4][6,2,4][6,2,4] CS schedule is also the unique minimum-cost distance-four solution within the compiled Clifford-check family, reducing the cultivation core by 26.6%26.6\%26.6% in active locations. State-vector simulations without a final ideal code-space projection further show higher acceptance and approximately half the residual error weight on the two Steane blocks. Coding the logical measurement record therefore reduces both measurement redundancy and compiled fault-tolerant overhead.