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

Daniel Eric Fredriksen

Published Oct 28, 2026• 0 citations

Abstract

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.

DOI: 10.5281/zenodo.23744565

Related papers

Quantum recovery from finitely many sharp questions

Seth Douglas

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.

Sep 16, 20260 citations

Learning an unknown bounded-degree quantum Hamiltonian from one thermal state

Matthew Liston

This preprint studies learning an unknown bounded-degree n-qubit Hamiltonian in a known Pauli basis from independent copies of a single-temperature Gibbs state. For fixed locality, interaction degree and fixed positive rational inverse temperature and coefficient bound, it gives a polynomial-resource algorithm using product single-qubit Pauli measurements, without geometry, a gap, correlation decay or a minimum nonzero coefficient. The output has rational coefficients, support inside the true support and total coefficient error at most the requested tolerance with the stated success probability. The temperature-dependent exponents are extremely large; the result is asymptotic. The refinement certificate is formalized in Lean conditionally on explicit analytic inputs. Initialization, iteration, solver, sampling and full resource bounds remain paper proofs. A companion source note preserves the separate hidden-Majorana discussion and its open calibration problem; it is not a proof of that broader learner. 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 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, 20260 citations

Finite-Shot Certification of Hidden Quantum Factor Structure from Calibration-Free Sequence Statistics

Oliver Tuma

This preprint studies finite-shot reconstruction of hidden quantum factor structure from global calibration-free sequence statistics without assuming an internal tensor-product cut in advance. A probability-only complex-projective 3-design self-test is used as an imported anchor for the active Hilbert/Jordan geometry. From this anchor, global control maps are reconstructed with explicit confidence bounds, including a weighted estimator for unequal shot counts and missing reference settings whenever the surviving frame remains full rank. The main certification result is a whole-commutant-energy lower bound. For reconstructed controls, the sum of the lowest commutator singular energies yields a basis-free lower bound on the aggregate projective Hilbert–Schmidt distance to every common hidden matrix factor of a specified multiplicity. Combined with exact Choi-to-projective-unitary conversion and finite-shot confidence balls, this produces a one-sided lower bound on distance to the complete common-factor model class. An explicit exact factor witness gives the complementary PROXIMAL-RECOVER certificate; otherwise the procedure returns ABSTAIN. The paper also proves that exact generated-algebra / tensor-product-structure type is not uniformly identifiable from finite samples without a structural separation margin. For the fixed two-qubit 60-state stabilizer benchmark, the paper provides an anchor-inclusive raw-count validation and an exact-rational / outward-rounded one-sided trust path from integer counts through anchor and control confidence radii to factor RECOVER/REJECT. The scope is deliberately operational: the result certifies active factor structure supported by the augmented data and does not claim identification of arbitrary inactive spectator degrees of freedom or a uniquely true microscopic decomposition.

Sep 5, 20260 citations

Generative reconstruction for irrecoverable erasure errors in quantum-corrupted images

Prokash Chandra Roy, Saikat Barua, Md. Razwanul Islam Tanvir +2 more

Quantum Machine IntelligenceNov 10, 20250 citations

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

The exact fourth-vector feasibility wall of the canonical MUB triple in dimension six

Noah Erlwein

For the canonical product MUB triple {Z₂ ⊗ Z₃, X₂ ⊗ Q₀, Y₂ ⊗ Q₁} in dimension six, known to admit no vector unbiased to all three bases, we prove an exact two-sided theorem for the projector-space feasibility functional f, where f(v) = 1 would characterize a candidate fourth unbiased vector. We show that the global maximum of f is W = (88 + 3√6) / 100 ≈ 0.9534846923. The bound is attained by an explicit algebraic unit vector, verified entirely in exact arithmetic over the field Q(ζ₂₄, √5). Its symmetry orbit contains 72 distinct maximizing rays. The matching global upper bound f ≤ W is established via an exact positive-semidefinite certificate at the level-2 Veronese lift. The certificate consists of a symmetric matrix over Q(√2, √3), whose polynomial identity and positivity are machine-verified in exact arithmetic and closed deterministically under the triple's 432-element symmetry group. No randomized computation or floating-point arithmetic appears anywhere in the proof chain. We further prove, via exact separating functionals, that degree-4 and degree-6 sum-of-squares certificates do not exist. In this precise sense, the lift level employed is minimal and necessary. Companion results include: • an exact product-vector ceiling for aligned product triples; • the exact wall value for the second known triple; • a complete Weyl-board census in dimension six, together with a Lean 4 kernel-verified combinatorial layer. These results completely characterize the pinned canonical triple. They do not resolve the MUB(6) problem, which remains open. The deposit contains two files: (1) the manuscript (PDF); (2) a complete verification bundle (ZIP; 91 files) containing all computational modules, tests, evidence receipts, execution logs, a SHA-256 manifest, and a minimal independent verifier (verify_global_certificate.py). The verifier is implemented in standard-library-only Python, shares no code with the certificate-construction pipeline, loads the stored exact certificate matrix, and independently re-establishes both directions of the global bound in approximately 150 seconds. Reproduction is available via: make verify-global Code is released under the Apache License 2.0 (with SPDX headers throughout the bundle). The manuscript text is released under CC BY 4.0. This research made extensive use of AI systems for conjecture generation, computation, proof drafting, and adversarial review. However, no mathematical claim depends on the correctness of any AI system. Every reported result is verified by exact rational arithmetic, exact interval arithmetic, or the Lean 4 kernel, and all verification artifacts are included in the deposit.

Jun 12, 20260 citations