# Quantum v4.38 — Chronological scheduled noisy repeaters Local candidate on `acb520f3ad5e4a101b9f985a98ce450b642f0954` (v4.37), branch `quantum-scheduled-noisy-v438`. The base is a verified local candidate; the separately published main baseline remains `a42c09d7` (v4.21–v4.36). This candidate is not a published release. [Source](../Verification/QuantumScheduledNoisyRepeater.lean) · [Knowledge card](../knowledge/quantum-physics/QuantumScheduledNoisyRepeater.en.md) · [Inventory](quantum-v4.38-inventory.json) ## Operators and chronology noisyGeneralTree extends the v4.37 tree to arbitrary PairDensity matrices. Its scalar degree is 2^m. Each spatial level first applies the actual ideal pairSwap to two independent child resources, then a depth-m noisy BBPSSW tree. The level's scalar degree is B(m)=2^(m+1). The same fixed physical Visibility parameter gamma post-depolarizes the retained pair at every internal BBPSSW node; swapping itself remains ideal. Zero purification depth applies no depolarization. The chronological list is evaluated with List.foldl. The accumulator explicitly stores matrix, weight and bounded visibility. scheduledStepAcc computes the matrix through the actual operators and independently updates the scalar fields. The proved ScheduledState.Valid invariant binds them: D=p*isotropic(w), 0