--- title: Fault-Tolerant Measurement Schedules url: https://www.emergentmind.com/topics/fault-tolerant-measurement-schedules type: topic --- # Fault-Tolerant Measurement Schedules Fault-tolerant measurement schedules are measurement protocols in which the ordering, grouping, and repetition of measurements are chosen so that low-weight faults remain distinguishable and correctable, while measurement overhead, circuit depth, and fault propagation remain controlled. In the recent literature, the term is used at several levels of abstraction: as the layerwise consumption rule for foliated three-dimensional cluster states in measurement-based quantum computing (MBQC), as the round structure for syndrome extraction in stabilizer-code quantum error correction, as a compressed sequence of stabilizer products that preserves code distance, and as an adaptive allocation policy for noisy logical readout. Across these settings, the central criterion is not merely whether the intended observables are measured, but whether the resulting detector or syndrome structure supports fault-tolerant decoding under the relevant noise model [2407.13826] [2509.07288] [2603.27004]. ## 1. Formal definitions and fault-tolerance criteria For an \([n,k,d]\) code, a measurement schedule can be specified as a sequence of \(n_M\) rounds in which a disjoint set of Pauli operators is measured in each round. In the detector-error-model formulation, such a schedule is fault-tolerant to distance \(d=2t+1\) if, for every syndrome \(\mathbf{s}\), there exists a correction \(c(\mathbf{s})\) such that every syndrome-consistent error of weight at most \(t\) is mapped to a residual output error no worse than the internal damage caused by the circuit. This formulation makes the schedule itself part of the error-correcting procedure rather than a neutral implementation detail [2407.13826]. A complementary definition appears in compressed syndrome extraction. There, a measurement schedule is a sequence of stabilizer measurements that enables fault-tolerant error correction even when the measured operators are fewer than the full set of independent generators. The paper introducing this framework defines weak fault tolerance for distance \(d=2t+1\) by the condition that, when the input has \(r\) errors and the error-correction procedure suffers \(s\) further errors, the corrected output has at most \(s\) errors whenever \(r+s\le t\). Under local noise with probability \(p\) on each data qubit before each stabilizer measurement and probability \(p\) on each syndrome qubit before measurement, the logical error probability scales like \(p^d\) [2509.07288]. In fault-tolerant cluster states (FTCSs), the schedule is encoded geometrically. A 3D cluster state simultaneously represents the MBQC resource state and the repeated syndrome-measurement structure for fault tolerance. In the bulk of the FTCS, all qubits are measured in the \(X\) basis; the syndrome graph is reconstructed from parity constraints on those measurement outcomes, and odd-parity vertices are interpreted as defects or error endpoints. This viewpoint makes explicit that fault tolerance is embedded in the measurement record itself [1810.09621]. A common misconception is that fault-tolerant scheduling is equivalent to “measuring all checks often enough.” The cited work instead treats schedule design as a distinguishability problem: dangerous low-weight error patterns must be separated in syndrome space, and the separation depends on geometry, detector choice, circuit ordering, and measurement overhead, not only on the nominal stabilizer set [2407.13826]. ## 2. Foliated schedules and hyperbolic cluster states In foliated MBQC, the schedule is inherited from a CSS code that is lifted into a 3D cluster-state resource. Hyperbolic cluster states extend this construction from Euclidean lattices to periodic negatively curved \(\{p,q\}\) lattices satisfying \[ \frac{1}{p}+\frac{1}{q}<\frac{1}{2}. \] For finite periodic realizations, the combinatorial relations \(pF=2E=qV\), \(\chi(M)=F-E+V\), and \(\chi(M)=2-2g\) imply \[ g = 1 + E\left(\frac{1}{2}-\frac{1}{p}-\frac{1}{q}\right), \] so the finite periodic hyperbolic sheet lies on a surface of genus \(g\ge 2\). In the \(\{8,3\}\) example used in the simulations, periodic boundary conditions give a closed surface of genus \(g=10\) [2603.27004]. On such a surface, the underlying CSS code is a hyperbolic surface-code-type construction with physical qubits on edges, \(Z\)-type plaquette checks on faces, and \(X\)-type star checks on vertices: \[ S_Z(f)=\prod_{e\in\partial f} Z_e,\qquad S_X(v)=\prod_{e\ni v} X_e. \] The number of logical qubits is \(k=2g\), and the encoding rate \[ \frac{k}{n}=1-\frac{2}{p}-\frac{2}{q}+\frac{2}{n} \] approaches a nonzero constant as \(n\to\infty\). This constant-rate behavior is one of the main reasons the measurement schedule is significant: the foliated resource can support more logical qubits per physical qubit than Euclidean cluster-state constructions while preserving a finite threshold [2603.27004]. The foliation procedure prepares data qubits and ancilla check qubits in \(\ket{+}\), entangles each check ancilla with the data qubits in its support by \(CZ\) gates, and alternates primal and dual layers. For a primal layer, the cluster-state stabilizers are \[ K_f = X_f \prod_{e\in \partial f} Z_e,\qquad K_e = X_e \prod_{f:e\in \partial f} Z_f, \] and, in the full 3D foliated complex, \[ K_f = X_f \prod_{e\in \partial f} Z_e,\qquad K_{\overline f}=X_{\overline f}\prod_{\overline e\in \partial \overline f} Z_{\overline e}. \] Measuring a face ancilla \(f\) in the \(X\) basis with outcome \(m_f\in\{\pm1\}\) projects the neighboring data qubits onto an eigenstate of the plaquette operator \(S_Z(f)\) with eigenvalue \(m_f\) [2603.27004]. The schedule that makes this construction fault-tolerant is layerwise in the foliation direction. The resource is built by stacking \(2z\) layers and then measuring all qubits in the \(X\) basis, with the final layer left unmeasured in the teleported-memory picture. The foliated direction functions as a discrete time coordinate: successive layers are measured, syndrome information is extracted from each layer’s parity outcomes, and the logical state is teleported from the input layer to the output layer up to Pauli byproduct operators determined by the outcomes [2603.27004]. Within each stabilizer neighborhood, the local gate order is fixed. In the explicit hyperbolic implementation, \(CZ\) gates are applied around each face in a counterclockwise order. The commutation relation \[ \Big(\prod_{q=5}^{8} CZ_{a,q}\Big)\, X_a = X_a\Big(\prod_{q=5}^{8} Z_q\Big)\Big(\prod_{q=5}^{8} CZ_{a,q}\Big) \] shows that an ancilla \(X\) fault can propagate into a contiguous chain of \(Z\) faults on neighboring data qubits. The stated purpose of the ordering is to keep propagated faults predominantly string-like, which matches the assumptions of minimum-weight perfect matching (MWPM) decoding [2603.27004]. The parity checks themselves occupy local 3D bi-pyramidal neighborhoods whose equators lie in one layer and whose apices lie in adjacent layers. For the \(\{8,3\}\) geometry, \(X\)-type checks have triangular equators and \(Z\)-type checks have octagonal equators. The parity-check outcome is given by the sum mod \(2\) of the single-qubit measurement outcomes on the corresponding nodes. The decoding pipeline first tabulates the syndrome produced by every distinct single fault in the circuit-level depolarizing model, then builds a weighted decoding graph with edge weights \[ W(e)=-\ln P_d(e), \] runs MWPM separately on primal and dual graphs, converts matched pairs into shortest paths, and declares failure when the residual chain has nontrivial pairing with a logical correlation surface [2603.27004]. At fixed foliation depth \(2z=8\), using \(2\times 10^4\) Monte Carlo trials per physical error rate, the \(\{8,3\}\) code yields threshold estimates of approximately \(p_{\mathrm{th}}^{(Z)}\approx 0.8\%\) and \(p_{\mathrm{th}}^{(X)}\approx 0.25\%\), compared with a commonly quoted Euclidean RHG threshold of about \(0.75\%\) under comparable circuit-level noise. The largest reported instance has \(n=600\) data qubits per sheet, \(k=52\), \(d_Z=12\), \(d_X=4\), \(k/n\approx 0.0867\), \(N_{\mathrm{total}}=7000\) cluster-state qubits, \(CZ_{\mathrm{HCS}}=13{,}800\), and \(N_F=214{,}000\) distinct single-location fault processes. The paper interprets these results as evidence that a geometry-sensitive but operationally simple layerwise schedule can preserve a threshold of the same order as RHG while retaining constant encoding rate [2603.27004]. ## 3. Beyond foliation and the geometry of fault-tolerant cluster states The FTCS framework is broader than foliated CSS constructions. In the generalized 3D cell-complex picture, cluster-state stabilizers can be written as \[ S^D_f = X_f \bigotimes_{e \in \partial f} Z_e, \qquad S^P_{\bar f} = X_{\bar f} \bigotimes_{\bar e \in \partial \bar f} Z_{\bar e}, \] and multiplying face stabilizers around a cell produces closed stabilizers \[ S^P_c = \bigotimes_{f\in \partial(c)} X_f, \qquad S^D_{\bar c} = \bigotimes_{\bar f\in \partial(\bar c)} X_{\bar f}. \] The syndrome graph is the 1-skeleton of the dual cell complex: vertices correspond to syndrome checks, edges to measured qubits, and a measurement error on an edge flips the parity at the two endpoints [1810.09621]. In standard foliated constructions, the geometry is layered and prism-like, with natural input and output layers. The beyond-foliation result is that a 3D FTCS need not arise from any foliation of a 2D stabilizer code. The key structural reason is that, in a generic 3D cell complex, the primal geometry does not uniquely determine the dual geometry. This permits more independent control over \(X\)- and \(Z\)-part geometries and allows syndrome-graph degree to be reduced below the degree-5 lower bound of foliated surface-code FTCSs [1810.09621]. The principal geometric operation is splitting. A vertex in the syndrome graph is replaced by two new vertices connected by a new edge, with the original incident edges partitioned between them. In the dual complex, this corresponds to cutting a cell into two connected pieces and adding a new bisecting face. Primal and dual splits commute, so the primal and dual syndrome graphs can be tuned independently without ambiguity in the final geometry [1810.09621]. Several explicit FTCS families are obtained in this way. | FTCS | Key structure | Thresholds | |---|---|---| | Cubic FTCS | cubic syndrome graph | erasure \(24.9\%\), Pauli \(2.6\%\) | | Diamond FTCS | self-dual, degree \(4\), hexagonal faces | erasure \(39\%\), Pauli \(5.2\%\) | | Doubled-edge cubic FTCS | self-dual, octagonal faces, doubled syndrome edges | erasure \(50\%\), Pauli \(7.5\%\) | | Triamond FTCS | self-dual, degree \(3\), decagonal faces | erasure \(55\%\), Pauli \(9.5\%\) | The diamond FTCS is obtained by matched primal and dual splits of the cubic lattice, yielding a self-dual degree-4 syndrome graph with hexagonal faces and cluster-state qubits of bond degree \(6\). The triamond FTCS uses a 3-split of the cubic lattice, giving a self-dual degree-3 syndrome graph, decagonal faces, and cluster-state qubits with \(10\) bonds. The doubled-edge cubic FTCS inserts a degree-2 vertex into each edge of both primal and dual lattices, producing octagonal faces and an interpretation in which each original cubic-FTCS qubit is encoded into a 2-qubit parity code; if each original edge is doubled, then \(p_E^{\text{eff}}=p_E^2\) and \(p_{\rm th}=\sqrt{0.249}\approx 0.5\), while \(n\)-segment divisions give \(p_{\rm th}=\sqrt[n]{0.249}\) with cluster-state valence \(4n\) [1810.09621]. The bulk schedule remains structurally simple across these examples: prepare the 3D cluster geometry, measure every bulk qubit in the \(X\) basis, reconstruct stabilizer parities from vertex incidences in the syndrome graph, decode defect pairs, and infer logical correlation operators as membrane-like connected surfaces of \(X\) operators. The significance is that error correction is geometrically embedded in the measurement record itself, rather than added by a separate syndrome-extraction circuit [1810.09621]. A second misconception follows from the foliated literature: that layered constructions are necessary for implementability. The beyond-foliation work states that self-dual FTCSs such as the cubic, diamond, triamond, and doubled-edge cubic constructions can still be prepared and measured layer by layer in a 2D physical architecture, including matter-based and photonic settings [1810.09621]. ## 4. Compressed schedules and detector-error-model synthesis One line of work reduces schedule length by replacing direct measurement of all \(r=n-k\) independent stabilizer generators with measurements of products or linear combinations of generators. If \(H_{r\times n}\) is the stabilizer or parity-check matrix and \(P_{r'\times r}\) is a classical parity-check matrix with \(r'