Quantum recovery from finitely many sharp questions

Seth Douglas

Published Sep 16, 2026• 0 citations

Abstract

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.

DOI: 10.5281/zenodo.22779670

Related papers

Bath dimension and initial entropy for closed repeated use of a quantum channel

Seth Douglas

Preprint by Seth Douglas (seth.douglas@gmail.com) on the dimension and actual initial-entropy rate region of a closed device serving repeated uses of one fixed quantum channel against adaptive inputs. Includes the complete manuscript, appendices and reproducibility materials. Scoped licenses: the manuscript, appendices, 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: a finite quantum closing identity and six arithmetic lemmas, not the full entropy or asymptotic theorem. AI assistance is disclosed in the manuscript. No efficient circuit synthesis or AK resolution is claimed.

Sep 16, 20260 citations

Quantum error-correcting subsystems are unitarily recoverable subsystems (7 pages)

David W. Kribs, Robert W. Spekkens

Physical Review AJan 1, 20061 citation

Closed Mixed-Apparatus Compression of Schur Channels: Exact-Approximate Separation and Scheduled Delivery

Seth Douglas

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.

Sep 16, 20260 citations

Two-reservoir model of quantum error correction (10 pages)

Julio R. Gea-Banacloche, James Clemens

Physical Review AJan 1, 20060 citations

Operational quantum reconstruction, Feynman rules, composition algebras, and beyond

Jens Köplinger

Sep 10, 20260 citations

Certified recovery of trace-determinant structure under low-dimensional corruption

Daniel Eric Fredriksen

First preprint and reproducibility companion for bounded exact recovery of a nonzero trace-determinant tensor over an unknown binary extension field under corruption supported on a small common covector space. Includes the manuscript PDF and source, complete prose proofs, executable recovery and independent certificate checks, pinned partial Lean proofs, validation receipts, and three AI-model review reports with feedback dispositions. For s >= 2R+5, at most 8*2^(4R)*h trials return a verified compatible representation with probability at least 1-2^(-h). Accepted outputs are checked exactly; unique identification of a planted field is not claimed. The cubic-only bound does not establish the broader quantum application or a BPP/BQP result. Lean verification is partial. The complete recovery theorem, its probability and resource bounds, and the Python implementation are not fully formally verified. The reviews are AI-assisted internal reviews, not independent human peer review. Licenses: manuscript text and PDF are CC-BY-4.0; software and Lean sources are Apache-2.0. See LICENSE, LICENSES/CC-BY-4.0.txt and PROVENANCE.md. The package-level Other (Open) designation preserves these per-component licenses.

Oct 28, 20260 citations