Preprint by Seth Douglas (seth.douglas@gmail.com). A finite closed mixed-apparatus construction approximates any Schur channel of Gram rank k in half-diamond distance using a physical apparatus of dimension of order epsilon^-2 (sqrt(k) + ln d), with a maximally mixed initializer of rank of order sqrt(k). A universal entropy converse 2Q - P >= S(J) and an exact extreme-channel cost P, Q >= log2 k give, for a known extreme rank-two ququart Schur channel, a matched leading-order exact-versus-vanishing-error separation: exact service needs P = Q = T, while error T^-4 admits Q = T/2 + O(log T) and P = O(log T). A separately scoped scheduled-delivery theorem compares sublogarithmic and superlogarithmic delay under mandatory arrivals, a common release schedule and observation-only stopping. Includes the complete manuscript, TeX source, reproducibility scripts and partial Lean coverage. Scoped licenses: the manuscript, PDF and TeX are licensed under Creative Commons Attribution 4.0 International (CC-BY-4.0). Original code and accompanying software documentation are MIT-licensed. These are separate file-specific licenses, not a choice of license for every file. See LICENSE.md and LICENSES/ in the archive. The aggregate Other (Open) category represents this mixed-license package. Lean coverage is partial: fourteen scoped dependency closures, not the headline analytic theorems. The construction is a probabilistic existence proof; no efficient compiler, arbitrary-channel upper bound, caller-paced delivery guarantee or sharp logarithmic-delay frontier is claimed. AI assistance is disclosed in the manuscript. This is a separate sequel to the closed repeated-use memory paper, DOI 10.5281/zenodo.22779673.
Preprint by Seth Douglas (seth.douglas@gmail.com). A finite closed mixed-apparatus construction approximates any Schur channel of Gram rank k in half-diamond distance using a physical apparatus of dimension of order epsilon^-2 (sqrt(k) + ln d), with a maximally mixed initializer of rank of order sqrt(k). A universal entropy converse 2Q - P >= S(J) and an exact extreme-channel cost P, Q >= log2 k give, for a known extreme rank-two ququart Schur channel, a matched leading-order exact-versus-vanishing-error separation: exact service needs P = Q = T, while error T^-4 admits Q = T/2 + O(log T) and P = O(log T). A separately scoped scheduled-delivery theorem compares sublogarithmic and superlogarithmic delay under mandatory arrivals, a common release schedule and observation-only stopping. Includes the complete manuscript, TeX source, reproducibility scripts and partial Lean coverage. Scoped licenses: the manuscript, PDF and TeX are licensed under Creative Commons Attribution 4.0 International (CC-BY-4.0). Original code and accompanying software documentation are MIT-licensed. These are separate file-specific licenses, not a choice of license for every file. See LICENSE.md and LICENSES/ in the archive. The aggregate Other (Open) category represents this mixed-license package. Lean coverage is partial: fourteen scoped dependency closures, not the headline analytic theorems. The construction is a probabilistic existence proof; no efficient compiler, arbitrary-channel upper bound, caller-paced delivery guarantee or sharp logarithmic-delay frontier is claimed. AI assistance is disclosed in the manuscript. This is a separate sequel to the closed repeated-use memory paper, DOI 10.5281/zenodo.22779673.
Preprint by Seth Douglas (seth.douglas@gmail.com) on quantitative recovery from finitely many calibrated sharp binary observables, with complete Appendix A and reproducibility materials. Scoped licenses: the manuscript, PDF and TeX are licensed under Creative Commons Attribution 4.0 International (CC-BY-4.0). Original code and accompanying software documentation are MIT-licensed. These are separate file-specific licenses, not a choice of license for every file. See LICENSE.md and LICENSES/ in the archive. The aggregate Other (Open) category represents this mixed-license package. Lean coverage is partial: calibrated projections imply finite-word operator-norm stability; no numbered recovery theorem is fully formalized. Language models assisted exploration and checking; the author retains responsibility for the claims.
Lụneï ∿ Oryun presents an exact characterization of optimal deterministic recovery for every finite-dimensional complex Schur channel, together with constructive decoders, matching converse bounds, and structural results for quantum erasure-correcting subspaces. The release includes an 18-page mathematical manuscript, editable LaTeX source, four numerical verification programs, recorded computational results, and reproducibility materials. The central result identifies the smallest achievable diamond-norm recovery error and the largest achievable worst-case entanglement fidelity through a single semidefinite optimization. One explicitly constructed recovery channel attains both optima. A common adversarial input proves optimality against every deterministic completely positive trace-preserving recovery, including recoveries outside the Schur and unitary classes. PureOne/LUNEI-Complex-Schur-Recovery · Datasets at Hugging Face The work also develops sharp code-repair bounds, an analytic separation between general recovery and mixed-unitary correction, and an obstruction to completing approximately maximum-dimension codes. Exact optimal recovery for arbitrary complex Schur channels Let (C) be a complex positive semidefinite matrix with unit diagonal. Its associated Schur channel acts by entrywise multiplication: [\mathcal M_C(X)=C\circ X.] Choose unit Gram vectors (c_i\in\mathbb C^r), where (r=\operatorname{rank}C), satisfying (c_i^\dagger c_j=C_{ij}). Define \min_{q\in\Delta}\lambda_{\max}!\left(\sum_iq_i c_ic_i^\dagger\right),] where (\Delta) is the probability simplex. The manuscript proves the operational identities [\inf_{\mathcal R}\left|\mathcal R\circ\mathcal M_C-\mathrm{id}\right|_\diamond=2[1-v(C)]] and [\sup_{\mathcal R}\inf_\rhoF_e!\left(\rho,\mathcal R\circ\mathcal M_C\right)=v(C).] Both optimizations range over all deterministic completely positive trace-preserving recovery channels on the fixed logical space. The diamond norm is unhalved, and entanglement fidelity uses the squared-overlap convention. These identities characterize optimal approximate recovery; perfect recovery occurs when (v(C)=1). The optimization uses an (r\times r) density matrix, or an equivalent spectral minimization over classical probabilities. This replaces an unrestricted search over recovery channels with a smaller problem on the Gram span. Constructive decoder and universal optimality witness An optimal density matrix (\sigma) determines a recovery correlation matrix explicitly. Writing [M_{ij}=c_i^\dagger\sigma c_j,\qquad f_i=M_{ii},] the construction is \frac{v(C)\overline{M_{ij}}}{f_if_j}+\delta_{ij}\left(1-\frac{v(C)}{f_i}\right).] The resulting Schur recovery (\mathcal M_A) attains both operational optima. Its recovered channel satisfies [C\circ A\succeq v(C)J,] where (J) is the all-ones matrix. This yields a convex decomposition containing an identity-channel component of weight (v(C)). The decomposition describes the deterministic channel; it does not assert an experimentally heralded successful branch. A dual-optimal probability distribution supplies a single reference-entangled input witnessing the converse bound against every competing recovery. Feasible primal and dual solutions also provide quantitative bounds on the optimal value and achievable recovery error. Connection to established semidefinite packing theory For the rank-one projectors (P_i=c_ic_i^\dagger), the reciprocal (1/v(C)) equals the established classical–quantum semidefinite packing number. The manuscript credits the packing framework studied by Duan and Winter rather than claiming the parameter as a new construction. The proposed contribution is its precise deterministic recovery interpretation: 2\left(1-\frac{1}{\mathsf A(P)}\right),\qquadF_{\mathrm{opt}}=\frac{1}{\mathsf A(P)},] together with the explicit common optimal decoder and universal adversarial witness. This interpretation concerns ordinary deterministic recovery and does not require a no-signalling assistance resource. Further operational and structural results Tensor-product recovery. The value obeys [ v(C\otimes E)=v(C)v(E). ] Product optimal decoders therefore attain the optimum against arbitrary collective recovery on the fixed tensor-product logical input space. This statement does not optimize additional redundant encodings across channel uses. Strict advantage over mixed-unitary correction. An explicitly solved tetrahedral tight-frame family exhibits a recovery channel that strictly outperforms every mixed-unitary recovery. For the four-dimensional family (C_t=(1-t)I+tG), the exact values are [ v(C_t)=\frac{1+t}{4}, \qquad D_{\mathrm{opt}}=\frac{3-t}{2}. ] The strict separation holds for (t>0). A convex quadratic subclass. For real entrywise nonnegative correlation matrices, [ v(C)=\min_{q\in\Delta}q^{T}Cq, ] and identity recovery is optimal. The general complex theorem covers phases for which this simpler conclusion fails. 1- \frac{ \sqrt{(1+a)(1+b)} + \sqrt{(1-a)(1-b)} }{2}. ] A sharp consequence is [ D_{\mathrm{opt}}\le1-\sqrt{1-\varepsilon^2} ] when the compression has operator norm at most (\varepsilon). Complete classification at maximum dimension. For complement-invariant binary supports of size (2K\ge4) and minimum Hamming distance at least two, every dimension-(K) code correcting any one known-coordinate erasure is classified by phase-weighted complementary pairs. Sharp constructive repair. Every rank-(K) trial projector on such a support admits an explicitly constructed closest exact code. Its squared Frobenius distance is bounded by the centered local compression defect divided by the support’s minimum Hamming distance. The uniform coefficient is globally sharp. Operator-norm repair. In the full central excitation sector, a complementary stability theorem controls the distance to an exact maximum-dimension code using local operator-norm defects. Its coefficient depends on physical blocklength rather than logical dimension. Failure of uniform near-capacity completion. A family of exactly erasure-correcting codes approaches the maximum dimension ratio while remaining far from every maximum-dimension code within the specified support. This establishes a limitation on extending the rank-half rigidity theorem to smaller ranks. Computational verification and release contents The accompanying programs record 157 case-level checks: 47 rigidity cases, 50 real minimax-recovery cases, 17 structural-extension cases, and 43 complex-recovery cases. Coverage includes explicit decoders, independent semidefinite formulations, primal–dual comparisons, tensor products, tight-frame examples, sharpness witnesses, and noncompletion constructions. The release contains the manuscript and source, verification scripts, full JSON reports, a consolidated verification table, dependency specifications, citation metadata, and integrity checksums. The prepared repository also provides a runner that preserves the recorded results while writing regenerated reports separately. These computations supplement the analytic proofs. They are finite floating-point checks rather than formal verification or interval-arithmetic certificates. Solver statuses and numerical residuals are retained in the reports. Research status and scope The proposed novelty concerns the precise operational equivalence, constructive optimal recovery, mixed-unitary separation, and stated structural theorems. Established packing parameters, packing multiplicativity, complement-pair constructions, and recovery methods are credited in the manuscript. Worldwide priority remains unconfirmed. The principal recovery theorem applies to finite-dimensional Schur channels on a fixed logical space. The erasure and rigidity results require their stated support and rank assumptions. The release makes no claim of solving unrestricted quantum recovery or demonstrating a physical fault-tolerant device. Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki. Version: Consolidated edition 3, 2 November 2026.
How much memory does it take to apply the same quantum channel many times, when each output must be released before the next input arrives and every retained qubit counts? One-use invariants do not decide it. Two explicit channels on dimension 1664 have identical normalized Choi spectra (32 eigenvalues 1/32), the same maximal complementary entropy 5, and zero asymptotic purity cost. At the same optimal exchange rate, one is implemented exactly with five memory qubits for any number of uses, while the other needs Omega(n^(1/(2 log_2(107)+2))) memory qubits for n uses, at every fixed error at most 1/16 and whatever purity is available; memory O(n^(1/3) log^(4/3) n) suffices for it. The hard channel is built from Houghton's group H_3. Behind the example is a general theory: the achievable exchange and purity rates, the purity cost kappa, which vanishes exactly on the closure of finite tracial factorizations, and memory bounds from how well a channel's environment is approximated by finite ones, and, for channels built from finite presentations, from the approximation profile of the group. Version 1.1 adds where the expensive channels lie: on the relative boundary of the closure; any fixed depolarizing admixture brings them down to polylogarithmic memory at the rank rate; on a face containing the Houghton channel a single moment of a trace on the group decides expense; and one free fermion per site already forces polynomial memory. Version 1.1.1 adds a map of what the main separation depends on (published inputs, companion results and new arguments), sets finite-budget and asymptotic-rate statements side by side, cites the companion papers at their published versions, pins the tested software versions, and makes every check refuse to run under optimized Python. The mathematical results are unchanged. Version 1.1.2 corrects attributions and makes two headline statements precise. The separation of Theorem A is stated at the exchange budget 5n/2, and the channels that need polynomial memory at every exchange rate are those with purity limited to O(log n). Credits added or corrected: Bisio, D'Ariano, Perinotti and Chiribella, and Bisio, D'Ariano, Perinotti and Sedlak; Boes et al. for the square-root dephasing construction; Lie, Son, Boes, Ng and Wilming for the exact case of the tracialization lemma; Faist, Berta and Brandao for the relation to the thermodynamic capacity; Haagerup, Musat and Rordam for the moment criteria; Thoma, Johnson, Watrous, Horodecki-Oppenheim-Winter and Lie-Jeong; Cornulier for the Baumslag-Solitar bound. Known results are moved out of numbered statements. The mathematical results and the numbering are unchanged. All operational bounds use complete-experiment error against adaptive observers with quantum references. The general rate-region achievability result uses a cited closed-device theorem; the explicit separation does not. This preprint archive includes the PDF, TeX source, finite verification scripts, and scoped Lean arithmetic proofs. The artifacts do not formally verify the entire manuscript; their scope and external dependencies are documented in verification/README.md.
How much memory does a device need to apply one quantum channel n times, if each output must leave before the next input arrives? The paper counts the qubits the device keeps, the qubits it exchanges for fresh ones, and the purity it is given, with error measured on the whole experiment against an adaptive observer. Immediate release has a price. For the qutrit Werner-Holevo channel, vanishing error requires log2 3 bits of purity per use, a known rate; the paper adds a bound at finite error. If all outputs may leave together, O(log n) bits suffice in total at polynomially small error, refining a known zero rate. At error n^-2 the change comes when outputs wait in batches of about log n, and the zero supplied-purity-rate side holds for every unital channel. Purity separates cheap from expensive repeated use along one set of channels, the closure of those that a finite, maximally mixed bath implements exactly: outside it, linear purity is known to be needed at small error, hence linear memory when fresh qubits are maximally mixed. The paper proves a converse for memory, keeping maximally mixed fresh qubits and the optimal exchange rate: a channel in the closure with a flat probe (an input that leaves the minimal environment maximally mixed) can be served with sublinear memory at any error that is not exponentially small. For channels built from finitely many group relations, memory at fixed error is at most logarithmic, divergent but sublinear, or linear, and some are linear exactly when some finitely presented group is not hyperlinear. Along the way, Rybar and Ziman's question on repeating a channel without resets is answered. At high precision, the memory of n uses of such a channel equals, up to squared logarithms, the cost of the best single use that never leaves the channel's support. That cost is the bath entropy plus n times the entropy one use adds to the bath. For Houghton's group, devices acting through the group need and attain memory n^(1/3) up to logarithmic factors. Whether the single-use law holds at fixed error is open. This archive includes the paper, its LaTeX source and the finite numerical checks; they support but do not replace the proofs.
A device that applies a quantum channel over and over must release each output before the next input arrives. How much memory does it need? Suppose every fresh qubit the device receives is maximally mixed. In companion work we showed that the answer then turns on one set: the channels that a unitary with a finite, maximally mixed bath implements, exactly or in the limit. A channel in this set with a flat probe, an input that leaves its environment maximally mixed, can be served with sublinear memory. A channel outside the set needs linear memory at small error, however many qubits the device exchanges. No algorithm can decide on which side of this line a channel lies. A computable map sends each program to an explicit Schur channel with Gaussian-rational entries. If the program halts, logarithmic memory suffices; if it runs forever, linear memory is needed at an error computed from the program. The same line recasts Connes' embedding problem. It has a positive answer exactly when every factorizable channel with a flat probe can be served with sublinear memory; Schur channels already suffice. Just past the line, the cost switches on at the statistical scale. Take the qutrit Werner-Holevo family at distance h/sqrt(n) beyond its boundary point. Independent uses of the boundary channel imitate it with error tending to 2 Phi(h/(2 sigma)) - 1, where Phi is the standard normal distribution function and sigma = 5 sqrt(2)/27. We prove that no device drawing on purity that grows more slowly than sqrt(n) does better, whatever its memory. This archive includes the paper, its LaTeX source, an exact certificate and the finite numerical checks; they support but do not replace the proofs.
This work establishes the exact, unhalved diamond-norm distance between a qubit generalized-amplitude-damping (GAD) channel Φₚ,ᵣ and its stationary-replacement channel Rₚ(X) = Tr(X) diag(1 − p, p). For stationary excited-state population 0 ≤ p ≤ 1 and coherence-amplitude factor 0 ≤ r ≤ 1, the closed-form result is ‖Φₚ,ᵣ − Rₚ‖⋄ = 2r[1 − p(1 − p)r²]/(2 − r). The result accounts for arbitrary finite-dimensional ancillas and arbitrary complex input matrices, rather than only unentangled states or density operators; a two-dimensional ancilla attains the optimum. The derivation includes the boundary cases r = 0 and r = 1 and the extreme stationary populations p = 0 and p = 1, without limiting arguments. The equality is supported by two explicit analytic certificates. A constructed three-Kraus completely positive, trace-preserving map Λₚ,ᵣ gives the factorization Φₚ,ᵣ − Rₚ = (δ/2)(id − Λₚ,ᵣ), where δ is the exact distance above. Trace-norm contractivity supplies a universal upper bound, while the normalized Schmidt state √(v/h)|00⟩ + √(u/h)|11⟩, with h = 2 − r, u = 1 − pr and v = 1 − (1 − p)r, saturates it through perfect discrimination of id from Λₚ,ᵣ. Independently, an explicit 4 × 4 semidefinite-programming dual witness satisfies Z ± J ⪰ 0 and Trₒᵤₜ(Z) = δI₂, reproducing the same upper bound without numerical optimization. A consolidated Lean 4 formalization of the physical four-Kraus channel and its finite-ancilla norm equality is accompanied by an author-reported successful kernel compilation, source hashes, and a replay protocol; the manuscript explicitly distinguishes this record from an independent rerun, which was not performed during assembly. The SDP certificate and the independent multi-qubit corollaries are analytic results, not separately claimed as kernel-checked. For independent channels, these corollaries bound the product-to-equilibrium distance between maxₖ δₖ and min{2, Σₖ δₖ}, and yield the asymptotic decay exponent minₖ γₖ when rₖ(t) = exp(−γₖt). The exact single-use discrimination error for equal prior probabilities is Pₑᵣᵣ = 1/2 − δ/4. Together, these results provide analytic and formally reproducible benchmarks for finite-temperature quantum noise and mixing, without asserting optimal multi-qubit discrimination strategies or experimental performance.