An eight-point obstruction to universality of RBM(4,3)

Anonymous

Published Sep 6, 2026• 0 citations

Abstract

Unrefereed candidate, Anonymous, version 0.2.0-candidate. A finite integer certificate and written analytic argument establish a necessary leakage inequality on the full classical real binary RBM(4,3) visible closure, an eight-point obstruction to universality, a strictly positive excluded law, and non-sharp total-variation lower bounds. A contrasting exact construction represents every distribution on the specified parity-plus-one support. At least four hidden units are necessary; four-hidden sufficiency, smallest excluded support, complete classification, practical training penalties and historical priority are not established. The archive includes solver-free standard-library checkers, exact data, manuscript and PDF, normal/optimized hostile regression controls, source comparison, and one five-role coordinated AI internal editorial round. Producer checks and coordinated reconstruction are not unaffiliated reproduction, human specialist endorsement, journal peer review, or formal verification. The supplied external AI review reports a separate reconstruction but its linked audit ZIP was not retrieved. Original prose and data are CC0; code is MIT; upstream terms are preserved in LICENSES.md. The frozen editorial submission is included separately for audit and is superseded by the final release archive.

DOI: 10.5281/zenodo.22550043

Related papers

No Szöllősi matrix lies in a quadruplet of mutually unbiased bases in dimension six

Anonymous

Unrefereed candidate excluding the specified closed two-circulant Szollosi family from MUB quadruplets in complex dimension six. The Fourier-family result re-proves prior work. The unrestricted dimension-six maximum remains conditional on MMVW Conjecture 2. The package separates an untrusted hull generator from an interval and graph checker; canonical half-open ownership repairs boundary coverage, and input-bound clean replay prevents stale cache acceptance. No end-to-end formal verification, unaffiliated reproduction or external human peer review is claimed. See the replay receipt for exact measured scope. Original prose and data CC0; original code MIT; third-party and review material retain their terms.

Sep 30, 20260 citations

Forrelation de-oracleization: three barriers, Kloosterman atoms, and the low-degree instantiations (manuscripts, Lean formalization, certificates)

Hikaru Wakaura

Two manuscripts on the de-oracleization of Forrelation, with the complete supporting material: the Lean 4 formalization (Mathlib), the exact computational certificates with their recorded outputs, and the records of the adversarial reviews. Paper 1 — Three Barriers to De-oracleizing Forrelation: Truth Tables, Seeds, and Restricted Models (barriers.pdf, source barriers-source.tar.gz). Forrelation separates quantum from classical query complexity maximally. The paper studies the ladder of intermediate goals between the oracle separation and an unconditional separation of uniform decision classes and shows that three natural formalizations of its rungs are either trivial (truth-table collapse: quasi-linear time by the fast Walsh–Hadamard transform), false for every family (seed-compression barrier: any family generated from fewer seed bits than queries is distinguished from random by a fixed query set, and the computational variant is equivalent to one-way functions), or a restatement of a classical question (restricted-model trap: an explicit universal family whose label is any prescribed function of the seed, with exact Forrelation atoms and a proof of invariance). In the equal-footing model, where the restricted class evaluates the family itself, the trap dissolves for the whole orbit of the quadratic base pair under linear changes of variables and twists, by a derivative attack; a Kloosterman-sum family outside that orbit is constructed with provable atoms for every n ≥ 7 (fourth-moment identity, translation Parseval), on which the same-seed attacks of the paper are at chance; a uniform choice of the NO translation is open and stated as a conjecture supported by exact computation up to n = 25. Paper 2 — Low-Degree Instantiations of Forrelation Are Easy: Hidden Subspaces from Queries, Block Structure from Coefficients (whitebox.pdf, source whitebox-source.tar.gz). For the hidden Maiorana–McFarland family of Girish and Servedio with a polynomial h of constant degree whose top-degree form has trivial radical, O(4^d n^2) queries to f recover the hidden subspace as the radical of the top-degree form of f, after which the dual is evaluated by linear algebra; the low-degree instantiation is therefore easy already in the black-box model, and for d = 3 the radical hypothesis can be dropped. For the self-Forrelation proposal of Gheorghiu, Bravyi and Temme (as described in Gheorghiu's talk), the block decomposition of a sum of non-degenerate cubic blocks scrambled by an orthogonal matrix is recovered from the coefficient list by linear algebra through the symmetry algebra of the cubic form; degenerate blocks, a constant fraction of the self-dual bent cubics the proposal uses, defeat this algorithm, and the obstruction and the failure rate are given. Reproducibility archive (forrelation-barriers.tar.gz): the Lean 4 project (41 files in Forrelation/ plus a vendored subset of the OpenAI Math Release library for constant-depth circuits, Apache 2.0), every theorem depending only on the standard axioms; 35 certificate scripts with run_all.sh and the recorded results; the review records (several rounds of adversarial panel review per paper, three reviewers per round, syntheses, and an evidence audit of the citations against primary sources); and the project report. The analysis, code, Lean proofs, reviews and text were produced with large language models operated by the author, who checked every statement and certificate (see the AI disclosure sections of the papers).

Oct 22, 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

An Independent Reproduction and Four Extensions of the MUB(6) Fourth-Vector Feasibility Wall

JEREMY H. CARROLL

Title. An Independent Reproduction and Four Extensions of the MUB(6) Fourth-Vector Feasibility Wall Abstract. We present a companion note that cites N. Erlwein’s exact fourth-vector feasibility wall for a canonical mutually unbiased product triple in dimension six (Zenodo 20682233; theorem W = (88 + 3√6)/100). We do not redistribute the upstream software bundle. Independently, we (A) maintain a pure-Rust exact verification surface; (B) raise a d=10 closed-form hunt to a 460-decimal-place stationarity anchor with a widened PSLQ menu (no relation found); (C) run a full Cl(2)×Cl(5) single-qudit Clifford census at d=10, finding a single antiunitary Z/2 real structure; and (D) issue exact rational finite-cover exclusion certificates on a specified cell of the gauge-fixed candidate 5-torus. MUB(6)=3 and MUB(10) remain open. Local certificates mint no authority. Why a researcher should care. The note strengthens a rare exact, machine-checkable obstruction artifact in d=6 quantum information with a second language (Rust), higher-precision d=10 evidence, and independently checkable finite covers—while keeping claim boundaries explicit. What this does not claim. Not MUB(6)=3; not MUB(10); not a closed form at d=10; not joint authorship of Erlwein’s wall; not a global moduli theorem. Reproduction. cd crate && cargo test -j 1cargo run --release --bin mub_cover -- --region quadrant DOI. Pending human mint. Upstream wall: 10.5281/zenodo.20682233.

Aug 3, 20260 citations

Which frustration graphs give free fermions?: A converse to the even-hole, claw-free theorem, and exact free sectors of the periodic Fendley chain

Anonymous

Unrefereed mathematical candidate: a faithful-Pauli converse to the even-hole, claw-free global spectrum theorem; an exact central-sector criterion; explicit all-coupling periodic Fendley blocks at N=8,9; weak prescribed-mode heredity; and a repaired three-mode parity-completeness argument. Written proofs, exact computer-algebra certificates for 107 listed graphs, and numerical census evidence have separate assurance boundaries. Producer replay and a separately implemented model-review checker are not external human peer review, unaffiliated reproduction, formal verification or exhaustive novelty. The remaining 1621 numerical candidates are not all-coupling certified. Original prose/data CC0-1.0; original code MIT; third-party exclusions in LICENSES.md.

Sep 27, 20260 citations

Concentratable entanglement: counterexamples and sharp repairs

Anonymous

Unrefereed mathematical candidate. Exact counterexamples to a proposed universal mixed-state total concentratable-entanglement upper bound, including full-rank noisy and genuinely tripartite-entangled families; sharp uniform and fixed-size concave-roof impurity repairs. Analytic proofs and producer-side exact arithmetic checks are provided. AI-assisted internal review does not establish external peer review, independent reproduction, formal verification, priority or impact. Original prose and data CC0-1.0; original code MIT. Source literature retains its own terms.

Oct 13, 20260 citations