betaFeedback

WorksPhysics and Astronomy

Certified Separation Between Coherent and Adaptive Temporal Processing of Quantum-Error-Correction Readout

Abstract

Repeated quantum-error-correction readout is normally converted into a classical time series: each syndrome pulse is measured on arrival and only the resulting classical record is retained. Nonorthogonal readout signals raise the question of whether preserving quantum information between rounds can improve the final recovery decision. We formulate this comparison as a loss-weighted state-discrimination problem. For an idealized two-round benchmark with quadrature phase-shift-keying (QPSK) signals, a receiver with a seven-dimensional persistent register has certified recovery-decision error below 24.2100%24.2100\%, whereas every separate adaptive receiver has error above 25.1431%25.1431\%. The certified separation is at least 0.9330.933 percentage points. The loss counts incorrect final error-mask decisions in the benchmark. In the strict architecture, where the counted register is the entire persistent state, four dimensions are necessary and sufficient to outperform the adaptive class. Certified separations also occur at three and four rounds with register dimensions 88 and 3636, compared with 1616 and 6464 for full-prefix storage. We relate memory dimension to the structure of the temporal measurement, give a sufficient memory bound for collective measurements, and quantify robustness to register dephasing and accumulated channel error.

Introduction

Repeated quantum error correction (QEC) is inherently a temporal inference problem. A single syndrome observation can be ambiguous because data faults and readout noise both affect the observed record, so practical decoders combine information across multiple extraction rounds. Recent work has further shown that retaining analog or soft readout information can improve on hard syndrome decisions [1, 2, 3]. These results make clear that not only the syndrome record, but also how that record is represented and retained, can affect the final recovery decision.

In the usual measurement-based architecture, each syndrome extraction produces a physical readout signal that is measured as it arrives. The resulting classical record can be retained in considerable detail: a decoder may keep analog values, assign likelihoods, model correlations across rounds, and use the complete history when selecting a recovery. Such processing can preserve much more information than a hard syndrome bit. It nevertheless begins after the arriving quantum signal has been measured. By the time temporal decoding takes place, the information available to the decoder is classical.

At the other end of the design space, coherent and measurement-free QEC architectures avoid the conventional measurement-and-feedback loop by retaining quantum information within a coherent controller or by implementing correction through autonomous dynamics [4, 5, 6, 7]. These approaches show that syndrome information need not always be converted immediately into a classical record, but they also change how error correction itself is implemented.

Here we consider an intermediate possibility. Before measurement, the finite-strength signals associated with distinct syndromes need not be orthogonal, so there is an operational distinction between remembering the past after measurement and preserving part of the past before measurement. We leave the syndrome-extraction process and the emitted readout signals unchanged, but alter when those signals must become classical. Rather than measuring every signal separately as it arrives, a finite quantum memory may retain information from earlier signals and interact with later ones, allowing some or all measurement to be deferred until later signals have arrived.

We therefore ask whether, for the same sequential readout ensemble and recovery objective, preserving quantum information across rounds can outperform every receiver that measures each signal separately and retains only classical information between rounds.

Answering this question requires more than comparing against a particular decoder. Failure of one classical algorithm could reflect the choice of decoder rather than a limitation imposed by measurement itself. We therefore define a deliberately broad separate adaptive class: each arriving signal may undergo an arbitrary quantum instrument, the receiver may retain an unrestricted classical transcript, and all later instruments may depend on that transcript. The only excluded resource is a quantum state carrying information from an earlier signal into a later round.

Direct optimization over this adaptive class is difficult. Every such receiver induces measurement operators that are separable across the temporal signal factors and therefore positive under partial transpose (PPT). This containment gives a tractable semidefinite-programming relaxation: a lower bound obtained over the larger PPT class is automatically a lower bound on the error attainable by any receiver in the separate adaptive class. Consequently, a feasible coherent receiver whose error lies below this bound is separated from the entire measure-and-feed-forward class, rather than from a particular decoder found numerically.

For the two-round QPSK benchmark studied here, a K=7K = 7 streaming receiver achieves a recovery-decision error of approximately 0.2421, while the certified adaptive lower bound is approximately 0.2514. The resulting separation is about 9.3×10−39.3 \times10^{-3}, or 0.93 percentage points; the outward-rounded values are stated in Theorem 2. This gap certifies a separation between the two receiver classes under the same signal ensemble and recovery objective.

We next determine the persistent-memory requirements of this separation. We distinguish the broad coherent class, which may retain classical side information, from a strict fixed-memory architecture in which the counted register is the only persistent state. For the latter model, the two-round benchmark has the exact threshold Ksep=4K_{\mathrm{sep}} = 4, while 4≤Kcoll≤74 \le K_{\mathrm{coll}} \le7. For each explicit receiver, the certified advantage persists up to a rigorously bounded dephasing strength on the persistent register. More generally, the entanglement-breaking analysis shows that any receiver exhibiting such an advantage must have at least one persistent boundary whose complete classically flagged instrument is not measure-and-prepare. The temporal-separability argument extends to arbitrary depth, and certified separations are obtained with K=8<16K = 8 < 16 at W=3W = 3 and K=36<64K = 36 < 64 at W=4W = 4. These finite-depth results establish persistence of the effect beyond two rounds; asymptotic memory scaling remains open.

We also derive a diamond-norm accumulation bound that gives sufficient implementation-error budgets for the explicit streaming receivers. Separately, a stored-pulse model translates phase retention into approximate storage-lifetime requirements and compares their scale with experimentally reported component coherence times. This comparison provides a component-level feasibility check. The architecture also changes where latency enters the recovery pipeline: information that would otherwise be converted into a classical record between rounds may instead be carried forward coherently, replacing some inter-round measurement and feed-forward requirements with coherent storage and control. This suggests a latency–coherence tradeoff whose quantitative characterization requires a hardware-specific timing model.

a. Soft syndrome decoding. Experimental readout produces analog voltages or photon counts before thresholding, and a hard decision discards information about the confidence of that assignment. Soft and analog decoders retain part of this information and can lower logical error relative to hard-decision decoding [1, 2, 3]. These results establish that the representation of readout information affects QEC performance even when the syndrome-extraction circuit remains unchanged. However, soft decoding operates on information that has already been converted into a classical measurement record. Our work asks whether the measurement itself imposes a fundamental limitation, even when all available classical information is retained. To isolate this distinction, our separate adaptive class permits arbitrary local measurements, continuous outcomes, an unrestricted classical transcript, and unrestricted classical post-processing. We establish a certified separation from this entire class, demonstrating that, for the benchmark considered, coherent processing achieves a lower recovery error than any separate adaptive receiver, even with unrestricted classical memory and post-processing.

b. Coherent and measurement-free QEC. Coherent feedback and measurement-free error correction avoid the standard mid-circuit measurement loop [4, 5, 6, 7, 8]. In these architectures, a coherent controller may participate directly in syndrome extraction, feedback, or autonomous correction. Recent theory provides scalable fault-tolerant and noise-biased measurement-free constructions [6, 8], while trapped-ion experiments have demonstrated measurement-free logical operations [7]. A separate spatio-temporal framework describes adaptive error correction using sequential interventions [9]. Our work addresses a different question. Rather than modifying syndrome extraction or implementing coherent correction, we hold the extraction circuit, emitted pulse ensemble, trajectory prior, and recovery loss fixed. Only the processing of the emitted temporal signals changes: each pulse is either measured on arrival, with its outcome retained classically, or processed through a persistent quantum memory. This isolates the value of quantum memory at the receiver level and establishes a certified advantage without attributing the improvement to changes in the underlying error-correction circuit.

c. Restricted quantum measurements. Minimum-error discrimination admits a primal-dual semidefinite programming (SDP) formulation [10, 11, 12]. For multipartite measurements, local operations and classical communication (LOCC), separable measurements, and positive-partial-transpose (PPT) measurements form a useful hierarchy [13, 14, 15, 16]. PPT constraints provide a tractable outer relaxation of separable measurements. We apply this hierarchy to a temporal discrimination problem in which the tensor factors represent readout signals arriving in successive rounds. Measuring each signal and retaining only its classical outcome produces adaptive-tree effects that are separable and therefore PPT. The resulting SDP consequently bounds the entire defined measure-and-feed-forward class, rather than a particular decoder or measurement policy. Our contribution is to combine this relaxation with a coherent receiver construction and rigorous verification of the optimization bounds. The resulting certificate establishes a strict separation between the receiver classes, rather than relying on numerical comparisons between individual measurement strategies.

Receiver-class comparison diagram showing separate adaptive and coherent streaming receiver architectures

Figure 1. Receiver-class comparison. Both receivers receive the same pulse ensemble, prior, clock, and recovery objective. The separate adaptive receiver may preserve an arbitrarily rich classical record. The coherent receiver additionally preserves a finite-dimensional quantum system between rounds. In the strict memory-KK model, the labeled KK-dimensional register is the only persistent state; no additional persistent classical side register is available.

d. Quantum memories and entanglement-breaking channels. Entanglement-breaking (EB) channels are precisely measure-and-prepare channels [17]. Resource-theoretic approaches have used discrimination tasks to verify whether a quantum memory is not entanglement-breaking [18]. However, the temporal interpretation of this property requires care: EB channels can still support nonclassical multitime correlations under broader operational notions of memory [19]. Our result is therefore specific to the causal receiver architecture considered here. If the complete classically flagged instrument at each persistent boundary is measure-and-prepare, the resulting statistics can be reproduced by a separate adaptive receiver. Consequently, a receiver that achieves the certified separation must have at least one boundary that is not measure-and-prepare. This gives the separation a resource interpretation: the advantage requires genuinely quantum memory, not merely a different classical encoding of earlier measurement outcomes. The simulability statement does not extend to arbitrary multitime intervention models.

e. Collective and sequential quantum receivers. Collective optical receivers can outperform symbol-by-symbol detection on structured coherent-state ensembles [20, 21]. Such improvements arise because joint measurements need

not reduce each signal to a classical outcome before subsequent signals are processed. Previous work has also shown that small persistent quantum memories can reproduce collective discrimination performance in streaming settings [22, 23]. Our work builds on this connection but considers a recovery-weighted objective and compares finite-memory coherent receivers against the entire class of arbitrary local measurements with classical memory and feed-forward. A finite persistent register restricts the operator-space complexity of the induced temporal effects. In the strict architecture considered here, this appears as an operator-Schmidt-rank bound across each chronological cut, corresponding to the matrix-product-operator bond-dimension constraint associated with finite sequential memory [24, 25]. We use these structural constraints to establish lower bounds on the required memory dimension and combine them with certified receiver constructions. For the two-round benchmark, this determines the exact minimum memory dimension needed to outperform every separate adaptive receiver, strengthening the connection between sequential discrimination performance and the quantum resources required to achieve it.

f. Quantum reservoir computing. Quantum reservoir computing (QRC) uses a persistent dynamical system and a simple trained readout to process temporal data [26, 27]. Its use of persistent quantum dynamics makes it a natural candidate for processing temporally correlated readout signals without measuring each signal independently. Appendix J examines this connection for the benchmark by comparing a homogeneous reservoir with a clocked construction. The clocked construction achieves lower error in all ten paired best-of-three comparisons with the matched homogeneous reservoir. Because the clocked construction was informed by the optimized channel, we treat these results as exploratory rather than as evidence of a general architectural advantage. They illustrate how the receiver framework may inform practical sequential architectures, while the formal contribution of this paper remains the certified separation and the associated memory-resource bounds.

Physical background and notation

From physical errors to readout signals

A physical qubit is an individual two-level quantum system. A logical qubit stores quantum information in a subspace of several physical qubits, so that specified errors can be detected without measuring the unknown logical amplitudes. In a stabilizer code, commuting check operators distinguish error sectors. Their outcomes form the syndrome: information about an error, rather than a measurement of the stored logical state. An ancillary qubit is a helper system coupled to the data to extract a check outcome, then read out and reset.

For example, the three-qubit repetition encoding ∣0L⟩=∣000⟩|0_L\rangle= |000\rangle, ∣1L⟩=∣111⟩|1_L\rangle= |111\rangle protects against a single bit flip, rather than arbitrary quantum noise; phase errors require additional protection. Here ∣0⟩|0\rangle, ∣1⟩|1\rangle denote computational-basis states, XX exchanges them, and Z=∣0⟩⟨0∣−∣1⟩⟨1∣Z = |0\rangle\langle0| - |1\rangle\langle1|. The parity checks Z1Z2Z_1Z_2 and Z2Z3Z_2Z_3 give syndrome bits b1⊕b2b_1 \oplus b_2 and b2⊕b3b_2 \oplus b_3 for error mask b=(b1,b2,b3)\mathbf{b} = (b_1,b_2,b_3), where ⊕\oplus is addition modulo two. This convention illustrates syndrome extraction; the phase lookup used in the certified benchmark is a separate part of its specification.

In dispersive microwave readout, an ancilla changes the response of a resonator and thereby the state of an outgoing pulse [28]. Finite pulses associated with different states can overlap, so a measurement need not reveal their labels without error. Repeated extraction rounds help distinguish ambiguous observations and track faults occurring between rounds. A receiver combines the readout signals to select a correction, either applied physically or recorded in a Pauli frame, a classical record of corrections used when interpreting later operations and measurements.

The benchmark below models these emitted signals directly. Each two-bit syndrome is assigned to one of four coherent pulse states. The ancilla circuit is physical motivation rather than a simulated component of the numerical model. The question is whether a receiver can use the same pulse sequence more effectively by retaining quantum information between arrivals. Figure 2 shows this connection.

Parity-check readout and QPSK constellation

Figure 2. Readout generation and signal encoding. Left: a conceptual parity-check extraction circuit couples data qubits to ancillary systems and generates readout signals. The receiver processes these signals and selects a recovery; the extraction circuit is illustrative rather than simulated in the benchmark. Right: quadrature phase-shift keying (QPSK) places four coherent-state amplitudes at phases 00, π/2\pi/2, π\pi, 3π/23\pi/2, with radius α=0.60\alpha= 0.60. The axes are real and imaginary field amplitude. Distinct points represent nonorthogonal quantum states. The phase index jj is assigned to a syndrome by the benchmark lookup, not by the drawing.

Mathematical description of signals and receivers

A Hilbert space H\mathcal{H} describes a quantum system, and L(H)\mathcal{L}(\mathcal{H}) is the space of linear operators on it. The set D(H)\mathcal{D}(\mathcal{H}) consists of density operators: positive semidefinite operators of trace one. We write A⪰0A \succeq0 when ⟨v∣A∣v⟩≥0\langle v|A|v\rangle\ge0 for every vector ∣v⟩|v\rangle, and A⪰BA \succeq B when A−B⪰0A-B \succeq0.

The trace Tr⁡A\operatorname{Tr} A is the sum of diagonal entries, A†A^\dagger is the Hermitian adjoint, ATA^T is transpose in the stated basis, and I\mathbb{I} is the identity operator. A ket ∣ψ⟩|\psi\rangle denotes a state vector and ∣ψ⟩⟨ψ∣|\psi\rangle\langle\psi| its pure-state density operator. Tensor products, written ⊗\otimes, describe joint systems; here their factors label different temporal signals. A partial trace Tr⁡B\operatorname{Tr}_B discards subsystem BB, while ATSA^{T_S} transposes only the factors indexed by SS.

A positive operator-valued measure (POVM) {Ma}\{M_a\} is a general quantum measurement: its positive effects sum to the identity, and Tr⁡(ρMa)\operatorname{Tr}(\rho M_a) is the probability of decision aa for input ρ\rho. A quantum instrument also specifies the state update associated with each outcome. A completely positive trace-preserving (CPTP) map is a quantum channel: it maps valid states to valid states, including when applied to part of a larger system. An entanglement-breaking (EB) channel measures its input and prepares a new state depending only on the outcome.

We use WW for the number of readout rounds and KK for the Hilbert-space dimension of the persistent receiver register. Thus KK describes the size of the quantum state available from one round to the next, rather than a physical-qubit count. It embeds in ⌈log⁡2K⌉\lceil\log_2 K\rceil ideal qubits, where ⌈⋅⌉\lceil\cdot\rceil denotes the ceiling function. The single-signal dimension is dsig=dim⁡Htd_{\mathrm{sig}} = \dim\mathcal{H}_t when common to all rounds. The separation rate symbol dcoded_{\mathrm{code}} denotes code distance, the minimum weight of a nontrivial logical Pauli operator in a stabilizer code.

a. Operator norms and measurement bounds. The receiver comparison uses matrix constraints and norms to bound measurement performance and sensitivity to perturbations. For operators, ∥A∥1=Tr⁡A†A\lVert A\rVert_1 = \operatorname{Tr}\sqrt{A^\dagger A} is the trace norm, ∥A∥∞\lVert A\rVert_\infty the largest singular value, and ∥A∥F=Tr⁡(A†A)\lVert A\rVert_F = \sqrt{\operatorname{Tr}(A^\dagger A)} the Frobenius norm. An effect is separable across temporal factors when it is a limit of sums of tensor products of positive effects. Such effects have positive partial transpose (PPT), the necessary condition used to bound adaptive receivers. A semidefinite program (SDP) optimizes a linear objective with positive-matrix constraints; a feasible dual witness supplies a bound on every primal solution.

Sequential recovery problem and receiver classes

Loss-weighted pulse ensemble

Let WW denote the number of readout rounds. A latent trajectory x∈Xx \in\mathcal{X} specifies the underlying fault history together with the syndrome labels it produces over those rounds. The trajectory is assigned prior probability πx\pi_x and generates an arbitrary receiver-independent temporal state

ρx∈D(H1:W),H1:W:=⨂t=1WHt.(1)\rho_x \in\mathcal{D}(\mathcal{H}_{1:W}), \qquad\mathcal{H}_{1:W} := \bigotimes_{t=1}^{W} \mathcal{H}_t. \tag*{(1)}
SymbolMeaning
xx, πx\pi_xError trajectory and its probability
ρx\rho_xReadout state emitted for that trajectory
aa, MaM_aRecovery action and its measurement effect
ℓ(a,x)\ell(a,x)Loss for that action on trajectory xx
CaC_a, SaS_aCost and success operators weighted by the prior
r(M;C)r(M;C)Average loss of a specified receiver
WW, KKNumber of rounds and persistent-register dimension
dsigd_{\mathrm{sig}}, dcoded_{\mathrm{code}}Signal dimension and code distance
P⋆P^\star, KsepK_{\mathrm{sep}}Class-optimal risk and minimum strict-register dimension that outperforms the adaptive class

Table 1. Main quantities and their physical meanings.

Thus ρx\rho_x may be mixed and may contain arbitrary classical or quantum temporal correlations. Temporal separability below is a property of the receiver protocol, not of this input state. The only source assumption is that the joint state is fixed independently of receiver actions. If an earlier receiver intervention causally changes later emissions, a process tensor or quantum-comb description is required instead [29, 30]. The present benchmark has no such feedback into the source: syndrome extraction and the emitted ensemble are held fixed.

Let a∈Aa \in\mathcal{A} label a recovery action and ℓ(a,x)∈[0,1]\ell(a,x) \in[0,1] its recovery loss. Operationally, aa can represent a physical correction or a Pauli-frame update. In the binary-loss benchmark below, the loss is zero exactly when the selected recovery mask equals the final physical-error mask, and one otherwise. Code-level logical success can identify different physical errors as equivalent; the benchmark instead uses exact mask matching. Define

Ca:=∑x∈Xπxℓ(a,x)ρx.(2)C_a := \sum_{x \in\mathcal{X}} \pi_x \ell(a,x)\rho_x. \tag*{(2)}

For an effective POVM {Ma}a∈A\{M_a\}_{a \in\mathcal{A}}, the average recovery risk is the linear functional

r(M;C):=∑a∈ATr⁡(CaMa).(3)r(M;C) := \sum_{a \in\mathcal{A}} \operatorname{Tr}(C_aM_a). \tag*{(3)}

This expression averages the loss over the possible trajectories and the receiver’s decisions. For the benchmark below, it is the probability of an incorrect final-mask decision, called the recovery-decision error. We distinguish this risk of a specified receiver from the class optima,

Pad⋆(C):=inf⁡M∈Madr(M;C),(4)P^\star_{\mathrm{ad}}(C) := \inf_{M \in\mathcal{M}_{\mathrm{ad}}} r(M;C), \tag*{(4)}
Pcoh⋆(C):=inf⁡M∈Mcohr(M;C).(5)P^\star_{\mathrm{coh}}(C) := \inf_{M \in\mathcal{M}_{\mathrm{coh}}} r(M;C). \tag*{(5)}

Here Mad\mathcal{M}_{\mathrm{ad}} and Mcoh\mathcal{M}_{\mathrm{coh}} denote the receiver classes defined below; r(M;C)r(M;C) is the risk of a specified receiver, whereas starred quantities denote class optima. Each CaC_a incorporates the trajectory prior, emitted temporal state, and recovery loss associated with recovery action aa. The resulting receiver optimization is a linear quantum decision problem. The objective rewards successful recovery rather than exact reconstruction of the syndrome history.

Two-round benchmark

The numerical instance specializes this construction to two sequential readout rounds. In each round the relevant syndrome has four possible values, represented by two syndrome bits. A fixed lookup maps these four labels one-to-one to a QPSK phase j∈{0,1,2,3}j \in\{0,1,2,3\}, producing the coherent state

IncrementProbabilitySyndromePulse
No flip, 01−p=0.701-p=0.70s(0)s(0)∣αj(s(0))⟩\lvert\alpha_{j(s(0))}\rangle
First bit, 1p/3=0.10p/3=0.10s(1)s(1)∣αj(s(1))⟩\lvert\alpha_{j(s(1))}\rangle
Second bit, 2p/3=0.10p/3=0.10s(2)s(2)∣αj(s(2))⟩\lvert\alpha_{j(s(2))}\rangle
Third bit, 4p/3=0.10p/3=0.10s(4)s(4)∣αj(s(4))⟩\lvert\alpha_{j(s(4))}\rangle

Table II. Per-round benchmark increments. The syndrome and pulse columns describe a single increment starting from zero error. At later rounds the lookup is applied to the cumulative mask btb_t. The symbolic functions ss and jj denote the benchmark’s syndrome and phase lookups.

∣αj⟩=∣αeiπj/2⟩,α=0.60.(6)\lvert\alpha_j\rangle=\lvert\alpha e^{i\pi j/2}\rangle,\qquad\alpha=0.60. \tag*{(6)}

The amplitude α\alpha is dimensionless, with mean photon number ∣α∣2=0.36\lvert\alpha\rvert^2=0.36. Four equally spaced phases encode the four syndrome labels. Distinct amplitudes in phase space need not be orthogonal states. Coherent pointer states arise naturally in dispersive microwave readout, where finite-amplitude responses associated with different system states are not perfectly distinguishable [28]. The QPSK encoding used here provides a symmetric four-state benchmark of this nonorthogonal-readout setting. At α=0.60\alpha=0.60 the four pulses are nonorthogonal, so no measurement can identify all four labels perfectly. We set p=0.30p=0.30 in the trajectory prior πx(p)\pi_x(p). The final decision set contains eight recovery masks. The loss and trajectory construction are specified below and in Appendix § 1.15.

a. Error trajectories and the recovery criterion. The per-round error increment is et∈{0,1,2,4}e_t\in\{0,1,2,4\}, where each nonzero integer mask flips one of the three physical bits. Increments are independent, with probabilities 1−p1-p, p/3p/3, p/3p/3, p/3p/3. The cumulative error is the bitwise exclusive OR bt=e1⊕⋯⊕etb_t=e_1\oplus\cdots\oplus e_t, and x=(e1,…,eW)x=(e_1,\ldots,e_W) specifies the full trajectory. The syndrome of the cumulative mask is s(bt)s(b_t), giving phase index jt(x)=j(s(bt))j_t(x)=j(s(b_t)). The eight actions a∈{0,…,7}a\in\{0,\ldots,7\} are all three-bit recovery masks, and the loss is

ℓ(a,x)=1[a≠bW],(7)\ell(a,x)=\mathbf{1}[a\ne b_W], \tag*{(7)}

where the indicator 1[⋅]\mathbf{1}[\cdot] is one if its condition holds and zero otherwise. An error near 24.21% therefore means an incorrect final mask on that fraction of the ensemble.

Exact mask matching cancels all modeled bit flips. For an encoded state, a nonzero residual mask may instead leave a detectable error or induce a logical operation. Counting every such residual as a failure is stricter than identifying only logical equivalence classes. The reported numbers measure this specified recovery decision, rather than a circuit-level logical-failure rate.

For example, x=(1,0)x=(1,0) is a first-bit flip in round one and no new flip in round two, with probability (p/3)(1−p)=0.07(p/3)(1-p)=0.07. The cumulative mask is one in both rounds, so both emitted pulses are ∣αj(s(1))⟩\lvert\alpha_{j(s(1))}\rangle. In the illustrative check convention of Sec. III, the syndrome is 10. Choosing a=1a=1 has zero loss; every other mask has unit loss. The receiver sees only the readout signals and must infer the recovery without knowing xx.

Unlike the general formulation in Equation (1), this specific QPSK benchmark uses conditionally independent emitted modes,

ρxQPSK=⨂t=1W∣αjt(x)⟩⟨αjt(x)∣.(8)\rho_x^{\mathrm{QPSK}}=\bigotimes_{t=1}^{W}\lvert\alpha_{j_t(x)}\rangle\langle\alpha_{j_t(x)}\rvert. \tag*{(8)}

The product form is therefore a specialization of the numerical instance, not an assumption of the receiver-class theorem.

Although the pulse modes have an infinite-dimensional Fock space, the four states used in each round span a four-dimensional subspace St⊂Ht\mathcal{S}_t\subset\mathcal{H}_t. Let PtP_t project onto that subspace and write P=⨂tPtP=\bigotimes_tP_t. Every benchmark state satisfies PρxP=ρxP\rho_xP=\rho_x. For any receiver effect MaM_a, the compression PMaPPM_aP, regarded as an operator on ⨂tSt\bigotimes_t\mathcal{S}_t, therefore gives the same outcome probabilities and risk. The compressed effects remain a POVM on that space. For a separate adaptive receiver, compression acts on each local factor of every product effect, preserving separability and PPT. Its conditional local measurements remain complete on St\mathcal{S}_t. The coherent update maps can likewise be restricted to these supported signal inputs without changing their statistics. Thus the finite-dimensional receiver results apply exactly to this ensemble, without a photon-number cutoff.

We represent this finite-dimensional signal space directly through the coherent-state Gram matrix

Gjk=⟨αj∣αk⟩=exp⁡[−∣αj∣2+∣αk∣22+αj∗αk].(9)G_{jk}=\langle\alpha_j\vert\alpha_k\rangle=\exp\left[-\frac{\lvert\alpha_j\rvert^2+\lvert\alpha_k\rvert^2}{2}+\alpha_j^*\alpha_k\right]. \tag*{(9)}

Here GjkG_{jk} is the overlap of pulses jj and kk, and the asterisk denotes complex conjugation. A factorization G=V†VG=V^\dagger V supplies coordinate vectors for the states without truncating their photon-number expansion. The four states span dsig=4d_{\mathrm{sig}}=4 dimensions; this is an effective representation of the chosen ensemble, not a truncation of the electromagnetic field’s full Hilbert space. The certified calculation reconstructs these coordinates and the cost operators directly from the analytic Gram data using Arb/Acb ball arithmetic. No photon-number cutoff enters the proof. Appendix § 1.15 describes the analytic reconstruction and an independent truncated-Fock convergence check. The parameter pp is a benchmark trajectory parameter rather than a calibrated device error rate. The operating point is chosen to provide a nontrivial temporal-discrimination regime, rather than to model a fault-tolerant device setting.

Receiver classes

The separate adaptive receiver carries an unrestricted classical transcript between rounds. The general coherent receiver can retain quantum memory alongside that transcript. The strict receiver permits only the counted KK-dimensional register. These are constraints on retained information, rather than on classical computational power.

Definition 1 (Separate adaptive receiver). At round tt, the receiver applies an arbitrary quantum instrument to the current pulse. Its choice may depend on the clock and the entire earlier classical transcript. It may use arbitrary local ancillas, randomness, continuous outcomes, and unrestricted classical computation. No quantum state carried between rounds may depend on an earlier pulse; all information retained from previous rounds is contained in the classical transcript.

Thus a separate adaptive receiver may remember arbitrarily much about the past, including a complete analog record, but every persistent record must be classical. For W=2W=2, coarse-graining the complete transcript into the final action gives an effect

Maad=∫Ay⊗Ba∣y dμ(y),(10)M^{\mathrm{ad}}_a = \int A_y \otimes B_{a|y}\,\mathrm{d}\mu(y), \tag*{(10)}

where Ay⪰0A_y \succeq0 is the first-round effect and {Ba∣y}a\{B_{a|y}\}_a is the conditional second-round POVM. Each MaadM^{\mathrm{ad}}_a is therefore separable across the temporal cut.

Definition 2 (Coherent receiver). A coherent receiver is a causal receiver that may retain a finite-dimensional quantum system between rounds. It may also retain an unrestricted classical transcript and condition later operations on that transcript. The union over all finite quantum-memory dimensions is denoted Mcoh\mathcal{M}_{\mathrm{coh}}.

Definition 3 (Strict memory-KK streaming receiver). A strict memory-KK receiver consists of completely positive trace-preserving maps

E1:L(H1)→L(CK),\mathcal{E}_1 : \mathcal{L}(\mathcal{H}_1) \to\mathcal{L}(\mathbb{C}^{K}),
Et:L(CK⊗Ht)→L(CK),2≤t≤W,(11)\mathcal{E}_t : \mathcal{L}(\mathbb{C}^{K} \otimes\mathcal{H}_t) \to\mathcal{L}(\mathbb{C}^{K}), \qquad2 \le t \le W, \tag*{(11)}

followed by a final memory POVM {Na}\{N_a\}. The KK-dimensional register is the only persistent state between rounds: no additional persistent classical record, quantum pointer, retained signal, or entangled ancillary system is available outside it. Fresh within-round ancillas may be introduced and discarded. The resulting receiver class is denoted Mstr(K)\mathcal{M}^{(K)}_{\mathrm{str}}.

The memory-dimension results use Mstr(K)\mathcal{M}^{(K)}_{\mathrm{str}}. The receiver-class separation instead compares Mad\mathcal{M}_{\mathrm{ad}} with the broader class Mcoh\mathcal{M}_{\mathrm{coh}}, which permits additional classical side information. In Mstr(K)\mathcal{M}^{(K)}_{\mathrm{str}}, the final POVM acts on the same counted KK-dimensional register.

The unrestricted collective receiver, which measures H1:W\mathcal{H}_{1:W} directly, supplies a global comparison point. The streaming model asks how much of that performance can be retained without storing the entire pulse block.

Arbitrary-depth structure of separate adaptive receivers

Theorem 1 (Temporal separability of classical-memory receivers). Let H1,…,HW\mathcal{H}_1,\ldots,\mathcal{H}_W be finite-dimensional temporal signal systems. Every receiver that measures each signal locally, retains only classical information between rounds, and classically maps its complete transcript to a final action induces effects of the form

Ma=∫ΓaEy1(1)⊗Ey2∣y1(2)⊗⋯⊗EyW∣y<W(W) dμ(y),(12)M_a = \int_{\Gamma_a} E^{(1)}_{y_1} \otimes E^{(2)}_{y_2|y_1} \otimes\cdots \otimes E^{(W)}_{y_W|y_{<W}}\,\mathrm{d}\mu(y), \tag*{(12)}

where every factor is positive semidefinite. Thus MaM_a is a positive conic integral of product effects, equivalently a limit of finite positive sums of product effects, and is fully separable across H1⊗⋯⊗HW\mathcal{H}_1 \otimes\cdots\otimes\mathcal{H}_W. Consequently,

MaTS⪰0for every S⊆{1,…,W}.(13)M_a^{T_S} \succeq0 \qquad\text{for every } S \subseteq\{1,\ldots,W\}. \tag*{(13)}

The receiver may use arbitrary discrete or continuous outcomes, private randomness, unrestricted classical computation, and fresh or resettable local ancillas. Outcome spaces are taken to be standard Borel, with measurable conditional measurement kernels.

The proof is given in Appendix A.

Corollary 1 (Multipartite PPT outer bound). For any WW-round recovery problem, minimizing the recovery loss over a measurement class constrained to be PPT across any selected temporal cuts gives a lower bound on the error of every separate adaptive receiver. If the risk of a feasible coherent receiver is below a certified dual lower bound for that relaxation, then it outperforms the entire separate adaptive class.

The benchmark emits product states conditional on the error trajectory. The coherent advantage therefore does not require entanglement between the emitted pulses. The relevant resource is the receiver’s ability to retain pulse-dependent quantum information. A boundary that measures its entire input and prepares a new state can instead be simulated by retaining the measurement outcome classically, as the next proposition establishes.

Proposition 1 (Entanglement-breaking persistent boundaries). Consider a receiver-independent temporal input and allow unrestricted classical side information. After each intermediate round t<Wt < W, let Qt\mathcal{Q}_t denote the complete pulse-dependent quantum system retained for round t+1t+1, and include any outcome produced at that boundary in the retained classical history. Suppose that, for every

incoming classical history, the complete boundary instrument is measure-and-prepare: each of its classical-outcome branches admits a measure-and-prepare decomposition for the state of QtQ_t. If no other pulse-dependent quantum system survives between rounds, the final action statistics can be reproduced by a separate adaptive receiver. Hence a certified advantage requires at least one intermediate boundary whose complete, classically flagged instrument is not entanglement breaking.

Remark 1. The entanglement-breaking condition applies to the complete quantum system crossing the persistent-memory boundary. Testing a reduced memory channel after fixing the incoming signal is insufficient: a SWAP-type update can make that reduced map entanglement breaking while transferring the signal’s quantum information intact into the retained register.

Proof. Let Q0Q_0 be a fixed, input-independent state. Suppose inductively that, conditional on the classical history hh before round tt, the retained memory is a known prepared state σh\sigma_h, uncorrelated with the unprocessed signals. Those signals may have an arbitrary joint conditional state. Include the boundary’s classical output zz in the next history. The branchwise measure-and-prepare assumption gives

Et,z∣h(X)=∫Tr⁡(Fz,y∣hX)σh,z,y dμz∣h(y),(14)\mathcal{E}_{t,z|h}(X)=\int\operatorname{Tr}(F_{z,y|h}X)\sigma_{h,z,y}\,\mathrm{d}\mu_{z|h}(y), \tag*{(14)}

where Fz,y∣h⪰0F_{z,y|h} \succeq0, and summing over zz and integrating over yy gives I\mathbb{I} on Qt−1⊗HtQ_{t-1}\otimes\mathcal{H}_t. Define effects on the current signal by

Gz,y∣h=Tr⁡Qt−1[(σh1/2⊗I)Fz,y∣h(σh1/2⊗I)].(15)G_{z,y|h}=\operatorname{Tr}_{Q_{t-1}}\left[(\sigma_h^{1/2}\otimes\mathbb{I})F_{z,y|h}(\sigma_h^{1/2}\otimes\mathbb{I})\right]. \tag*{(15)}

They are positive and sum (with integration) to the identity on Ht\mathcal{H}_t. A separate adaptive receiver can measure this conditional POVM, retain (z,y)(z,y) classically, and prepare σh,z,y\sigma_{h,z,y} locally. This gives the same joint outcome distribution and conditional state of all untouched future signals as the original instrument. It also restores the induction hypothesis for the next round.

At the last round, let {Na∣h}a\{N_{a|h}\}_a be the final POVM on QW−1⊗HWQ_{W-1}\otimes\mathcal{H}_W. With the entering memory prepared in σh\sigma_h, the conditional effects

Ba∣h=Tr⁡QW−1[(σh1/2⊗I)Na∣h(σh1/2⊗I)](16)B_{a|h}=\operatorname{Tr}_{Q_{W-1}}\left[(\sigma_h^{1/2}\otimes\mathbb{I})N_{a|h}(\sigma_h^{1/2}\otimes\mathbb{I})\right] \tag*{(16)}

form a POVM on the last signal and reproduce the final action statistics. The resulting protocol measures each signal on arrival and retains only a classical transcript. No independence assumption on the emitted temporal state is needed.

Non-entanglement-breaking memory is therefore necessary, but not sufficient, for an advantage in this receiver model. This conclusion does not extend to more general multitime intervention settings [19].

Two-round separation

Collective and PPT programs

To bound the entire adaptive class, we optimize over a larger measurement class with directly checkable constraints. A feasible coherent measurement gives an achievable error upper bound. A feasible dual witness for the larger class gives a lower bound that applies to every adaptive receiver. If the upper bound is smaller, no assumption of global optimality of the coherent search is needed.

The unrestricted collective receiver minimizes the error over all POVMs on the full two-round signal space and provides a reference for the streaming receivers. The collective optimum is the SDP

minimize{Ma}∑aTr⁡(CaMa),subject toMa⪰0,∑aMa=I.(17)\begin{aligned} \text{minimize}_{\{M_a\}}\quad&\sum_a \operatorname{Tr}(C_aM_a),\\ \text{subject to}\quad&M_a\succeq0,\qquad\sum_a M_a=\mathbb{I}. \tag*{(17)} \end{aligned}

Its dual, with Hermitian witness YY, maximizes Tr⁡Y\operatorname{Tr}Y subject to Y⪯CaY\preceq C_a for every aa [12 Sec. 3.1.2]. Primal feasibility gives an achievable error; dual feasibility gives a lower bound on the collective optimum.

Let T1T_1 denote partial transpose on the first temporal factor, (A⊗B)T1=AT⊗B(A\otimes B)^{T_1}=A^T\otimes B. Because every separate adaptive effect is separable across the two temporal factors, it remains positive under T1T_1. Dropping separability and imposing only this necessary PPT condition enlarges the feasible measurement class and gives

PerrPPT:=minimize{Ma}∑aTr⁡(CaMa),subject toMa⪰0,T1(Ma)⪰0,∑aMa=I.(18)\begin{aligned} P_{\mathrm{err}}^{\mathrm{PPT}}:=\text{minimize}_{\{M_a\}}\quad&\sum_a \operatorname{Tr}(C_aM_a),\\ \text{subject to}\quad&M_a\succeq0,\qquad T_1(M_a)\succeq0,\\ &\sum_a M_a=\mathbb{I}. \tag*{(18)} \end{aligned}

Here the dual uses a Hermitian operator YY and one positive multiplier QaQ_a for each action. A convenient dual is

maximizeY=Y†,{Qa}Tr⁡Y,subject toQa⪰0,Ca−Y−T1(Qa)⪰0∀a.(19)\begin{aligned} \text{maximize}_{Y=Y^\dagger,\{Q_a\}}\quad&\operatorname{Tr}Y,\\ \text{subject to}\quad&Q_a\succeq0,\\ &C_a-Y-T_1(Q_a)\succeq0\quad\forall a. \tag*{(19)} \end{aligned}

This is the loss-minimization form of the standard PPT discrimination primal–dual pair [16 Sec. 3.1]; see also [12 Sec. 1.2.3] for SDP duality.

Proposition 2 (Adaptive containment). Every two-round separate adaptive receiver induces a POVM feasible for Equation (18). Consequently,

PerrPPT≤Pad∗(C).(20)P_{\mathrm{err}}^{\mathrm{PPT}}\leq P_{\mathrm{ad}}^*(C). \tag*{(20)}
QuantityRecovery-decision error
Collective optimum[0.242099896126073,0.242099929928125][0.242099896126073, 0.242099929928125]
Certified K=7K=7 risk upper bound≤0.242099929928125\le0.242099929928125
Certified PPT lower bound on adaptive error≥0.251431736761034\ge0.251431736761034
Achievable adaptive risk upper bound≤0.256727930428793\le0.256727930428793
Certified gap lower bound≥0.009331806832908\ge0.009331806832908

Table III. Certified two-round benchmark. Inequality directions follow from outward-rounded receiver and dual verification.

Proof. Each coarse-grained effect is an integral of positive product operators, as in Equation (10). It is therefore separable. Partial transpose maps A⊗BA \otimes B to AT⊗B⪰0A^{\mathsf{T}} \otimes B \succeq0; integration, convex mixing, local ancillas, continuous records, and randomization preserve this property. The completeness relation is unchanged.

A coherent receiver whose risk lies below a certified lower bound on PerrPPTP_{\mathrm{err}}^{\mathrm{PPT}} therefore outperforms the entire separate adaptive class.

Floating-point optimization is used to find candidate receivers and dual witnesses, but it is not used directly for the theorem. The numerical receiver and dual candidates are embedded as exact rational data and checked against cost operators reconstructed directly from the analytic benchmark using 256-bit Arb/Acb ball arithmetic. Outward rounding yields a risk upper bound for each explicit receiver and a dual objective lower bound for the PPT relaxation. The procedure is described in Appendix § 1.3.4.

Separation criterion and numerical values

Theorem 2 (Certified two-round separation). For the two-round cost operators CC, the certified K=7K=7 streaming receiver and PPT-dual witness satisfy

r(MK=7;C)≤U7:=0.242099929928125,LPPT:=0.251431736761034≤Pad⋆(C).(21)r(M_{K=7};C) \le U_7 := 0.242099929928125, \qquad L_{\mathrm{PPT}} := 0.251431736761034 \le P_{\mathrm{ad}}^{\star}(C). \tag*{(21)}

Consequently,

Pad⋆(C)−Pcoh⋆(C)≥LPPT−U7≥0.009331806832908.P_{\mathrm{ad}}^{\star}(C)-P_{\mathrm{coh}}^{\star}(C) \ge L_{\mathrm{PPT}}-U_7 \ge0.009331806832908.

The upper bound U7U_7 concerns one explicitly feasible receiver, whereas LPPTL_{\mathrm{PPT}} lower-bounds the error of every adaptive receiver. Their strict ordering certifies the class separation. They are bounds rather than claims that both class optima are known exactly.

The theorem follows from weak duality and feasibility of the explicit receiver. The lower bound applies to every separate adaptive receiver; tightness of the PPT relaxation is unnecessary. The same calculation encloses the collective optimum as

0.242099896126073≤Pcoll⋆(C)≤0.242099929928125.(22)0.242099896126073 \le P_{\mathrm{coll}}^{\star}(C) \le0.242099929928125. \tag*{(22)}

The K=7K=7 receiver is therefore within 3.3802052×10−83.3802052 \times10^{-8} of the collective optimum. The enclosure does not establish equality with the collective optimum.

Certified two-round comparison

Figure 3. Certified two-round comparison. The horizontal axis is recovery-decision error. The coherent-risk upper bound lies below the certified PPT lower bound on the separate-adaptive optimum. The explicit adaptive receiver is shown as an achievable reference.

Proposition 3 (Stability of a certified separation). Let C′={Ca′}C'=\{C'_a\} be a perturbed decision problem on the same physical Hilbert space and with the same receiver classes, where Ca′=Ca+ΔCaC'_a=C_a+\Delta C_a. Suppose Lad≤Pad⋆(C)L_{\mathrm{ad}} \le P_{\mathrm{ad}}^{\star}(C) is a certified lower bound and a fixed feasible coherent receiver McohM^{\mathrm{coh}} has risk r(Mcoh;C)r(M^{\mathrm{coh}};C). Define

ϵ⋆(C′,C):=inf⁡X=X†∑a∥ΔCa−X∥1.(23)\epsilon_{\star}(C',C):=\inf_{X=X^{\dagger}}\sum_a\lVert\Delta C_a-X\rVert_1. \tag*{(23)}

where the common Hermitian shift XX is independent of aa. If δ:=Lad−r(Mcoh;C)>0\delta:=L_{\mathrm{ad}}-r(M^{\mathrm{coh}};C)>0, then the perturbed class optima obey

Pad⋆(C′)−Pcoh⋆(C′)≥δ−2ϵ⋆(C,C′).(24)P_{\mathrm{ad}}^{\star}(C')-P_{\mathrm{coh}}^{\star}(C')\ge\delta-2\epsilon_{\star}(C,C'). \tag*{(24)}

Proof. For any POVM {Ma}\{M_a\}, 0⪯Ma⪯I0\preceq M_a\preceq\mathbb{I}, and hence, for every Hermitian XX,

∣∑aTr⁡[(ΔCa−X)Ma]∣≤∑a∥ΔCa−X∥1=:ϵ⋆.(25)\left\lvert\sum_a\operatorname{Tr}[(\Delta C_a-X)M_a]\right\rvert\le\sum_a\lVert\Delta C_a-X\rVert_1=:\epsilon_{\star}. \tag*{(25)}

POVM completeness makes the common shift contribute ∑aTr⁡(XMa)=Tr⁡X\sum_a\operatorname{Tr}(XM_a)=\operatorname{Tr}X. Therefore Pad⋆(C′)≥Lad+Tr⁡X−ϵ⋆P_{\mathrm{ad}}^{\star}(C')\ge L_{\mathrm{ad}}+\operatorname{Tr}X-\epsilon_{\star}. Evaluating the same explicit coherent receiver on C′C' gives r(Mcoh;C′)≤r(Mcoh;C)+Tr⁡X+ϵ⋆r(M^{\mathrm{coh}};C')\le r(M^{\mathrm{coh}};C)+\operatorname{Tr}X+\epsilon_{\star}, while Pcoh⋆(C′)≤r(Mcoh;C′)P_{\mathrm{coh}}^{\star}(C')\le r(M^{\mathrm{coh}};C'). Subtraction and optimization over XX prove Equation (24).

For the certified two-round gap, Proposition 3 guarantees separation whenever

ϵ⋆<0.004665903416454.(26)\epsilon_{\star}<0.004665903416454. \tag*{(26)}

The bound is sufficient and need not be tight.

Certified parameter neighborhood {#sec:C}

Interval verification gives the same strict two-round threshold throughout

p∈[0.29999,0.30001],α∈[0.59999,0.60001].(27)p\in[0.29999,0.30001], \qquad \alpha\in[0.59999,0.60001]. \tag*{(27)}

with a whole-box separation lower bound of 0.001627522285899. Thus Ksep=4K_{\rm sep}=4 throughout this inner rectangle in the strict model. The verification includes both exclusion of K=1,2,3K=1,2,3, with a uniform margin of at least 0.034644013557275, and a feasible K=4K=4 receiver throughout the rectangle. A separate K=7K=7 certificate covers

p∈[0.2999,0.3001],α∈[0.5999,0.6001],(28)p \in[0.2999,0.3001], \qquad\alpha\in[0.5999,0.6001], \tag*{(28)}

with gap at least 0.001932932526545 and uniform K≤3K \le3 exclusion margin at least 0.023874515270248; there the established memory statement is 4≤Ksep≤74 \le K_{\rm sep} \le7. All values of α\alpha are represented in a common analytic signal frame; details are given in Appendix § 1.15. These rectangles give local parameter-robustness certificates around the benchmark point.

Temporal quantum-memory complexity

Streaming optimization

A collective POVM does not specify the sequential channels needed for a streaming implementation. We therefore optimize the channel sequence in Equation (11) using Choi-matrix representations, enforcing complete positivity and trace preservation for each update and positivity and completeness for the final POVM. With all other blocks fixed, one update channel or the final measurement enters the objective linearly and can be optimized by an SDP. Each completed sweep produces a candidate receiver, which is subsequently checked and, when necessary, repaired as described in Appendix § 1. The joint problem is nevertheless nonconvex, so the reported values are the best feasible values found rather than certified global optima. Appendix § 1 states the Choi convention, block structure, and feasibility checks used in this calculation.

A Choi matrix represents a channel as a positive matrix subject to a linear trace-preservation condition. This is why each individual update can be optimized by an SDP when the others are fixed. Its convention is given in Appendix § 1.

For the strict class in Definition 3, define

Kstr⋆(C):=min⁡M∈Mstr(K)r(M;C),(29)K_{\mathrm{str}}^{\star}(C) := \min_{M\in\mathcal{M}_{\mathrm{str}}(K)} r(M;C), \tag*{(29)}
Ksep(C):=min⁡{K:PK,str⋆(C)<Pad⋆(C)},(30)K_{\mathrm{sep}}(C) := \min\{K : P_{K,\mathrm{str}}^{\star}(C) < P_{\mathrm{ad}}^{\star}(C)\}, \tag*{(30)}
Kcoll(C):=min⁡{K:PK,str⋆(C)=Pcoll⋆(C)}.(31)K_{\mathrm{coll}}(C) := \min\{K : P_{K,\mathrm{str}}^{\star}(C) = P_{\mathrm{coll}}^{\star}(C)\}. \tag*{(31)}

The minimum of an empty set is ∞\infty. Thus KsepK_{\mathrm{sep}} is the smallest dimension whose optimal strict receiver outperforms the adaptive optimum; the certificates determine it by upper and lower bounds. It is not defined by the outcome of a particular local search. These definitions apply to the strict counted-register convention and do not include architectures with an additional persistent classical record.

Proposition 4 (Attainment and monotonicity). For finite signal and action spaces, the minimum in Eq. (29) is attained and

PK+1,str⋆(C)≤PK,str⋆(C).(32)P_{K+1,\mathrm{str}}^{\star}(C) \le P_{K,\mathrm{str}}^{\star}(C). \tag*{(32)}

Theorem 3 (Constructive full-storage bound). For WW signals of common dimension dsigd_{\mathrm{sig}} and AA final actions, every AA-outcome collective POVM can be realized by a strict streaming receiver with

K=max⁡{dsigW−1,A}.(33)K=\max\{d_{\mathrm{sig}}^{W-1},A\}. \tag*{(33)}

The operator-Schmidt rank OSR⁡t(Ma)\operatorname{OSR}_{t}(M_a) is the smallest number of product operators Lμ⊗RμL_\mu\otimes R_\mu needed to express the effect MaM_a across the cut between the first tt signals and the rest.

Theorem 4 (Finite-memory operator-Schmidt-rank bound). Every terminal effect MaM_a induced by a strict memory-KK receiver obeys

OSR⁡t(Ma)≤K2(34)\operatorname{OSR}_{t}(M_a) \le K^2 \tag*{(34)}

across every chronological prefix-suffix cut H1:t∣Ht+1:W\mathcal{H}_{1:t}|\mathcal{H}_{t+1:W}. For a fixed receiver, the action effects share the same channel-generated left slice space at each chronological cut.

The K2K^2-dimensional operator space of a memory limits the structure that can link earlier and later signals in each decision effect. This rank bound describes the receiver’s measurement, not entanglement of the emitted input.

The proofs are given in Appendix B. The operator-Schmidt statement is the standard matrix-product-operator bound constraint associated with a finite operator space [24, 25]; its use here is to formulate memory requirements for the recovery-weighted decision problem.

Global lower bounds for fixed memory dimension

The minimality statements below require lower bounds valid for every strict memory-KK receiver, not merely the best value found by a local search. Two such bounds are used. Both are stated with the success operators

Sa:=∑x∈Xπx[1−ℓ(a,x)]ρx,(35)S_a := \sum_{x\in\mathcal{X}} \pi_x[1-\ell(a,x)]\rho_x, \tag*{(35)}

which satisfy ∑aTr⁡(SaMa)=1−r(M;C)\sum_a \operatorname{Tr}(S_aM_a)=1-r(M;C) for the binary loss.

The success operator SaS_a weights each trajectory state by its reward for action aa. In the relaxation below, FaF_a is an effective input effect, tat_a bounds its operator norm, and the sum of these bounds is limited by the terminal register dimension.

Lemma 1 (Terminal norm budget). Let {Fa}\{F_a\} be the effective POVM on the full temporal input induced by a strict memory-KK receiver. Then

∑a∥Fa∥∞≤K.(36)\sum_a \lVert F_a\rVert_\infty\le K. \tag*{(36)}

Proof. Write Fa=Φ†(Na)F_a=\Phi^\dagger(N_a), where Φ\Phi is the composed channel from the temporal input to the terminal KK-dimensional register and NaN_a is the terminal POVM element. The adjoint Φ†\Phi^\dagger is positive and unital, so ∥Fa∥∞≤∥Na∥∞\lVert F_a\rVert_\infty\le\lVert N_a\rVert_\infty. Since Na⪰0N_a\succeq0, ∥Na∥∞≤Tr⁡Na\lVert N_a\rVert_\infty\le\operatorname{Tr}N_a, and ∑aTr⁡Na=Tr⁡IK=K\sum_a\operatorname{Tr}N_a=\operatorname{Tr}\mathbb{I}_K=K.

Lemma 1 gives the convex outer relaxation

maximize{Fa},{ta}∑aTr⁡(SaFa),(37)\begin{aligned} \mathop{\mathrm{maximize}}_{\{F_a\},\{t_a\}}\quad&\sum_a\operatorname{Tr}(S_aF_a), \tag*{(37)} \end{aligned}

subject to

Fa⪰0,∑aFa=I,(38)F_a\succeq0,\qquad\sum_aF_a=\mathbb{I}, \tag*{(38)}
Fa⪯taI,ta≥0,(39)F_a\preceq t_a\mathbb{I},\qquad t_a\ge0, \tag*{(39)}
∑ata≤K.(40)\sum_at_a\le K. \tag*{(40)}

Every strict memory-KK receiver is feasible for Equation 36, so its optimum upper-bounds the achievable success probability. A convenient dual is

minimizeY=Y†,{Za},μTr⁡Y+Kμ,(41)\begin{aligned} \mathop{\mathrm{minimize}}_{Y=Y^\dagger,\{Z_a\},\mu}\quad&\operatorname{Tr}Y+K\mu, \tag*{(41)} \end{aligned}

subject to

Za⪰0,(42)Z_a\succeq0, \tag*{(42)}
Y+Za−Sa⪰0,(43)Y+Z_a-S_a\succeq0, \tag*{(43)}
Tr⁡Za≤μ,μ≥0.(44)\operatorname{Tr}Z_a\le\mu,\qquad\mu\ge0. \tag*{(44)}

The dual follows by assigning a Hermitian multiplier YY to POVM completeness, positive multipliers ZaZ_a to Fa⪯taIF_a\preceq t_a\mathbb{I}, and a nonnegative multiplier μ\mu to the terminal norm budget, using standard SDP duality [12 Sec. 1.2.3]. Any certified feasible dual value DKD_K therefore gives the global bound

PK,str⋆(C)≥1−DK.(45)P^\star_{K,\mathrm{str}}(C)\ge1-D_K. \tag*{(45)}

For the two-round benchmark, interval verification of feasible duals gives

P1,str⋆=0.48,P^\star_{1,\mathrm{str}}=0.48,
P2,str⋆≥0.360464844234613,P^\star_{2,\mathrm{str}}\ge0.360464844234613,
P3,str⋆≥0.292565480672402.(46)P^\star_{3,\mathrm{str}}\ge0.292565480672402. \tag*{(46)}

In the dual, YY is Hermitian, ZaZ_a are positive multipliers, and μ\mu is a nonnegative scalar. A feasible value DKD_K upper-bounds success, so 1−DK1-D_K lower-bounds the risk. A second, purely combinatorial bound is useful at greater depth.

Lemma 2 (Terminal-dimension prior bound). For binary loss ℓ(a,x)∈{0,1}\ell(a,x)\in\{0,1\}, let ωa=∑xπx[1−ℓ(a,x)]\omega_a=\sum_x\pi_x[1-\ell(a,x)], and order these weights as ω(1)≥ω(2)≥⋯\omega_{(1)}\ge\omega_{(2)}\ge\cdots, padding with zeros if K>∣A∣K>|\mathcal{A}|. Then

PK,str⋆(C)≥1−∑j=1Kω(j).(47)P^\star_{K,\mathrm{str}}(C)\ge1-\sum_{j=1}^{K}\omega_{(j)}. \tag*{(47)}

The proof is given in Appendix B.

Memory-dimension frontier

Figure 4 shows the best values obtained in the fixed-memory search, while Table IV gives the separate certified bounds used to establish the strict memory threshold. The plotted K=2K=2 and K=3K=3 values are feasible search points; their exclusion instead follows from Equation (46). The K=4K=4 and K=7K=7 entries are explicit receivers whose risks are certified by outward rounding.

Two-round memory-performance search

Figure 4. Two-round memory-performance search. The horizontal axis is memory dimension KK, and the vertical axis is recovery-decision error. Markers show the best values found at each tested dimension. The exact strict-model threshold Ksep=4K_{\mathrm{sep}}=4 follows from the global exclusion certificates in Table IV, not from the plotted K=2,3K=2,3 points. The plotted collective line is the numerical estimate used in the search; Eq. (22) gives the certified enclosure.

ObjectCertified relationRole
P1,str⋆P^\star_{1,\mathrm{str}}=0.48=0.48global value
P2,str⋆P^\star_{2,\mathrm{str}}≥0.360464844234613\ge0.360464844234613global lower bound
P3,str⋆P^\star_{3,\mathrm{str}}≥0.292565480672402\ge0.292565480672402global lower bound
Pad⋆(C)P^\star_{\mathrm{ad}}(C)≤Uad:=0.256727930428793\le U_{\mathrm{ad}}:=0.256727930428793adaptive strategy
r(MK=4;C)r(M_{K=4};C)≤U4:=0.249065686566581\le U_4:=0.249065686566581explicit strict receiver
Pad⋆(C)P^\star_{\mathrm{ad}}(C)≥Lad:=0.251431736761034\ge L_{\mathrm{ad}}:=0.251431736761034PPT lower bound

Table IV. Certified bounds used for the two-round strict-memory threshold. The adaptive entry is an achievable risk upper bound.

For K=1,2,3K=1,2,3, global lower bounds exceed the error of an available adaptive strategy, excluding an advantage at these dimensions. A certified K=4K=4 receiver instead has error below the lower bound for every adaptive receiver. Together these comparisons establish necessity and sufficiency. Four dimensions could be represented by two ideal qubits; the threshold counts the entire persistent and terminal register in the strict model.

Theorem 5 (Two-round strict-memory threshold). For the certified two-round benchmark and the strict terminal-

register model,

Ksep=4,4≤Kcoll≤7.(48)K_{\mathrm{sep}} = 4,\qquad4 \le K_{\mathrm{coll}} \le7. \tag*{(48)}

Proof. The first three rows of Table IV give PK,str⋆>UadP^{\star}_{K,\mathrm{str}} > U_{\mathrm{ad}} for K=1,2,3K = 1, 2, 3. Since the displayed adaptive strategy is feasible, Pad⋆≤UadP^{\star}_{\mathrm{ad}} \le U_{\mathrm{ad}}; therefore none of these dimensions can beat the adaptive optimum. Conversely, the certified K=4K = 4 receiver obeys

Lad−U4≥0.002366050194452>0,(49)L_{\mathrm{ad}} - U_4 \ge0.002366050194452 > 0, \tag*{(49)}

and Lad≤Pad⋆L_{\mathrm{ad}} \le P^{\star}_{\mathrm{ad}}, so K=4K = 4 suffices. This proves Ksep=4K_{\mathrm{sep}} = 4, and the same exclusion gives Kcoll≥4K_{\mathrm{coll}} \ge4. Recovery action 7 is never correct for the two-round benchmark, so its success operator satisfies S7=0S_7 = 0. Any weight assigned to outcome 7 can be reassigned to another outcome without decreasing the success probability, since all success operators are positive semidefinite. Hence an optimal collective POVM may be chosen with at most seven nonzero decision outcomes. Applying Theorem 3 with dsig=4d_{\mathrm{sig}} = 4 and A=7A = 7 gives Kcoll≤7K_{\mathrm{coll}} \le7.

The threshold refers to the strict counted-register convention: the terminal register is included in KK, and no additional persistent classical history is available outside that register. By Proposition 1, the certified K=4K = 4 receiver must contain a non-entanglement-breaking persistent boundary. This is a statement about the channel, not about entanglement of the benchmark state.

Multi-round finite-memory results

For W>2W > 2, temporal separability again permits PPT constraints across chosen temporal bipartitions. The W=3W = 3 certificate imposes all three one-versus-two cuts simultaneously (only 1∣231|23 and 12∣312|3 are chronological),

1∣23,2∣13,3∣12,(50)1|23,\qquad2|13,\qquad3|12, \tag*{(50)}

and gives L3,PPT≥0.299647463773192L_{3,\mathrm{PPT}} \ge0.299647463773192. Only the balanced cut 12∣3412|34 is imposed in the W=4W = 4 calculation, which gives L4,PPT≥0.319542490402679L_{4,\mathrm{PPT}} \ge0.319542490402679.

The full-storage construction of Theorem 3 gives K=16K = 16 at W=3W = 3 and K=64K = 64 at W=4W = 4 for dsig=4d_{\mathrm{sig}} = 4 and A=8A = 8. Certified separation is achieved with K=8K = 8 and K=36K = 36, respectively. Table V collects the outward-safe bounds.

DepthMemoryCertified risk upper boundPPT lower boundGap lower bound
W=3W = 3K=8K = 80.2942973444482160.2996474637731920.005350119324975
W=3W = 3K=16K = 160.2845026994892120.2996474637731920.015144764283980
W=4W = 4K=36K = 360.3193700570475140.3195424904026790.000172433355164
W=4W = 4K=64K = 640.3175296098818210.3195424904026790.002012880520857

Table V. Certified streaming constructions at greater depth. The W=3W = 3 comparator uses all cuts in Eq. (50); the W=4W = 4 comparator uses only 12∣3412|34.

The K=16K = 16 and K=64K = 64 entries are explicit strict streaming realizations. The K=8K = 8 and K=36K = 36 entries are lower-memory streaming receivers obtained directly from the restricted prefix-memory construction described in Appendix § 1.16.

The lower endpoints at W=3W = 3 and W=4W = 4 follow from Lemma 2. Certified feasible product receivers give the adaptive-class upper bounds

Pad⋆(W=3)≤0.405392108675551,Pad⋆(W=4)≤0.444280960818635.\begin{aligned} P^{\star}_{\mathrm{ad}}(W = 3) &\le0.405392108675551,\\ P^{\star}_{\mathrm{ad}}(W = 4) &\le0.444280960818635. \end{aligned}

The dimension-prior floor excludes K=1,2K = 1, 2 against these feasible comparators, giving Ksep≥3K_{\mathrm{sep}} \ge3 at both depths. The corresponding K=3K = 3 dimension-prior lower bounds lie above the certified feasible full-storage risk upper bounds 0.284502699892120.28450269989212 at W=3W = 3 and 0.3175296098818210.317529609881821 at W=4W = 4, establishing Ksep≥4K_{\mathrm{sep}} \ge4.

The reduction from 64 to 36 is in Hilbert-space dimension. Both need six qubits in a binary embedding: ⌈log⁡236⌉=⌈log⁡264⌉=6\lceil\log_2 36 \rceil= \lceil\log_2 64 \rceil= 6. A smaller dimension alone does not imply fewer physical qubits or a simpler control circuit.

At W=3W = 3 and W=4W = 4, full-prefix storage is therefore not necessary for a certified separation. The tested depths do not determine asymptotic memory scaling. The certified margins are also not monotonic in WW: the stronger three-cut W=3W = 3 relaxation produces a larger full-storage margin than the two-round calculation, while the present W=4W = 4 bound uses only one balanced cut. The margin therefore depends on both the recovery problem and the tightness of the chosen outer relaxation. Appendix § 1.16 describes the deeper streaming constructions and certificates; the observation-only control remains separate in Appendix H.

Robustness and implementation error

Dephasing of the counted persistent register

We first apply noise to the register of an explicit streaming receiver while holding its channels and terminal measurement fixed. This tests whether its advantage survives imperfections. Section IX instead acts on the original pulse registers and reoptimizes a collective measurement.

For the strict streaming receivers, whole-register dephasing is applied after each intermediate update. The update channels and terminal POVM are otherwise kept fixed. We use qq for dephasing strength and η=1−q\eta= 1-q for coherence retention:

Dq(ρ)=(1−q)ρ+q∑m=0K−1∣m⟩⟨m∣ρ∣m⟩⟨m∣.(51)\mathcal{D}_q(\rho) = (1-q)\rho+ q\sum_{m=0}^{K-1} |m\rangle\langle m|\rho|m\rangle\langle m|. \tag*{(51)}

This differs from reoptimizing a terminal measurement for each noise strength. At W=2W = 2 there is a single intermediate memory boundary, so the certified curve is a test of inter-round memory alone and the risk is affine in qq.

Interval verification brackets the crossing points near

q⋆(K=4)≈0.0169123753455,q⋆(K=7)≈0.0519338246576.(52)\begin{aligned} q_{\star}^{(K=4)} &\approx0.0169123753455,\\ q_{\star}^{(K=7)} &\approx0.0519338246576. \tag*{(52)} \end{aligned}

The available bracket information is listed in Appendix C; exact two-round endpoints remain to be transcribed. Thus the fixed K=4K = 4 and K=7K = 7 receivers retain a certified advantage up to approximately 1.69% and 5.19% dephasing strength, respectively. These dephasing strengths are defined in the numerical memory basis and are not calibrated device error rates. Analogous fixed-receiver certificates are obtained for the deeper W=3,K=8W = 3, K = 8 and W=4,K=36W = 4, K = 36 constructions; their exact crossing brackets are listed in Appendix C.

WWKsepK_{\mathrm{sep}}KcolK_{\mathrm{col}}Prefix dimension
24[4, 7]4
3[3, 8][4, 16]16
4[3, 36][4, 64]64

Table VI. Current strict-memory bounds. Only the two-round separation threshold is exact. The prefix column is dsigW−1d^{W-1}_{\mathrm{sig}}, before accounting for the terminal action register in Eq. (33).

Channel-distance error budget

Theorem 6 (Implementation-error accumulation). Let the ideal strict receiver be a composition of CPTP factors, including a terminal measurement channel, and let factor jj be replaced by an implementation at unhalved diamond distance δj=∥Ej−Ej∥⋄\delta_j = \lVert\mathcal{E}_j - E_j \rVert_{\diamond}. The diamond norm maximizes the output trace norm over joint inputs with an arbitrary reference system and input trace norm one. No factor of one half is included in δj\delta_j. For any loss in [0,1][0,1],

∣rimpl−rideal∣≤min⁡{1,12∑jδj}.(53)\lvert r_{\mathrm{impl}} - r_{\mathrm{ideal}} \rvert\le\min\left\{1,\frac{1}{2}\sum_j \delta_j\right\}. \tag*{(53)}

The proof is a telescoping hybrid argument followed by contractivity of trace distance and is given in Appendix C. Combining Eq. (53) with the certified W2 margins gives the sufficient budgets

∑jδj<0.004732100388904(K=4),\sum_j \delta_j < 0.004732100388904 \qquad(K = 4),
∑jδj<0.018663613665816(K=7).(54)\sum_j \delta_j < 0.018663613665816 \qquad(K = 7). \tag*{(54)}

These are dimensionless sufficient channel-error budgets, not calibrated hardware tolerances.

Stored-pulse hardware model

We also consider a stored-pulse model in which individual pulse registers undergo phase decay before an optimized collective readout. This model acts on the stored pulse registers rather than on the learned KK-dimensional streaming memory. At each trial value of T2T_2, the final joint POVM is reoptimized while the stored pulses undergo pulse-dependent phase retention.

Here T2T_2 is the coherence-decay time, T1T_1 the energy-relaxation time, and TϕT_{\phi} the pure-dephasing time. The interval τround\tau_{\mathrm{round}} separates pulses, and τproc\tau_{\mathrm{proc}} is the final processing delay. For pulse t∈{1,…,W}t \in\{1,\ldots,W\}, the modeled storage time and retention are

tt=τproc+(W−t)τround,λt=e−tt/T2.(55)t_t = \tau_{\mathrm{proc}} + (W-t)\tau_{\mathrm{round}}, \qquad\lambda_t = e^{-t_t/T_2}. \tag*{(55)}

The earliest pulse has the longest modeled storage time,

t1=τproc+(W−1)τround.(56)t_1 = \tau_{\mathrm{proc}} + (W-1)\tau_{\mathrm{round}}. \tag*{(56)}

Amplitude loss must be simulated separately, for example with

η1,t=e−tt/T1.(57)\eta_{1,t} = e^{-t_t/T_1}. \tag*{(57)}

Although

1T2=12T1+1Tϕ(58)\frac{1}{T_2} = \frac{1}{2T_1} + \frac{1}{T_{\phi}} \tag*{(58)}

relates the decay constants in a Markovian model, it does not replace separate amplitude-damping and pure-dephasing channels.

For the slow schedule, the timing anchors are

τround=5.82 μs,\tau_{\mathrm{round}} = 5.82\,\mu\mathrm{s},
τproc=2.64 μs.(59)\tau_{\mathrm{proc}} = 2.64\,\mu\mathrm{s}. \tag*{(59)}

The timing parameters are modeling inputs drawn from the stated schedule and a literature anchor [31]; they are not measurements of an integrated implementation. The composition of τround\tau_{\mathrm{round}} is given in Appendix § 1.21. The corresponding longest storage times t1t_1 are 8.46, 14.28, and 20.10 μs\mu\mathrm{s} for W=2,3,4W = 2,3,4. At a numerical crossing T2,⋆T_{2,\star} we report the retention of the earliest pulse,

λ⋆:=exp⁡(−t1/T2,⋆).(60)\lambda_{\star} := \exp(-t_1/T_{2,\star}). \tag*{(60)}

The resulting crossings, shown in Figure 6 of Appendix § 1.21, are T2,⋆=259.942 μsT_{2,\star} = 259.942\,\mu\mathrm{s}, 767.970 μs\mu\mathrm{s}, and 2656.778 μs\mu\mathrm{s} for W=2,3,4W = 2,3,4.

Stored-pulse collective-readout model

Figure 6. Stored-pulse collective-readout model. Solid curves show the slow-schedule calculation in which the final joint POVM is reoptimized at each T2T_2. Each panel has coherence time on the horizontal axis and recovery-decision error on the vertical axis; panels correspond to W=2,3,4W=2,3,4. Horizontal dashed lines show the comparator values used in the stored-pulse root calculation; the W=3W=3 root uses the single-cut comparator employed in that stored-pulse calculation rather than the three-cut bound in Eq. (50). The marked crossings give T2,⋆=259.942 μsT_{2,\star}=259.942\,\mu\mathrm{s}, 767.970 μs767.970\,\mu\mathrm{s}, and 2656.778 μs2656.778\,\mu\mathrm{s} for W=2,3,4W=2,3,4. Vertical lines indicate separately reported component-scale coherence values: approximately 300 μs300\,\mu\mathrm{s} for a tantalum transmon [34], 720 μs720\,\mu\mathrm{s} for an integrated cavity memory [33], and 34 ms34\,\mathrm{ms} for a high-QQ cavity qubit [35]. These coherence values were reported in separate experiments and do not represent an integrated realization of the receiver considered here.

These crossings are numerical outputs of the stored-pulse model and are not part of the interval-certified receiver bounds. The W=2W = 2 crossing lies within reported component-scale coherence times, whereas the W=3W = 3 and W=4W = 4 calculations require progressively longer storage. The comparison is made at the component level; reported component values and the timing assumptions behind them are collected in Appendix § 1.21.

Discussion

The certified coherent-risk upper bound lies below the certified PPT lower bound on the entire separate-adaptive class. That class already permits continuous outcomes, unrestricted classical memory, and unrestricted classical computation. The operational distinction is therefore whether pulse-dependent quantum information may persist between rounds.

Proposition 3 shows that the positive gap persists under sufficiently small perturbations of the cost operators. Proposition 1 shows that a receiver whose complete classically flagged boundary instruments are all measure-and-prepare can be simulated by a separate adaptive receiver. The certified K=4K = 4 separation therefore implies that at least one persistent boundary of that receiver is not measure-and-prepare. This implication is specific to the receiver architecture defined here; entanglement-breaking dynamics can behave differently under more general multitime interventions [19].

For the strict two-round architecture, the minimum terminal memory dimension required to outperform the separate adaptive class is exactly four. This threshold includes the terminal register and assumes that no additional persistent classical history is available outside the counted register. The fixed-receiver dephasing study acts on this counted register, while the diamond-norm theorem bounds the effect of imperfect channel implementations without choosing a dephasing basis.

At greater depth the exact threshold is not known, but certified separation is already obtained with K=8K = 8 at W=3W = 3 and K=36K = 36 at W=4W = 4, compared with K=16K = 16 and K=64K = 64 for the full-prefix construction. At W=3W = 3, the simultaneous three-cut relaxation gives a full-storage certified margin of 0.015144764283980, while the W=4W = 4 calculation presently uses only one balanced cut. The tested depths therefore do not establish a monotonic trend in the true coherent-adaptive gap or an asymptotic memory scaling law.

The architecture also changes where latency enters the recovery pipeline. A separate adaptive receiver converts each arriving signal into a classical record before any pulse-dependent information from that signal can participate in later-round processing, whereas a coherent receiver may carry such information forward in a quantum memory. This can replace some inter-round measurement and feed-forward requirements with coherent updates and storage. The present results do not establish lower end-to-end latency: coherent capture, memory operations, storage, and final readout introduce their own timing requirements, and, in the separate stored-pulse model considered here, the required coherence time increases substantially with depth. A quantitative comparison of these resources would require a hardware-specific timing model and is left for future work.

Several limitations remain. The pulse ensemble, extraction circuit, QPSK encoding, prior, and recovery loss are fixed. PPT is an outer relaxation and may become loose at larger temporal depth; Appendix G gives an analytic two-round task with a strict coherent advantage whose optimal measurement is nevertheless separable. The optimized channels have not yet been compiled to a low-depth device Hamiltonian. The QRC calculation is exploratory, and the stored-pulse hardware calculation is distinct from the learned streaming-memory architecture. The most immediate extensions are a stronger multi-cut W=4W = 4 relaxation, device-level compilation of the coherent updates, and tests with independently calibrated amplitude and phase noise. Appendix § 1.22 states a conditional flagged-sector inheritance criterion, but its hypotheses have not been verified for a natural surface-code family.

Conclusion

The point at which syndrome information becomes classical is itself a receiver-design decision. For the fixed recovery problem studied here, an explicit coherent streaming receiver has certified recovery risk below every separate adaptive receiver. In the strict counted-register model, the exact two-round separation threshold is Ksep=4K_{\mathrm{sep}} = 4, and the induced temporal effects have operator-Schmidt rank at most K2K^2 across every chronological cut. At greater depth, certified K=8K = 8 and K=36K = 36 receivers show that full-prefix storage is not required for separation at W=3W = 3 and W=4W = 4.

Dephasing of the actual persistent register gives a direct robustness test for the explicit receivers, while the channel-distance bound gives a general sufficient implementation-error condition. Both results are defined within the receiver model used here. The distinction from the separate adaptive class is the ability to retain pulse-dependent quantum information across rounds. Exact W3W3 and W4W4 thresholds, a stronger multi-cut W4W4 bound, and device-level compilation of the certified updates remain open.

Proof of temporal separability

Proof of Theorem 1. Condition on the receiver’s private randomness. Fresh local ancillas can be absorbed into the effective POVM on the current signal. At each node of the adaptive tree, the conditional POVM is a measurable operator-valued kernel. In finite dimension, it admits a positive density with respect to its scalar trace measure, which may depend on the preceding history. The integrals below are understood iteratively with these conditional measures. For a complete transcript y=(y1,…,yW)y=(y_1,\ldots,y_W), the associated leaf effect therefore factors as

Ey=Ey1(1)⊗Ey2∣y1(2)⊗⋯⊗EyW∣y<W(W),(61)E_y=E_{y_1}^{(1)}\otimes E_{y_2\mid y_1}^{(2)}\otimes\cdots\otimes E_{y_W\mid y_{<W}}^{(W)}, \tag*{(61)}

and each factor is positive semidefinite. Let Γa\Gamma_a be the measurable set of transcripts that the classical decision rule maps to action aa. Coarse-graining those leaves and averaging over private randomness gives

Ma=∫ΓaEy dμ(y),(62)M_a=\int_{\Gamma_a} E_y\,d\mu(y), \tag*{(62)}

which is exactly Equation (12). In finite dimension, this is a positive conic integral of product effects, equivalently a limit of finite positive sums of product effects, and therefore belongs to the closed fully separable cone.

Summing Equation (62) over the final actions, the sets {Γa}a\{\Gamma_a\}_a partition the transcript space, and recursive use of the local completeness relations at each node gives ∑aMa=IH1:W\sum_a M_a=\mathbb{I}_{\mathcal{H}_{1:W}}. Finally, partial transpose on any subset of temporal factors maps each product integrand to another positive product operator. Positivity is preserved by integration, so MaTS⪰0M_a^{T_S}\succeq0 for every temporal subset SS, completing the proof.

Memory-complexity proofs

For fixed KK, the Choi matrices of the strict update channels and the final POVM belong to closed and bounded subsets of finite-dimensional vector spaces. Their product is compact, and the risk is continuous; this proves attainment in Proposition 4. Embedding CK\mathbb{C}^K as a subspace of CK+1\mathbb{C}^{K+1}, extending each channel on the unused level, and ensuring that the added level is never reached from the embedded input subspace reproduces every memory-KK receiver at dimension K+1K+1. The final POVM is extended arbitrarily on the orthogonal one-dimensional complement, for example by assigning that complement to one fixed outcome. Because the added level is unreachable, this does not change the induced statistics and proves monotonicity.

For Theorem 3, store the first tt signals coherently in a prefix register. Immediately before the last signal arrives, its dimension is dsigW−1d_{\mathrm{sig}}^{W-1}. Apply the desired collective POVM when the last signal arrives, write its outcome into one of AA orthogonal terminal states, and measure that state. A common register of dimension max⁡{dsigW−1,A}\max\{d_{\mathrm{sig}}^{W-1},A\} accommodates both stages, proving the claimed sufficiency.

For the archived W=3W=3, K=16K=16 and W=4W=4, K=64K=64 realizations, the induced measurement was additionally checked on a complete matrix-unit basis. Consequently, those explicit channel sequences reproduce their target collective measurements on arbitrary signal inputs and under extension by an external reference system.

To prove Theorem 4, cut the channel sequence after round tt. Let Φ1:t\Phi_{1:t} be the composed prefix channel from

H1:t\mathcal{H}_{1:t} to the KK-dimensional memory. Pull the terminal effect for action aa back through the remaining channels, obtaining an operator TaT_a on CK⊗Ht+1:W\mathbb{C}^K\otimes\mathcal{H}_{t+1:W}. Choose an operator basis {Fμ}μ=1K2\{F_\mu\}_{\mu=1}^{K^2} of L(CK)\mathcal{L}(\mathbb{C}^K) and expand

Ta=∑μ=1K2Fμ⊗Ra,μ(t).(63)T_a=\sum_{\mu=1}^{K^2}F_\mu\otimes R_{a,\mu}^{(t)}. \tag*{(63)}

Pulling this operator back through the prefix channel gives

Ma=∑μ=1K2Φ1:t†(Fμ)⊗Ra,μ(t).(64)M_a=\sum_{\mu=1}^{K^2}\Phi_{1:t}^{\dagger}(F_\mu)\otimes R_{a,\mu}^{(t)}. \tag*{(64)}

The rank is therefore at most K2K^2, and the left factors depend only on the prefix channels, not on aa.

Proof of the terminal-dimension prior bound

Let Fa=Φ†(Na)F_a=\Phi^\dagger(N_a) be the effective input effect associated with action aa, and define

ua:=∥Fa∥∞.u_a:=\lVert F_a\rVert_\infty.

Because 0⪯Fa⪯I0\preceq F_a\preceq\mathbb{I}, one has 0≤ua≤10\leq u_a\leq1. Moreover, Lemma 1 gives

∑aua≤K.\sum_a u_a\leq K.

Since Sa⪰0S_a\succeq0 and Tr⁡Sa=ωa\operatorname{Tr}S_a=\omega_a,

Tr⁡(SaFa)≤∥Fa∥∞Tr⁡Sa=ωaua.(65)\operatorname{Tr}(S_aF_a)\leq\lVert F_a\rVert_\infty\operatorname{Tr}S_a=\omega_a u_a. \tag*{(65)}

Hence every strict memory-KK receiver satisfies

Psucc=∑aTr⁡(SaFa)(66)P_{\mathrm{succ}}=\sum_a\operatorname{Tr}(S_aF_a) \tag*{(66)}
≤max⁡0≤ua≤1∑aua≤K∑aωaua=∑j=1Kω(j).(67)\leq\max_{\substack{0\leq u_a\leq1\\\sum_a u_a\leq K}}\sum_a\omega_a u_a =\sum_{j=1}^{K}\omega_{(j)}. \tag*{(67)}

Therefore

PK,str∗(C)≥1−∑j=1Kω(j),P^*_{K,\mathrm{str}}(\mathcal{C})\geq1-\sum_{j=1}^{K}\omega_{(j)},

which proves Lemma 2.

Global bounds used for the two-round threshold

The certified global lower bounds for K=1,2,3K=1,2,3 in Equation (46) are obtained from interval-verified feasible duals of Equation 37. Their comparison with the explicit adaptive upper bound and the certified K=4K=4 receiver is the argument given in the proof of Theorem 5. The minimality result uses only the certified global lower bounds.

Robustness proofs and controls

For Theorem 6, replace the ideal CPTP factors one at a time. The telescoping hybrid expansion and diamond-norm contractivity give an unhalved trace-norm change at most ∑jδj\sum_j \delta_j in the terminal classical state. The expectation of any loss in [0,1][0,1] changes by at most one half of that distance and never by more than one, proving Eq. (53).

Certified crossing brackets

Table VII gives the available dephasing-strength metadata, in the convention q=1−ηq = 1 - \eta of Eq. (51). The trace-preservation completion ρ↦Tr⁡(Rρ)∣0⟩⟨0∣\rho\mapsto\operatorname{Tr}(R\rho)|0\rangle\langle0| used in the certificate is included when the noisy curves are evaluated.

ReceiverExact bracketDecimal
W=2W = 2, K=4K = 4–≈0.0169123753455\approx0.0169123753455
W=2W = 2, K=7K = 7–≈0.0519338246576\approx0.0519338246576
W=3W = 3, K=8K = 8[28190516777216,28190616777216]\left[\frac{281905}{16777216},\frac{281906}{16777216}\right][0.01680284738,0.0168029070][0.01680284738, 0.0168029070]
W=4W = 4, K=36K = 36[565216777216,565316777216]\left[\frac{5652}{16777216},\frac{5653}{16777216}\right][0.00033688545,0.00033694506][0.00033688545, 0.00033694506]

Table VII. Certified dephasing-strength brackets for the fixed streaming receivers. Exact endpoints for the two-round receivers are pending transcription from the verification archive.

For these particular receivers, terminal-hold dephasing applied after the last update leaves the decision statistics unchanged: the two-round terminal POVM effects are diagonal in the dephasing basis, and the deeper measure-and-encode constructions produce diagonal terminal states. This is a property of these constructions, not a general statement about processing noise.

Pulse-register control

As a separate control, the incoming pulse registers were dephased before a collective terminal measurement. At the coherent endpoint the optimized error is approximately 0.24210, while complete pulse-register dephasing gives approximately 0.29165. The terminal POVM is reoptimized in this control. These values do not describe noise on the learned persistent memory and are not used for the certified thresholds in Eq. (52).

Pulse-register dephasing control

Figure 5. Pulse-register dephasing control. The horizontal axis is retained pulse coherence, and the vertical axis is recovery-decision error. The points show the reoptimized end-point errors and the dashed line the adaptive comparison value used in this control. This auxiliary calculation acts on stored input pulses before collective readout, not on the counted streaming register.

Certificate validation

The certified bounds are evaluated using 256-bit Arb/Acb ball arithmetic. The QPSK Gram matrix, state coordinates, trajectory probabilities, and loss-weighted cost operators are reconstructed from the analytic benchmark rather than read as rounded cost matrices. Binary64 receiver and dual candidates are embedded as exact rational numbers before verification, so their input conversion adds no untracked rounding error.

For each candidate receiver, each Choi matrix and terminal effect is replaced by its Hermitian part in ball arithmetic. After positivity of the terminal POVM effects is verified, those effects are contracted by the exact rational factor 99999999/10000000099999999/100000000 to create completeness slack. The positive remainder is assigned to a fixed outcome, restoring exact completeness. Channel trace-preservation remainders are completed by the completely positive map ρ↦Tr⁡(Rρ)∣0⟩⟨0∣\rho\mapsto\operatorname{Tr}(R\rho)|0\rangle\langle0|, with interval verification that R⪰0R \succeq0. The completed maps are then checked for complete positivity and trace preservation. The risk is evaluated from the analytic cost operators with outward rounding, yielding an upper bound on the explicit receiver’s error. Search optimality is not required.

For the PPT dual, the exact-rational witnesses YY and QaQ_a are inserted into

Qa⪰0,Ca−Y−T1(Qa)⪰0.(68)Q_a \succeq0,\qquad C_a-Y-T_1(Q_a)\succeq0. \tag*{(68)}

Interval factorizations verify every cone and slack, and the objective Tr⁡Y\operatorname{Tr}Y is rounded downward. Weak duality then gives a lower bound on the analytic benchmark. For a congruence B=V†HVB=V^\dagger H V with invertible VV, suppose a directed Gershgorin calculation gives B⪰gIB \succeq gI. A lower bound on the smallest eigenvalue of HH is

λmin⁡(H)≥{g/∥V∥22,g≥0,g∥V−1∥22,g<0.(69)\lambda_{\min}(H)\ge \begin{cases} g/\lVert V\rVert_2^2, & g\ge0,\\ g\lVert V^{-1}\rVert_2^2, & g<0. \end{cases} \tag*{(69)}

The norm factors are replaced by certified upper bounds, with outward rounding in the appropriate direction. The accompanying archive records the exact rational witnesses, interval outputs, arithmetic precision, solver metadata, and cryptographic hashes used to reproduce these directed bounds.

Benchmark construction and convergence

The benchmark generator enumerates a finite latent-trajectory set X\mathcal{X}. The per-round physical-error increments are

(0,1,2,4)with probabilities(710,110,110,110),(70)(0,1,2,4)\quad\text{with probabilities}\quad\left(\frac{7}{10},\frac{1}{10},\frac{1}{10},\frac{1}{10}\right), \tag*{(70)}

corresponding to no error or a single flip on one of the three physical bits. With two rounds, at most two distinct bits can be flipped, so the reachable final masks are 0, 1, 2, 3, 4, 5, 6; mask 7 is unreachable. The eight recovery actions are the masks 0, …, 7, and the loss is zero exactly when the recovery mask equals the final physical-error mask. Each record contains a fault trajectory, its probability πx\pi_x, the emitted syndrome labels, and the residual physical-error mask associated with every recovery action. If st(x)s_t(x) is the two-bit syndrome in round tt, the fixed syndrome-to-QPSK lookup assigns a phase index jt(x)∈{0,1,2,3}j_t(x) \in\{0,1,2,3\}, giving

ρxQPSK=⨂t=12∣αjt(x)⟩⟨αjt(x)∣.(71)\rho_x^{\mathrm{QPSK}}=\bigotimes_{t=1}^{2}\lvert\alpha_{j_t(x)}\rangle\langle\alpha_{j_t(x)}\rvert. \tag*{(71)}

Temporal factors are ordered chronologically, with round 1 as the leftmost tensor factor; the archive uses the same ordering. The certified calculation constructs the finite coherent-state span directly from the analytic Gram entries in Eq. (9). Arb/Acb ball arithmetic is used for the certified cost operators and objective contractions; tensor products of the resulting coordinates represent complete trajectories without a Fock cutoff. In the parameter-neighborhood verification, different values of α\alpha are compared in a common analytic four-dimensional frame using explicit isometries, rather than by subtracting unrelated Gram factorizations. For final physical-error mask bW(x)b_W(x), the residual mask is a⊕bW(x)a\oplus b_W(x). The benchmark loss is

ℓ(a,x)=1−δa,bW(x),(72)\ell(a,x)=1-\delta_{a,b_W(x)}, \tag*{(72)}

where the Kronecker delta is one when its indices agree and zero otherwise. This is Eq. (7), a comparison of complete masks rather than logical equivalence classes. Substitution of the enumerated πx\pi_x, lookup jt(x)j_t(x), and loss table into Equation (2) determines every CaC_a without receiver-dependent choices.

As an independent floating-point check, let VαfpV_\alpha^{\mathrm{fp}} denote the numerical Gram factor and GαG_\alpha the analytic Gram matrix. The check gives

∥(Vαfp)†Vαfp−Gα∥F=2.63×10−15.(73)\left\|\left(V_\alpha^{\mathrm{fp}}\right)^\dagger V_\alpha^{\mathrm{fp}}-G_\alpha\right\|_F=2.63\times10^{-15}. \tag*{(73)}

The maximum eigenvalue discrepancy was 2.22×10−152.22\times10^{-15}. The two-norm condition numbers are approximately κ2(Vαfp)=11.34\kappa_2(V_\alpha^{\mathrm{fp}})=11.34 for the Gram factor and κ2(Gα)=128.69\kappa_2(G_\alpha)=128.69 for the Gram matrix. These are independent floating-point consistency diagnostics. The directed theorem bounds instead use the analytic Gram construction and interval procedure of Appendix D.

As an independent convergence check, the same states were also reconstructed in a normalized truncated Fock basis,

∣αj⟩N=1ZN∑n=0N(αeiπj/2)nn!∣n⟩,ZN=∑n=0N∣α∣2nn!.(74)\lvert\alpha_j\rangle_N=\frac{1}{\sqrt{Z_N}}\sum_{n=0}^{N}\frac{(\alpha e^{i\pi j/2})^n}{\sqrt{n!}}\lvert n\rangle,\qquad Z_N=\sum_{n=0}^{N}\frac{|\alpha|^{2n}}{n!}. \tag*{(74)}

For each tested NN, the cost operators and both optimization objectives were rebuilt. Relative to the N=30N=30 reference, the first tested cutoff satisfying a 10−810^{-8} convergence criterion is N=8N=8. At that cutoff, the absolute differences in coherent error, repaired PPT lower bound, and gap are 6.22×10−106.22\times10^{-10}, 6.20×10−106.20\times10^{-10}, and 1.87×10−121.87\times10^{-12}, respectively. This Fock sweep is a numerical cross-check rather than an interval bound; no cutoff enters the certified theorem.

Multi-round PPT relaxation and deeper constructions

By Theorem 1, every final adaptive effect is fully separable across temporal factors. A tractable outer relaxation imposes

Ma⪰0,MaTS⪰0for selected S⊂{1,…,W},(75)M_a\succeq0,\qquad M_a^{T_S}\succeq0\quad\text{for selected }S\subset\{1,\ldots,W\}, \tag*{(75)}

together with ∑aMa=I\sum_a M_a=\mathbb{I}. Adding temporal partial-transpose constraints tightens the relaxation. Omitting a cut does not invalidate containment, but it may weaken the resulting adaptive bound. For W=3W=3, all eight analytic residual matrices and all twenty-four PPT multipliers were verified at 256 bits; the scalar-repair objective debit was exactly 0.000672565248.

The W=3W=3, K=16K=16 and W=4W=4, K=64K=64 entries are explicit full-storage streaming realizations constructed using Theorem 3. Their Choi matrices and terminal POVMs are materialized exactly in sparse rational and Gaussian-rational form; the W=4W=4 matrices are represented sparsely.

The remaining entries are lower-memory streaming receivers obtained from a restricted prefix-memory construction. Selected prefix computational-basis vectors are preserved coherently, the discarded population is reset to ∣0⟩\lvert0\rangle, and the selection keeps the vectors of largest average diagonal mass with deterministic tie-breaking. Only the terminal discrimination POVM is then numerically optimized and certified. Because the construction is restricted, a failure at some KK does not exclude that dimension globally. The tested dimensions were K=4,5,6,7,8,9,10,11,12,16K = 4,5,6,7,8,9,10,11,12,16 at W=3W = 3 and K=4,8,12,16,24,32,34,35,36,40,48,64K = 4,8,12,16,24,32,34,35,36,40,48,64 at W=4W = 4. For K<8K < 8 at W=3W = 3 this measure-and-encode family supports at most KK terminal labels, so the negative results there are constructional rather than global; this is why the W=3W = 3 statement remains 3≤Ksep≤83 \le K_{\mathrm{sep}} \le8. For W=3W = 3, the relaxation uses the cuts 1∣231|23, 2∣132|13, and 3∣123|12; for W=4W = 4, it uses 12∣3412|34. In particular, the W=4W = 4 certificate does not establish an advantage for a constrained K=4K = 4 receiver.

WWKKReceiver upper boundPPT lower boundCertified gap
270.2420999299281250.2514317367610340.009331806832908
380.2942973444482160.2996474637731920.005350119324975
3100.2883501729495010.2996474637731920.011297290823690
3120.2861752613632480.2996474637731920.013472202409943
3160.2845026994892120.2996474637731920.015144764283980
4360.3193700570475140.3195424904026790.000172433355164
4480.3178514433306210.3195424904026790.001691047072057
4640.3175296098818210.3195424904026790.002012880520857

Table IX. Certified depth bounds and explicit streaming receivers. All inequalities are directed; cut metadata are stated in the text.

A separable-optimum example

Separability across the temporal cut does not by itself preclude a coherent advantage. Let b∈{0,1}b \in\{0,1\} and β∈{Z,X}\beta\in\{Z,X\} be independent and uniform. The first signal is

∣ψ0,Z⟩=∣0⟩,∣ψ1,Z⟩=∣1⟩,∣ψ0,X⟩=∣+⟩,∣ψ1,X⟩=∣−⟩,(76)\begin{aligned} \lvert\psi_{0,Z}\rangle&= \lvert0\rangle,\qquad\lvert\psi_{1,Z}\rangle= \lvert1\rangle,\\ \lvert\psi_{0,X}\rangle&= \lvert+\rangle,\qquad\lvert\psi_{1,X}\rangle= \lvert-\rangle, \tag*{(76)} \end{aligned}

where ∣±⟩=(∣0⟩±∣1⟩)/2\lvert\pm\rangle= (\lvert0\rangle\pm\lvert1\rangle)/\sqrt{2}, and X,ZX,Z label their measurement bases. The second signal is an orthogonal basis flag ∣β⟩\lvert\beta\rangle. Thus

ρb,β=∣ψb,β⟩⟨ψb,β∣⊗∣β⟩⟨β∣,(77)\rho_{b,\beta} = \lvert\psi_{b,\beta}\rangle\langle\psi_{b,\beta}\rvert\otimes\lvert\beta\rangle\langle\beta\rvert, \tag*{(77)}

and the final action is a guess a∈{0,1}a \in\{0,1\} with ℓ(a,b,β)=1[a≠b]\ell(a,b,\beta) = \mathbf{1}[a \ne b]. A two-dimensional coherent memory can retain the first qubit until the basis flag arrives and then measure in the indicated basis, giving zero error. A receiver that must measure the first signal before learning the basis has optimal success probability cos⁡2(π/8)=(1+1/2)/2\cos^2(\pi/8) = (1 + 1/\sqrt{2})/2 [32], and hence error (1−1/2)/2(1 - 1/\sqrt{2})/2. Therefore

P2,str⋆=Pcoll⋆=0,P^{\star}_{2,\mathrm{str}} = P^{\star}_{\mathrm{coll}} = 0,
Pad⋆=1−1/22,P^{\star}_{\mathrm{ad}} = \frac{1 - 1/\sqrt{2}}{2},
Ksep=Kcoll=2.(78)K_{\mathrm{sep}} = K_{\mathrm{coll}} = 2. \tag*{(78)}

The optimal collective measurement is nevertheless separable across the temporal cut,

Mb=∣ψb,Z⟩⟨ψb,Z∣⊗∣Z⟩⟨Z∣+∣ψb,X⟩⟨ψb,X∣⊗∣X⟩⟨X∣.(79)M_b = \lvert\psi_{b,Z}\rangle\langle\psi_{b,Z}\rvert\otimes\lvert Z\rangle\langle Z\rvert+ \lvert\psi_{b,X}\rangle\langle\psi_{b,X}\rvert\otimes\lvert X\rangle\langle X\rvert. \tag*{(79)}

The example shows that a PPT or separability relaxation cannot detect every temporal-order advantage, and it is not used in any certificate above.

Observation-only depth control

As a separate numerical control, additional observations were introduced without additional data-error opportunities. This differs from both the certified two-round benchmark and the slow timing schedule used for Figure 6. Within that control model, the coherent errors decrease from approximately 8.761% to 4.093% to 1.814% for two, three, and four observations. The corresponding dephasing-threshold parameters are λ⋆(2)=0.9402\lambda_{\star}^{(2)} = 0.9402, λ⋆(3)=0.9863\lambda_{\star}^{(3)} = 0.9863, and λ⋆(4)=0.9966\lambda_{\star}^{(4)} = 0.9966. Here λ⋆\lambda_{\star} denotes the coherence-retention parameter used in this control calculation. These values pertain only to the observation-only control and are not used in the stored-pulse hardware calculation.

Numerical optimization of streaming updates

Consider a channel E:L(Cdin)→L(Cdout)\mathcal{E} : \mathcal{L}(\mathbb{C}^{d_{\mathrm{in}}}) \to\mathcal{L}(\mathbb{C}^{d_{\mathrm{out}}}), where dind_{\mathrm{in}} and doutd_{\mathrm{out}} are the input and output dimensions. Let {∣i⟩}\{\lvert i\rangle\} be an orthonormal input basis. Its Choi matrix is defined by

J(E)=∑i,j=1din∣i⟩⟨j∣⊗E(∣i⟩⟨j∣).(80)J(\mathcal{E}) = \sum_{i,j=1}^{d_{\mathrm{in}}} \lvert i\rangle\langle j\rvert\otimes\mathcal{E}(\lvert i\rangle\langle j\rvert). \tag*{(80)}

Complete positivity and trace preservation are equivalent to

J(E)⪰0,Tr⁡outJ(E)=Iin.(81)J(\mathcal{E}) \succeq0,\qquad\operatorname{Tr}_{\mathrm{out}} J(\mathcal{E}) = \mathbb{I}_{\mathrm{in}}. \tag*{(81)}

The action of the channel is recovered from

E(X)=Tr⁡in[(XT⊗Iout)J(E)].(82)\mathcal{E}(X) = \operatorname{Tr}_{\mathrm{in}}\left[(X^{\mathsf{T}} \otimes\mathbb{I}_{\mathrm{out}})J(\mathcal{E})\right]. \tag*{(82)}

After composing the update maps with the loss-weighted input ensemble, the average risk is multilinear in the channel Choi matrices and linear in the final POVM. Holding every block but one fixed therefore leaves a linear objective over the positive semidefinite and trace-preserving constraints in Equation (81); optimizing that block is an SDP. The final POVM block is likewise an SDP with positivity and completeness constraints.

The streaming search uses block-coordinate optimization. It begins from feasible channel and POVM blocks, replaces one block at a time by the solution of its convex subproblem, and repeats channel and measurement updates until the prescribed stopping criterion is reached. An exactly solved block update cannot increase the objective, but finite solver tolerances can obscure changes at the last reported digits. Figure 4 shows the search values; Table IV gives the certified bounds used for minimality.

Feasibility can be checked independently of the optimization expression. The candidate receivers are evaluated by reconstructing the induced channel action with Equation (82) and recomputing the recovery risk from the resulting output states. The feasibility check records the smallest Choi and POVM eigenvalues, the trace-preservation residuals, and the Frobenius-norm POVM completeness residual ∥∑aNa−I∥F\left\lVert\sum_a N_a-I\right\rVert_F. These diagnostics are used to screen the candidate receivers before interval verification.

For the K=7K=7 and K=4K=4 receivers, the feasibility check found trace-preservation residuals below 9.7×10−159.7\times10^{-15} and Choi minimum eigenvalues no more than 7×10−177\times10^{-17} below zero. The final POVMs were positive semidefinite and complete to floating-point precision. Before interval verification, the repaired floating-point candidates had risks 0.242099914992664 for K=7K=7 and 0.249065671918806 for K=4K=4. The certified theorem instead uses the outward-safe upper bounds in Table VIII.

QuantityCertified bound
K=7K=7 receiver riskU7≤0.242099929928125U_7 \le0.242099929928125
Separate-adaptive riskPad∗≥0.251431736761034P_{\mathrm{ad}}^* \ge0.251431736761034
K=7K=7 separationΔ2,7≥0.009331806832908\Delta_{2,7} \ge0.009331806832908
K=4K=4 receiver riskU4≤0.249065686566581U_4 \le0.249065686566581
K=4K=4 separationΔ2,4≥0.002366050194452\Delta_{2,4} \ge0.002366050194452
Collective optimum[0.242099896126073,0.242099929928125][0.242099896126073, 0.242099929928125]
Adaptive strategy riskUad≤0.256727930428793U_{\mathrm{ad}} \le0.256727930428793

Table VIII. Outward-safe two-round bounds for the analytic benchmark.

Block-coordinate optimization therefore supplies candidate receivers but does not establish their global optimality. Feasibility and outward-safe risk bounds for the receivers used in the certified results are obtained independently by the procedure of Appendix § 1.3.4. The reproducibility archive records the initialization rules, block order, stopping tolerance, completed starts, solver versions, and feasibility residuals for the reported memory sweep.

Clocked quantum-reservoir pilot

We compare homogeneous and clocked reservoir constructions on the W=3W=3 pilot benchmark with reservoir memory dimension m=4m=4, where mm is the dimension of the persistent reservoir register carried between rounds. The clocked and parameter-matched homogeneous families were compared over thirty seeds, grouped into ten matched best-of-three trials. Clocking gave lower error in 29 of 30 raw seed comparisons and in 10 of 10 grouped trials, with a mean difference of 0.00200414101285111 in absolute error, that is 0.200414101285111 percentage points. Because the comparison was not designed as a prespecified inferential study, we report these results

QuantityReported result
Raw seed comparisons29/30 clocked wins
Grouped best-of-three trials10/10 clocked wins
Mean error reduction0.200414101285111 percentage points

Table X. Descriptive clocked-reservoir comparison. No inferential interval is reported.

descriptively. Within this guided comparison, the clocked family gives lower error than the matched homogeneous family. Because the clocked maps were informed by the optimized coherent receiver, we treat this comparison as exploratory. The per-seed results and the grouping rule are included in the archive; the original training source and checkpoints are not.

Hardware-noise sensitivity

The modeled round duration is

τround=(5.75+0.05+0.02) μs=5.82 μs,(83)\tau_{\mathrm{round}}=(5.75+0.05+0.02)\,\mu\mathrm{s}=5.82\,\mu\mathrm{s}, \tag*{(83)}

combining a separately simulated pulse duration with assumed memory-interaction and inter-round gap times. All three components are modeling assumptions rather than measurements of the receiver studied here. The three crossings in Figure 6 were located by Brent root finding in log⁡T2\log T_2, with an unreconstructed joint POVM reoptimized at each trial point.

For context, superconducting microwave-cavity memories have demonstrated long-lived storage [33], tantalum transmons have exceeded 0.3 ms0.3\,\mathrm{ms} under dynamical decoupling [34], and a single-photon cavity qubit reached T2c=34±1 msT_2^c=34\pm1\,\mathrm{ms} [35]. Separate experiments have demonstrated 140 ns140\,\mathrm{ns} superconducting-qubit readout [36] and a 2.64 μs2.64\,\mu\mathrm{s} measurement-to-conditional-pulse sequence [31]. These records were not achieved together as a coherent sequential receiver, and the 140 ns140\,\mathrm{ns} result characterizes a fast measurement step rather than coherent capture, storage, and reinteraction. Because maximum latency depends on whether pulse integration, control, and memory interaction overlap, we report lifetime values rather than a single architecture-independent latency ceiling.

DepthLongest storage time t1t_1λ⋆\lambda_\starT2,⋆T_{2,\star}
W=2W=28.46 μs8.46\,\mu\mathrm{s}0.967978260 μs260\,\mu\mathrm{s}
W=3W=314.28 μs14.28\,\mu\mathrm{s}0.981577768 μs768\,\mu\mathrm{s}
W=4W=420.10 μs20.10\,\mu\mathrm{s}0.9924632.66 ms2.66\,\mathrm{ms}

Table XI. Stored-pulse slow-schedule crossing values. The values are model-dependent and do not represent integrated-receiver performance.

Equation (55) models phase retention, whereas amplitude damping is controlled separately by Equation (57). Under a Markovian decomposition, Equation (58) separates the pure-dephasing time TϕT_\phi from the amplitude-relaxation time T1T_1. This calculation includes phase retention only; it is not a complete device-noise model. A multilevel memory also requires a specified encoding and decay law for its off-diagonal matrix elements; the cited qubit coherence times alone do not determine those rates. A device-level assessment would vary T1T_1 and TϕT_\phi independently and propagate timing and control uncertainties.

Flagged direct-sum inheritance criterion

A certified base-sector separation can be inherited by a larger block-diagonal decision problem under the following conditions.

Proposition 5 (Locally flagged inheritance). Let an orthogonal classical flag be accessible to both receiver classes before any operation whose choice depends on that flag. Assume the enlarged receiver classes admit the causal embedding of the base-sector strategies, and that restriction of an enlarged adaptive strategy to the base sector is an allowed base adaptive strategy. Let its register FF belong wholly to one local temporal tensor factor, and require that no partial transpose used by the certificate splits FF from that factor. In the fixed flag basis define the pinching map

PF(X):=∑f(∣f⟩⟨f∣F⊗I)X(∣f⟩⟨f∣F⊗I).(84)\mathcal{P}_F(X):=\sum_f (\lvert f\rangle\langle f\rvert_F\otimes I)X(\lvert f\rangle\langle f\rvert_F\otimes I). \tag*{(84)}

Suppose the enlarged cost operators are block diagonal,

C^a=qCa(0)⊕(1−q)D,0<q≤1,(85)\widehat{C}_a=qC_a^{(0)}\oplus(1-q)D,\qquad0<q\le1, \tag*{(85)}

where DD is independent of the action. If the base sector has an adaptive lower bound LadL_{\mathrm{ad}}, a fixed receiver McohM^{\mathrm{coh}} with explicit risk r(Mcoh;C(0))r(M^{\mathrm{coh}};C^{(0)}), and certified gap δ=Lad−r(Mcoh;C(0))>0\delta=L_{\mathrm{ad}}-r(M^{\mathrm{coh}};C^{(0)})>0, then the enlarged problem has the explicit-versus-certified separation

Δ^cert≥qδ.(86)\widehat{\Delta}_{\mathrm{cert}}\ge q\delta. \tag*{(86)}

If the conditional base-sector costs are perturbed by ΔCa\Delta C_a, the right-hand side becomes q[δ−2ϵ∗]q[\delta-2\epsilon_*], with ϵ∗\epsilon_* from Equation (23).

Proof. Pinching a feasible POVM in the orthogonal flag basis preserves positivity, completeness, and the block-diagonal objective. Since the flag belongs to one temporal factor and its projectors are diagonal in the transpose basis, for every certified cut SS,

PF∘TS=TS∘PF.(87)\mathcal{P}_F\circ\mathcal{T}_S=\mathcal{T}_S\circ\mathcal{P}_F. \tag*{(87)}

Thus pinching also preserves the PPT relaxation and permits sectorwise analysis. The lower bound for the adaptive class uses a separate assumption: restricting an enlarged adaptive protocol to the base sector must give an allowed base-sector adaptive protocol. Its conditional risk is therefore at least LadL_{\mathrm{ad}}. Conversely, the causal-embedding assumption lets the coherent receiver use McohM^{\mathrm{coh}} on the base sector. In the other sector, the action-independent cost gives ∑aTr⁡(DMa)=Tr⁡D\sum_a\operatorname{Tr}(DM_a)=\operatorname{Tr}D, irrespective of the receiver. This common contribution cancels, leaving a gap of at least q[Lad−r(Mcoh;C(0))]q[L_{\mathrm{ad}}-r(M^{\mathrm{coh}};C^{(0)})]. The perturbed statement follows by applying Proposition 3 to the base-sector costs.

The same reasoning applies when the complementary sector is not action-independent only if a nonnegative explicit-versus-certified contribution is established there separately. The inheritance therefore requires the flag, cost decomposition, and relaxation to respect the same direct-sum structure. For a family indexed by code distance dcoded_{\mathrm{code}}, a uniform inherited floor would require both qdcode≥q0>0q_{d_{\mathrm{code}}}\ge q_0>0 and ϵ∗,dcode≤ϵ0<δ/2\epsilon_{*,d_{\mathrm{code}}}\le\epsilon_0<\delta/2, giving

Δ^cert,dcode≥q0(δ−2ϵ0)>0.(88)\widehat{\Delta}_{\mathrm{cert},d_{\mathrm{code}}}\ge q_0(\delta-2\epsilon_0)>0. \tag*{(88)}

Neither condition has been established for a natural surface-code family; in particular, the probability of a chosen sector may vanish with distance. Thus the proposition is conditional and does not establish scaling for a natural surface-code family.

Acknowledgments

This work was authored in part by the National Laboratory of the Rockies (NLR) for the U.S. Department of Energy (DOE), operated under Contract No. DE-AC36-08GO28308. Funding for the NLR authors provided by the Modeling, Simulation, Optimization Capability for Grid Modernization, Energy Systems Integration, Mobility Electrification (MSOC 4 GEM) at the National Laboratory of the Rockies. The views expressed in the article do not necessarily represent the views of the DOE or the U.S. Government. The U.S. Government retains and the publisher, by accepting the article for publication, acknowledges that the U.S. Government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this work, or allow others to do so, for U.S. Government purposes.

Grammarly was used for grammar checking during the preparation of this manuscript. The authors reviewed and edited the suggested changes and take full responsibility for the final content.

References

References

  1. [1]C. A. Pattison, M. E. Beverland, M. P. da Silva, and N. Delfosse, Improved quantum error correction using soft information (2021), arXiv:2107.13589 [quant-ph].arxiv.org/abs/2107.13589
  2. [2]H. Ali, J. Marques, O. Crawford, J. Majaniemi, M. Serra-Peralta, D. Byfield, B. M. Varbanov, B. M. Terhal, L. Di-Carlo, and E. T. Campbell, Physical Review Applied 22, 044031 (2024).
  3. [3]M. D. Hanisch, B. Hétènyi, and J. R. Wootton, APS Open Science 1, 000019 (2026).
  4. [4]J. Kerckhoff, H. I. Nurdin, D. S. Pavlichin, and H. Mabuchi, Physical Review Letters 105, 045002 (2010), arXiv:0907.0236.
  5. [5]D. Crow, R. J. Joynt, and M. Saffman, Physical Review Letters 117, 130503 (2016).
  6. [6]F. Butt, D. F. Locher, K. Brechtelsbauer, H. P. Büchler, and M. Müller, Science Advances 11, eadv2590 (2025), arXiv:2410.13568.
  7. [7]F. Butt, I. Pogorelov, R. Freund, A. Steiner, M. Meyer, T. Monz, and M. Müller, Nature Communications 17, 995 (2026).
  8. [8]K. Brechtelsbauer, F. Butt, D. F. Locher, S. Higuera Quintero, S. Weber, M. Müller, and H. P. Büchler, PRX Quantum 6, 040349 (2025), arXiv:2505.15669.
  9. [9]A. Tanggara, M. Gu, and K. Bharti, Strategic code: A unified spatio-temporal framework for quantum error-correction (2024), arXiv:2405.17567 [quant-ph].arxiv.org/abs/2405.17567
  10. [10]C. W. Helstrom, Quantum Detection and Estimation Theory (Academic Press, New York, 1976).
  11. [11]H. P. Yuen, R. S. Kennedy, and M. Lax, IEEE Transactions on Information Theory 21, 125 (1975).
  12. [12]J. Watrous, The Theory of Quantum Information (Cambridge University Press, 2018).DOI
  13. [13]W. Matthews, S. Wehner, and A. Winter, Communications in Mathematical Physics 291, 813 (2009), arXiv:0810.2327.
  14. [14]A. Peres, Physical Review Letters 77, 1413 (1996).
  15. [15]M. Horodecki, P. Horodecki, and R. Horodecki, Physics Letters A 223, 1 (1996).
  16. [16]A. Cosentino, Physical Review A 87, 012321 (2013), arXiv:1205.1031.
  17. [17]M. Horodecki, P. W. Shor, and M. B. Ruskai, Reviews in Mathematical Physics 15, 629 (2003), arXiv:quant-ph/0302031.
  18. [18]D. Rosset, F. Buscemi, and Y.-C. Liang, Physical Review X 8, 023033 (2018).
  19. [19]L. B. Vieira, H.-Y. Ku, and C. Budroni, Physical Review Research 7, 043281 (2025).
  20. [20]S. Guha, Physical Review Letters 106, 240502 (2011).
  21. [21]S. M. Barnett and S. Croke, Advances in Optics and Photonics 1, 238 (2009).
  22. [22]R. Blume-Kohout, S. Croke, and M. Zwolak, Ideal state discrimination with an O(1)-qubit quantum computer (2012), arXiv:1201.6625 [quant-ph].
  23. [23]A. Klimek, M. Jachura, W. Wasilewski, and K. Banaszek, Journal of Modern Optics 63, 2074 (2016).
  24. [24]F. Verstraete, J. J. García-Ripoll, and J. I. Cirac, Physical Review Letters 93, 207204 (2004), arXiv:cond-mat/0406426.
  25. [25]U. Schollwöck, Annals of Physics 326, 96 (2011), arXiv:1008.3477.
  26. [26]K. Fujii and K. Nakajima, Physical Review Applied 8, 024030 (2017).
  27. [27]G. Tanaka, T. Yamane, J. B. Héroux, R. Nakane, N. Kanazawa, S. Takeda, H. Numata, D. Nakano, and A. Hirose, Neural Networks 115, 100 (2019).
  28. [28]A. Blais, A. L. Grimsmo, S. M. Girvin, and A. Wallraff, Reviews of Modern Physics 93, 025005 (2021).
  29. [29]F. A. Pollock, C. Rodríguez-Rosario, T. Frauenheim, M. Paternostro, and K. Modi, Physical Review A 97, 012127 (2018).
  30. [30]G. White, Nature Reviews Physics 4, 287 (2022).
  31. [31]D. Ristè, C. C. Bultink, K. W. Lehnert, and L. DiCarlo, Physical Review Letters 109, 240502 (2012).
  32. [32]M. A. Ballester, S. Wehner, and A. Winter, IEEE Transactions on Information Theory 54, 4183 (2008), arXiv:quant-ph/0608014.
  33. [33]M. Reagor, W. Pfaff, C. Axline, R. W. Heeres, N. Ofek, K. Sliwa, E. Holland, C. Wang, J. Blumoff, K. Chou, M. J. Hatridge, L. Frunzio, M. H. Devoret, L. Jiang, and R. J. Schoelkopf, Physical Review B 94, 014506 (2016), arXiv:1508.05882.
  34. [34]A. P. M. Place, L. V. H. Rodgers, P. Mundada, B. M. Smitham, M. Fitzpatrick, Z. Leng, A. Premkumar, J. Bryon, A. Vrajitoarea, S. Sussman, G. Cheng, T. Madhavan, H. K. Babla, B. Jäck, A. Gyenis, N. Yao, R. J. Cava, N. P. de Leon, and A. A. Houck, Nature Communications 12, 1779 (2021), arXiv:2003.00024.
  35. [35]O. Milul, B. Guttel, U. Goldblatt, S. Hazanov, L. M. Joshi, D. Chausovsky, N. Kahn, E. Çiftüyürek, F. Lafont, and S. Rosenblum, PRX Quantum 4, 030336 (2023), arXiv:2302.06442.
  36. [36]E. Jeffrey, D. Sank, J. Y. Mutus, T. C. White, J. Kelly, R. Barends, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, A. Megrant, P. J. J. O’Malley, C. Neill, P. Roushan, A. Vainsencher, J. Wenner, A. N. Cleland, and J. M. Martinis, Physical Review Letters 112, 190504 (2014), arXiv:1401.0257.

Paper details

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

views · 11

downloads · 0

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

  • Physics and Astronomy

Grammarly

View statement
Looking for related papers…
Contents