betaFeedback

WorksPhysics and Astronomy

Modular optical fault-tolerant quantum computation via an interface between verified resources and online logical operations

Abstract

We introduce a factory–processor interface architecture for modular optical fault-tolerant quantum computation that separates code-dependent encoded-resource preparation from reusable online logical processing on a common Gaussian optical processor. Beyond encoded resources, the interface specifies logical outputs, code-to-mode mapping, measurement roles, frame updates, verification records, and resource-injection boundaries. As a concrete realization, we combine an offline verified Bell-resource factory based on a recursively concatenated C4C_4 code with physical Gottesman–Kitaev–Preskill (GKP) qubits with an online time-domain measurement-based quantum computation (MBQC) processor. Under the specified additive-displacement-noise model and fixed postselection policy, simulations support the finite-level logical Bell-error ordering P5<P4<P3<P2P_5<P_4<P_3<P_2 at 12.25 dB of effective GKP displacement-noise quality, both with and without the prescribed additional post-injection displacement noise. At 15.6 dB and L=2L=2, a separate fixed-sample evaluation gives one-sided 95%\% Clopper–Pearson upper bounds below 10−510^{-5} for both conditions under the binomial model. The interface supports address-tracked injection, transversal CNOT and logical Bell-measurement constructions, and logical SWAP and Hadamard constructions with tracked code permutations. Given advance resource preparation and sufficient routing parallelism, increasing the concatenation level expands parallel encoded-resource width without increasing the protected online sequence length of these constructions. These results identify a modular route to lower logical error rates while retaining a common Gaussian MBQC operation set with shallow online processing.

Introduction

Quantum algorithms motivate computing systems that can sustain long quantum computations despite imperfect physical operations [1, 2]. Fault-tolerant quantum computation (FTQC) addresses this requirement through encoding, quantum error correction (QEC), and protected logical operations, with resource overhead depending on both the code and its implementation [3]. Hardware-aware FTQC architectures couple noise, resource supply, connectivity, and logical operations across superconducting and bosonic [4, 5], trapped-ion and neutral-atom [6, 7, 8, 9], and semiconductor platforms [10]. They motivate interfaces that specify more than code performance alone.

Optical FTQC poses a related question in measurement-based quantum computation (MBQC), where entangled resources, measurements, and feedforward realize logical operations [11, 12, 13]. Continuous-variable (CV) clusters generated from squeezed light and linear optics [14, 15, 16, 17] can be multiplexed in time; large cluster-state experiments and programmable Gaussian processing demonstrate this platform [18, 19, 20, 21, 22]. The quad-rail lattice (QRL) arranges time-domain-multiplexed (TDM) modes into macronodes whose measurement bases implement Gaussian processing and routing [23, 24, 25]. On this Gaussian platform, non-Gaussian GKP resources provide qubit encoding and analog displacement-syndrome information for higher-level decoding [26, 27, 28]. The input values quoted in decibels, including 12.25 and 15.6 dB, denote an effective GKP displacement-noise parameter rather than measured optical-source or cluster squeezing (Sec. II C). Recent propagating-state and integrated-source demonstrations advance optical GKP supply [29, 30]. Universal FTQC also requires non-Clifford resources; measurement-induced cubic operations exemplify related optical techniques [31, 32, 33, 34, 35].

Optical FTQC proposals span GKP topological and concatenated coding and more general CV noise [36, 37, 38, 39, 40, 41, 42, 43], as well as interleaving, switching-free organization, and all-optical feedforward [44, 45, 46, 47]. Complementary approaches address linear-optical and fusion-based computation [48, 49, 50, 51], modular networking and manufacturable hardware [52, 53], nonlinear photonics [54], and code-agnostic linear optics [55]. Verified teleportation ancillas and prepared-ancilla constant-depth Clifford circuits provide earlier foundations [56, 57, 58]. Our focus is the operation-aware factory–processor boundary that connects such resources to their online logical use.

A central architectural challenge in optical FTQC is to specify how verified encoded resources and their associated classical records are transferred from offline preparation to online logical operations on a Gaussian processor. A resource state and its estimated error rate alone do not fix this interface. The processor must identify the specified logical subsystem, pair physical code indices, assign measurement roles, and interpret byproducts during MBQC. In TDM, modes on the same rail can occupy different time bins, while a known permutation can change the output port carrying the intended state. Address and frame records must follow the quantum information, and verification outcomes and analog likelihoods must retain their meaning for the receiving decoder. When encoding, verification, or decoding changes, this boundary must continue to distinguish resource quality, operational compatibility, and execution cost. This factory–processor boundary differs from noisy links between separate quantum processing units investigated in Refs. [59, 60].

We formulate a factory–processor interface architecture comprising the designated encoded output, code-index-to-space–time addresses, measurement and frame rules, reliability records, and injection boundary. Compatibility requires matched quantum operations and classical updates for the intended logical action (Figure 1). Factories may differ in preparation, verification, decoding, logical error, acceptance, and cost while sharing the QRL Gaussian resource-state family and operation set; their address and control rules remain code dependent. The interface is particularly relevant to transversal logical operations: physical Gaussian measurement patterns are paired across corresponding code indices, with required code permutations and Pauli/Clifford byproducts explicitly tracked in the address and correction records. For the supported C4C_{4} Clifford constructions, this enables level-independent protected online measurement depth under advance resource preparation and sufficient address-preserving parallel capacity; transversality alone does not guarantee level-independent elapsed runtime.

Modular optical FTQC architecture and the verified-resource interface

Figure 1. Modular optical FTQC architecture and the verified-resource interface. (a) Encoded resources are prepared and verified in an offline factory and supplied to a common Gaussian MBQC processor. The interface associates the designated quantum resource with its mode addresses, measurement roles, frame information, and verification/reliability records; these classical records are specified in Sec. III and are not drawn as separate wires. (b) The two illustrated concatenation levels use the same interface schema with level-dependent block sizes, addresses, and decoding. The stack represents parallel encoded resources, not additional sequential measurement rounds. An unchanged protected online sequence is conditional on advance preparation, simultaneous execution, and address-preserving routing, as discussed in Sec. III F; it does not imply unchanged preparation time or elapsed runtime.

For a concrete realization, we combine GKP qubits with concatenated C4C_{4} blocks used as [[4,1,1,2]][[4, 1, 1, 2]] data–gauge subsystem codes in a Knill-type verified Bell-resource factory. Both the data and gauge degrees of freedom of the C4C_{4} stabilizer block are tracked, but only the designated DD-Bell pair is counted as the delivered output. A recursive decoder combines observable analog likelihoods, syndromes, verification outcomes, and tracked frames, building on soft-decision and concatenated-code decoding [28, 36, 61, 62]. Its reliability score determines binary acceptance under a schedule fixed before independent evaluation. Related resource-postselection approaches also use decoder information [63, 64]. The accepted resource and its associated records supply the inputs to the QRL injection and logical-operation constructions.

Two numerical results characterize the supplied resource under the specified additive-displacement-noise model. At 12.25 dB, the fixed-schedule evaluation shows logical-error reduction from L=2L = 2 through L=5L = 5 for both specified post-injection conditions; the claim is restricted to the evaluated finite levels and grid. At 15.6 dB and L=2L = 2, an independent fixed-sample confirmation gives one-sided 95% Clopper–Pearson upper bounds below 10−510^{-5} for the designated Bell-resource error, separately without and with the additional macronode-noise step. Throughout this comparison, decibels parameterize effective GKP displacement noise rather than directly measured source squeezing. The evaluated 14-dB level-3 and 15.6-dB level-2 points use nominal supplied-GKP counts of 3637.9 and 288, respectively. The within-factory comparison isolates the dependence of selected-resource cost on input quality; total-hardware and equal-input-quality benchmarking require separate accounting.

Sections II and III describe the architecture and interface; Sec. IV describes the factory and its decoder-based selection procedure. Section VI presents the principal numerical results, with statistical procedures, accounting, and auxiliary analyses in the Appendices. Section VII concludes.

Modular architecture for optical FTQC

Separation of the online Gaussian processor and offline encoded-resource factory

Figure 1 shows an offline encoded-resource factory alongside a continuously generated Gaussian QRL processor. The factory supplies verified resources and synchronized classical records; the processor consumes them through the interface introduced in Sec. III. As successive cluster modes are measured, quantum information propagates to subsequent time-bin modes through measurement-based teleportation. The common element is therefore the QRL resource-state family and Gaussian operation set, not fixed optical modes or a code-independent address allocation.

MBQC platform: 2D CV cluster states

We assume a large-scale two-dimensional cluster state generated from squeezed vacuum states using linear optics and time-domain multiplexing, as shown in Figure 2. Specifically, we adopt the macronode protocol based on the quad-rail lattice (QRL). Nearest-neighbor entanglement between macronodes is generated by Gaussian linear-optical networks with time delays, and homodyne measurement bases determine single-mode Gaussian gates, two-mode entangling operations, and routing operations. In this paper we use the configuration in Figure 2(a), with one logical-QEC/refresh port per macronode.

Schematic of the large-scale Gaussian MBQC platform

Figure 2. Schematic of the large-scale Gaussian MBQC platform based on a squeezed-vacuum 2D CV cluster. The proposed architecture employs the quad-rail lattice (QRL) with time-domain multiplexing, and Gaussian MBQC operations are implemented by homodyne measurements and classical feedforward. Fault-tolerant logical operations are supplied by verified GKP resources with higher-level qubit encoding injected into selected macronodes. Panels (a) and (b) show configurations with one and two logical-QEC/refresh ports per macronode, respectively; in this paper we consider the configuration in (a). The GKP waveforms in (a) and (b) show a matched pair of physical modes from the two encoded blocks of a verified C4_4/GKP Bell resource, rather than the entire encoded Bell pair. Panel (c) sketches the teleportation-based injection circuit for one such matched code index; the full encoded operation uses the corresponding physical-mode indices together with tracked classical frames and logical decoding.

The two-mode QRL gadget implements direct CV SWAP through four homodyne angles [25]. It also acts on GKP-encoded inputs and supplies the address-tracked SWAP construction of Sec. III F. Universal QC additionally requires appropriate non-Gaussian encoded resources (Sec. IV C). The QRL implements programmable but noisy Gaussian transformations. Teleportation-based injection localizes verification and repreparation to the offline factory without restarting the Gaussian-cluster stream. CV ZX calculus offers a complementary process-description language [65]; here the explicit QRL model keeps physical routing and macronode layers visible.

QEC with GKP qubits

Gottesman–Kitaev–Preskill (GKP) qubits provide a natural interface between CV optics and qubit-based fault tolerance. Small phase-space shifts are converted by

GKP digitization into correctable residual shifts and discrete Pauli-frame errors, while Gaussian operations and homodyne measurements provide the analog information used by the higher-level decoder.

For a square-lattice GKP code with spacing π\sqrt{\pi}, the probability that a Gaussian shift is digitized into the incorrect qubit bin is

Perr(σ)=∑k∈Z∫(2k+1/2)π(2k+3/2)πdξ 12πσ2exp⁡[−ξ22σ2].(1)P_{\mathrm{err}}(\sigma)=\sum_{k\in\mathbb{Z}}\int_{(2k+1/2)\sqrt{\pi}}^{(2k+3/2)\sqrt{\pi}}d\xi\,\frac{1}{\sqrt{2\pi\sigma^2}}\exp\left[-\frac{\xi^2}{2\sigma^2}\right]. \tag*{(1)}

We use [q^,p^]=i[\hat{q},\hat{p}]=i and vacuum variance 1/21/2. A Gaussian displacement with variance σ2\sigma^2 in either quadrature is assigned the numerical GKP displacement-noise level sGKP≡10log⁡10[(1/2)/σ2]=−10log⁡10(2σ2)s_{\mathrm{GKP}}\equiv10\log_{10}[(1/2)/\sigma^2]=-10\log_{10}(2\sigma^2) in decibels; for example, sGKP=12s_{\mathrm{GKP}}=12 means 12 dB. For a numerical dB argument ss, define σGKP2(s)≡1210−s/10\sigma_{\mathrm{GKP}}^2(s)\equiv\frac{1}{2}10^{-s/10} and use σGKP2≡σGKP2(sGKP)\sigma_{\mathrm{GKP}}^2\equiv\sigma_{\mathrm{GKP}}^2(s_{\mathrm{GKP}}) when the operating point is understood. We use this quantity only as the equivalent noise parameter of the additive-displacement model; it neither represents directly measured source squeezing nor specifies a state-generation protocol. Unless explicitly identified as optical-source or cluster squeezing, every reported GKP displacement-noise level in decibels refers to sGKPs_{\mathrm{GKP}}. The homodyne residual is retained as a log-likelihood ratio (LLR) and passed to the C4 decoder [26, 66, 67]. We denote one measured modular GKP residual by zz; the later symbol yprepy_{\mathrm{prep}} denotes the complete multi-outcome factory record and must not be confused with this scalar residual. For an accessible residual zz and the alternative binary error hypotheses b=0,1b=0,1, we fix the likelihood-ratio convention

ratio convention

ℓ(z)=log⁡p(z∣b=0)p(z∣b=1).(2)\ell(z)=\log\frac{p(z\mid b=0)}{p(z\mid b=1)}. \tag*{(2)}

The two likelihoods are obtained by summing the Gaussian-displacement density over the appropriate even and odd lattice cosets. For a chosen quadrature, b=0b=0 and b=1b=1 label the two GKP digitization-parity hypotheses (even and odd wrapped-lattice bins), not two different physical resource types. If the class priors are unequal, the log posterior odds additionally contain log⁡[P(b=0)/P(b=1)]\log[P(b=0)/P(b=1)]; a likelihood ratio must not be confused with posterior odds.

QEC with higher-level encodings

GKP digitization alone does not ensure a sufficiently small logical failure probability for long computations at realistic finite noise. A higher-level qubit code supplies parity constraints, repeated error detection and/or correction, and a route to stronger suppression when combined with an appropriate fault-tolerant preparation schedule. The factory–processor interface is not restricted to the particular higher-level code used below.

We use the four-qubit C4 stabilizer block [4, 2] in its [[4, 1, 1, 2]] subsystem interpretation: one protected information qubit DD is the designated data output, while the other encoded degree of freedom GG is treated as a tracked gauge qubit. The notation [[n,k,r,d]][[n,k,r,d]] specifies nn physical qubits, kk protected data qubits, rr gauge qubits, and dressed distance dd. After this distinction, we refer to the construction simply as the C4_4 code. The underlying two-qubit stabilizer space is unchanged; the chosen output/gauge roles are part of the interface contract.

A Pauli representative convention is

XˉD=X1X2,ZˉD=Z1Z3,XˉG=X1X3,ZˉG=Z1Z2,SX=X1X2X3X4,SZ=Z1Z2Z3Z4.(3)\begin{aligned} \bar{X}_{D} &= X_{1}X_{2}, \qquad\bar{Z}_{D} = Z_{1}Z_{3},\\ \bar{X}_{G} &= X_{1}X_{3}, \qquad\bar{Z}_{G} = Z_{1}Z_{2},\\ S_{X} &= X_{1}X_{2}X_{3}X_{4}, \qquad S_{Z} = Z_{1}Z_{2}Z_{3}Z_{4}. \tag*{(3)} \end{aligned}

These representatives commute with the stabilizers; the data and gauge algebras commute with each other. The accepted logical Bell pair on DD is the only certified output. Gauge information is propagated for parity, frame, and role tracking, not independently credited as a second output. A physical permutation that exchanges DD and GG requires an explicit output-role reassignment and does not, by itself, guarantee protection of arbitrary information initially residing in the gauge degree of freedom. Appendix B 1 supplies the full code construction. A logical Pauli-error class on the designated data qubit is the action of XˉDxZˉDz\bar{X}_{D}^{x}\bar{Z}_{D}^{z}, with (x,z)∈{0,1}2(x,z) \in\{0,1\}^{2}, modulo irrelevant global phases, stabilizers, and gauge-equivalent representatives. We denote its four possible labels by AD={ID,XD,YD,ZD}A_{D} = \{I_{D}, X_{D}, Y_{D}, Z_{D}\}, and the analogous gauge alphabet by AG={IG,XG,YG,ZG}A_{G} = \{I_{G}, X_{G}, Y_{G}, Z_{G}\}; the identity class is 0, and ⊕\oplus denotes bitwise addition of their (x,z)(x,z) labels modulo two. A class label is an error hypothesis, not a child-resource type or physical slot. For joint data–gauge diagnostics the label space is AD×AGA_{D} \times A_{G} (16 possible pairs), without implying statistical independence between the two degrees of freedom.

GKP analog information and soft-decision decoding

GKP homodyne residuals supply likelihoods or LLRs in addition to digitized outcomes. Soft-decision decoding retains this information when estimating the logical Pauli class. Known measurement-dependent displacements and discrete corrections are tracked deterministically; uncertainty concerns the residual error, not the recorded correction command. Physical GKP correction and C4_4-level correction or refresh remain quantum operations at their specified circuit locations. Soft-decision decoding and teleportation-based recursive Bell-state preparation are established ingredients, including the Fibonacci post-selection analysis of Aliferis and Preskill and the C4/C6 soft decoder of Goto and Uchikawa [61, 68]. The present contribution does not claim to invent soft decoding; it specifies the measurement-accessible, confidence-ranked selection record at an optical factory–QRL boundary and qualifies the designated data-Bell output under a declared noise protocol. No same-noise benchmark against those earlier decoders is claimed. Section III defines the correction records, and Sec. IV D specifies the recursive classical decoder and candidate selection.

Interface between verified resources and online logical operations

The interface separates what the processor consumes, how matched operations and records realize a logical action, and how well a particular factory supplies the resource. Depth is an operation-dependent execution property, not part of compatibility itself. We distinguish four mathematical objects throughout: the physical completely positive, trace-preserving (CPTP) preparation and macronode (MN) noise maps Nprep\mathcal{N}_{\mathrm{prep}} and NMN\mathcal{N}_{\mathrm{MN}}, the outcome-resolved quantum measurement instrument {Ey}\{\mathcal{E}_y\}, the classical decoder D:y↦pL(a∣y)\mathcal{D}: y \mapsto p_L(a \mid y), and the accepted residual-Pauli error distribution Pres,L(e∣AL=1)P_{\mathrm{res},L}(e \mid A_L = 1). Only under the stated ideal-teleportation/Pauli-diagonal assumptions does the last distribution define an estimated logical Pauli-channel model ΛLR(L)\Lambda_{\mathrm{LR}}^{(L)}. Here AL=1A_L = 1 means that the level-LL candidate is retained under the declared selection rule; aL∈ADa_L \in\mathcal{A}_D is its unknown logical Pauli class before the decoder’s predicted correction a^L\hat{a}_L, eL=a^L⊕aLe_L = \hat{a}_L \oplus a_L is the residual error class, and ELE_L is the event eL≠0e_L \ne0 on the designated data Bell pair. The acceptance event AL=1A_L = 1 and the failure event ELE_L are distinct.

Interface specification and requirements

We distinguish the interface specification from a factory’s measured performance. The logical-resource interface is

ILR=(Rlog,Amode,Mlog,F,V,∂inj),(4)I_{\mathrm{LR}} = \left(R_{\mathrm{log}}, A_{\mathrm{mode}}, M_{\mathrm{log}}, F, V, \partial_{\mathrm{inj}}\right), \tag*{(4)}

The interface tuple is code-independent and defines compatibility rather than measured performance. The recursive decoder record RL\mathcal{R}_L in Eq. (9) describes one candidate; the separate SLS_L below summarizes its accepted-output population under a specified selection and evaluation protocol. Here RlogR_{\mathrm{log}} specifies the encoded resource type, AmodeA_{\mathrm{mode}} assigns code indices to optical space–time addresses, and MlogM_{\mathrm{log}} specifies the measurement or teleportation operation. The correction-record schema FF distinguishes a known CV displacement vector dCV∈R2n\mathbf{d}_{\mathrm{CV}} \in\mathbb{R}^{2n} for nn modes, physical-GKP Pauli-frame bits, and the encoded logical Pauli frame (with a Clifford frame when required). MBQC byproducts identify the measurement-dependent origin of such corrections, not an additional independent error. Lattice corrections transferred from the CV record to a Pauli frame are composed once. The schema VV contains verification observations and decoder-reliability information; ∂inj\partial_{\mathrm{inj}} marks the preparation/online boundary. Compatible factories may differ in error, acceptance, and preparation time.

For the declared numerical scope, a level-LL accepted-resource population is characterized by

SL=(PL,CIL,Pacc(L),RLGKP),(5)S_L = \left(P_L, \mathrm{CI}_L, P_{\mathrm{acc}}^{(L)}, R_L^{\mathrm{GKP}}\right), \tag*{(5)}

Throughout the factory characterization, yprepy_{\mathrm{prep}} denotes accessible GKP homodyne residuals, verification/Bell outcomes, syndromes, and known addresses, frames, and pre-declared derived features. The index a∈{I,X,Y,Z}a \in\{I, X, Y, Z\} denotes one of four residual data-Bell Pauli hypotheses prior to the predicted correction. We write pL(a∣yprep)p_L(a \mid y_{\mathrm{prep}}) for their normalized, decoder-estimated class-score distribution; it is not automatically a calibrated conditional error probability, nor is it a distribution over unobserved simulator variables. The separate record yposty_{\mathrm{post}} contains additional online measurement outcomes. Here PL=Pr⁡(EL∣AL=1)P_L = \Pr(E_L \mid A_L = 1) is the selected-output logical-error probability, CIL\mathrm{CI}_L its stated confidence or credible interval, as specified by the statistical method, Pacc(L)=Pr⁡(AL=1)P_{\mathrm{acc}}^{(L)} = \Pr(A_L = 1) the acceptance probability at the generated-candidate boundary, and RLGKPR_L^{\mathrm{GKP}} the declared nominal supplied-GKP count (Appendix E2). The reported estimates and intervals arise from the independent evaluation counts under their declared statistical conventions. The candidate-specific decoder scores and verification record are components of RL\mathcal{R}_L, not entries of the population record. The separate estimated Pauli-diagonal model ΛLR(L)\Lambda_{\mathrm{LR}}^{(L)}, derived from accepted residual classes under ideal teleportation (Appendix B4), is not a fitted physical noise process; preparation latency and actual delivered-factory cost are not reported as measured fields of SLS_L.

The specification is used through six compatibility requirements:

  1. Resource compatibility. The accepted resource has the declared encoded type and designated logical subsystem, characterized at ∂inj\partial_{\mathrm{inj}}.

  1. Index/address compatibility. Physical code index ii is mapped to αi=(ri,τi)\alpha_i = (r_i,\tau_i), with rir_i a spatial optical rail and τi\tau_i a time-bin index; required pairings and known permutations remain explicit in AmodeA_{\mathrm{mode}}. Rail reuse at different times does not identify the modes because the ordered pair is the address.

  1. Measurement-role compatibility. Each participating mode has a declared injection, teleportation, logical-measurement, or routing role, with a defined interpretation of its outcome.

  1. Frame composability. Known CV displacements and discrete Pauli/Clifford corrections are composed through FF, with their representation changes tracked without double counting.

  1. Verification/reliability compatibility. Syndrome, analog, class-score, and reliability records

retain their declared meaning for the consuming decoder or subsequent logical operation.

(vi) Operation compatibility. The matched quantum operations, measurements, decoding, and address/frame updates together realize the intended encoded action.

These requirements enforce consistency at the resource-to-operation boundary. A noise-inclusive fault-tolerance guarantee requires additional performance characterization. The common element is the Gaussian QRL resource-state family and operation set. A replacement code may require different preparation, routing, buffering, decoding, measurement, or control rules, and its performance record must be characterized separately.

Compatible factories and code-dependent implementation

Candidate factories based on Calderbank–Shor–Steane (CSS) codes, other stabilizer codes, or quantum low-density parity-check (qLDPC) codes must supply and characterize the resource, measurement, address, frame, and reliability elements above for their intended operations [55, 69]. Compatible factories can supply the same declared logical role while differing in error, acceptance, preparation time, and cost. Operational equivalence is stronger: it additionally requires the same conditional logical channel and classical-record distribution at ∂inj\partial_{\mathrm{inj}}.

Compatibility and bounded online depth are separate properties. A replacement code with an O(d)O(d) logical-measurement protocol may remain compatible with the Gaussian processor while losing the O(1)O(1) depth property. Address, measurement, decoding, and control rules must be re-established when the encoding changes.

Composability and the logical-state boundary

An accepted encoded Bell pair is an ancilla, distinct from the teleported data. An online operation combines encoded-resource injection, QRL measurements, and measurement-conditioned classical processing and corrections. The corresponding quantum-instrument composition and its register definitions are given in Appendix D, Eq. (57). This composition specifies the interface; it does not constitute a noisy online logical-gate evaluation. Teleportation and refresh preserve the output register type, not its state. Destructive Bell measurements produce classical outcomes, and the surviving teleported register is tracked separately.

With ideal logical Bell measurements and frame corrections, a Pauli-diagonal encoded Bell resource represents the Choi state of the induced logical teleportation channel; its four logical-Pauli probabilities determine that channel. Noisy injection and subsequent operations require their own channel characterization. Repeated-cycle exclusive-OR (XOR) convolution is used only as a consistency diagnostic when cycles are stationary and memoryless, accepted ancillas are independent, and the residual channel is Pauli-frame diagonal; a complete noise analysis of an online logical operation instead requires composition of the corresponding measurement-conditioned instruments (Appendix D), which is beyond the present Bell-resource numerical evaluation.

Logical-state injection

Verified encoded resources are coupled to selected macronodes by teleportation-based injection. The physical GKP modes are matched to their corresponding code indices, and the homodyne outcomes supply displacement and Pauli/Clifford updates. Analog residuals and C4_4 syndromes are decoded into logical Bell outcomes and reliability records; residual Pauli uncertainty remains a logical-error contribution after the known address and correction updates.

The index mapping is essential: arbitrary physical controlled-Z (CZ) wiring does not automatically implement a logical CZ. For each supported construction, a physical QRL instruction acts on a GKP-encoded mode or matched mode pair; transversal use across the C4_4 physical indices is then interpreted through the data/gauge Pauli representatives and the updated address and correction frame. The existence of this ideal logical map does not itself certify a noisy online logical gate. Required pairings and any intra-block permutation must be implemented or tracked explicitly. Table I specifies the mapping i↔αi=(ri,τi)i \leftrightarrow\alpha_i = (r_i,\tau_i), which permits rail reuse across the finite bins without losing the intended transversal pairing.

Interface requirementOperational definition
Address assignmentEach physical index ii of an encoded block is assigned to a declared QRL space–time address αi=(ri,τi)\alpha_i=(r_i,\tau_i).
Time-domain reuseA spatial rail may carry different modes at different time bins, but the full space–time address remains part of the logical-resource record.
Transversal pairingFor two-block transversal operations, corresponding physical indices are paired as Ai↔BiA_i \leftrightarrow B_i, with i=0,…,nL−1i=0,\ldots,n_L-1 for a block of nLn_L physical modes (nL=4Ln_L=4^L in the present C4_4 realization).
Permutation trackingIf routing or a code automorphism introduces i↦π(i)i\mapsto\pi(i), the address record is updated explicitly before the next logical operation. An untracked intra-block permutation is not permitted because it can change the intended physical pairing and logical-subsystem action.
Classical interface recordKnown address changes and Pauli/Clifford byproducts are tracked classically. Their bookkeeping does not constitute an additional protected QRL/macronode layer, although controller latency and feedforward are accounted for separately.

Table I. Address-preserving interface contract between an offline encoded resource and the online QRL/MBQC processor. The contract preserves the physical-index pairing required by transversal encoded operations while allowing optical rails to be reused across time bins. These routing and bookkeeping requirements support the online operations in Figure 1; they are not additional quantum operations.

Logical-operation constructions and their scope

Table II gives the physical QRL instruction, encoded C4_4 action, and classical record for each supported construction. Detailed measurement patterns are in Appendix § 1.2.6, with routing and parallelism assumptions specified by Criterion F.1. Here SUM denotes the continuous-variable controlled-sum gate.

Logical operationQRL instruction and encoded actionClassical record and outputConstruction and evaluated scope
Injection / teleportationBell-type homodyne injection of matched GKP modes using an accepted encoded Bell resource.Addresses, homodyne outcomes, GKP likelihoods, and C4_4 decoding update the surviving data frame and reliability.Interface and injection construction, Secs. III C–III D; resource-output evaluation in Sec. VI.
Logical-subsystem SWAPA QRL SWAP instruction (four homodyne angles) implements parallel SWAP23_{23} permutations, exchanging the DD and GG ports.Track Din↦GoutD_{\mathrm{in}}\mapsto G_{\mathrm{out}} and its frame, rather than retaining a fixed output-port label.One-layer benchmark: DprotSWAP=1D_{\mathrm{prot}}^{\mathrm{SWAP}}=1, Eq. (6).
HadamardA QRL Fourier instruction with the tracked permutation gives HˉDHˉG=SWAP23H⊗4\bar{H}_D\bar{H}_G=\mathrm{SWAP}_{23}H^{\otimes4} in the stated C4_4 convention.Compose Fourier/Clifford byproducts and the address permutation to preserve the logical labels.Fixed-length construction, Appendix F.
CNOTParallel QRL SUM–SWAP on index-matched GKP modes gives CNOTs on DA→DBD_A\rightarrow D_B and GA→GBG_A\rightarrow G_B and exchanges the output registers.Track block pairing, output exchange, and Pauli/Clifford frames.Logical map and fixed-length construction, Appendices B.3 and F.
Logical Bell measurementPhysical GKP Bell/homodyne measurements and C4_4 parity decoding provide logical Bell outcomes.Logical outcomes and reliability; update any surviving teleportation output separately.Measurement/decoding construction, Appendix F.

Table II. Logical actions and classical records at the C4_4/GKP–QRL interface. The ideal maps and tracked corrections follow Appendix F, with advance resource availability and parallel routing as in Criterion F.1. Only SWAP is assigned a numerical depth here. The independent error qualification applies to the designated Bell resource before or after the specified identity-teleportation noise, not to all listed operations.

For example, SWAP23_{23} exchanges the C4_4 data (D)(D) and gauge (G)(G) ports, so the data label follows Din↦GoutD_{\mathrm{in}} \mapsto G_{\mathrm{out}} rather than a fixed physical DD port. Recording this permutation identifies the routed output while leaving physical routing and residual logical error to be treated explicitly (Appendices B1 and B3).

Non-Clifford resources fit the same interface, but their preparation and distillation are outside the numerical analysis (Sec. IV C).

Parallel resource stacking and online execution

The benefit of the stacked arrangement in Figure 1(b) is that protection can be increased by enlarging the parallel encoded-resource block while reusing a fixed-length QRL measurement pattern. For the constructions considered here, corresponding physical operations are assigned to matched code-index addresses. Increasing the level replicates those operations across a larger block, rather than appending sequential measurement stages. The interface preserves the pairings, frames, and output addresses needed to interpret these parallel operations as the intended logical action. This makes verified-resource supply and parallel optical capacity explicit scaling parameters while retaining a common Gaussian operation set.

Protected online measurement depth counts sequential QRL/macronode measurement layers acting on encoded data. Classical correction-record processing is excluded from this layer count and included separately in latency. With resources available in advance, concurrent disjoint operations, and address-preserving routing, the native QRL SWAP construction implements the C4_4 permutation SWAP23_{23} in one layer:

DprotSWAP=1(6)D_{\mathrm{prot}}^{\mathrm{SWAP}}=1 \tag*{(6)}

The output record follows Din↦GoutD_{\mathrm{in}}\mapsto G_{\mathrm{out}} so that data identity is not confused with a fixed physical port. This circuit property is evaluated separately from the Bell-resource failure counts. A transversal layer still contains 4L4^L physical operations, and resource preparation and classical decoding can grow with LL. If parallel capacity is fixed, TDM batches can serialize the layer; shallow protected depth therefore does not alone fix preparation latency, elapsed runtime, or throughput. Appendix § 1.2.6 gives the measurement patterns and full execution criterion; Appendix § 1.2.6 § 3.3.4 gives the width, timing, and supply-rate relations.

C4/GKP encoded-resource factory

The factory supplies the quantum resource and classical records required by Sec. III. Its C4_4/GKP realization is the case study evaluated in § 2.

Preparation and twelve-child verification

Figure 3(a) shows level-1 preparation: physical GKP Bell pairs, generated from elementary GKP and qunaught resources (qunaughts are noncomputational GKP grid states), are assembled into a C4_4/GKP block-pair resource by logical Hadamard/CNOT operations and verified by logical Bell measurements. We call a completed level-LL encoded Bell-resource candidate, together with its known frame and measurement-derived reliability record, a child when it serves as one input to the construction of a level-(L+1)(L+1) parent candidate. A child is not an individual physical C4_4 qubit, and child “classes” must not be confused with the logical Pauli-error classes ADA_D defined in Sec. II. At higher levels, a candidate consumes twelve child resources (Nchild=12N_{\mathrm{child}}=12) in one data group and two verification groups,

C4/GKP Bell-resource factory

Figure 3. C4/GKP Bell-resource factory. (a) Physical GKP Bell pairs are assembled into a level-1 C4/GKP Bell resource by the logical Hadamard/CNOT preparation circuit and verified by logical Bell measurements. (b) Twelve level-LL child resources, arranged as one data group and two verification groups, prepare and verify a level-(L+1L+1) candidate. The accept/reprepare decision is schematic: the 12.25-dB numerical output selection applies a batchwise rank quota rather than a fixed per-candidate risk cutoff (Appendix E 1 a). The child records and new verification outcomes determine its decoder class-score record and binary accept/reprepare decision. The tuple in the diagram abbreviates Eqs. (9) and (10); the 12 input boxes are level-LL resources, whereas a “class” is a possible residual logical Pauli error on such a resource; PL=Pr⁡(EL∣AL=1)P_L = \Pr(E_L \mid A_L = 1) and Pacc=Pr⁡(AL=1)P_{\mathrm{acc}} = \Pr(A_L = 1). Non-Clifford-resource preparation is outside this figure.

{B1(D),…,B4(D)},{B1(A),…,B4(A)},{B1(B),…,B4(B)}.(7)\left\{B_1^{(D)},\ldots,B_4^{(D)}\right\},\qquad \left\{B_1^{(A)},\ldots,B_4^{(A)}\right\},\qquad \left\{B_1^{(B)},\ldots,B_4^{(B)}\right\}. \tag*{(7)}

In this notation, Bj(g)B_j^{(g)} is the level-LL Bell resource occupying slot j∈{1,2,3,4}j\in\{1,2,3,4\} of group g∈{D,A,B}g\in\{D,A,B\}. The three groups name one data-bearing preparation group (g=Dg=D) and two verification groups (g=A,Bg=A,B); these are circuit roles, not three code types or three error classes. The group superscript (D)(D) is a preparation role and should not be confused with the protected data-qubit subsystem DD. Each group’s four children are ordered by their assigned circuit slots; the 12 records enter the parent decoder with those slot identities preserved. A root is the completed top-level candidate whose designated DD Bell output is finally evaluated. Each child supplies its optical state, tracked frame, and reliability record. The fixed teleportation-and-verification network combines these records with new homodyne and syndrome outcomes to form the parent class-score distribution. Exact parity relations, child-slot topology, and address/frame transformations are retained; the decoder and binary acceptance rule are defined in Sec. IV D. Accepted outputs have the same interface resource type at each level. In the numerical implementation, verification outcomes enter the decoder without an additional syndrome-only hard-rejection gate. Confidence selection acts on completed level-wise outputs, not recursively on every internal child (Appendix E 1a); its nominal cost penalty is specified separately in Appendix E 2.

Optical implementation

The layout combines a continuously generated QRL cluster, offline GKP Bell-resource modules, and C4_4 encoding/verification modules. The latter use squeezed-ancilla-assisted quantum-nondemolition (QND) / SUM operations, homodyne detection, and classical feedforward [70, 71, 72]. In the infinite-ancilla-squeezing and unit-gain limit, the physical operation is

USUM=exp⁡(−iq^Cp^T),(8)U_{\mathrm{SUM}}=\exp\left(-i\hat{q}_{C}\hat{p}_{T}\right), \tag*{(8)}

which implements GKP controlled-X (CX, or CNOT) up to the stated Fourier and frame conventions. Finite ancillary squeezing contributes to the preparation channel; additional macronode noise is applied separately after resource preparation. Source mechanisms, component context, and the noisy physical gate are described in Appendix A. The numerical resource metric counts supplied GKP qunits, not a sum of detector, switch, gate, storage, and controller costs.

Universality via magic-state injection

The evaluated factory prepares Clifford-type Bell resources. A non-Clifford operation can be supplied by an encoded magic state prepared offline and consumed through logical Bell measurement and frame update [73, 74]. The interface accommodates this route, although magic-state preparation and distillation costs are outside the reported numerical resource counts. Optical non-Gaussian implementation routes are summarized in Appendix A 3.

Factory-side soft-information decoding and resource selection

Knill-type circuits provide verification measurements [56, 57]. Here qL∈(0,1]q_L \in(0,1] is the prescribed fraction of generated level-LL candidates retained by the declared selection policy. Here, verification means assessing each candidate Bell resource from its observed syndromes and analog GKP measurements. For qL<1q_L < 1, we retain the candidates with the lowest decoder-estimated risk; for qL=1q_L = 1, all generated candidates are retained. No additional pass/fail test requiring every syndrome to vanish is imposed. The fitted decoder assigns four class scores from measurement-accessible factory records. In the frozen-tree inference path, multiclass scores are combined into the designated Bell-Pauli distribution and the

known Pauli frame is applied deterministically. Selection-policy calibration means choosing the decoder/risk configuration and retained fractions on non-test data and fixing them before independent evaluation. The resulting rL=1−max⁡apL(a∣y)r_L = 1 - \max_a p_L(a \mid y) is a candidate-ranking score; no additional post-hoc probability-remapping step is used in this specified construction. Appendix D 3 specifies the classical procedure; the distinct physical MN noise model is given in Appendix C. Appendix Fig. 6 summarizes the decoder and the separation between calibration and independent evaluation.

Recursive record and logical output

A level-LL resource carries

RL=(pL(a∣y),fLknown,rL,sL,Amode,L),(9)\mathcal{R}_L = \left(p_L(a \mid y), f_L^{\mathrm{known}}, r_L, s_L, A_{\mathrm{mode},L}\right), \tag*{(9)}

Here pL(a∣y)p_L(a \mid y) is the normalized decoder class-score distribution for the accessible record y=yprepy = y_{\mathrm{prep}} defined in Sec. III, and fLknownf^{\mathrm{known}}_L is the encoded Pauli frame after lower-level deterministic updates. The candidate-ranking score rL=1−max⁡apL(a∣y)r_L = 1-\max_a p_L(a\mid y) is smaller for more confidently classified candidates. The syndrome record sLs_L and mode-address record Amode,LA_{\mathrm{mode},L} complete the tuple. (5) summarizes independent population-level error and acceptance statistics, while RL\mathcal{R}_L is updated for each candidate. Candidate-level class scores do not themselves yield a Clopper–Pearson bound on the selected population. Twelve child records and new verification outcomes produce

RL+1=DL+1soft(RL,1,…,RL,12,yL+1new).(10)\mathcal{R}_{L+1}=\mathcal{D}^{\mathrm{soft}}_{L+1}\left(\mathcal{R}_{L,1},\ldots,\mathcal{R}_{L,12},y^{\mathrm{new}}_{L+1}\right). \tag*{(10)}

Here RL,j\mathcal{R}_{L,j} is the complete record of the child in ordered slot jj, and yL+1newy^{\mathrm{new}}_{L+1} consists of newly acquired parent-level verification syndromes sL+1s_{L+1}, measured analog/Bell outcomes, and specified slot/address updates. The child Pauli-class labels are latent hypotheses summarized in these records, not measured child identities; no new parent-level outcome is silently omitted from the map’s argument.

C4_4 parity constraints, Bell-stabilizer quotienting, child-slot permutations, and deterministic frame composition are handled exactly. The map DL+1soft\mathcal{D}^{\mathrm{soft}}_{L+1} updates classical records; a fitted predictor estimates the remaining class scores from measurement-accessible information. It is not a quantum channel. For the independent level-2 confirmation it is a fixed probabilistic tree ensemble; training, selection-policy calibration, and confirmation use disjoint data. At a parent node, the specified recursive decoder consumes twelve ordered child records, newly measured verification bits and analog likelihoods, and known slot permutations. It (i) propagates allowed C4_4 parity/Bell-stabilizer constraints and known frames exactly; (ii) forms or updates the compatible error-class likelihood sums (log-sum-exp at the physical/C4_4 parity stage); (iii) supplies the resulting observable features to the frozen side-specific multiclass predictors, whose outputs are mapped to four Bell-Pauli class scores as in Eq. (58); (iv) applies the known frame and normalizes pL+1(a∣y)p_{L+1}(a\mid y), recording rL+1=1−max⁡apL+1(a∣y)r_{L+1}=1-\max_a p_{L+1}(a\mid y); and (v) applies the predeclared candidate-ranking rule. These steps define the components of DL+1soft\mathcal{D}^{\mathrm{soft}}_{L+1} without assuming statistical independence among the twelve child errors. Hidden physical-error labels are not decoder inputs. Appendix D specifies the map and auxiliary diagnostics; physical-to-logical likelihood rules are given in Appendix B 2 a.

The residual error is eL=a^L⊕aLe_L=\hat{a}_L\oplus a_L after the final deterministic frame update, where aLa_L is the true logical Pauli class and a^L\hat{a}_L is the decoder’s correction. A logical failure is eL≠0e_L\ne0 on the designated data Bell subsystem. Known corrections are not treated as unknown faults; the full residual-channel definition is given in Appendix B 4.

Binary selection using decoder-estimated risk

At 12.25 dB, qLq_L is the prescribed fraction retained from generated candidates within each replicate, level, and MN condition. A replicate is one separately ranked candidate batch for a fixed level and noise condition, and MM denotes the number of generated candidates in that batch (M=500M=500 for the stated level-2–4 ordering batches). Candidates are ranked by increasing risk; max⁡{1,⌈MqL⌉}\max\{1,\lceil Mq_L\rceil\} of MM candidates are retained. At the reported batch sizes this gives discard fraction 1−qL1-q_L. This quota fixes no numerical risk cutoff.

For the declared candidate-selection rule, the selected-output error probability and the candidate-level retention probability are

PL(qL)=Pr⁡(EL∣AL=1),Pacc(L)(qL)=Pr⁡(AL=1).(11)P_L(q_L)=\Pr(E_L\mid A_L=1),\qquad P_{\mathrm{acc}}^{(L)}(q_L)=\Pr(A_L=1). \tag*{(11)}

Acceptance is binary; the fitted decoders, retained fractions, and tie rules are fixed before evaluation. At qL=1q_L=1, all generated candidates in the soft-verification mode are retained. Resource errors and experimental source losses remain possible. The reported acceptance is defined relative to the generated-candidate boundary rather than as a source-to-processor delivery probability. Appendices E 1a and E 3 specify the numerical selection rules; Appendix E 2 distinguishes nominal cost from complete expected consumption.

Online injection and decoding interface

Section IV characterizes preparation: the offline factory creates Bell candidates, propagates their analog and syndrome records, performs final resource GKP correction, and retains candidates according to the declared policy. The consuming processor instead acts on the injected data and produces new measurement outcomes. Its decoder must update the logical frame in the presence of those outcomes; the present numerical results do not constitute a separately simulated, end-to-end noisy online-gate qualification.

Accessible online record and logical correction

Let yprepy_{\mathrm{prep}} denote the frozen record delivered with the accepted DD-Bell resource. After injection, yposty_{\mathrm{post}} contains newly available Bell/homodyne quadratures and modular residuals, measured syndrome outcomes where prescribed, and the known address, gauge-role, and Pauli/Clifford-frame changes. An online decoder may evaluate

pon(a∣yprep,ypost,Fknown)(12)p_{\mathrm{on}}\left(a\mid y_{\mathrm{prep}},y_{\mathrm{post}},F_{\mathrm{known}}\right) \tag*{(12)}

for the residual data-Pauli class aa. The factory record is conditioned on rather than counted as a new independent measurement. A measured GKP modular residual enters as an even/odd wrapped-Gaussian likelihood, not as an idealized hidden displacement or error label. The C4 parity constraints then map those physical likelihoods and the Bell outcomes to a data-qubit four-class score distribution, followed by deterministic frame/address composition and a declared correction or logical-outcome interpretation.

Operational decoding sequence and scope

For clarity, a possible measurement-accessible online processing contract is:

  1. Acquire the new Bell/homodyne outcomes and compute modular residual likelihoods under the specified physical noise convention.

  • (ii) Condition on the delivered factory record without reusing its analog samples as statistically fresh evidence; propagate C4 parity constraints and any tracked data–gauge role permutation.

  • (iii) Infer the four-class residual data-Pauli estimate using the decoder assigned to this measurement instrument and update the known Pauli/Clifford frame.

  • (iv) Report the logical outcome and its reliability; a physical logical correction/refresh is performed only where the circuit explicitly calls for it.

This is an interface specification for applying analog information after injection. Its online conditional model, calibration and noise-inclusive gate failure rate are not established by the frozen Bell-resource decoder or its independent 15.6-dB samples.

The ideal identity/Bell-type homodyne injection, Fourier–permutation, index-matched SUM–SWAP, and GKP Bell-measurement instructions are mapped to their C4_4 actions and frame updates in Table II. These instructions use the new online measurement record described above; their QRL patterns appear in Appendix § 1.2.6.

Numerical characterization of the supplied verified resource

We generate noisy Bell-resource candidates, apply final GKP correction and frozen classical decoding, select the prescribed outputs, and count residual Pauli failures on the designated data subsystem. Preparation includes GKP displacement noise and finite-ancilla-squeezing QND/SUM noise. The MN-noise-off and MN-noise-on conditions differ only by a prescribed single-step additive-displacement channel applied after resource preparation. The off condition adds no additional displacement noise, whereas the on condition adds independent Gaussian displacements with variance 4×10−2/10σGKP2(sGKP)4 \times10^{-2/10}\sigma_{\mathrm{GKP}}^{2}(s_{\mathrm{GKP}}) in each relevant quadrature; the factor 10−2/1010^{-2/10} corresponds to a 2 dB increase in the reference GKP noise-quality parameter. Both conditions retain preparation noise and final GKP correction. This effective noise step is distinct from a device-calibrated macronode gate-noise model (Appendix C1). For the headline physical-coordinate test, the order is candidate preparation and recording, the additional displacement draw (MN on only), final physical GKP correction, and fixed logical decoding, followed by the declared candidate selection and the designated-output failure test. Preparation-stage record updates are distinct from this final decoder pass.

Finite-level contraction criterion near 12 dB

For the fixed retained-fraction schedule (q2,q3,q4,q5)=(1,0.70,0.960,1.0)(q_2,q_3,q_4,q_5)=(1,0.70,0.960,1.0), per-replicate selection at 12.25 dB (Appendix E1a) gives selected-sample estimates exhibiting

P5(m)<P4(m)<P3(m)<P2(m).(13)P_{5}^{(m)} < P_{4}^{(m)} < P_{3}^{(m)} < P_{2}^{(m)}. \tag*{(13)}

separately for MN off and on, with m∈{off,on}m \in\{\mathrm{off},\mathrm{on}\} denoting the prescribed additional-noise condition and PL(m)P_{L}^{(m)} the corresponding selected-output failure probability. Here PS abbreviates postselection, and PS, prep designates the selected preparation-only Bell-resource error, while MN, post denotes the corresponding error with the specified extra MN displacement and final GKP correction:

PL(m)≡{PLPS,prep,m=off,PLMN,post,m=on.(14)P_{L}^{(m)} \equiv \begin{cases} P_{L}^{\mathrm{PS,prep}}, & m=\mathrm{off},\\ P_{L}^{\mathrm{MN,post}}, & m=\mathrm{on}. \end{cases} \tag*{(14)}

The generated-candidate retention fractions are 100%, 70%, 96%, and 100% at L=2,3,4,5L=2,3,4,5, respectively. The Jeffreys-posterior probabilities of the strict ordering are 0.99998 and 0.99981, respectively (Appendix E1). Figure 4 shows the level dependence. At L=5L=5, no failures are observed in 15,000 accepted samples for either condition, giving a one-sided 95% Jeffreys limit of 1.28×10−41.28 \times10^{-4}; this bound neither establishes zero error nor constitutes a 10−510^{-5} qualification. Because decoder configurations and retained candidate populations can differ between the two MN conditions, their selected-output error rates do not provide a controlled comparison of the added physical noise under an identical decoder and selection rule.

Finite-level logical-error contraction plots at 12.25 dB

Figure 4. Finite-level logical-error contraction at 12.25 dB for (q2,q3,q4,q5)=(1,0.70,0.96,1)(q_2,q_3,q_4,q_5)=(1,0.70,0.96,1). Confidence selection is applied within each replicate; q5=1q_5=1 retains all level-5 candidates. The L=2L=2–44 estimates have 95% Jeffreys intervals; the L=5L=5 downward markers are one-sided 95% Jeffreys limits from 0/15,000 accepted samples in each condition. The Jeffreys-posterior ordering probabilities for P5<P4<P3<P2P_5<P_4<P_3<P_2 are 0.99998 (MN off) and 0.99981 (MN on). These selected-output results support the stated finite-level ordering under the statistical model of Appendix E 1, not a 10−510^{-5} tail.

The adjacent 12.125-dB point does not pass the ordering criterion for both conditions; the evaluated-grid transition is

12.125 dB<srec,grid⋆≤12.25 dB.(15)12.125\ \mathrm{dB} < s_{\mathrm{rec,grid}}^{\star} \le12.25\ \mathrm{dB}. \tag*{(15)}

Accordingly, the result is a fixed-schedule, finite-level grid criterion rather than a continuous physical threshold or conventional physical–logical pseudothreshold. The native level-1 source uses a different preparation map and is not part of this recursive ordering test. Figure 5 gives the displacement-noise dependence and separate sparse L=5L=5 support points; their statistical role is detailed in Appendix E1d.

Logical Bell-error probability versus GKP displacement-noise level

Figure 5. Logical Bell-error probability versus GKP displacement-noise level for the fixed schedule. The retention fractions denote the declared numerical rank-selection schedule, not a fixed streaming confidence threshold. Panels (a) and (b) show MN noise off and on. L=2L=2–44 estimates have 95% Jeffreys intervals. The sparse L=5L=5 support points are restricted to 11.75 and 12.00 dB: inverted triangles denote zero-event upper limits; the diamond is 5/200,000=2.5×10−55/200{,}000=2.5\times10^{-5}. No L=5L=5 trend line is inferred. Shading marks the evaluated-grid transition of the posterior ordering diagnostic, not an interpolation of these curves. The independent 12.25-dB ordering sample remains in Figure 4; support-point counts and intervals are detailed in Appendix E 1 d.

Independent 10-to-the-minus-five qualification at 15.6 dB

A diagnostic scan selected 15.6 dB for a separate fixed-sample level-2 confirmation with q=1q=1. The diagnostic samples were not pooled into this test, and no outcome-dependent sample extension or decoder reselection was used (Appendix E3). Under the fixed-sample binomial model of Appendix E1, with 10610^{6} samples per condition, the observed failures and one-sided 95% Clopper–Pearson upper bounds are

MN noise off:3/106,U0.95=7.7536×10−6,MN noise on:4/106,U0.95=9.1535×10−6.(16)\begin{aligned} \text{MN noise off:} &\quad3/10^{6}, \quad U_{0.95}=7.7536\times10^{-6},\\ \text{MN noise on:} &\quad4/10^{6}, \quad U_{0.95}=9.1535\times10^{-6}. \tag*{(16)} \end{aligned}
{#eq:17}

Under this model, each specified condition separately meets the 10−510^{-5} target; these are pointwise statements rather than a joint familywise 95% guarantee. Table III places this result alongside the other evaluated high-squeezing operating points, which retain their stated Jeffreys convention. The level-5 ordering and support samples are separate from this confirmation.

sGKP\mathrm{s}_{\mathrm{GKP}} (dB)(L,qL)(L,q_L)intervalkoff/noffk_{\mathrm{off}}/n_{\mathrm{off}}kon/nonk_{\mathrm{on}}/n_{\mathrm{on}}statusRGKPR_{\mathrm{GKP}}
13.0(3, 0.70)Jeffreys 95%0/50400024/504000one condition above target4937
14.0(3, 0.95)Jeffreys 95%0/1995000/199500below target under stated convention3638
15.0(2, 1)Jeffreys 95%26/10610^626/10610^6both above target288
15.6(2, 1)Clopper–Pearson 95%3/10610^64/10610^6below target under binomial model288
16.0(2, 1)Jeffreys 95%0/2000000/200000below target under stated convention288

Table III. Evaluated operating points for one accepted designated data-subsystem Bell resource. Off/on refer to the two additional-MN-noise conditions. Under the fixed-sample binomial model, the 15.6-dB Clopper–Pearson upper bound is below 10−510^{-5} separately for each condition; other rows retain their specified one-sided Jeffreys convention. RGKPR_{\mathrm{GKP}} is the nominal supplied-GKP count, not a measured complete retry cost. Statistical assumptions and accounting are defined in Appendices E1 and E2.

Input-quality versus factory-resource tradeoff

The 14-dB level-3 point with q3=0.95q_3 = 0.95 meets the target under its Jeffreys convention, whereas the 15.6-dB level-2 point is independently qualified by the exact-binomial criterion. Their nominal supplied-GKP counts are 3637.9 and 288 per accepted designated Bell pair, respectively, giving a within-factory ratio of 12.63. The higher-quality input thus permits a lower concatenation level at the target error under the stated nominal accounting convention.

Quality-dependent source costs and complete factory consumption are not included; Appendix E 2 specifies the cost recurrence and break-even condition. Supplementary tail diagnostics and the separate C4C_4/Raussendorf–Harrington–Goyal (RHG) comparison boundaries appear in Appendices E 3 and E 4.

Discussion and conclusion

The proposed factory–processor interface links resource type, mode addresses, measurement roles, frames, and reliability records to an intended logical action. Its C4C_4/GKP realization connects verified Bell resources to injection, SWAP, Hadamard, CNOT, and logical Bell measurement on a common Gaussian QRL processor. The supported Clifford constructions exploit transversal logical operations where applicable: corresponding physical QRL measurement patterns act in parallel on matched code-index addresses, while code automorphisms and measurement byproducts are explicitly tracked. The address-tracked one-layer logical-subsystem SWAP provides a permutation benchmark; the index-matched SUM component of the QRL SUM–SWAP pattern supplies the transversal logical CNOT construction. With encoded resources prepared in advance and sufficient address-preserving routing, stronger protection enlarges the parallel encoded-resource stack without extending the protected online measurement sequence of these supported constructions. Preparation, finite parallel capacity, and classical decoding remain level-dependent costs; hardware serialization can increase elapsed runtime despite the protected-depth property. The selected-output numerical case study shows finite-level error suppression and separately qualifies a designated level-2 Bell resource below 10−510^{-5} under the two stated noise conditions. The high-squeezing operating points illustrate an input-quality versus nominal factory-cost tradeoff. The resource results complement the logical-operation constructions; an all-gate error certificate would require additional noisy-operation analysis. Compatible changes to preparation, verification, decoding, or encoding can be assessed at the same factory–processor boundary, with code-dependent address, measurement, and control rules updated and each factory’s performance characterized independently. Two-subsystem outputs, non-Clifford factories, storage loss, and algorithm-level timing remain beyond the present evaluation. Together, the interface specification and the C4C_4/GKP case study establish a concrete architectural framework for assessing verified-resource preparation and online logical execution on a common Gaussian optical processing platform. The factory–processor boundary makes resource quality, code-dependent control, and the conditions for shallow online processing explicit and testable.

Acknowledgments

This work was supported by JST Moonshot R&D (Grant No. JPMJMS256I). This paper is based on results obtained from a project, JPNP20017, subsidized by the New Energy and Industrial Technology Development Organization (NEDO).

The authors disclose financial competing interests: Kosuke Fukui, Takaya Matsuura, Yohji Chin, Shohei Kiryu, and Takaya Hoshi are employees of OptQC Corp., and Kan Takase and Warit Asavanant are directors of, and hold equity in, OptQC Corp. In addition, OptQC Corp. has filed a patent application related to the work described in this manuscript.

Data Availability.— The data and software supporting the findings of this study cannot be made publicly available because they contain commercially sensitive information. They are available from the corresponding author upon reasonable request.

GKP and optical-operation conventions

This appendix fixes the conventions and minimal operations used by the main text. We use quadrature satisfying [q^,p^]=i[\hat{q},\hat{p}] = i and vacuum variance 1/21/2. GKP-state imperfections and gate noise are represented, unless stated otherwise, by additive Gaussian displacement noise.

GKP qubits

We use the standard square-lattice GKP convention 1. In the qq-quadrature representation, the ideal logical basis states are Dirac combs,

∣0GKP⟩∝∑s∈Z∣q=2sπ⟩.(17)\lvert0_{\mathrm{GKP}}\rangle\propto\sum_{s\in\mathbb{Z}}\lvert q=2s\sqrt{\pi}\rangle. \tag*{(17)}
∣1GKP⟩∝∑s∈Z∣q=(2s+1)π⟩.(18)\lvert1_{\mathrm{GKP}}\rangle\propto\sum_{s\in\mathbb{Z}}\lvert q=(2s+1)\sqrt{\pi}\rangle. \tag*{(18)}

The conjugate-basis codewords are obtained by the corresponding combs in the pp quadrature. A displacement by π\sqrt{\pi} in qq changes the logical XX frame, while exp⁡(iπq^)\exp(i\sqrt{\pi}\hat{q}) distinguishes the two logical ZZ-eigenstates.

The ideal comb states have infinite energy. Finite-energy approximations can be described by Gaussian-broadened peaks and a finite envelope, but the reported Monte Carlo calculations do not propagate these approximate pure-state wavefunctions. Instead, for error propagation they represent each noisy GKP qubit as an ideal encoded state followed by an effective independent Gaussian-displacement channel,

ρσ=Nσ(ρideal).(19)\rho_{\sigma}=\mathcal{N}_{\sigma}(\rho_{\mathrm{ideal}}). \tag*{(19)}

The noise channel is

Nσ(ρ)=∫dξq dξp Pσ(ξq,ξp)D(ξq,ξp)ρD†(ξq,ξp),(20)\mathcal{N}_{\sigma}(\rho)=\int d\xi_q\,d\xi_p\,P_{\sigma}(\xi_q,\xi_p)D(\xi_q,\xi_p)\rho D^\dagger(\xi_q,\xi_p), \tag*{(20)}
Pσ(ξq,ξp)=12πσGKP2exp⁡[−ξq2+ξp22σGKP2].(21)P_{\sigma}(\xi_q,\xi_p)=\frac{1}{2\pi\sigma_{\mathrm{GKP}}^2}\exp\left[-\frac{\xi_q^2+\xi_p^2}{2\sigma_{\mathrm{GKP}}^2}\right]. \tag*{(21)}

Here

D(ξq,ξp)=exp⁡(−iξqp^)exp⁡(iξpq^)(22)D(\xi_q,\xi_p)=\exp(-i\xi_q\hat{p})\exp(i\xi_p\hat{q}) \tag*{(22)}

is the phase-space displacement operator. Equivalently, the measured quadratures are modeled as

q↦q+ξq,p↦p+ξp,q\mapsto q+\xi_q,\qquad p\mapsto p+\xi_p,
ξq,ξp∼N(0,σGKP2).(23)\xi_q,\xi_p\sim\mathcal{N}(0,\sigma_{\mathrm{GKP}}^2). \tag*{(23)}

The shorthand σGKP2\sigma_{\mathrm{GKP}}^2 denotes σGKP2(sGKP)\sigma_{\mathrm{GKP}}^2(s_{\mathrm{GKP}}) in Sec. II C; this effective input-noise parameter is distinct from optical cluster-source squeezing. The same variance convention is used for the GKP-displacement, finite-squeezing gate-noise, and additional MN-noise terms.

GKP correction reduces measured quadratures modulo the lattice spacing. For a scalar Gaussian shift of variance vv, the odd-bin error probability is Podd(v)≡Perr(v)P_{\mathrm{odd}}(v)\equiv P_{\mathrm{err}}(\sqrt{v}), using the single definition in Eq. (1).

When the analog residual ξ\xi is retained, the corresponding GKP log-likelihood ratio is

ℓGKP(ξ;v)=log⁡∑m∈2Zexp⁡[−(ξ−mπ)22v]∑m∈2Z+1exp⁡[−(ξ−mπ)22v].(24)\ell_{\mathrm{GKP}}(\xi;v)=\log\frac{\sum_{m\in2\mathbb{Z}}\exp\left[-\frac{(\xi-m\sqrt{\pi})^2}{2v}\right]}{\sum_{m\in2\mathbb{Z}+1}\exp\left[-\frac{(\xi-m\sqrt{\pi})^2}{2v}\right]}. \tag*{(24)}

The sign of ℓGKP\ell_{\mathrm{GKP}} gives the most likely GKP Pauli frame, and its magnitude gives the confidence. These analog likelihoods are used by the residual logical Pauli error decoder and by the decoder-risk postselection rule. Thus, even when the final logical variable is binary, the decoder uses continuous GKP information before the modulo reduction.

Physical QND/SUM gate and logical GKP CX

The C4_4 factory uses physical Gaussian entangling operations that implement GKP CX gates. In the optical model adopted here, the physical gate is the noisy CV QND/SUM gate considered in [70], implemented by two input modes C,TC,T and two ancillary squeezed-vacuum modes A,BA,B. With beam-splitter parameter RR and ancillary squeezing parameters rA,rBr_A,r_B, the quadratures transform as

q^C′=q^C−1−R1+Rq^Ae−rA,\hat{q}_C'=\hat{q}_C-\sqrt{\frac{1-R}{1+R}}\hat{q}_Ae^{-r_A},
p^C′=p^C−1−RRp^T+R(1−R)1+Rp^Be−rB,\hat{p}_C'=\hat{p}_C-\frac{1-R}{\sqrt{R}}\hat{p}_T+\sqrt{\frac{R(1-R)}{1+R}}\hat{p}_Be^{-r_B},
q^T′=1−RRq^C+q^T+R(1−R)1+Rq^Ae−rA,\hat{q}_T'=\frac{1-R}{\sqrt{R}}\hat{q}_C+\hat{q}_T+\sqrt{\frac{R(1-R)}{1+R}}\hat{q}_Ae^{-r_A},
p^T′=p^T+1−R1+Rp^Be−rB.(25)\hat{p}_T'=\hat{p}_T+\sqrt{\frac{1-R}{1+R}}\hat{p}_Be^{-r_B}. \tag*{(25)}

Choosing (1−R)/R=1(1-R)/\sqrt{R}=1 and taking rA,rB→∞r_A,r_B\to\infty gives the ideal controlled-SUM operation, which implements a logical GKP CX up to local Fourier-frame conventions. For finite squeezing, the ancillary noises increase the GKP displacement variances. If

σA2=12e−2rA,σB2=12e−2rB,(26)\sigma_A^2=\frac{1}{2}e^{-2r_A},\qquad\sigma_B^2=\frac{1}{2}e^{-2r_B}, \tag*{(26)}

then the variance update used for preparation-noise effect is

σC,q2↦σC,q2+1−R1+RσA2,\sigma_{C,q}^2\mapsto\sigma_{C,q}^2+\frac{1-R}{1+R}\sigma_A^2,
σC,p2↦σC,p2+(1−R)2RσT,p2+R(1−R)1+RσB2,\sigma_{C,p}^2\mapsto\sigma_{C,p}^2+\frac{(1-R)^2}{R}\sigma_{T,p}^2+\frac{R(1-R)}{1+R}\sigma_B^2,
σT,q2↦σT,q2+(1−R)2RσC,q2+R(1−R)1+RσA2,\sigma_{T,q}^2\mapsto\sigma_{T,q}^2+\frac{(1-R)^2}{R}\sigma_{C,q}^2+\frac{R(1-R)}{1+R}\sigma_A^2,
σT,p2↦σT,p2+1−R1+RσB2.(27)\sigma_{T,p}^2\mapsto\sigma_{T,p}^2+\frac{1-R}{1+R}\sigma_B^2. \tag*{(27)}

This physical QND/SUM noise is part of Nprep(L)\mathcal{N}_{\mathrm{prep}}^{(L)}, not part of the QRL post-injection channel. The latter is applied only after a logical resource has been prepared and decoded. In a component-level implementation model, each physical QND/SUM gate also consumes ancillary squeezed modes and homodyne/feedforward operations; these quantities are not part of the principal supplied-GKP metric.

Optical resource-source options

The numerical model specifies effective GKP displacement noise, not a microscopic state-generation route. Possible sources include breeding, photon-counting/catalysis, nonlinear optical or free-electron methods, and traveling-wavepacket or deterministic schemes [75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88]. Relevant components include squeezed sources and waveguide optical parametric amplifiers (OPAs) [89, 90, 91, 92, 93, 94], time-resolved non-Gaussian states [95, 96, 97, 98, 99, 100, 101], and measurement-induced or OPA-based QND interactions [71, 72, 102, 103].

Non-Clifford optical options include cubic-phase, higher-order and nonlinear-quadrature gates, nonlinear squeezing, and adaptive feedforward [31, 32, 33, 34, 35, 104, 105, 106]. Neither their preparation costs nor source-specific generation costs enter the reported supplied-GKP metric. Analog decoding and concatenation also occur in quantum-repeater settings [107, 108, 109, 110, 111, 112].

C4 data–gauge code and logical maps

This Appendix specifies the [[4,1,1,2]][[4,1,1,2]] data–gauge realization used in the main text and the physical/code operations required to interpret the supplied DD-Bell pair. The [[4,2,2]][[4,2,2]] notation continues to denote the same underlying four-qubit stabilizer space.

C4 code and soft concatenation rules

The underlying [[4,2,2]][[4,2,2]] C4 stabilizer block is used here as a [[4,1,1,2]][[4,1,1,2]] subsystem code, with one designated data qubit and one tracked gauge qubit [56, 57]. Its Clifford action under physical-qubit permutations is tracked explicitly rather than inferred from transversality alone [113]. The stabilizer generators and data/gauge Pauli representatives are fixed in Eq. (3); the same convention is used in the following logical maps. The gauge group is G=⟨SX,SZ,XˉG,ZˉG⟩\mathcal{G}=\langle S_X,S_Z,\bar{X}_G,\bar{Z}_G\rangle (phases implicit). Its center modulo phases is generated by SX,SZS_X,S_Z; the data Pauli algebra commutes with the gauge group. The dressed logical distance is two. This subsystem choice does not assert that the gauge qubit is initialized, protected, or independently qualified as a second delivered logical output.

With the chosen data/gauge representatives, bare transversal Hadamard exchanges the two Pauli algebras,

Hˉ⊗4:XˉD↦ZˉG,ZˉD↦XˉG,(28)\bar{H}^{\otimes4}:\qquad\bar{X}_D\mapsto\bar{Z}_G,\qquad\bar{Z}_D\mapsto\bar{X}_G, \tag*{(28)}
XˉG↦ZˉD,ZˉG↦XˉD.(29)\bar{X}_G\mapsto\bar{Z}_D,\qquad\bar{Z}_G\mapsto\bar{X}_D. \tag*{(29)}

The physical permutation SWAP23\mathrm{SWAP}_{23} also exchanges DD and GG. Their composition therefore gives the label-preserving logical Hadamard

HˉDHˉG=SWAP23H⊗4.(30)\bar{H}_D\bar{H}_G=\mathrm{SWAP}_{23}H^{\otimes4}. \tag*{(30)}

The same physical permutation SWAP23\mathrm{SWAP}_{23} implements the logical exchange D↔GD\leftrightarrow G under the Pauli representatives above. In the subsystem interpretation, this exchanges the roles of the data and gauge algebras. It is not a gauge-only operation preserving a fixed protected data algebra; the output address must explicitly redefine which algebra carries the information. Consequently the one-layer permutation is an ideal code-space/address benchmark, not an independently quantified protected SWAP on two arbitrary information qubits. Corresponding physical CNOTs between two C4 blocks implement independent logical CNOTs on DD and GG. Whether a gauge-qubit fault contributes to the designated output therefore depends on the exact logical map and output-address convention: SWAP23\mathrm{SWAP}_{23} exchanges the subsystem labels, whereas the ideal transversal CNOT preserves the D/GD/G partition. Appendix B 3 gives these mappings explicitly. This corrects the ambiguity that would arise from treating either bare H⊗4H^{\otimes4} or an untracked physical permutation as label preserving.

The code detects any single-qubit Pauli error but does not by itself correct arbitrary single-qubit errors without additional syndrome and verification structure. This is why the architecture uses C4 as a compact verified-resource layer rather than as a standalone memory code.

Under ideal concatenated-code counting, an LL-level C4 block has physical-resource count

nC4(L)=4L,dC4(L)=2L,nC4(L)=dC4(L)2.(31)n_{\mathrm{C4}}(L)=4^L,\qquad d_{\mathrm{C4}}(L)=2^L,\qquad n_{\mathrm{C4}}(L)=d_{\mathrm{C4}}(L)^2. \tag*{(31)}

The actual verified-resource cost of the Knill-type recursive factory is larger than this resource count because a level-(L+1)(L+1) verified resource consumes multiple level-LL resources, verification ancillae, measurements, classical decoding, and possibly buffering. The resource discussion therefore distinguishes the nominal supplied-GKP cost from the bare code-block size.

For soft decoding, a measured C4_4 syndrome ss defines the compatible physical error sets E0(s)\mathcal{E}_0(s) and E1(s)\mathcal{E}_1(s) for the two logical-error hypotheses. For a fixed XX- or ZZ-error component, let e=(e1,…,e4)∈{0,1}4\boldsymbol{e}=(e_1,\ldots,e_4)\in\{0,1\}^4 denote the component-wise physical-error pattern. Then Eb(s)\mathcal{E}_b(s) consists of patterns compatible with the observed syndrome and inducing designated-data logical parity b∈{0,1}b\in\{0,1\}, with gauge alternatives summed over rather than declared to be additional delivered outputs. These bb labels are binary parity hypotheses, not child-group labels or the full four-class Pauli alphabet. The displayed product-likelihood form presumes conditionally factorized incoming binary likelihoods; correlated inputs require joint-pattern weights. The corresponding designated-data logical log odds are obtained by the syndrome-constrained log-sum-exp marginalization in Eq. (34); the compatibility and conditional-factorization assumptions above apply to that expression. This same operation is recursively applied in the concatenated factory: physical GKP analog likelihoods are combined with the C4_4 syndrome constraints, lower-level decoder records become inputs to higher-level verification gadgets, and every level outputs the formal recursive record RLR_L defined in Eq. (9).

The twelve-child construction used in the simulations is therefore interpreted as a recursive soft-information resource map,

({RL,j}j=112,s(L+1))⟼RL+1,(32)\left(\{R_{L,j}\}_{j=1}^{12},s^{(L+1)}\right)\longmapsto R_{L+1}, \tag*{(32)}

with the transition constraints determined by the teleportation and verification circuit; the full circuit-indexed transition table is not reproduced here. The present paper reports the decoder-dependent logical-Bell preparation analysis; the physical QND/SUM gate used for each GKP CX is specified above, while the resource discussion uses the supplied-GKP nominal schedule-cost convention defined in § 2 C.

Likelihood propagation through C4 verification

From physical LLRs to C4 logical LLRs

Let

ℓi≡log⁡Pr⁡(ei=0∣yi)Pr⁡(ei=1∣yi)(33)\ell_i\equiv\log\frac{\Pr(e_i=0\mid y_i)}{\Pr(e_i=1\mid y_i)} \tag*{(33)}

denote the physical GKP-derived log posterior odds for a Pauli error variable ei∈{0,1}e_i\in\{0,1\}. Here yiy_i is the accessible local measurement record for mode ii, and the four-index set i=1,…,4i=1,\ldots,4 refers to physical modes in one C4_4 block, not four child resources. When physical-error priors are uniform, these odds coincide with the likelihood-ratio convention in Eq. (2); with unequal priors the prior-odds term must be retained. Conditioning on the measured C4_4 syndrome ss, the logical log odds are obtained by marginalizing over physical error patterns consistent with each logical class,

ℓC4=log⁡∑e∈E0(s)exp⁡[12∑i=14(1−2ei)ℓi]∑e∈E1(s)exp⁡[12∑i=14(1−2ei)ℓi].(34)\ell_{C_4}=\log\frac{\sum_{\boldsymbol{e}\in\mathcal{E}_0(s)}\exp\left[\frac{1}{2}\sum_{i=1}^{4}(1-2e_i)\ell_i\right]}{\sum_{\boldsymbol{e}\in\mathcal{E}_1(s)}\exp\left[\frac{1}{2}\sum_{i=1}^{4}(1-2e_i)\ell_i\right]}. \tag*{(34)}

where E0/1(s)\mathcal{E}_{0/1}(s) denotes the syndrome-compatible physical error patterns in each binary data-parity hypothesis for the selected Pauli component. No hard physical-level decision is required: every compatible pattern contributes with its likelihood weight. The resulting ℓC4\ell_{C_4} is passed to the next concatenation level.

Parity-check structure

The C4_4 stabilizers impose parity constraints on the physical error variables, so Eq. (34) can be viewed as inference on a small factor graph with physical LLRs as incoming messages. The same structure repeats at higher concatenation levels.

Higher-level stabilizers impose analogous constraints among C4_4 subblocks. Decoder-confidence postselection ranks the resulting reliability information and applies the fixed retained fraction qLq_L while preserving the probabilistic interpretation across levels.

The same logical LLRs can be incorporated into adaptive MBQC measurement and frame updates as described in Sec. II E.

Logical-operation maps and gauge-qubit tracking

The physical permutation SWAP23_{23} exchanges the two C4_4 logical-subsystem ports,

(aD,aG)in⟷(aG,aD)physical ports.(35)(a_D,a_G)_{\mathrm{in}}\longleftrightarrow(a_G,a_D)_{\mathrm{physical\ ports}}. \tag*{(35)}

Consequently, a data label that follows the quantum information through the declared address map satisfies Din↦GoutD_{\mathrm{in}}\mapsto G_{\mathrm{out}}, whereas a fixed physical DD port after the permutation contains the input gauge degree of freedom. The designated-DD certificate therefore transfers to the address-tracked output data label, not to an unlabeled fixed port. The gauge qubit remains in the joint decoder state but is not independently qualified as a delivered output. No statistical independence between the C4_4 data and gauge degrees of freedom is assumed.

For two C4_4 blocks AA and BB, corresponding physical CNOTs implement

CNOT‾A→BC4=CNOT‾DA→DB⊗CNOT‾GA→GB.(36)\overline{\mathrm{CNOT}}_{A\to B}^{C_4}=\overline{\mathrm{CNOT}}_{D_A\to D_B}\otimes\overline{\mathrm{CNOT}}_{G_A\to G_B}. \tag*{(36)}

This ideal map keeps the designated and gauge qubits separate and fixes their address-matched pairing.

Logical output and residual-Pauli normalization

Underlying each [[4,1,1,2]][[4,1,1,2]] data–gauge realization is the [[4,2,2]][[4,2,2]] stabilizer space. Designating the protected output as data DD and tracking GG as gauge determines the output-normalization convention; it does not change the four-qubit stabilizers. The recursive simulator retains the information needed to propagate both subsystems through the verification gadget. One pre-specified logical Bell-pair subsystem of the verified block pair is counted as the accepted encoded ancilla, while the gauge qubit is retained for parity consistency and optional diagnostics and is not credited as a second independent output.

After final deterministic frame composition, aL∈{0,1,2,3}a_L \in\{0,1,2,3\} labels the true Pauli class on the designated Bell pair and a^L\hat{a}_L is the decoder correction. The residual eL=a^L⊕aLe_L = \hat{a}_L \oplus a_L has accepted distribution

Pres,Lprep(e∣AL=1)=Pr⁡[eL=e∣AL=1],(37)P^{\mathrm{prep}}_{\mathrm{res},L}(e \mid A_L = 1) = \Pr[e_L = e \mid A_L = 1], \tag*{(37)}
PLPS,prep(sGKP;q)=1−Pres,Lprep(0∣AL=1)=Pr⁡[a^L⊕aL≠0∣AL=1].(38)P^{\mathrm{PS,prep}}_L(s_{\mathrm{GKP}};\mathbf{q}) = 1 - P^{\mathrm{prep}}_{\mathrm{res},L}(0 \mid A_L = 1) = \Pr[\hat{a}_L \oplus a_L \ne0 \mid A_L = 1]. \tag*{(38)}

The four-class residual distribution, not the maximum of component-wise Bell-bit errors, defines the primary metric. Joint tracking of data and gauge uses 16 Pauli classes for diagnostics only; the gauge is not credited as a second qualified output. Under the stated Pauli-mixture description, write PLres(e)=Pr⁡(eL=e∣AL=1)P_L^{\mathrm{res}}(e) = \Pr(e_L = e \mid A_L = 1). The corresponding estimated Pauli-diagonal logical channel model (for ideal teleportation) is

ΛLR(L)(ρ)=∑e∈{I,X,Y,Z}PLres(e) P‾eρP‾e†.\Lambda^{(L)}_{\mathrm{LR}}(\rho) = \sum_{e \in\{I,X,Y,Z\}} P_L^{\mathrm{res}}(e)\,\overline{P}_e \rho\overline{P}_e^{\dagger}.

It is CPTP because the weights are nonnegative and sum to one. This representation is associated with the accepted Bell-resource distribution and ideal logical teleportation; it does not reconstruct coherent device noise or certify noisy online gates.

Preparation, MN, and QRL noise models

This Appendix distinguishes the isotropic displacement channel used in the reported physical-coordinate simulations from gate-specific QRL variance formulas and an auxiliary factorized logical-Pauli approximation. No device-specific logical-channel fitting is used to obtain the headline error rates.

Declared physical-coordinate evaluation

The independent 15.6-dB confirmation adds the specified displacements to physical GKP coordinates in the MN-on condition and performs final GKP correction in both conditions before logical decoding. This physical-coordinate evaluation differs from the auxiliary independent-channel approximation, which factorizes logical preparation and post-injection errors before XOR convolution. The latter is not used to replace the direct confirmation.

Let ΩLprep\Omega_L^{\mathrm{prep}} be the joint state of the prepared quantum candidate and its classical record YY. The notation Nprep(L)\mathcal{N}_{\mathrm{prep}}^{(L)} elsewhere summarizes the GKP and finite-squeezing QND/SUM preparation-noise model; conditional preparation and selection are not assumed to be a single logical noise channel. Before final correction and decoding, the additional physical noise acts as

ΩLpost=(NQRL/MN(L)⊗id⁡Y)[ΩLprep].(39)\Omega_L^{\mathrm{post}} = \left(\mathcal{N}_{\mathrm{QRL/MN}}^{(L)} \otimes\operatorname{id}_Y\right)\left[\Omega_L^{\mathrm{prep}}\right]. \tag*{(39)}

Here id⁡Y\operatorname{id}_Y leaves the existing record unchanged. The added-noise operation is a mixture of physical displacement unitaries and is therefore CPTP; it is not the inferred logical Pauli distribution. Loss, detector inefficiency, mode mismatch, storage noise, and inter-operation correlations require additional calibrated terms. Controller latency, buffering, and throughput are not logical-error probabilities.

For the numerical results reported below, the two post-injection labels refer to one fixed pair of channels. In the MNMN-noise-off condition no additional post-injection displacement is applied. In the MNMN-noise-on condition a Gaussian displacement is drawn independently in each relevant quadrature. Its reference variance is evaluated at the numerical noise-quality level sMN=sGKP+2s_{MN}=s_{\mathrm{GKP}}+2, i.e., 2 dB higher than sGKPs_{\mathrm{GKP}}, and multiplied by four. Equivalently, the declared added variance is

σq,MN,on2=σp,MN,on2=4 10−2/10σGKP2(sGKP)≈2.524 σGKP2(sGKP).(40)\sigma^2_{q,\mathrm{MN,on}} = \sigma^2_{p,\mathrm{MN,on}} = 4\,10^{-2/10}\sigma^2_{\mathrm{GKP}}(s_{\mathrm{GKP}}) \approx2.524\,\sigma^2_{\mathrm{GKP}}(s_{\mathrm{GKP}}). \tag*{(40)}

The isotropic numerical step is not identified with the gate-specific QRL parameterization below without a specified squeezing/gain and measurement-pattern calibration.

The second evaluation applies post-injection QRL/macronode noise after the logical Bell resource has been prepared. For each constituent qubit aa of the prepared level-LL resource we sample independent displacement noise

q^a↦q^a+ξq,a,p^a↦p^a+ξp,a,\hat{q}_a \mapsto\hat{q}_a + \xi_{q,a}, \qquad\hat{p}_a \mapsto\hat{p}_a + \xi_{p,a},
ξq,a∼N(0,σq,MN2),ξp,a∼N(0,σp,MN2).(41)\xi_{q,a} \sim\mathcal{N}(0,\sigma^2_{q,\mathrm{MN}}), \qquad\xi_{p,a} \sim\mathcal{N}(0,\sigma^2_{p,\mathrm{MN}}). \tag*{(41)}

where the variances are determined by the declared post-injection channel. For the headline MN-noise-on results they are the declared single-step values of Eq. (40), while the MN-noise-off condition sets both additional variances to zero.

QRL operation ggvqgv_q^gvpgv_p^g
IINxϵQRL/2N_x\epsilon_{\mathrm{QRL}}/2NpϵQRL/2N_p\epsilon_{\mathrm{QRL}}/2
FF(Nx+Np)ϵQRL/2(N_x+N_p)\epsilon_{\mathrm{QRL}}/2(Nx+Np)ϵQRL/2(N_x+N_p)\epsilon_{\mathrm{QRL}}/2
P(1)P(1)NxϵQRLN_x\epsilon_{\mathrm{QRL}}NpϵQRLN_p\epsilon_{\mathrm{QRL}}
(F⊗F)CZ(1)(F\otimes F)CZ(1)(Nx+Np)ϵQRL/2(N_x+N_p)\epsilon_{\mathrm{QRL}}/2(Nx+Np)ϵQRL/2(N_x+N_p)\epsilon_{\mathrm{QRL}}/2

Table IV. Gate-dependent additive displacement variances in the QRL parameterization of this Appendix. These entries do not by themselves identify the device-level noise with the isotropic numerical step of Eq. (40).

Gate-specific QRL parameterization

We use the QRL finite-squeezing parameterization of Ref. [24]. Let rclr_{\mathrm{cl}} be the squeezing parameter of the input squeezed resources used to generate the QRL cluster. Using the convention [q^,p^]=i[\hat{q},\hat{p}]=i and Var⁡(qsqueezed)=12e−2rcl\operatorname{Var}(q_{\mathrm{squeezed}})=\frac{1}{2}e^{-2r_{\mathrm{cl}}}, we define the corresponding input squeezing scl=(20/ln⁡10)rcls_{\mathrm{cl}}=(20/\ln10)r_{\mathrm{cl}} in decibels. This cluster-source squeezing is not the effective GKP displacement-noise level sGKPs_{\mathrm{GKP}} used in the headline data. The effective QRL edge weight and residual finite-squeezing parameter are

tQRL=tanh⁡(2rcl),ϵQRL=sech⁡(2rcl).(42)t_{\mathrm{QRL}}=\tanh(2r_{\mathrm{cl}}),\qquad\epsilon_{\mathrm{QRL}}=\operatorname{sech}(2r_{\mathrm{cl}}). \tag*{(42)}

For a single QRL computation step, the quadrature noise factors are

Nx=tanh⁡−2(2rcl),Np=1.(43)N_x=\tanh^{-2}(2r_{\mathrm{cl}}),\qquad N_p=1. \tag*{(43)}

Reference [24] uses x,px,p quadratures; here we identify x≡qx\equiv q.

In the following gate labels, II is the identity, FF is the single-mode Fourier transform, P(1)P(1) is a unit-strength quadratic phase gate, and CZ(1)CZ(1) is a unit-strength controlled-phase gate; the q,pq,p variance factors follow the chosen QRL convention. For the elementary QRL Clifford operations used here, the additive displacement variances are

(vqI,vpI)=ϵQRL2(Nx,Np),(44)(v_q^I,v_p^I)=\frac{\epsilon_{\mathrm{QRL}}}{2}(N_x,N_p), \tag*{(44)}
(vqF,vpF)=ϵQRL2(Nx+Np,Nx+Np),(45)(v_q^F,v_p^F)=\frac{\epsilon_{\mathrm{QRL}}}{2}(N_x+N_p,N_x+N_p), \tag*{(45)}
(vqP(1),vpP(1))=ϵQRL(Nx,Np),(46)(v_q^{P(1)},v_p^{P(1)})=\epsilon_{\mathrm{QRL}}(N_x,N_p), \tag*{(46)}
(vq(F⊗F)CZ,vp(F⊗F)CZ)=ϵQRL2(Nx+Np,Nx+Np).(47)(v_q^{(F\otimes F)CZ},v_p^{(F\otimes F)CZ})=\frac{\epsilon_{\mathrm{QRL}}}{2}(N_x+N_p,N_x+N_p). \tag*{(47)}

These gate-dependent variance formulas follow Ref. [24]; they are contextual analytic inputs, not a calibrated replacement for the isotropic noise used in the headline simulation.

Auxiliary logical-Pauli factorization

The headline MN-on study adds the prescribed displacement noise to physical GKP coordinates and then performs final correction and frozen decoding. For a separate auxiliary approximation, let e∈{0,1,2,3}e\in\{0,1,2,3\} be the preparation residual Pauli class and u∈{0,1,2,3}u\in\{0,1,2,3\} an effective post-injection Pauli class on the designated Bell output. Their respective marginal distributions are denoted Pres,Lprep(e∣AL=1,q)P_{\mathrm{res,L}}^{\mathrm{prep}}(e\mid A_L=1,\mathbf{q}) and PQRL,L(u∣S,hroute)P_{\mathrm{QRL,L}}(u\mid S,h_{\mathrm{route}}), where q\mathbf{q} is the declared retention schedule, SS denotes an ordered QRL measurement/gate schedule, and hrouteh_{\mathrm{route}} a routing history. The latter distribution is an auxiliary model input, not the output of a device-calibration fit performed in this work. Under the factorized approximation, the residual Pauli class is the two-bit XOR convolution

Ptot,L(c)=∑e=03Pres,Lprep(e∣AL=1,q)×PQRL,L(c⊕e∣S,hroute).(48)P_{\mathrm{tot,L}}(c)=\sum_{e=0}^{3}P_{\mathrm{res,L}}^{\mathrm{prep}}(e\mid A_L=1,\mathbf{q})\times P_{\mathrm{QRL,L}}(c\oplus e\mid S,h_{\mathrm{route}}). \tag*{(48)}

The corresponding auxiliary failure probability is

PLind,post=1−Ptot,L(0).(49)P_L^{\mathrm{ind,post}}=1-P_{\mathrm{tot,L}}(0). \tag*{(49)}

Here ⊕\oplus adds two-bit logical Pauli labels. This factorization assumes statistical independence between preparation and post-injection residual errors after conditioning on the accepted-output protocol. Independently drawn physical displacements alone do not ensure this logical independence under joint decoding; a correlated model requires their joint distribution. Accordingly, PLind,postP_L^{\mathrm{ind,post}} is not identified with the directly simulated physical-coordinate result PLMN,postP_L^{\mathrm{MN,post}}. The identity-pattern variances in Table IV are generally anisotropic, unlike the prescribed isotropic MN-on variance in Eq. (40); no calibrated equivalence between them is asserted.

Ordered covariance propagation for a QRL segment

Gate counts alone do not generally determine the output noise of a Gaussian circuit. Let SjS_j be the linear quadrature map of step jj and NjN_j the covariance of fresh additive noise at its output, both in the same specified quadrature convention. For independent noise increments in an ordered Gaussian segment [14],

Σj=SjΣj−1SjT+Nj,(50)\Sigma_j=S_j\Sigma_{j-1}S_j^{T}+N_j, \tag*{(50)}
Σmadded=∑j=1mTjNjTjT,Tj=SmSm−1⋯Sj+1,(51)\Sigma_m^{\mathrm{added}}=\sum_{j=1}^{m}T_jN_jT_j^{T},\qquad T_j=S_mS_{m-1}\cdots S_{j+1}, \tag*{(51)}
Tm=I.(52)T_m=I. \tag*{(52)}

The total covariance also includes T0Σ0T0TT_0\Sigma_0T_0^T, with T0=Sm⋯S1T_0=S_m\cdots S_1. The variance table gives diagonal entries only; a multimode segment also requires all relevant off-diagonal elements of NjN_j. This identity follows by substituting the preceding step into the next; it is not a new simulation result. A scalar sum of gate variances is a special case only if each contribution has already been transported into the same output frame, the relevant cross-covariances vanish, and the required diagonal entries are then selected. A shear or SUM can otherwise propagate and correlate earlier noise. Temporally correlated increments require the corresponding cross terms. GKP digitization, syndrome conditioning, and error-correction resets require their own conditional update rather than this unconditional Gaussian identity. Storage and routing noise must enter at their actual positions in the ordered sequence.

The covariance recursion is an auxiliary Gaussian propagation identity, not an evaluation performed for the reported MN-on condition. A compact gate-count record alone cannot replace the ordered maps, covariance blocks, and decoding/reset locations; no longer-circuit logical performance is inferred from that identity.

Independent physical-noise model

The independent-channel approximation is used to scan MN/QRL post-injection noise at low computational cost. This analysis assumes that the preparation-decoder logical Pauli error and the logical Pauli error induced by post-injection noise are independent. For the primary output subsystem, the MN/QRL post-injection noise is represented in this auxiliary diagnostic by a four-class logical Pauli-error distribution on the designated Bell-pair subsystem. When both C4_4 data/gauge degrees of freedom are retained jointly for diagnostics, the same construction can be lifted to a 16-class residual-error distribution corresponding to four binary frame components. The four-class convolution is Eq. (48), under the independence conditions of Appendix C. In this auxiliary model, Pind,post(q)=1−Ptot,L(0)P_{\mathrm{ind,post}}(\mathbf{q}) = 1 - P_{\mathrm{tot,L}}(0); it is not a substitute for the physical-coordinate result.

For the independent physical error model, each physical GKP coordinate receives MN noise with variance

σMN,aux2=CMNσGKP2.(53)\sigma_{\mathrm{MN,aux}}^2 = C_{\mathrm{MN}}\sigma_{\mathrm{GKP}}^2. \tag*{(53)}

The physical bit-flip probability is approximated by

pphys=Pr⁡(∣X∣>π2),X∼N(0,CMNσGKP2).(54)p_{\mathrm{phys}} = \Pr\left(|X| > \frac{\sqrt{\pi}}{2}\right), \qquad X \sim\mathcal{N}(0,C_{\mathrm{MN}}\sigma_{\mathrm{GKP}}^2). \tag*{(54)}

For a level-LL C4_4 block containing 4L4^L physical qubits in the simplified counting model, the parity-flip probability is

ppar,L=1−(1−2pphys)4L2.(55)p_{\mathrm{par},L} = \frac{1 - (1 - 2p_{\mathrm{phys}})^{4^L}}{2}. \tag*{(55)}

The four binary frame components (X/Z on the data and gauge degrees of freedom of the C4_4 block) are then combined into the joint 16-class diagnostic distribution PMN,L(a)P_{\mathrm{MN},L}(a) by treating the four parity flips as independent within this factorized approximation. The declared MN-noise-on effective channel retains

CMNprod=4×10−2/10≃2.524,(56)C_{\mathrm{MN}}^{\mathrm{prod}} = 4 \times10^{-2/10} \simeq2.524, \tag*{(56)}

consistent with Eq. (40); MN noise off sets the additional variance to zero. The earlier sensitivity-family coefficients are not used in the reported headline results.

Decoder records, selection-policy calibration, and measurement instruments

Quantum-instrument composition at the online boundary

An accepted encoded Bell pair is an ancilla distinct from the teleported data. Let DLD_L denote the encoded data and its classical address and correction records, BLB_L the accepted Bell resource and associated records, and CLC_L the newly produced measurement records. These registers are distinct from the single-candidate classical decoder record RL\mathcal{R}_L and the nominal supplied-GKP resource cost RLGKPR_L^{\mathrm{GKP}}. Injection JL\mathcal{J}_L and the QRL measurement instrument MQRL\mathcal{M}_{\mathrm{QRL}} are followed by classical processing and prescribed conditional corrections DLcqD_L^{\mathrm{cq}}. Their composition is

IL:DL⊗BL⟶DL⊗CL,IL=DLcq∘MQRL∘JL.(57)\mathcal{I}_L:\quad D_L \otimes B_L \longrightarrow D_L \otimes C_L, \qquad \mathcal{I}_L = D_L^{\mathrm{cq}} \circ\mathcal{M}_{\mathrm{QRL}} \circ\mathcal{J}_L. \tag*{(57)}

The complete quantum/classical output defines a quantum instrument. The classical-processing map implements the specified outcome-conditioned corrections without assuming that an inferred Pauli-error class is correct. This expression describes composability at the interface and is not evaluated as a complete noisy logical-gate channel in the present numerical study.

The main text defines classical decoder updates and binary candidate selection. For the quantum instrument in Eq. (57), an outcome yy labels a linear completely positive, trace-nonincreasing operation Ey\mathcal{E}_y; summing (or integrating) over all outcomes is trace preserving. Recording the outcome gives ∑yEy(ρ)⊗∣y⟩⟨y∣\sum_y \mathcal{E}_y(\rho)\otimes|y\rangle\langle y|. Normalizing one accepted branch is a conditional state update, not generally a linear quantum channel. Fixed-batch rank selection is a classical rule on the joint batch record, not a fixed independent single-candidate instrument. This Appendix specifies the logical endpoint, fitted-map inputs, deterministic transformations, and auxiliary diagnostics.

Class-score construction and calibration. The decoder uses two side-specific ExtraTrees predictors to produce a normalized 64-class score distribution, pA(u∣y)p_A(u\mid y) and pB(v∣y)p_B(v\mid y). Absent classes receive a small positive numerical floor before normalization. The four Bell-Pauli scores are constructed by summing products of the side scores over pairs of component labels consistent with the fixed Bell-stabilizer quotient map λ(u,v)∈{0,1,2,3}\lambda(u,v) \in\{0,1,2,3\} and composing the recorded Pauli frame fLknownf^{\mathrm{known}}_{L}:

sL(a∣y)=∑u,v:λ(u,v)=apA(u∣y)pB(v∣y),s_L(a \mid y)=\sum_{u,v:\lambda(u,v)=a}p_A(u\mid y)p_B(v\mid y),
pL(a∣y)=sL(a⊕fLknown∣y).(58)p_L(a\mid y)=s_L(a\oplus f^{\mathrm{known}}_L\mid y). \tag*{(58)}

The product combines two fitted side-score distributions and need not equal a true jointly calibrated conditional posterior. No separate post-hoc probability-remapping function enters this score construction: class normalization and known-frame relabeling are deterministic operations, not temperature, isotonic, or sigmoid calibration. Instead, non-test calibration data are used to select the risk/retention policy. The estimated score is not claimed to be a reliability-validated conditional failure probability. The isotropic MN benchmark does not infer a device-specific logical error distribution.

Pre-specified recursive-decoder definition

The frozen level-2 models are ExtraTreesClassifier ensembles with 112 trees, maximum depth 28, minimum leaf size 3, square-root feature subsampling, and balanced-subset class weights. Each level-2 MN-specific model bundle accepts 523 ordered observable/derived input features and contains the two side-specific multiclass estimators used in Eq. (58). Model training uses data disjoint from the independent confirmation samples; at the reported q=1q=1 level-2 point, no decoder-confidence cutoff removes candidates. The feature definition and fitted parameters are fixed before confirmation, with no retraining or retrospective model selection. For each child k∈{1,…,12}k\in\{1,\ldots,12\} supplied by the preparation gadget, the parent decoder receives (i) normalized logical-class-score information after deterministic Pauli-frame handling, (ii) exposed C4 verification syndromes and Bell-measurement outcomes, (iii) ordered child-slot/address information, and (iv) retained analog GKP likelihood features. No unobservable physical error label is supplied to the decoder during evaluation.

Frozen evaluation inputs. The decoder’s operational input contains measured GKP analog likelihoods, exposed verification syndromes and Bell outcomes, the known frame, and child-slot/address records. Simulated correct labels are used for fitting and non-test policy comparison only. Neither those labels nor hidden physical-error coordinates are supplied as decoder features at independent evaluation. The fixed feature columns, learned trees, logical-class map, and risk-ranking rule are applied without updating the model from confirmation outcomes.

Selection-policy calibration and independent evaluation

The evaluation separates three data roles. The training set Tfit\mathcal{T}_{\mathrm{fit}} fits the component multiclass estimators using observable records and simulated labels. Non-test calibration data Tsel\mathcal{T}_{\mathrm{sel}} compare the specified decoder/risk and selection-policy candidates using selected-output failure statistics and retain the admissible policy, including the level-dependent schedule q⋆q^{\star}. The independent set Tconf\mathcal{T}_{\mathrm{conf}} evaluates the fixed choice; its labels are not used for refitting, policy reselection, or choosing an operating point after the fact. At q2=1q_2=1 every candidate is retained, so the level-2 confirmation tests the frozen class decision rather than the benefit of confidence filtering.

For each generated candidate ii at level LL, the fixed decoder returns pL,i(a∣yi)p_{L,i}(a\mid y_i) and the associated score

a^L,i=arg⁡max⁡a∈{I,X,Y,Z} pL,i(a∣yi),\hat{a}_{L,i}=\underset{a\in\{I,X,Y,Z\}}{\arg\max}\ p_{L,i}(a\mid y_i),
rL,i=1−max⁡apL,i(a∣yi).(59)r_{L,i}=1-\max_a p_{L,i}(a\mid y_i). \tag*{(59)}

The selection policy reported for the 12.25-dB level-2–4 ordering study is within-batch rank selection. For a batch BB containing MM generated candidates, let ρB(i)\rho_B(i) be the rank of (rL,i,jobIDi,shotIDi)(r_{L,i},\mathrm{jobID}_i,\mathrm{shotID}_i) in ascending lexicographic order; the identifiers break score ties deterministically. The acceptance indicator is

KL(B)=max⁡{1,⌈qL⋆M⌉},K_L(B)=\max\{1,\lceil q_L^{\star}M\rceil\},
AL,i(B)=1[ρB(i)≤KL(B)].(60)A_{L,i}(B)=\mathbf{1}[\rho_B(i)\le K_L(B)]. \tag*{(60)}

Here M=500M=500 for the stated level-2–4 batches, and (q2,q3,q4,q5)=(1,0.70,0.96,1)(q_2,q_3,q_4,q_5)=(1,0.70,0.96,1) is the preselected schedule. This policy imposes an exact rank quota within each specified batch, not an absolute threshold on rLr_L or a demonstrated streaming implementation. The level-5 condition retains all candidates; the separate 15.6-dB level-2 confirmation also has q2=1q_2=1 and therefore no confidence-based rejection.

One diagnostic that can be constructed using only calibration labels is the empirical selected-output error rate for a proposed policy qq,

P^L,selcal(q)=∑i∈TselAL,i(q)1[a^L,i≠aL,i]∑i∈TselAL,i(q),(61)\widehat{P}^{\mathrm{cal}}_{L,\mathrm{sel}}(q)= \frac{\sum_{i\in\mathcal{T}_{\mathrm{sel}}}A_{L,i}(q)\mathbf{1}[\hat{a}_{L,i}\ne a_{L,i}]} {\sum_{i\in\mathcal{T}_{\mathrm{sel}}}A_{L,i}(q)}, \tag*{(61)}

whenever the denominator is nonzero. This is a non-test selected-output statistic used for policy comparison; it is not a probability-remapping objective and is never reported as the independent logical-error estimate. Candidate operating points and nominal costs are selected according to the declared non-test rule of Appendix E2. After the policy is frozen, the same formula with Tconf\mathcal{T}_{\mathrm{conf}} in place of Tsel\mathcal{T}_{\mathrm{sel}} defines the observed selected-output failure fraction; the confidence/credible intervals are evaluated from confirmation counts using their separately stated statistical conventions (Appendix E1). The true class aL,ia_{L,i} is used only in labeled training, non-test calibration diagnostics, and independent evaluation—never as a runtime decoder feature or selection key.

An optional streaming fixed-cutoff policy would set an acceptance threshold from non-test score quantiles; it was not used for the reported 12.25-dB batchwise selection.

No calibration-only estimate, however accurate, is substituted for the independent reported error counts. In particular, an empirical agreement of predicted class confidences with class frequencies is a separate reliability test and is not established by the rank-selection equations above.

The twelve children are placed in the fixed ordered groups defined by the Knill-type parent verification gadget. Deterministic C4\mathrm{C}_4 parity constraints, Bell-stabilizer quotienting, child-slot permutations, and Pauli-frame composition are evaluated exactly. The statistical model is used only to estimate normalized scores over the four logical Pauli classes after these exact transformations. The fitted map cannot alter the code relations, logical labels, address map, or deterministic frame composition. Decoder-universal robustness is not inferred from the fixed-map result. In particular, the decoder output is

pL+1(a∣y)=FL+1[{pL,k,sL,k,uL,k,Amode,L,k}k=112,sL+1,uL+1].(62)p_{L+1}(a \mid y) = \mathcal{F}_{L+1}\left[\left\{p_{L,k},s_{L,k},u_{L,k},A_{\mathrm{mode},L,k}\right\}_{k=1}^{12},s_{L+1},u_{L+1}\right]. \tag*{(62)}

where ss denotes the observable syndrome/verification record, uu collects the pre-specified analog-likelihood features, and AmodeA_{\mathrm{mode}} denotes the ordered address/slot record. The tracked Pauli frame after the final GKP correction is then composed exactly with this class-score distribution. The predicted class is a^L+1=arg⁡max⁡apL+1(a∣y)\hat{a}_{L+1} = \arg\max_a p_{L+1}(a \mid y) and the candidate-ranking score is

rL+1=1−max⁡apL+1(a∣y).(63)r_{L+1}=1-\max_a p_{L+1}(a \mid y). \tag*{(63)}

The 12.25-dB evaluation ranks this score within each replicate as in Appendix E1a. If the final GKP correction supplies a deterministic Pauli-frame update fGKPfinalf_{\mathrm{GKP}}^{\mathrm{final}} (the known update from this final correction), the post-correction class-score distribution is obtained exactly as

ppost(a∣y,fGKPfinal)=ppre(a⊕fGKPfinal∣y),(64)p_{\mathrm{post}}(a \mid y,f_{\mathrm{GKP}}^{\mathrm{final}})=p_{\mathrm{pre}}(a\oplus f_{\mathrm{GKP}}^{\mathrm{final}}\mid y), \tag*{(64)}

so the applied correction is never presented to the statistical model as an unknown fault.

The equations specify the observable input classes and deterministic transformations used by the decoder. The reported performance pertains to the fitted decoder fixed for each evaluation; it does not imply robustness to arbitrary decoder replacements. Level-dependent fitted maps are used where required by the recursive construction.

The parent-level class scores pL+1(a∣yL+1)p_{L+1}(a\mid y_{L+1}) are the class-score component of the recursive record update in Eq. (10), with inputs from the twelve child records and newly accessible likelihood, syndrome, address, and frame data.

Physical-coordinate-level decoder

The physical-coordinate-level MN model adds noise to the GKP coordinates before logical decoding. It is distinct from the independent-channel approximation and is used for the independent 15.6-dB confirmation. For each resource, the coordinates before the additional noise step are retained, and MN/​QRL noise is sampled at the physical-coordinate level,

xjnoisy=xj+ξj,ξj∼N(0,σMN2).(65)x_j^{\mathrm{noisy}}=x_j+\xi_j,\qquad\xi_j\sim\mathcal{N}(0,\sigma_{\mathrm{MN}}^2). \tag*{(65)}

and similarly for the conjugate quadrature when required by the measured channel. The noisy physical bit is obtained by nearest-lattice binning,

bjnoisy=[round⁡(xjnoisyπ)] mod 2.(66)b_j^{\mathrm{noisy}}=\left[\operatorname{round}\left(\frac{x_j^{\mathrm{noisy}}}{\sqrt{\pi}}\right)\right]\bmod2. \tag*{(66)}

In the physical-coordinate description, simulator coordinates define the noise experiment. Only measurement-accessible outcomes, syndromes, known frames, and their pre-specified derived features may be passed to an operational MN-aware decoder. Here Φobs\Phi_{\mathrm{obs}} denotes the prescribed construction of the observable feature record, MallowedM_{\mathrm{allowed}} specifies the permitted measurements, and FknownF_{\mathrm{known}} is the tracked correction record; the map is separate from the C4\mathrm{C}_4 gauge group G\mathcal{G}. Let yobsnoisy=Φobs(xnoisy;Mallowed,Fknown)y_{\mathrm{obs}}^{\mathrm{noisy}}=\Phi_{\mathrm{obs}}(x^{\mathrm{noisy}};M_{\mathrm{allowed}},F_{\mathrm{known}}) denote the decoder-input record formed from permitted measured outcomes, their declared derived features, and known classical frames. The symbol xnoisyx^{\mathrm{noisy}} describes simulator coordinates and is not itself the operational decoder input:

a^=DMN(L)(yobsnoisy).(67)\hat{a}=D_{\mathrm{MN}}^{(L)}\left(y_{\mathrm{obs}}^{\mathrm{noisy}}\right). \tag*{(67)}

The operational interpretation of this map requires the features constructed by Φobs\Phi_{\mathrm{obs}} to depend only on measured quantities and known classical records, not on hidden simulator labels or unmeasured quadratures.

The physical-coordinate-level decoder is not required to be the same as the preparation decoder. In particular, the preparation decoder predicts the residual logical Pauli error of an offline resource, whereas the MN-aware decoder predicts the residual logical Pauli error after post-injection noise. These two tasks have different feature distributions.

The designated-data identity Pauli class dominates in the low-error regime. Aggregate selected-output error rates alone do not separately quantify recall for each rare nonidentity Pauli class; no such per-class sensitivity metric is claimed in the reported results.

Diagnostic comparison with a no-residual-inference baseline

The frozen aggregate records permit one diagnostic comparison without retraining or reselecting a decoder. An identity residual predictor applies the deterministic Pauli-frame update but performs no statistical inference and therefore fails whenever the exact designated-DD residual Pauli operation is nontrivial. Table V compares this no-residual-inference baseline with the fixed four-class decoder on the same q=1q=1 independent samples.

Inference ruleNo additional macronode-noise stepOne macronode-noise stepInterpretation
Identity residual predictor after deterministic frame update9/1069/10^{6}; U0.95=1.5705×10−5U_{0.95}=1.5705\times10^{-5}6163/1066163/10^{6}; U0.95=6.2933×10−3U_{0.95}=6.2933\times10^{-3}No statistical residual-Pauli inference
Fixed constrained four-class decoder3/1063/10^{6}; U0.95=7.7536×10−6U_{0.95}=7.7536\times10^{-6}4/1064/10^{6}; U0.95=9.1535×10−6U_{0.95}=9.1535\times10^{-6}Primary independent result

caption: TABLE V. Diagnostic comparison at 15.6 dB and q=1q=1. Both rows use the same frozen independent samples. The identity predictor is a no-residual-inference baseline. This diagnostic isolates the contribution of residual-Pauli inference and is not used to define the confirmatory confidence bound.

:::

Numerical evaluation, statistical confidence, and resource accounting

Selection and confirmatory statistics

Fixed protocol, selection policy, and output definition

The confirmatory data are generated only after the decoder family, observable feature set, logical-Pauli definition, the primary level-dependent retention schedule q∗q^\ast, and the confidence criterion have been fixed. Training, calibration, schedule selection, and independent evaluation use disjoint replicate or seed-bank sets. The primary schedule is selected on calibration data and is not reselected on the independent test set.

Candidates are generated at each specified level and displacement-noise setting and decoded after final GKP correction. In the soft-verification mode, syndrome outcomes are recorded without an additional hard-rejection test. At 12.25 dB, each level-2–4 replicate contains M=500M=500 generated candidates. They are sorted by risk, with ties ordered by job and shot identifiers; the first max⁡{1,⌈MqL⌉}\max\{1,\lceil Mq_L\rceil\} are retained. This batchwise rank rule requires scoring and comparing the specified candidate set; associated candidate buffering and selection latency are outside the nominal supplied-GKP count and protected online layer depth. A separate fixed-cutoff streaming rule is discussed only as an alternative and is not assumed in these M=500M=500 results. True-error labels are not sorting keys. The 72 replicates per MN condition give 36,000/36,000, 25,200/36,000, and 34,560/36,000 selected/generated outputs at L=2,3,4L=2,3,4. Level 5 retains 15,000/15,000 at q5=1q_5=1. These are retention fractions at the modeled candidate boundary, not measured optical-source success probabilities.

Selection follows recursive message construction. The retained lower-level output sets are not fed back into generation of the higher-level test candidates. Thus these data do not characterize a factory with the same confidence filters cascaded through every internal child. This distinction concerns confidence rejection, not omission of verification measurements. The 15.6-dB q=1q=1 confirmation retains every generated candidate.

For each level and operating point, the attempted count, accepted count, logical-failure count, acceptance, logical Bell-pair error estimate, and uncertainty interval are retained. No decoder parameter, feature definition, logical-output definition, decoder-risk definition, or retention fraction is reselected from the confirmatory labels.

Jeffreys-posterior ordering statistic and evaluated grid

For each level LL, let kLk_L be the observed logical-failure count among nLn_L accepted outputs. The aggregate failure-rate parameter pLp_L used here is distinct from the candidate-level decoder class-score distribution pL(a∣y)p_L(a\mid y) and its decision-risk score rLr_L. Under the declared binomial model with the Jeffreys prior, the level-wise posterior is

pL∣kL,nL∼Beta⁡(kL+12,nL−kL+12).(68)p_L \mid k_L,n_L \sim\operatorname{Beta}\left(k_L+\frac{1}{2},n_L-k_L+\frac{1}{2}\right). \tag*{(68)}

The independent ordering evaluation draws these level-wise posteriors independently and estimates

π^ord=1B∑b=1B1[p5(b)<p4(b)<p3(b)<p2(b)].(69)\widehat{\pi}_{\mathrm{ord}}=\frac{1}{B}\sum_{b=1}^{B}\mathbf{1}\left[p_5^{(b)}<p_4^{(b)}<p_3^{(b)}<p_2^{(b)}\right]. \tag*{(69)}

For the reported 12.25-dB result, the evaluation uses B=900,000B=900,000 posterior draws. The resulting estimates are approximately 0.99998 (MN off) and 0.99981 (MN on). These are Monte Carlo estimates conditional on the independent-Jeffreys posterior model, not exact probabilities; their finite-draw standard errors are of order 5×10−65\times10^{-6} and 1.5×10−51.5\times10^{-5}, respectively, under independent posterior draws. The criterion used for the evaluated-grid diagnostic is π^ord>0.95\widehat{\pi}_{\mathrm{ord}}>0.95. This ordering statistic uses a declared independent-Jeffreys model for aggregate held-out failure counts; it is neither a paired cluster bootstrap nor an estimate of cross-level covariance from shared ancestry. The pointwise Jeffreys intervals in Figure 4 are separate summaries. The finite-level ordering claim is therefore conditioned on the declared binomial and level-wise posterior-independence model. As a descriptive split-lane check, each of the three independent lower-level lanes separately satisfies P4<P3<P2P_4<P_3<P_2 in both MN conditions, and each of the six level-5 lanes has zero failures in 2,500 selected roots per condition. Within each lower-level lane, rank selection is performed separately for each replicate. It couples acceptance indicators within a batch; independent posterior draws do not establish independent selected errors or correct for shared resource ancestry. The diagnostic therefore neither supplies a covariance-corrected guarantee nor establishes equivalence to a fixed-cutoff stream.

Recursive decoding and independent evaluation

Figure 6. Recursive decoding and independent evaluation. (a) Observable analog information, C4 syndromes, known frames, and mode addresses determine the designated Bell-pair class-score distribution and reliability record. Twelve child records and new verification data produce the parent record; acceptance remains binary Eqs. (9)–(11). (b) Decoder parameters and the retention schedule are fixed before independent evaluation. The posterior ordering statistic π^ord\hat{\pi}_{\mathrm{ord}} is defined in Appendix E 1; nominal supplied-GKP cost and calibration-only candidate selection are defined in Appendix E 2. The displayed Clopper–Pearson expression is the convention for the fixed-sample target confirmation. Panel (a) shows the predeclared batchwise rank-selection rule used in the numerical evaluation; true logical-error labels are used only to evaluate failures, not as decoder inputs. The boxes do not introduce fractional outputs or an observed retry-cost estimator.

The primary schedule q⋆q^{\star} is fixed on calibration data before the independent ordering sample is opened (Appendix D 3). For the finite set Ggrid\mathcal{G}_{\mathrm{grid}} of evaluated GKP displacement-noise levels (not the gauge group G\mathcal{G} of Appendix B 1), the first point meeting the criterion in both conditions is

srec,grid⋆(q⋆;Ggrid)=min⁡{s∈Ggrid:π^ordoff(s)>0.95, π^ordon(s)>0.95}.(70)s_{\mathrm{rec,grid}}^{\star}(q^{\star};\mathcal{G}_{\mathrm{grid}})=\min\left\{s\in\mathcal{G}_{\mathrm{grid}}:\hat{\pi}_{\mathrm{ord}}^{\mathrm{off}}(s)>0.95,\ \hat{\pi}_{\mathrm{ord}}^{\mathrm{on}}(s)>0.95\right\}. \tag*{(70)}

The adjacent points give Eq. (15). Figure 7 shows this ordering diagnostic over the evaluated GKP displacement-noise grid for both specified MN conditions. A candidate family Q\mathcal{Q} may be scanned on training/calibration data, but the independent test uses only the fixed schedule. No continuous threshold is inferred by interpolation.

Jeffreys-posterior probability of the strict ordering for the pre-specified postselection schedule

Figure 7. Jeffreys-posterior probability of the strict ordering P5<P4<P3<P2P_5 < P_4 < P_3 < P_2 for the pre-specified postselection schedule. The dashed line is the 0.95 criterion. The 12.25-dB point is the first evaluated point at which both conditions exceed the 0.95 criterion; the adjacent 12.125-dB point does not. This evaluated-grid transition is used to support the finite-level ordering and is not a standard physical–logical pseudothreshold.

Pointwise intervals and fixed-sample qualification

For the Jeffreys convention, a binomial likelihood and the prior p∼Beta⁡(1/2,1/2)p\sim\operatorname{Beta}(1/2,1/2) give the posterior p∣k,n∼Beta⁡(k+1/2,n−k+1/2)p\mid k,n\sim\operatorname{Beta}(k+1/2,n-k+1/2). Writing Qu(a,b)Q_u(a,b) for a beta-distribution quantile, the one-sided upper limit and central interval are

U0.95J(k,n)=Q0.95(k+1/2,n−k+1/2),(71)U_{0.95}^{\mathrm{J}}(k,n)=Q_{0.95}(k+1/2,n-k+1/2), \tag*{(71)}
I0.95J(k,n)=[Q0.025(k+1/2,n−k+1/2),Q0.975(k+1/2,n−k+1/2)].(72)I_{0.95}^{\mathrm{J}}(k,n)=\left[Q_{0.025}(k+1/2,n-k+1/2),Q_{0.975}(k+1/2,n-k+1/2)\right]. \tag*{(72)}

These are posterior credible statements, not Clopper–Pearson coverage guarantees. In particular a 95% one-sided limit is not the upper endpoint of a central 95% interval. Here nn is the accepted-sample count to which the binomial likelihood is applied, not an interchangeable raw-trial count.

For a binomial failure count kk in nn fixed selected samples, the one-sided Clopper–Pearson upper confidence limit is

U1−α(k,n)=I1−α−1(k+1,n−k),(73)U_{1-\alpha}(k,n) = I^{-1}_{1-\alpha}(k+1,n-k), \tag*{(73)}

where I−1I^{-1} is the inverse regularized incomplete beta function, for 0≤k<n0 \leq k < n; for k=nk=n the upper limit is 1. The stated coverage is conditional on a fixed-nn binomial model: the trial-level failure indicators must have the relevant independent, common-probability distribution after fixing the decoder and acceptance rule. Distinct seeds or a large aggregate nn do not by themselves establish this condition. Shared resource ancestry, within-batch quota selection, and outcome-dependent stopping require separate treatment. The independent 15.6-dB evaluation uses a fixed sample size with no result-dependent extension; diagnostic samples are not pooled into that evaluation. At this q=1q=1 operating point, no confidence-based batch rank rejection is applied. The intended binomial unit is the accepted designated Bell-pair output, not an individual GKP measurement or child resource. The binomial coverage statement additionally assumes independent root-level failure indicators, including no sharing of child-resource ancestry across those trials; this condition cannot be inferred from the fixed sample count alone. For the independent 15.6-dB confirmation, the two specified macronode-noise conditions are reported separately: at L=2L=2 and q=1q=1, the counts are 3/1063/10^6 and 4/1064/10^6, with upper limits 7.7536×10−67.7536 \times10^{-6} and 9.1535×10−69.1535 \times10^{-6}. No familywise 95% statement across both conditions is made.

Separate level-5 curve-support samples

At 11.75 dB, the level-5 curve-support markers correspond to zero observed failures among 2,500 accepted samples in each MN condition. These samples are separate from those used for the finite-level ordering test.

Figure 5 includes the additional level-5 curve-support calculation at 12.00 dB. With the extra post-injection macronode-noise step off, no failure was observed in 200,000 accepted samples, giving a one-sided 95% Jeffreys upper credible limit of 9.60×10−69.60 \times10^{-6}. Under the exact-binomial criterion used for the independent 15.6-dB certificate, the corresponding one-sided 95% Clopper–Pearson upper bound is 1.50×10−51.50 \times10^{-5} and therefore does not qualify the 10−510^{-5} target. With the step on, the result is 5/200,000=2.5×10−55/200,000 = 2.5 \times10^{-5}, with a 95% Jeffreys interval of 9.54×10−69.54 \times10^{-6} to 5.48×10−55.48 \times10^{-5}. These samples support the plotted level-5 trend only. They neither replace the posterior ordering analysis used for the evaluated-grid transition interval nor constitute the independent exact-binomial 10−510^{-5} certificate of Sec. VI B. To keep the scan and confirmatory roles distinct, level-5 points at and above 12.125 dB are not included in Figure 5; the independent 12.25-dB ordering sample remains in Figure 4.

Numerical records for resource analysis

The preparation and post-injection evaluations retain the following records for the resource analysis. Here CILprep\mathrm{CI}^{\mathrm{prep}}_L denotes the reported preparation-error interval, NLaccN^{\mathrm{acc}}_L the accepted-output count, and NLfailN^{\mathrm{fail}}_L the designated-output logical-failure count. The preparation-only dataset is

Dprep={L,sGKP,q,PLPS,prep,CILprep,Pacc(L),NLacc,NLfail}L=25.(74)\mathcal{D}_{\mathrm{prep}} = \left\{L, s_{\mathrm{GKP}}, \mathbf{q}, P^{\mathrm{PS,prep}}_L, \mathrm{CI}^{\mathrm{prep}}_L, P^{(L)}_{\mathrm{acc}}, N^{\mathrm{acc}}_L, N^{\mathrm{fail}}_L\right\}_{L=2}^{5}. \tag*{(74)}

For the reported post-injection evaluation, the records are indexed by LL, sGKPs_{\mathrm{GKP}}, the specified MN-on/off condition, and the fixed retention schedule q\mathbf{q}; the selected-output error counts and uncertainty intervals are reported for each condition. Cluster squeezing scls_{\mathrm{cl}}, QRL schedule SS, routing history hrouteh_{\mathrm{route}}, and an auxiliary logical Pauli distribution PQRL,LP_{\mathrm{QRL},L} belong only to the separate gate-specific model of Appendix C; they are not independently calibrated inputs to the reported effective MN displacement step. The physical-coordinate confirmation is distinct from the auxiliary independent logical-Pauli approximation described in Appendix C.

Nominal and expected resource accounting

Declared retention cost

The normalization is one accepted designated data-subsystem Bell resource, not two separately qualified C4 outputs. The supplied-GKP metric counts the preparation and rejection costs assigned by the recurrence below. It does not combine simultaneous optical modes, detectors, switches, delay lines, squeezed-vacuum ancillas, classical hardware, footprint, power, storage, and total execution time.

The finite-batch evaluation in Appendix E 1a retains the prescribed rank quota qLq_L, and its accepted logical-error probability is the conditional probability in Eq. (11). Unlike a streaming threshold applied to unseen candidates, the declared protocol fixes the retained count within each scored batch. For a batch with fixed cost per generated candidate and nn retained outputs, the selection penalty is exactly M/nM/n, here 1/qL1/q_L. This output-stage ratio alone does not establish the cost of a recursively confidence-filtered child supply. Schedules and decoders are fixed before independent evaluation.

For the twelve-child factory, let RLRGKPR_L^{\mathrm{RGKP}} denote the supplied-GKP cost assigned by the declared schedule-level accounting convention. This nominal schedule metric counts supplied GKP qubits per designated Bell resource, not simultaneous hardware or a directly measured mean delivered cost. Actual mean consumption additionally requires the specified retry and supply process. With a declared baseline and nominal retained fraction qL+1q_{L+1}, its recursion is

RL+1GKP(q)=12RLGKP(q)qL+1(75)R_{L+1}^{\mathrm{GKP}}(\mathbf{q}) = \frac{12R_L^{\mathrm{GKP}}(\mathbf{q})}{q_{L+1}} \tag*{(75)}

(75) assigns the retention penalty 1/qL+11/q_{L+1} at each level. It is not an observed internal-child retry ledger. No extra factor for a syndrome-only hard-rejection test is required by the reported soft-verification mode, since that test is not applied. This does not include experimental source-generation failures, storage loss, or finite-capacity waiting.

For the 12.25-dB schedule, ∏ℓ=25qℓ=0.672\prod_{\ell=2}^{5}q_\ell= 0.672 and its inverse is 1.488095…1.488095\ldots. These summarize the nominal level-wise penalties; 67.2% is not a measured end-to-end factory success probability. The measured output-retention fractions are given separately in Appendix E 1a.

Calibration selection and independent qualification

For fixed GKP displacement-noise level sGKPs_{\mathrm{GKP}}, macronode-noise condition mm, target ptargp_{\mathrm{targ}}, and a pre-specified candidate family, selection and qualification are separate steps. Write θ=(L,q)\boldsymbol{\theta}=(L,q) and suppress the fixed arguments of RGKPnomR_{\mathrm{GKP}}^{\mathrm{nom}}. Here RGKPnomR_{\mathrm{GKP}}^{\mathrm{nom}} denotes the same declared schedule cost as RLGKPR_L^{\mathrm{GKP}} above. The rule is

θsel∈arg⁡min⁡θ∈Fcal RGKPnom(θ),\theta_{\mathrm{sel}} \in\underset{\theta\in\mathcal{F}_{\mathrm{cal}}}{\arg\min}\ R_{\mathrm{GKP}}^{\mathrm{nom}}(\theta),
Qconf(θsel)=1 ⁣[U0.95conf(θsel)≤ptarg].(76)Q_{\mathrm{conf}}(\theta_{\mathrm{sel}})=\mathbb{1}\!\left[U_{0.95}^{\mathrm{conf}}(\theta_{\mathrm{sel}})\leq p_{\mathrm{targ}}\right]. \tag*{(76)}

Here Fcal\mathcal{F}_{\mathrm{cal}} is the candidate subset admitted by the pre-specified calibration criterion, not a set filtered using independent confirmation outcomes. The selected candidate is fixed before the disjoint confirmation data are opened; independent data determine only its qualification. If Qconf=1Q_{\mathrm{conf}}=1, the reported cost is RGKPnom(θsel)R_{\mathrm{GKP}}^{\mathrm{nom}}(\theta_{\mathrm{sel}}); otherwise that test does not qualify the selected candidate, and it does not trigger retrospective reselection. The bound U0.95confU_{0.95}^{\mathrm{conf}} uses the interval convention specified for that evaluation. The GKP displacement-noise level is held fixed because improving physical GKP quality is not counted as free by the supplied-GKP-qubit metric. The distinct diagnostic selection of the 15.6-dB point and its new independent confirmation are described in § 2 B.

Operating-point costs and source-quality break-even

Using the same nominal schedule-cost convention, RL=2=288R_{L=2}=288 is the declared level-2 baseline cost and the level-3 point uses the pre-specified retained fraction q3=0.95q_3=0.95. The baseline is consistent with an algebraically implied level-1 nominal count RL=1=288/12=24R_{L=1}=288/12=24 and a twelve-child step with q2=1q_2=1. The value 24 is an inferred normalization, not a verified component-by-component physical supply ledger; the breakdown of GKP states, qunaut inputs, and any non-counted ancillas must be checked against the factory circuit before identifying it with a complete source cost. (75) then gives

RL=2=288,(77)R_{L=2}=288, \tag*{(77)}
RL=3=12×2880.95=3637.8947,(78)R_{L=3}=\frac{12\times288}{0.95}=3637.8947, \tag*{(78)}

and therefore

RL=3RL=2=12.6316.(79)\frac{R_{L=3}}{R_{L=2}}=12.6316. \tag*{(79)}

The 14-dB level-3 point meets the 10−510^{-5} target under the declared one-sided Jeffreys-posterior convention (0/199,500)(0/199,500), whereas the 15.6-dB level-2 point has a separate fixed-sample Clopper–Pearson qualification (4/106(4/10^6 for MN on). The 12.63 nominal cost ratio therefore does not represent a common exact-binomial confidence certificate for both operating points. The supplied-qubit ratio does not assign equal generation cost to GKP qubits of different quality. Let Csrc(s)C_{\mathrm{src}}(s) denote the mean source cost per supplied GKP qubit at displacement-noise level ss. Within this multiplicative source-cost model, the 15.6-dB L=2L = 2 point has a lower assigned source cost than the 14-dB L=3L = 3 point whenever

Csrc(15.6)Csrc(14)<3637.8947288=12.6316.(80)\frac{C_{\mathrm{src}}(15.6)}{C_{\mathrm{src}}(14)} < \frac{3637.8947}{288} = 12.6316. \tag*{(80)}

This multiplicative per-qubit break-even relation leaves source-specific shared hardware, nonlinear multiplexing overhead, and throughput constraints to a dedicated source model. (79) compares the same nominal factory-consumption metric at different input qualities; it is not a C4C_4/RHG cost quotient.

Relation to actual expected retry consumption

For comparison, let CattC_{\mathrm{att}} include all costs of one complete candidate attempt, including its consumed child resources and any local preparation or verification resources. If successive attempts are independently and identically distributed, each has success probability Pacc>0P_{\mathrm{acc}} > 0, and a failed attempt is discarded before restarting under the same rule, then

E[Cdelivered]=E[Catt]Pacc.(81)\mathbb{E}[C_{\mathrm{delivered}}] = \frac{\mathbb{E}[C_{\mathrm{att}}]}{P_{\mathrm{acc}}}. \tag*{(81)}

This renewal identity follows by writing the mean total cost as the mean cost of the first attempt plus (1−Pacc)(1 - P_{\mathrm{acc}}) times a fresh total cost. Cost and acceptance within one attempt need not be independent; the restarted process must obey the same distribution. Recycling, adaptive stopping, shared caches, and partial retries require their own ledger and state-dependent model. Substituting qq for PaccP_{\mathrm{acc}} in this single-candidate retry identity requires the corresponding acceptance assumption. The fixed-quota batch penalty M/nM/n above is a separate accounting relation.

We use 288 as the declared nominal normalization rather than as a separately measured complete expected cost. Physical QND/SUM gate consumption requires separate local gate and ancilla entries rather than reuse of the GKP-only recursion.

Conventional Knill-type postselection

For comparison, conventional hard-postselected constructions abort preparation when a verification flag is triggered [56, 57]. This is a different acceptance policy from the numerical soft-verification mode used here; the pass probability below is not an omitted factor in that mode. The rigorous postselection threshold framework can be viewed as a recursive conditional-channel construction: data are allowed to interact with an ancillary resource only after the latter has passed the appropriate verification tests.

At a single verification level, let AL∈{0,1}A_L \in\{0,1\} be the level-LL retention indicator and let ELE_L be the designated-output logical-failure event defined in Sec. III. The hard-postselected logical-error probability is the conditional event probability

PLhard=Pr⁡(EL∣AL=1),(82)P^{\mathrm{hard}}_L = \Pr(E_L \mid A_L = 1), \tag*{(82)}

with acceptance probability

Pacchard(L)=Pr⁡(AL=1).(83)P^{\mathrm{hard}}_{\mathrm{acc}}(L) = \Pr(A_L = 1). \tag*{(83)}

For a recursive resource factory in which a level-(L+1)(L+1) parent consumes NchildN_{\mathrm{child}} level-LL child resources, the hard-postselected acceptance probability has the schematic form

Pdelhard(L+1)≃Pver(L+1)[Pdelhard(L)]Nchild,(84)P^{\mathrm{hard}}_{\mathrm{del}}(L+1) \simeq P^{(L+1)}_{\mathrm{ver}} \left[P^{\mathrm{hard}}_{\mathrm{del}}(L)\right]^{N_{\mathrm{child}}}, \tag*{(84)}

where Pver(L+1)P^{(L+1)}_{\mathrm{ver}} is the probability that the parent-level syndrome tests pass. When child resources are instead prepared with separate retries, the corresponding expected resource-cost recursion is

RL+1hard≃NchildRLhardPver(L+1).(85)R^{\mathrm{hard}}_{L+1} \simeq\frac{N_{\mathrm{child}}R^{\mathrm{hard}}_L}{P^{(L+1)}_{\mathrm{ver}}}. \tag*{(85)}

In the C4C_4 Knill-type recursive verification gadget considered here, Nchild=12N_{\mathrm{child}} = 12. Equations (E17) and (E18) make explicit why hard postselection can produce high conditional fidelity but poor throughput: the accepted channel is improved by conditioning, while the preparation overhead grows as the acceptance probability decreases. Related GKP schemes have likewise used analog information, tracking, and concatenation with higher-level codes to reduce logical errors or physical-resource overhead [114, 115].

Diagnostic scans and independent confirmation

After independent evaluation at 13, 14, 15, and 16 dB under the specified Jeffreys convention, a diagnostic scan selected one point for a new confirmation. Its designated-data failure counts per 10510^5 samples were

sGKPs_{\mathrm{GKP}} (dB)noise offnoise on
15.224
15.412
15.600
15.800

Table 1.

The scan was used only to identify 15.6 dB as the first zero-observed-failure point on the evaluated 0.2-dB grid. The 10−510^{-5} certificate is based on a separate fixed-sample confirmation with 10610^6 selected samples per condition, the decoder and operating point fixed before evaluation, and no parameter reselection. Its two condition-specific Clopper–Pearson results provide the focal qualification.

The supplementary direct-tail calculation uses the nominal level-3 retained fraction q3=0.75q_3 = 0.75. The reported sealed diagnostic points have zero selected-output failures among 900,000 selected outputs obtained from 1,200,000 raw trials per condition. The stored central 95% Jeffreys credible intervals have upper endpoints 2.794×10−62.794 \times10^{-6} (MN noise off, 13.3 dB) and 2.807×10−62.807 \times10^{-6} (MN noise on, 14.0 dB). These are Monte Carlo estimates of interval endpoints from 250,000 posterior draws, not one-sided 95% limits; their small difference at identical counts is sampling variation. Within each raw-data batch, candidates are ranked by observable risk and the prescribed lowest-risk 75% is selected. This is not the application of a separately calibrated fixed cutoff. The adaptive-stopping diagnostic is therefore not an additional independent fixed-sample target qualification. Figure 8 is included only as a supplementary diagnostic; its 10−710^{-7} line is a reference scale, not a performance claim.

Supplementary direct-tail diagnostics for the nominal level-3 retained fraction

Figure 8. Supplementary direct-tail diagnostics for the nominal level-3 retained fraction q3=0.75q_3 = 0.75. The displayed estimates and Jeffreys intervals refer to selected outputs; for the sealed zero-failure points, the plotted upper markers are the upper endpoints of the stored central 95% Jeffreys credible intervals. Each sealed point contains 900,000 selected outputs from 1,200,000 raw trials. These adaptive-stopping diagnostics are not used as an additional independent fixed-sample target qualification. The 10−710^{-7} line is a reference scale only.

C4-only plots and architecture boundaries

The interface specification and within-factory comparison do not require a cross-architecture performance ranking. The nominal supplied-Bell-resource GKP count and an RHG spacetime volume have different units and are not directly comparable without matched source, operation, and failure conventions. Likewise, a one-layer logical SWAP construction is not a measurement of total algorithm runtime. Figure 9 shows the C4C_4 aggregate-count upper bounds from Table III. It does not put a supplied Bell-resource cost and an RHG spacetime volume on one performance axis, or compare a one-layer SWAP construction with a different protected-operation duration.

C4-only upper-bound arithmetic from the aggregate counts in Table III

Figure 9. C4C_4-only upper-bound arithmetic from the aggregate counts in Table III. The horizontal coordinate is the declared GKP displacement-noise level, not a direct measurement of a particular source. Filled circles and open squares distinguish MN noise off and on; overlapping markers denote equal upper bounds. The 15.6-dB points use one-sided 95% Clopper–Pearson limits, while the other points retain one-sided 95% Jeffreys limits. Points are not joined because the evaluated level, retained fraction, and interval convention change. The limits are calculated from the reported (k,n)(k,n) under the statistical conventions and assumptions in Appendix E 1. Factory cost remains in Table III; the conditional SWAP-layer result is reported separately.

A quantitative cross-architecture comparison would require the same logical operation, target failure definition, source convention, and finite-size model. The present comparison distinguishes these resource boundaries and does not establish a C4C_4/RHG resource quotient, an optimal RHG distance, or a runtime advantage.

QRL measurement patterns and their C4 logical action

This Appendix gives representative QRL measurement patterns for the bounded-depth operations used at the C4/QRL interface and connects the physical Gaussian maps to the logical-action and protected-depth conventions of Sec. III F. These ideal maps specify the physical implementation scope of the interface; the logical-error certificate for the accepted Bell resource is defined separately in the main text.

Macronode and depth convention

The physical macronode convention is the one shown in Figure 2. The four measured modes in a macronode are denoted by AA–DD. In the diagrams below, quadrature labels attached to measured modes specify the homodyne bases, green circles mark the surviving computational rails, and the symbol ≐\doteq denotes equality of the induced Gaussian map up to deterministic classical postprocessing, displacement feedforward, and tracked Clifford-frame updates [24, 25, 28]. These deterministic corrections belong to the correction record of Sec. III, not additional protected quantum layers. An ideal Gaussian map in these diagrams denotes a Gaussian unitary, represented on quadratures by a symplectic transformation; its finite-squeezing noise channel is specified separately.

A protected online layer is one sequential QRL/macronode measurement layer acting on the injected encoded data. Physical operations on disjoint C4 indices belong to the same protected layer when they are executed in parallel. Thus, if a physical QRL pattern gg has fixed sequential length dgd_g, its transversal application to a level-LL block satisfies

Dprot(g,L)=dg(86)D_{\mathrm{prot}}(g,L)=d_g \tag*{(86)}

under the advance-preparation and address-preserving routing conditions of Criterion F.1. The present work does not assign separate numerical values to Hadamard, CNOT, or Bell-measurement depths; the quantitative benchmark used in the main text is the explicitly evaluated address-tracked logical-subsystem SWAP with DprotSWAP=1D_{\mathrm{prot}}^{\mathrm{SWAP}}=1.

Single-register identity and Fourier patterns

The identity-teleportation pattern supplies the ideal single-step reference map. Its finite-squeezing calibration to the declared effective MN-noise condition is a separate requirement. A convenient homodyne choice is shown in Figure 10. Equal basis choices on the paired macronode modes cancel the unwanted vertical coupling after classical postprocessing, leaving the one-dimensional teleportation map [24, 28]. Finite-squeezing noise associated with this step is treated separately in Appendix C.1; the diagram below represents the ideal Gaussian map.

Figure 10. Representative QRL identity-teleportation pattern. The left copy shows the homodyne bases and the right copy shows the induced ideal map. The equivalence is up to deterministic feedforward displacements and tracked frame updates.

A Fourier transformation is obtained by changing the measured quadratures as shown in Figure 11 [24]. For square-lattice GKP qubits this physical Fourier map induces the usual logical Hadamard action up to the declared GKP/Clifford-frame convention. At the C4 level, however, the label-preserving Hadamard also requires the physical-index permutation specified below; this is why the logical action is stated in terms of the C4 D/GD/G subsystem map rather than by assigning a separate depth symbol to the Fourier pattern alone.

Figure 11. Representative QRL Fourier pattern. The highlighted effective map is F^\hat{F} up to deterministic displacement and frame corrections. Parallel application to the C4 leaves supplies the physical H⊗4H^{\otimes4} component of the label-preserving logical Hadamard.

Tracked register permutation and the SWAP benchmark

QRL measurement choices can also implement deterministic permutations of the computational registers. Figure 12 shows a two-register SWAP pattern. The operation moves the computational rails while exchanging the selected registers; for some larger cyclic permutations a known Fourier byproduct can appear and must be retained in the frame record. Because the permutation is deterministic, it is propagated through the declared address map rather than treated as an unknown error.

Figure 12. QRL register-permutation pattern implementing a deterministic SWAP of the selected computational registers, up to tracked frame corrections. The right-hand shaded path denotes the effective routed register map. The permutation is retained explicitly in the address record and is therefore not interpreted as a stochastic logical fault.

For the C4 logical-subsystem SWAP used as the depth benchmark, the required physical permutation is applied in parallel across the relevant leaves and the output-address record is relabeled to follow the routed data subsystem. The specific benchmark used in the main text is one protected macronode layer,

DprotSWAP=1,(87)D_{\mathrm{prot}}^{\mathrm{SWAP}}=1, \tag*{(87)}

while controller latency and frame bookkeeping are accounted for separately.

Entangling SUM–SWAP pattern and C4 logical action

The two-register entangling pattern used here is a SUM operation accompanied by a deterministic register exchange. The corresponding QRL measurement pattern is shown in Figure 13. In the vertical crossing channel, the sequence of local Fourier transformations and the QRL entangling interaction produces the physical SUM map; the same pattern also exchanges the routed computational registers. Thus the physical operation furnished directly by this pattern is a SUM–SWAP rather than a bare CNOT with an implicit routing convention.

Figure 13. QRL SUM–SWAP measurement pattern. The chosen homodyne bases induce the physical SUM entangling map together with a deterministic exchange of the computational registers, up to displacement and frame corrections. When applied transversally to address-matched GKP/C4 leaves, the SUM component supplies the logical CNOT action and the known register exchange is carried by the address record.

On square-lattice GKP code states, the SUM map induces the logical GKP CX/CNOT action up to the declared local Fourier and Pauli/Clifford-frame conventions. Applied in parallel to corresponding physical indices of two C4 blocks, the SUM component therefore supplies the transversal logical CNOT action, while the accompanying deterministic register exchange is propagated through the address record. In the C4 logical-Pauli convention of Appendix B 4, the abstract transversal CNOT map is

CNOTA→B⊗4=CNOT‾DA→DB⊗CNOT‾GA→GB,(88)\mathrm{CNOT}_{A\to B}^{\otimes4}=\overline{\mathrm{CNOT}}_{D_A\to D_B}\otimes\overline{\mathrm{CNOT}}_{G_A\to G_B}, \tag*{(88)}

and the physical QRL realization adds only the declared deterministic routing/permutation shown in Figure 13. The quantitative depth comparison in this work is anchored by the SWAP benchmark and therefore does not require an additional operation-specific CNOT depth parameter in the numerical claim.

C4 Hadamard, Bell measurement, and non-Clifford injection

For the data and gauge degrees of freedom of C4, the label-preserving Hadamard convention used throughout the manuscript is

H‾DH‾G=SWAP23H⊗4,(89)\overline{H}_{D}\overline{H}_{G}=\mathrm{SWAP}_{23}H^{\otimes4}, \tag*{(89)}

consistent with Eq. (30). The parallel Fourier pattern of Figure 11 supplies the H⊗4H^{\otimes4} component, while the rerequired deterministic physical-index permutation is implemented and tracked using the register-routing operation above. The purpose of this construction is to establish a bounded-length physical realization consistent with the interface criterion; no separate Hadamard depth parameter enters the numerical claim.

Logical Bell measurement is implemented by parallel physical GKP Bell measurements followed by classical C4_4 decoding and deterministic frame composition. Only the physical measurement sequence contributes to protected quantum depth; the decoding and frame-processing latency belongs to the classical-control term of the latency decomposition. The numerical logical-error certificate is defined for the accepted encoded Bell resource and the declared post-injection channel; the ideal maps in this Appendix specify how the corresponding QRL operations enter the interface.

Fault-tolerant universality additionally requires a verified non-Clifford resource. Such a resource can be prepared offline and consumed through logical teleportation, with the resulting Pauli/Clifford byproduct propagated through the same frame and address interface [73, 74]. The architecture is compatible with this route, but the numerical resource counts 288 and 3637.9 reported in the main text do not include a non-Clifford-resource factory, and no full algorithm-level compilation or waiting-time claim is made here.

Advance preparation and the execution criterion

DprotD_{\mathrm{prot}} counts protected QRL/macronode layers, not preparation, classical processing, or resource waiting. These circuit-level counts are distinct from the algorithm-level guarantees of transversal algorithmic fault tolerance [116].

Operational criterion F.1. Preservation of bounded online depth under advance preparation and parallel routing Consider a level-LL code family and a logical operation GG for which there exists a level-independent integer DGD_G such that, for every LL, GG is implemented by DGD_G sequential layers of disjoint physical operations. Suppose that (i) every encoded ancilla required by GG is prepared before the online operation, (ii) all physical operations within each declared layer are executable concurrently with the available parallel capacity, (iii) routing preserves that parallel execution without serializing a declared protected layer, and (iv) classical Pauli-frame updates are excluded from protected online depth. Then

Dprot(G,L)=DG,(90)D_{\mathrm{prot}}(G,L)=D_G, \tag*{(90)}

independent of LL, even when the code distance d(L)d(L) and the number of parallel physical operations Npair(L)N_{\mathrm{pair}}(L) increase with LL. For concatenated C4_4, the code distance is dC4(L)=2Ld_{\mathrm{C}_4}(L)=2^L and Npair(L)=4L=dC4(L)2N_{\mathrm{pair}}(L)=4^L=d_{\mathrm{C}_4}(L)^2.

Advance preparation does not imply zero or level-independent preparation time. Replacing logical locations by disjoint child locations increases parallel width without adding protected layers only when each layer can run concurrently. Hardware serialization violates this premise and must be accounted for through BaddrB_{\mathrm{addr}} and the timing model below. This is an implementation criterion; finite-level error contraction is evaluated separately.

Protected online depth, parallel width, and execution time

For a level-LL C4_4 block, the number of physical operations required by one transversal layer is

Npair(L)=4L=dC4(L)2.(91)N_{\mathrm{pair}}(L)=4^L=d_{\mathrm{C}_4}(L)^2. \tag*{(91)}

If only PpairP_{\mathrm{pair}} operations are available in one optical clock slot, the transversal layer spans

Baddr(L;Ppair)=⌈4LPpair⌉(92)B_{\mathrm{addr}}(L;P_{\mathrm{pair}})=\left\lceil\frac{4^L}{P_{\mathrm{pair}}}\right\rceil \tag*{(92)}

time bins or synchronized batches. Criterion F.1 concerns protected online depth, not total elapsed time. A schematic timing relation is

τop≳Baddrτbin+DGτMN+τff,(93)\tau_{\mathrm{op}}\gtrsim B_{\mathrm{addr}}\tau_{\mathrm{bin}}+D_G\tau_{\mathrm{MN}}+\tau_{\mathrm{ff}}, \tag*{(93)}

where τbin\tau_{\mathrm{bin}} is the time-bin spacing, τMN\tau_{\mathrm{MN}} is the duration of one QRL/macronode layer, and τff\tau_{\mathrm{ff}} is the feedforward latency. Full spatial parallelism gives Baddr=1B_{\mathrm{addr}}=1; temporal multiplexing reduces the number of spatial modes at the cost of a longer operation time. First-output latency also includes resource preparation and availability, for which no distance-independent bound is established.

Let ΓGKP(s)\Gamma_{\mathrm{GKP}}(s) denote the rate at which physical GKP qubits at displacement-noise level ss enter the factory, and let RGKP,L(s)R_{\mathrm{GKP,L}}(s) be the expected supplied-qubit consumption per accepted encoded Bell resource. When RGKP,LR_{\mathrm{GKP,L}} is the actual mean delivered-resource cost and GKP supply is the bottleneck, the ideal source-limited accepted-resource rate is

Γfac,L(s)≃ΓGKP(s)RGKP,L(s).(94)\Gamma_{\mathrm{fac,L}}(s)\simeq\frac{\Gamma_{\mathrm{GKP}}(s)}{R_{\mathrm{GKP,L}}(s)}. \tag*{(94)}

Inserting the nominal schedule cost into this relation is a conditional planning estimate, not a measured throughput. It additionally requires that the nominal baseline and retention penalties equal the corresponding actual mean costs. If a logical operation GG consumes nanc(G)n_{\mathrm{anc}}(G) accepted resources at rate ΓG\Gamma_G, stall-free operation requires

Γfac,L(s)≥nanc(G)ΓG.(95)\Gamma_{\mathrm{fac,L}}(s)\ge n_{\mathrm{anc}}(G)\Gamma_G. \tag*{(95)}

This average-rate requirement alone does not exclude stalls with stochastic supply and finite buffers. Within this source-limited model, assigning equal raw GKP supply rates at 14 and 15.6 dB would make the accepted-resource rate at the L=2L = 2 point a factor 3637.8947/288 = 12.6316 higher than at the L=3L = 3 point. This conditional rate estimate assumes that entangling gates, switching, storage, and decoding are not bottlenecks; it is not a measured speedup. Calibrated storage loss and finite-capacity throughput are outside the present numerical evaluation.

The two operating points highlighted in the resource comparison are

L=2:dC4(2)=4,Npair=16,DprotSWAP=1,RGKP=288(15.6 dB),L=3:dC4(3)=8,Npair=64,DprotSWAP=1,RGKP=3637.9(14 dB).(96)\begin{aligned} L &= 2:\quad d_{\mathrm{C4}}(2) = 4,\quad N_{\mathrm{pair}} = 16,\quad D_{\mathrm{prot}}^{\mathrm{SWAP}} = 1,\\ &\qquad R_{\mathrm{GKP}} = 288\quad(15.6\ \mathrm{dB}),\\ L &= 3:\quad d_{\mathrm{C4}}(3) = 8,\quad N_{\mathrm{pair}} = 64,\quad D_{\mathrm{prot}}^{\mathrm{SWAP}} = 1,\\ &\qquad R_{\mathrm{GKP}} = 3637.9\quad(14\ \mathrm{dB}). \tag*{(96)} \end{aligned}

These points illustrate two uses of the same interface at different input qualities, block sizes, and factory costs. Their one-layer SWAP construction is a separate conditional circuit property, not a fixed-quality asymptotic fit or a total-runtime comparison.

For implementation planning, the classical feedforward loop may be summarized by

Bdelay=⌈τffτbin⌉(97)B_{\mathrm{delay}} = \left\lceil\frac{\tau_{\mathrm{ff}}}{\tau_{\mathrm{bin}}} \right\rceil \tag*{(97)}

where τbin\tau_{\mathrm{bin}} is the optical time-bin spacing and τff\tau_{\mathrm{ff}} is the feedforward latency. An algorithm-level estimate would additionally require a compiled logical circuit, counts and scheduling of Clifford and non-Clifford operations, an allocated total failure budget, the refresh/teleportation cadence, magic-state-factory throughput, routing, storage, and concurrent factory/processor timing. Because these inputs are not fixed here, we do not report an algorithm-level runtime or spacetime volume.

References

References

  1. [1]P. W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science (IEEE, 1994) pp. 124–134.
  2. [2]C. Gidney and M. Ekerå, How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits, Quantum 5, 433 (2021).DOI
  3. [3]A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Physical Review A 86, 032324 (2012).DOI
  4. [4]J. Guillaud and M. Mirrahimi, Repetition cat qubits for fault-tolerant quantum computation, Physical Review X 9, 041053 (2019).DOI
  5. [5]A. Kubica, A. Haim, Y. Vaknin, H. Levine, F. Brandão, and A. Retzker, Erasure qubits: Overcoming the T1 limit in superconducting circuits, Physical Review X 13, 041022 (2023).DOI
  6. [6]N. H. Nickerson, J. F. Fitzsimons, and S. C. Benjamin, Freely scalable quantum technologies using cells of 5-to-50 qubits with very lossy and noisy photonic links, Physical Review X 4, 041041 (2014).DOI
  7. [7]J. Ramette, J. Sinclair, Z. Vendeiro, A. Rudelis, M. Cetina, and V. Vuletić, Any-to-any connected cavity-mediated architecture for quantum computing with trapped ions or rydberg arrays, PRX Quantum 3, 010344 (2022).
  8. [8]I. Cong, H. Levine, A. Keesling, D. Bluvstein, S.-T. Wang, and M. D. Lukin, Hardware-efficient, fault-tolerant quantum computation with rydberg atoms, Physical Review X 12, 021049 (2022).arxiv.org/abs/2105.13501
  9. [9]Z. Cai, A. Siegel, and S. Benjamin, Looped pipelines enabling effective 3D qubit lattices in a strictly 2D device, PRX Quantum 4, 020345 (2023), erratum: PRX Quantum 6, 010901 (2025).
  10. [10]N. C. Jones, R. Van Meter, A. G. Fowler, P. L. McMahon, J. Kim, T. D. Ladd, and Y. Yamamoto, Layered architecture for quantum computing, Physical Review X 2, 031007 (2012).
  11. [11]R. Raussendorf and H. J. Briegel, A one-way quantum computer, Physical Review Letters 86, 5188 (2001).pubmed.ncbi.nlm.nih.gov/11384453
  12. [12]R. Raussendorf, D. E. Browne, and H. J. Briegel, Measurement-based quantum computation on cluster states, Physical review A 68, 022312 (2003).DOI
  13. [13]R. Raussendorf, J. Harrington, and K. Goyal, Topological fault-tolerance in cluster state quantum computation, New Journal of Physics 9, 199 (2007).DOI
  14. [14]C. Weedbrook et al., Gaussian quantum information, Reviews of Modern Physics 84, 621 (2012).
  15. [15]S. Takeda and A. Furusawa, Toward large-scale fault-tolerant universal photonic quantum computing, APL Photonics 4, 060902 (2019).DOI
  16. [16]K. Fukui and S. Takeda, Building a large-scale quantum computer with continuous-variable optical technologies, Journal of Physics B: Atomic, Molecular and Optical Physics 55, 012001 (2022).
  17. [17]N. C. Menicucci, P. van Loock, M. Gu, C. Weedbrook, T. C. Ralph, and M. A. Nielsen, Universal quantum computation with continuous-variable cluster states, Physical Review Letters 97, 110501 (2006).pubmed.ncbi.nlm.nih.gov/17025869
  18. [18]S. Yokoyama et al., Ultra-large-scale continuous-variable cluster states multiplexed in the time domain, Nature Photonics 7, 982 (2013).DOI
  19. [19]J. Yoshikawa et al., Generation of one-million-mode continuous-variable cluster state by unlimited time-domain multiplexing, APL Photonics 1, 060801 (2016).DOI
  20. [20]W. Asavanant et al., Generation of time-domain-multiplexed two-dimensional cluster state, Science 366, 373 (2019).DOI
  21. [21]M. V. Larsen, X. Guo, C. R. Breum, J. S. Neergaard-Nielsen, and U. L. Andersen, Deterministic generation of a two-dimensional cluster state, Science 366, 369 (2019).DOI
  22. [22]S. Yokoyama, A. Sakaguchi, W. Asavanant, K. Takase, Y.-R. Chen, H. Nagayoshi, J. Yoshikawa, T. Kashiwazaki, A. Inoue, T. Umeki, T. Hashimoto, T. Hiraoka, A. Furusawa, and H. Yonezawa, A full-stack analog optical quantum computing platform with one hundred inputs (2025), arXiv:2506.16147.
  23. [23]R. N. Alexander and N. C. Menicucci, Flexible quantum circuits using scalable continuous-variable cluster states, Physical Review A 93, 062326 (2016).DOI
  24. [24]M. V. Larsen, J. S. Neergaard-Nielsen, and U. L. Andersen, Architecture and noise analysis of continuous-variable quantum gates using two-dimensional cluster states, Physical Review A 102, 024608 (2020).DOI
  25. [25]B. W. Walshe, R. N. Alexander, N. C. Menicucci, and B. Q. Baragiola, Streamlined quantum computing with macronode cluster states, Physical Review A 104, 062427 (2021).DOI
  26. [26]D. Gottesman, A. Kitaev, and J. Preskill, Encoding a qubit in an oscillator, Physical Review A 64, 012310 (2001).DOI
  27. [27]N. C. Menicucci, Fault-tolerant measurement-based quantum computing with continuous-variable cluster states, Physical Review Letters 112, 120504 (2014).pubmed.ncbi.nlm.nih.gov/24724639
  28. [28]B. W. Walshe, B. Q. Baragiola, R. N. Alexander, and N. C. Menicucci, Continuous-variable gate teleportation and bosonic-code error correction, Physical Review A 102, 062411 (2020).
  29. [29]S. Konno et al., Logical states for fault-tolerant quantum computation with propagating light, Science 383, 289 (2024).DOI
  30. [30]M. V. Larsen et al., Integrated photonic source of Gottesman–Kitaev–Preskill qubits, Nature 642, 587 (2025).DOI
  31. [31]M. Yukawa, K. Miyata, H. Yonezawa, P. Marek, R. Filip, and A. Furusawa, Emulating quantum cubic nonlinearity, Phys. Rev. A 88, 053816 (2013).DOI
  32. [32]K. Miyata, H. Ogawa, P. Marek, R. Filip, H. Yonezawa, J. Yoshikawa, and A. Furusawa, Implementation of a quantum cubic gate by an adaptive non-gaussian measurement, Phys. Rev. A 93, 022301 (2016).DOI
  33. [33]P. Marek, R. Filip, H. Ogawa, A. Sakaguchi, S. Takeda, J. Yoshikawa, and A. Furusawa, General implementation of arbitrary nonlinear quadrature phase gates, Phys. Rev. A 97, 022329 (2018).DOI
  34. [34]S. Konno, A. Sakaguchi, W. Asavanant, H. Ogawa, M. Kobayashi, P. Marek, R. Filip, J. Yoshikawa, and A. Furusawa, Nonlinear squeezing for measurement-based non-gaussian operations in time domain, Phys. Rev. Applied 15, 024024 (2021).DOI
  35. [35]A. Sakaguchi, S. Konno, F. Hanamura, W. Asavanant, K. Takase, H. Ogawa, P. Marek, R. Filip, J. Yoshikawa, E. Huntington, H. Yonezawa, and A. Furusawa, Nonlinear feedforward enabling quantum computation, Nat. Commun. 14, 3817 (2023).
  36. [36]K. Fukui, A. Tomita, A. Okamoto, and K. Fujii, High-threshold fault-tolerant quantum computation with analog quantum error correction, Physical Review X 8, 021054 (2018).
  37. [37]K. Fukui, W. Asavanant, and A. Furusawa, Temporal-mode continuous-variable three-dimensional cluster state for topologically protected measurement-based quantum computation, Phys. Rev. A 102, 032614 (2020).DOI
  38. [38]H. Yamasaki, K. Fukui, Y. Takeuchi, S. Tani, and M. Koashi, Polylog-overhead highly fault-tolerant measurement-based quantum computation: all-Gaussian implementation with Gottesman–Kitaev–Preskill code (2020), arXiv:2006.05416 [quant-ph].arxiv.org/abs/2006.05416
  39. [39]M. V. Larsen, C. Chamberland, K. Noh, J. S. Neergaard-Nielsen, and U. L. Andersen, Fault-tolerant continuous-variable measurement-based quantum computation architecture, PRX Quantum 2, 030325 (2021).
  40. [40]J. E. Bourassa et al., Blueprint for a scalable photonic fault-tolerant quantum computer, Quantum 5, 392 (2021).
  41. [41]I. Tzitrin, T. Matsuura, R. N. Alexander, G. Dauphinais, J. E. Bourassa, K. K. Sabapathy, N. C. Menicucci, and I. Dhand, Fault-tolerant quantum computation with static linear optics, PRX Quantum 2, 040353 (2021).
  42. [42]K. Noh, C. Chamberland, and F. G. S. L. Brandão, Low-overhead fault-tolerant quantum error correction with the surface-GKP code, PRX Quantum 3, 010315 (2022).
  43. [43]T. Matsuura, N. C. Menicucci, and H. Yamasaki, Continuous-variable fault-tolerant quantum computation under general noise, Nature Communications 17, 1709 (2026).DOI
  44. [44]H. Bombin, I. H. Kim, D. Litinski, N. Nickerson, M. Pant, F. Pastawski, S. Roberts, and T. Rudolph, Interleaving: Modular architectures for fault-tolerant photonic quantum computing (2021), arXiv:2103.08612 [quant-ph].arxiv.org/abs/2103.08612
  45. [45]W. Asavanant, K. Fukui, A. Sakaguchi, and A. Furusawa, Switching-free time-domain optical quantum computation with quantum teleportation, Phys. Rev. A 107, 032412 (2023).
  46. [46]P. Renault, P. Yard, R. C. Pooser, M. Eaton, and H. A. Zaidi, End-to-end switchless architecture for fault-tolerant photonic quantum computing, Quantum 9, 1796 (2025), arXiv:2412.12680 [quant-ph].DOI
  47. [47]T. Hoshi, A. Kawasaki, X. Yan, A. Sakaguchi, T. Suzuki, T. Sonoyama, H. Nagyoshi, K. Fukui, K. Takase, and W. Asavanant, All-optical implementation of generalized quantum teleportation (2026), arXiv:2606.22736 [quant-ph].arxiv.org/abs/2606.22736
  48. [48]P. Kok et al., Linear optical quantum computing with photonic qubits, Reviews of Modern Physics 79, 135 (2007).DOI
  49. [49]T. Rudolph, Why i am optimistic about the silicon-photonic route to quantum computing, APL Photonics 2, 030901 (2017).arxiv.org/abs/1607.08535
  50. [50]F. Ewert and P. van Loock, 3/4-efficient Bell measurement with passive linear optics and unentangled ancillae, Physical Review Letters 113, 140403 (2014).DOI
  51. [51]S. Bartolucci et al., Fusion-based quantum computation, Nature Communications 14, 912 (2023).
  52. [52]H. Aghaei Rad et al., Scaling and networking a modular photonic quantum computer, Nature 638, 912 (2025).
  53. [53]PsiQuantum Team, A manufacturable platform for photonic quantum computing, Nature 641, 876 (2025).DOI
  54. [54]S. Yu, J. Sun, K.-C. Chen, et al., Extensible universal photonic quantum computing with nonlinearity, Nature Photonics 10.1038/s41566-026-01962-8 (2026).
  55. [55]B. W. Walshe, B. Q. Baragiola, H. Ferretti, J. Gefaell, M. Vasmer, R. Weil, T. Matsuura, T. Jaeken, G. Pantaleoni, Z. Han, T. Hillmann, N. C. Menicucci, I. Tzitrin, and R. N. Alexander, Linear-optical quantum computation with arbitrary error-correcting codes, Phys. Rev. Lett. 134, 100602 (2025), arXiv:2408.04126 [quant-ph].DOI
  56. [56]E. Knill, Quantum computation with realistically noisy devices, Nature 434, 39 (2005).pubmed.ncbi.nlm.nih.gov/15744292
  57. [57]P. Aliferis, D. Gottesman, and J. Preskill, Accuracy threshold for postselected quantum computation, Quantum Information and Computation 8, 181 (2008).
  58. [58]Y.-C. Zheng, C.-Y. Lai, T. A. Brun, and L.-C. Kwek, Constant depth fault-tolerant Clifford circuits for multi-qubit large block codes, Quantum Science and Technology 5, 045007 (2020), arXiv:2003.12328 [quant-ph].DOI
  59. [59]F. K. Marqversen, G. Baranes, M. Sirotin, and J. Borregaard, Fault-tolerant interfaces for modular quantum computing on diverse qubit platforms, Phys. Rev. Research 8, 023097 (2026), arXiv:2510.05221 [quant-ph].DOI
  60. [60]S. Chelluri, R. Mengoni, T. Darras, J. Laurat, E. Diamanti, and I. Lavdas, Fault-tolerant logical operations and efficient state preparation in modular quantum architectures with noisy interfaces (2026), arXiv:2607.27204 [quant-ph].arxiv.org/abs/2607.27204
  61. [61]H. Goto and H. Uchikawa, Fault-tolerant quantum computation with a soft-decision decoder for error correction and detection by teleportation, Scientific Reports 3, 2044 (2013).DOI
  62. [62]D. Poulin, Optimal and efficient decoding of concatenated quantum block codes, Physical Review A 74, 052333 (2006).DOI
  63. [63]J. W. Staples, W. Fu, and J. D. Thompson, Scalable postselection of quantum resources (2026), arXiv:2603.08697 [quant-ph].arxiv.org/abs/2603.08697
  64. [64]P. Birchall, J. Bridgeman, C. Dawson, T. Farrelly, Y. Liu, N. Nickerson, M. Pant, S. Roberts, K. Seetharam, and D. Tuckett, Macromux: scalable postselection for high-threshold fault-tolerant quantum computation (2026), arXiv:2603.04875 [quant-ph].arxiv.org/abs/2603.04875
  65. [65]H. Nagayoshi, W. Asavanant, R. Ide, K. Fukui, A. Sakaguchi, J. Yoshikawa, N. C. Menicucci, and A. Furusawa, ZX graphical calculus for continuous-variable quantum processes, Phys. Rev. Research 7, 033141 (2025).
  66. [66]S. Glancy and E. Knill, Error analysis for encoding a qubit in an oscillator, Physical Review A 73, 012325 (2006).DOI
  67. [67]K. Fukui, A. Tomita, and A. Okamoto, Analog quantum error correction with encoding a qubit into an oscillator, Physical Review Letters 119, 180507 (2017).DOI
  68. [68]P. Aliferis and J. Preskill, Fibonacci scheme for fault-tolerant quantum computation, Physical Review A 79, 012332 (2009).DOI
  69. [69]N. Raveendran, N. Rengaswamy, F. Rozpędek, A. Rajan, L. Jiang, and B. Vasic, Finite-rate QLDPC-GKP coding scheme that surpasses the CSS hamming bound, Quantum 6, 767 (2022).
  70. [70]K. Fukui, High-threshold fault-tolerant quantum computation with the Gottesman–Kitaev–Preskill qubit under noise in an optical setup, Physical Review A 107, 052414 (2023).
  71. [71]J. Yoshikawa, Y. Miwa, A. Huck, U. L. Andersen, P. van Loock, and A. Furusawa, Demonstration of a quantum nondemolition sum gate, Phys. Rev. Lett. 101, 250501 (2008).DOI
  72. [72]Y. Shiozawa, J. Yoshikawa, S. Yokoyama, T. Kaji, K. Makino, T. Serikawa, R. Nakamura, S. Suzuki, S. Yamazaki, W. Asavanant, S. Takeda, P. van Loock, and A. Furusawa, Quantum nondemolition gate operations and measurements in real time on fluctuating signals, Phys. Rev. A 98, 052311 (2018).
  73. [73]S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Physical Review A 71, 022316 (2005).DOI
  74. [74]S. Bravyi and J. Haah, Magic-state distillation with low overhead, Physical Review A 86, 052329 (2012).
  75. [75]H. M. Vasconcelos, L. Sanz, and S. Glancy, All-optical generation of states for “encoding a qubit in an oscillator”, Optics Letters 35, 3261 (2010).DOI
  76. [76]D. J. Weigand and B. M. Terhal, Generating grid states from Schrödinger-cat states without postselection, Physical Review A 97, 022341 (2018).DOI
  77. [77]M. Eaton, R. Nehra, and O. Pfister, Non-Gaussian and Gottesman–Kitaev–Preskill state preparation by photon catalysis, New Journal of Physics 21, 113034 (2019).DOI
  78. [78]I. Tzitrin, J. E. Bourassa, N. C. Menicucci, and K. K. Sabapathy, Progress towards practical qubit computation using approximate Gottesman–Kitaev–Preskill codes, Physical Review A 101, 032315 (2020).
  79. [79]M. Eaton, C. González-Arciniegas, R. N. Alexander, N. C. Menicucci, and O. Pfister, Measurement-based generation and preservation of cat and grid states within a continuous-variable cluster state, Quantum 6, 769 (2022).
  80. [80]J. Hastrup, K. Park, J. B. Brask, R. Filip, and U. L. Andersen, Protocol for generating optical Gottesman–Kitaev–Preskill states with cavity QED, Physical Review Letters 128, 170503 (2022).DOI
  81. [81]K. Fukui, M. Endo, W. Asavanant, A. Sakaguchi, J. Yoshikawa, and A. Furusawa, Generating the Gottesman–Kitaev–Preskill qubit using a cross-Kerr interaction between squeezed light and Fock states in optics, Physical Review A 105, 022436 (2022).DOI
  82. [82]K. Fukui, S. Takeda, M. Endo, W. Asavanant, J. Yoshikawa, P. van Loock, and A. Furusawa, Efficient backcasting search for optical quantum state synthesis, Physical Review Letters 128, 240503 (2022).DOI
  83. [83]K. Takase, K. Fukui, A. Kawasaki, W. Asavanant, M. Endo, J. Yoshikawa, P. van Loock, and A. Furusawa, Gottesman–Kitaev–Preskill qubit synthesizer for propagating light, npj Quantum Information 9, 98 (2023).
  84. [84]R. Dahan, G. Baranes, A. Gorlach, R. Ruimy, N. Rivera, and I. Kaminer, Creation of optical cat and GKP states using shaped free electrons, Physical Review X 13, 031001 (2023).arxiv.org/abs/2206.08828
  85. [85]K. Takase, F. Hanamura, H. Nagayoshi, J. E. Bourassa, R. N. Alexander, A. Kawasaki, W. Asavanant, M. Endo, and A. Furusawa, Generation of flying logical qubits using generalized photon subtraction with adaptative Gaussian operations, Physical Review A 110, 012436 (2024).
  86. [86]A. J. Pizzimenti and D. Soh, Optical Gottesman–Kitaev–Preskill qubit generation via approximate squeezed coherent state superposition breeding, Physical Review A 110, 062619 (2024).
  87. [87]M. S. Winnel, J. J. Guanzon, D. Singh, and T. C. Ralph, Deterministic preparation of optical squeezed cat and Gottesman–Kitaev–Preskill states, Physical Review Letters 132, 230602 (2024).DOI
  88. [88]Ö. Erkilic, A. Das, B. Shajilal, P. K. Lam, T. C. Ralph, and S. M. Assad, A unified optical platform for non-gaussian and fault-tolerant Gottesman–Kitaev–Preskill states, npj Quantum Information 10.1038/s41534-026-01336-6 (2026).arxiv.org/abs/2512.02607
  89. [89]Y. Takeno, M. Yukawa, H. Yonezawa, and A. Furusawa, Observation of -9 dB quadrature squeezing with improvement of phase stability in homodyne measurement, Opt. Express 15, 4321 (2007).DOI
  90. [90]H. Vahlbruch, M. Mehmet, K. Danzmann, and R. Schnabel, Detection of 15 dB squeezed states of light and their application for the absolute calibration of photoelectric quantum efficiency, Phys. Rev. Lett. 117, 110801 (2016).
  91. [91]T. Kashiwazaki, N. Takanashi, T. Yamashima, T. Kazama, K. Enbutsu, R. Kasahara, T. Umeki, and A. Furusawa, Continuous-wave 6-dB-squeezed light with 2.5-THz-bandwidth from single-mode PPLN waveguide, APL Photonics 5, 036104 (2020).
  92. [92]T. Kashiwazaki, T. Yamashima, K. Enbutsu, T. Kazama, A. Inoue, K. Fukui, M. Endo, T. Umeki, and A. Furusawa, Over-8-dB squeezed light generation by a broadband waveguide optical parametric amplifier toward fault-tolerant ultra-fast quantum computers, Applied Physics Letters 122, 234003 (2023).
  93. [93]K. Hirota, T. Kashiwazaki, G. Ha, T. Yamashima, P. Jaturapathorn, T. Suzuki, K. Takahashi, A. Kawasaki, A. Inoue, W. Asavanant, M. Endo, T. Umeki, and A. Furusawa, Generation of 10-dB squeezed light from a broadband waveguide optical parametric amplifier with improved phase locking method, Opt. Express 34, 7958 (2026).DOI
  94. [94]G. Ha, K. Hirota, T. Kashiwazaki, T. Suzuki, A. Kawasaki, W. Asavanant, M. Endo, and A. Furusawa, Generation of 12 dB squeezed light from a waveguide optical parametric amplifier using a machine-learning-controlled spatial light modulator (2026), arXiv:2603.02744 [quant-ph].arxiv.org/abs/2603.02744
  95. [95]T. Gerrits, S. Glancy, T. S. Clement, B. Calkins, A. E. Lita, A. J. Miller, A. L. Migdall, S. W. Nam, R. P. Mirin, and E. Knill, Generation of optical coherent-state superpositions by number-resolved photon subtraction from squeezed vacuum, Phys. Rev. A 82, 031802 (2010).DOI
  96. [96]M. Yukawa, K. Miyata, T. Mizuta, H. Yonezawa, P. Marek, R. Filip, and A. Furusawa, Generating superposition of up-to three photons for continuous variable quantum information processing, Opt. Express 21, 5529 (2013).DOI
  97. [97]K. Takase, A. Kawasaki, B. K. Jeong, M. Endo, T. Kashiwazaki, T. Kazama, K. Enbutsu, K. Watanabe, T. Umeki, S. Miki, H. Terai, M. Yabuno, F. China, W. Asavanant, J. Yoshikawa, and A. Furusawa, Generation of Schrödinger cat states with Wigner negativity using a continuous-wave low-loss waveguide optical parametric amplifier, Opt. Express 30, 14161 (2022).DOI
  98. [98]T. Sonoyama, K. Takahashi, B. Charoensombutamon, S. Takasu, K. Hattori, D. Fukuda, K. Fukui, K. Takase, W. Asavanant, J. Yoshikawa, M. Endo, and A. Furusawa, Non-gaussian state generation with time-gated photon detection, Phys. Rev. Research 5, 033156 (2023).
  99. [99]M. Endo, R. He, T. Sonoyama, K. Takahashi, T. Kashiwazaki, T. Umeki, S. Takasu, K. Hattori, D. Fukuda, K. Fukui, K. Takase, W. Asavanant, P. Marek, R. Filip, and A. Furusawa, Non-gaussian quantum state generation by multi-photon subtraction at the telecommunication wavelength, Opt. Express 31, 12865 (2023).
  100. [100]T. Sonoyama, K. Takahashi, T. Sano, T. Suzuki, T. Nomura, M. Yabuno, S. Miki, H. Terai, K. Takase, W. Asavanant, M. Endo, and A. Furusawa, Generation of multi-photon Fock states at telecommunication wavelength using picosecond pulsed light, Opt. Express 32, 32387 (2024).
  101. [101]A. Kawasaki et al., Broadband generation and tomography of non-gaussian states for ultra-fast optical quantum processors, Nat. Commun. 15, 9075 (2024).DOI
  102. [102]R. Filip, P. Marek, and U. L. Andersen, Measurement-induced continuous-variable quantum interactions, Phys. Rev. A 71, 042308 (2005).DOI
  103. [103]R. Yanagimoto, R. Nehra, R. Hamerly, E. Ng, A. Marandi, and H. Mabuchi, Quantum nondemolition measurements with optical parametric amplifiers for ultrafast universal quantum information processing, PRX Quantum 4, 031033 (2023).
  104. [104]F. Hanamura, W. Asavanant, H. Nagayoshi, A. Sakaguchi, R. Ide, K. Fukui, P. van Loock, and A. Furusawa, Implementing arbitrary multimode continuous-variable quantum gates with fixed non-Gaussian states and adaptive linear optics, Phys. Rev. A 110, 022614 (2024).DOI
  105. [105]S. Konno, W. Asavanant, K. Fukui, A. Sakaguchi, F. Hanamura, P. Marek, R. Filip, J. Yoshikawa, and A. Furusawa, Non-clifford gate on optical qubits by nonlinear feedforward, Phys. Rev. Research 3, 043026 (2021).DOI
  106. [106]R. Yanagimoto, T. Onodera, E. Ng, L. G. Wright, P. L. McMahon, and H. Mabuchi, Engineering a Kerr-based deterministic cubic phase gate via Gaussian operations, Phys. Rev. Lett. 124, 240503 (2020).
  107. [107]K. Fukui, R. N. Alexander, and P. van Loock, All-optical long-distance quantum communication with Gottesman–Kitaev–Preskill qubits, Phys. Rev. Research 3, 033118 (2021).DOI
  108. [108]F. Rozpędek, K. Noh, Q. Xu, S. Guha, and L. Jiang, Quantum repeaters based on concatenated bosonic and discrete-variable quantum codes, npj Quantum Information 7, 102 (2021).
  109. [109]F. Rozpędek, K. P. Seshadreesan, P. Polakos, L. Jiang, and S. Guha, All-photonic Gottesman–Kitaev–Preskill-qubit repeater using analog-information-assisted multiplexed entanglement ranking, Phys. Rev. Research 5, 043056 (2023).DOI
  110. [110]F. Schmidt, D. Miller, and P. van Loock, Error-corrected quantum repeaters with Gottesman–Kitaev–Preskill qudits, Phys. Rev. A 109, 042427 (2024).
  111. [111]S. Häussler and P. van Loock, Quantum repeaters based on stationary Gottesman–Kitaev–Preskill qubits, Phys. Rev. A 111, 062611 (2025).arxiv.org/abs/2406.07158
  112. [112]S. Häussler and P. van Loock, Quantum repeaters based on stationary and flying Gottesman–Kitaev–Preskill qudits, Phys. Rev. Research 8, 033101 (2026).arxiv.org/abs/2508.00530
  113. [113]H. Sayginel, K. S. Koutsioumpas, M. Webster, A. Rajput, and D. E. Browne, Fault-tolerant logical Clifford gates from code automorphisms, PRX Quantum 6, 030343 (2025).arxiv.org/abs/2409.18175
  114. [114]K. Fukui, A. Tomita, and A. Okamoto, Tracking quantum error correction, Phys. Rev. A 98, 022326 (2018).DOI
  115. [115]K. Fukui, T. Matsuura, and N. C. Menicucci, Efficient concatenated bosonic code for additive Gaussian noise, Phys. Rev. Lett. 131, 170603 (2023).
  116. [116]H. Zhou, C. Zhao, M. Cain, D. Blümstein, 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), arXiv:2406.17653 [quant-ph].DOI

Paper details

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

views · 1

downloads · 0

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

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents