Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum recovery from finitely many sharp questions

Seth Douglas

Published Sep 16, 2026• 0 citations
Publisher

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

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, 2026•1 citation

A concrete procedure for obtaining sharp reconstructions of unsharp observables in finite-dimensional quantum mechanics

Gianpiero Cattaneo, Tiziana Marsico, Giuseppe Nisticò +1 more

Foundations of Physics•Oct 1, 1997•7 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, 2026•0 citations

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

Jens Köplinger

•Sep 10, 2026•0 citations

The entanglement cost of the antisymmetric state is one ebit: Sharp purity bounds for tensor products of antisymmetric pairs

Matthew Liston

This preprint proves a sharp purity bound for arbitrary complex pure states in tensor products of antisymmetric pair spaces, across the physical cut consisting of the first system from each pair versus the second system from each pair. For every finite number m of pairs and local dimensions at least two, purity is at most 2^(-m) and entanglement entropy is at least m bits, with equality characterized by products of normalized decomposable two-forms. It derives entanglement of formation m for m copies of the normalized antisymmetric state and, using the published regularization theorem, entanglement cost one ebit for every local dimension at least two. The archive provides original formal sources and a precise account of their scope; it does not claim a complete Lean translation of every ordinary LOCC execution. Research directed and curated by Matthew Liston. The mathematics, proofs, formalization and manuscript preparation substantially involve AI systems; paper-specific attribution and checking limits are disclosed in the paper and archive. No independent human proof verification, external endorsement or peer review is claimed. Licensing: original manuscript and documentation CC BY 4.0; original code MIT. The inherited QICLean SchattenNorm helper retains Apache 2.0 and its original attribution. The archive provides the exact file-level license mapping. Manuscript revision: 22 October 2026. Research director's note — Matthew Liston: This project is motivated by philosophical exploration and curiosity about AI-assisted research. My aim in sharing these results is to make them available for scrutiny, correction and further development, so that others can build on whatever proves useful to mathematics and science. Correspondence: atemporalwalk@gmail.com.

•Oct 22, 2026•0 citations

Approximate quantum error correction: Optimal codes for independent and correlated errors

Sol H. Jacobsen, Florian Mintert

Verhandlungen der Deutschen Physikalischen Gesellschaft•Jan 1, 2013•0 citations
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.
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.
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.
This preprint proves a sharp purity bound for arbitrary complex pure states in tensor products of antisymmetric pair spaces, across the physical cut consisting of the first system from each pair versus the second system from each pair. For every finite number m of pairs and local dimensions at least two, purity is at most 2^(-m) and entanglement entropy is at least m bits, with equality characterized by products of normalized decomposable two-forms. It derives entanglement of formation m for m copies of the normalized antisymmetric state and, using the published regularization theorem, entanglement cost one ebit for every local dimension at least two. The archive provides original formal sources and a precise account of their scope; it does not claim a complete Lean translation of every ordinary LOCC execution. Research directed and curated by Matthew Liston. The mathematics, proofs, formalization and manuscript preparation substantially involve AI systems; paper-specific attribution and checking limits are disclosed in the paper and archive. No independent human proof verification, external endorsement or peer review is claimed. Licensing: original manuscript and documentation CC BY 4.0; original code MIT. The inherited QICLean SchattenNorm helper retains Apache 2.0 and its original attribution. The archive provides the exact file-level license mapping. Manuscript revision: 22 October 2026. Research director's note — Matthew Liston: This project is motivated by philosophical exploration and curiosity about AI-assisted research. My aim in sharing these results is to make them available for scrutiny, correction and further development, so that others can build on whatever proves useful to mathematics and science. Correspondence: atemporalwalk@gmail.com.