Linked discovery record only. The manuscript and supplement are hosted on OSF under CC BY-NC 4.0. The Figshare record contains no copy of those PDFs. Primary preprint and supplement: 10.17605/OSF.IO/34BDM (OSF public record). Rights distinction: Figshare's CC BY 4.0 selection applies only to the original text and metadata of this linked discovery listing. It does not license or relicense the separately hosted manuscript or supplement. Both OSF PDFs remain Copyright 2026 Kent Nimmo, Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0): licence terms. Abstract A binary measurement can hide logical-state dependence on its first read and reveal it when repeated. We study rank-two logical codes in singlet sectors of four equal positive spins, requiring all three opposite-pair correlations to have state-independent means. Spin 3/2 is the smallest spin supporting such a code. In its four-dimensional singlet sector, every fixed-pair-mean code obeys sum_O g_O >= 64/75 and max_O g_O >= 64/225, where g_O is the width of the compressed second moment. Both bounds are attained by a unique code plane. The optimizer is the span of the unique totally antisymmetric and totally symmetric singlets and, equivalently, the maximal-absolute-eigenvalue subspace of the oriented triple product Q = J_1 dot (J_2 cross J_3). Its two sharp-Q states have opposite handedness while sharing all individual pair-measurement distributions. Under sequential binary readout with classical records, inaccessible measurement environments, and no quantum bypass memory, a self-contained Bell-recovery bound yields an explicit response inequality. Exact recovery at detector strength eta > 0 forces each conditional-response width to satisfy d_i = eta g_i/2, and known-code conditional restoration attains this requirement. Uniform pair selection therefore has the attained minimum D = 32 eta/225. Accessible word privacy alone remains insufficient when unread noise can erase the logical state. Publication status Author-submitted preprint, version 2.5, submitted to Journal of Mathematical Physics on 22 October 2026 (JMP26-AR-03103). This is not an accepted manuscript or the publisher's version of record. No acceptance or peer-review approval is claimed. The 19-page manuscript and 3-page supplement are available at the primary OSF record. Reproducibility Private verification scripts, certificates, source archives and research code are not included in either public deposit. They remain available from the corresponding author upon reasonable request. Author Kent Nimmo; Independent Researcher, Vancouver, British Columbia, Canada; ORCID 0009-0003-8503-8891. Contact: kentnimmo@gmail.com. No external funding received.Reading and related workBrowse Quantum Foundations or Mathematics for related work, including Retained Quantum Records. This navigation does not change the CC BY-NC 4.0 terms of the primary OSF PDFs.
Linked discovery record only. The manuscript and supplement are hosted on OSF under CC BY-NC 4.0. The Figshare record contains no copy of those PDFs. Primary preprint and supplement: 10.17605/OSF.IO/34BDM (OSF public record). Rights distinction: Figshare's CC BY 4.0 selection applies only to the original text and metadata of this linked discovery listing. It does not license or relicense the separately hosted manuscript or supplement. Both OSF PDFs remain Copyright 2026 Kent Nimmo, Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0): licence terms. Abstract A binary measurement can hide logical-state dependence on its first read and reveal it when repeated. We study rank-two logical codes in singlet sectors of four equal positive spins, requiring all three opposite-pair correlations to have state-independent means. Spin 3/2 is the smallest spin supporting such a code. In its four-dimensional singlet sector, every fixed-pair-mean code obeys sum_O g_O >= 64/75 and max_O g_O >= 64/225, where g_O is the width of the compressed second moment. Both bounds are attained by a unique code plane. The optimizer is the span of the unique totally antisymmetric and totally symmetric singlets and, equivalently, the maximal-absolute-eigenvalue subspace of the oriented triple product Q = J_1 dot (J_2 cross J_3). Its two sharp-Q states have opposite handedness while sharing all individual pair-measurement distributions. Under sequential binary readout with classical records, inaccessible measurement environments, and no quantum bypass memory, a self-contained Bell-recovery bound yields an explicit response inequality. Exact recovery at detector strength eta > 0 forces each conditional-response width to satisfy d_i = eta g_i/2, and known-code conditional restoration attains this requirement. Uniform pair selection therefore has the attained minimum D = 32 eta/225. Accessible word privacy alone remains insufficient when unread noise can erase the logical state. Publication status Author-submitted preprint, version 2.5, submitted to Journal of Mathematical Physics on 22 October 2026 (JMP26-AR-03103). This is not an accepted manuscript or the publisher's version of record. No acceptance or peer-review approval is claimed. The 19-page manuscript and 3-page supplement are available at the primary OSF record. Reproducibility Private verification scripts, certificates, source archives and research code are not included in either public deposit. They remain available from the corresponding author upon reasonable request. Author Kent Nimmo; Independent Researcher, Vancouver, British Columbia, Canada; ORCID 0009-0003-8503-8891. Contact: kentnimmo@gmail.com. No external funding received.Reading and related workBrowse Quantum Foundations or Mathematics for related work, including Retained Quantum Records. This navigation does not change the CC BY-NC 4.0 terms of the primary OSF PDFs.
AUTHOR-SUBMITTED PREPRINT • v2.5 A binary measurement can hide logical-state dependence on its first read and reveal it when repeated. We study rank-two logical codes in singlet sectors of four equal positive spins, requiring all three opposite-pair correlations to have state-independent means. Spin 3/2 is the smallest spin supporting such a code. In its four-dimensional singlet sector, every fixed-pair-mean code obeys sum_O g_O >= 64/75 and max_O g_O >= 64/225, where g_O is the width of the compressed second moment. Both bounds are attained by a unique code plane. The optimizer is the span of the unique totally antisymmetric and totally symmetric singlets and, equivalently, the maximal-absolute-eigenvalue subspace of the oriented triple product Q = J_1 dot (J_2 cross J_3). Its two sharp-Q states have opposite handedness while sharing all individual pair-measurement distributions. Under sequential binary readout with classical records, inaccessible measurement environments, and no quantum bypass memory, a self-contained Bell-recovery bound yields an explicit response inequality. Exact recovery at detector strength eta > 0 forces each conditional-response width to satisfy d_i = eta g_i/2, and known-code conditional restoration attains this requirement. Uniform pair selection therefore has the attained minimum D = 32 eta/225. Accessible word privacy alone remains insufficient when unread noise can erase the logical state. PUBLICATION STATUS This is the author's original submitted v2.5 manuscript and technical supplement. It was submitted to the Journal of Mathematical Physics on October 22, 2026 (manuscript JMP26-AR-03103), and is not the journal's published version of record. No acceptance or peer-review approval is claimed here. If a journal version is eventually published, cite the final version separately. PUBLIC FILES QM_Phase1_v2_5_JMP.pdf — complete submitted manuscript, 19 pages. QM_Phase1_v2_5_SM.pdf — associated technical supplement, 3 pages. license.txt — CC BY-NC 4.0 licence notice for the two PDFs. LICENCE Copyright 2026 Kent Nimmo. The manuscript and supplement are shared under Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0), subject to its full legal terms: https://creativecommons.org/licenses/by-nc/4.0/. The licence applies to the two publicly deposited PDFs and does not release private code, other materials or patent rights. REPRODUCIBILITY This is theoretical work supported by analytical proofs and exact finite-dimensional computations. The verification scripts, certificates and replay materials are available from the corresponding author upon reasonable request; they have not been publicly deposited here. AUTHOR Kent Nimmo — Independent Researcher, Vancouver, British Columbia, Canada. ORCID: https://orcid.org/0009-0003-8503-8891. Contact: kentnimmo@gmail.com. No external research funding received.
A Spin-Sector Obstruction to (((7,3,3))_2) Quantum Codes This record contains a focused research manuscript and an extended research version investigating structural obstructions to the existence of binary quantum error-correcting codes with parameters (((7,3,3))_2). The primary manuscript establishes a sector-specific obstruction for codes contained entirely in the total-spin (j=5/2) sector. The proof uses pair-root projectors, weighted quadrupole identities, compression arguments, Cauchy interlacing, and the total-spin Casimir identity. Additional results exclude the sector-pure (j=7/2) and (j=1/2) cases using collective-pair correlation bounds. The record contains two complementary manuscript versions: - Primary manuscript (10 pages): A focused presentation of the principal sector-obstruction results and their proofs.- Extended research manuscript (23 pages): A fuller treatment containing additional derivations, correlation bounds, moment analyses, and supporting mathematical investigations. The deposit also includes the corresponding LaTeX source files and Python scripts for exact-arithmetic verification of selected operator identities and quadrupole-coefficient uniqueness calculations. Scope of the results: These results exclude the specified sector-pure cases. They do not resolve the unrestricted existence problem for (((7,3,3))_2) quantum codes. The sector-pure (j=3/2) case and cases involving mixed total-spin sectors remain unresolved in this work. The verification scripts support reproducibility of the stated algebraic calculations; they should not be interpreted as an independent computer-assisted proof of every theorem in the manuscripts. The primary manuscript is intended as the concise research presentation, while the extended manuscript preserves additional mathematical development and supporting analysis. Both are included to facilitate scholarly scrutiny, reproducibility, and accurate citation. AI assistance : This work was produced with substantial assistance from an AI system (ChatGPT, Claude, Gemini). Corrections are welcome.
Linked discovery record only. The full manuscript is hosted on OSF under CC BY-NC 4.0. This Figshare listing contains no copy of the manuscript PDF.Primary manuscript preprint: https://doi.org/10.17605/OSF.IO/KGPSW. The OSF manuscript retains its noncommercial licence. Figshare’s CC BY 4.0 selection applies only to this original discovery-listing text and metadata; it does not relicense the linked manuscript or supporting materials.AbstractWhen do prescribed quantum trials realize a proposed law for their recorded results? We distinguish a positive configuration measurement, realization of its statistics by the named trials, and realization of one common full instrument across schedules. For finite experiments with success prerequisites, we give an exact local compatibility criterion for contraction successes completed by their canonical square-root failures. It yields the same terminal instrument, including residual states, under every exhaustive history-dependent classical scheduler. This equality also holds for reference-entangled inputs. The scheduling argument also covers fixed binary instruments with commuting concurrent branch maps. For two canonical trials whose successes commute up to a unit phase, mutual preservation of their success effects characterizes equality of the recorded-result laws. A qutrit pair has this equality but different residual states; we prove that dimension three is minimal within this setting. A commuting nilpotent family has positive configuration effects and a regular unitary dilation, yet its record law has sharp minimum worst-input error nq − 1 + (1−q)^n under at most n calibrated trials, with n ≥ 2 and 0 < q ≤ 1/n. Canonical execution attains the bound. At q = 1/n, it equals (1−1/n)^n, which tends to e^(−1) as n → ∞. Changing a conditional success effect permits exact realization. These results identify distinct requirements on a measurement law and the fixed processes used to implement it.Journal statusThe following article has been submitted to Journal of Mathematical Physics as manuscript JMP26-AR-02895. This is an unreviewed author-submitted preprint, not an accepted manuscript, journal proof or Version of Record. No journal acceptance or peer-review certification is claimed.Supporting reproducibility materialsCode, frozen outputs, computational addendum and supplementary material remain separately available at 10.17605/OSF.IO/68GNF. This supporting-archive DOI is distinct from the manuscript preprint DOI.Kent Nimmo — Independent Researcher, Vancouver, British Columbia, Canada. ORCID: 0009-0003-8503-8891.
This theoretical and computational preprint studies how the direction of central-qubit noise affects optimal local readout of a multipartite GHZ phase. The task is equal-prior discrimination of GHZ+ and GHZ- by a final measurement of one central qubit, using commuting spin-star interactions with fixed axes and a bound on the instantaneous sum of absolute coupling strengths. For signed, time-dependent controls, the study derives an exact attainable trace-distance frontier and its inverse error-time relation. Equal integrated coupling angles attain the noiseless frontier, so balanced simultaneous and sequential schedules are equivalent under the stated resource model. Central dephasing along the commuting axis preserves this equivalence and gives an exact optimal stopping time. The main additional result concerns three qubits with transverse central Pauli-jump noise. Among nonnegative deterministic controls that achieve perfect noiseless discrimination at the minimum possible decoding time, balanced simultaneous couplings are uniquely optimal at every finite positive noise rate. The proof establishes nonnegativity of the signed contrast, an exact performance-gap identity, and a lower bound in terms of accumulated coupling imbalance. Optimality is restricted to this control class and endpoint time; allowing a later measurement can improve the result. The supplementary materials contain supporting proofs, calibration bounds and classical scalar-output prediction results. The companion RM01 analysis compares finite-sample prediction and serialized storage against methods using the same measurement information. It explicitly identifies cases where a conventional polynomial representation uses fewer bytes, and does not claim a new general compression principle. The archive supplies editable manuscript sources, code, simulated data, recorded results, reproduction instructions and checksums. Archived validation includes 2,348 Q1 assertions and 530 transverse-noise schedule cases. A publication review dated 4 November 2026 adds separate numerical checks and a fresh reproduction of the RM01 analysis of 12,000 simulated measurement records. Its report distinguishes newly executed checks from archived results and documents execution limitations. All findings concern the specified mathematical and simulation models. No laboratory measurements or device-level advantage are reported. AI assistance is disclosed. Scientific priority and independent human peer review are not established.
AbstractRetained measurement records constrain recoverability, but their formation also depends on the available physical controls. We give exact, constructively attained answers to both questions in two specified models. For a balanced nondemolition qubit process with actual binary observer memories unavailable to the decoder, we determine the maximum recovery compatible with average readout accuracy and pair agreement. The finite-record solution includes its feasible region and a common memory-writing and recovery process, without assuming exchangeability of observed records. Under a complete conditional-pairwise-independence promise at fixed informative accuracy, the optimal coherence has a sharp inverse-square-root asymptotic; fully conditionally independent records instead give exponential decay. Thus identical single-record and pair-record calibrations need not justify the product-law recovery bound. We then fix a logical code in four spin-3/2 systems and sequential diagonal contacts with exact controlled-swap endpoints. Hard budgets for net contact action and added spectral control charge yield an exact peak-excursion frontier within a declared quadratic-plus-cubic control class. A single positive-amplitude preparation jointly attains the record, recovery and occupation requirements, connecting the two results through an exact finite-dimensional optimization. A closed three-record example distinguishes fixed complete records from fixed averaged data. Separately calibrated imperfect contacts admit one-sided finite-error extensions. Together, the results characterize both informational compatibility and control-dependent formation through common attaining apparatuses.Preprint status and related materialsAuthor-submitted preprint; not peer reviewed or accepted for publication. This theoretical and computational work addresses the compatibility of retained binary quantum records with optimized accessible-system recovery, and the control-dependent resources required to form those records in a specified spin encoding. The article provides exact finite-record bounds, attainable recovery and resource frontiers, and calibrated finite-error qualifications. The manuscript has been submitted to Foundations of Physics for journal consideration; this Figshare record is not a journal publication. The technical supplement is included as a second PDF in this same record. Related software, verification code, exact certificates, and selected computational evidence are available separately at https://doi.org/10.6084/m9.figshare.34886079 under the MIT licence. When a journal version of record becomes available, a link to its DOI will be added here.AuthorKent Nimmo; Independent Researcher, Vancouver, British Columbia, Canada; ORCID 0009-0003-8503-8891.Reading and related workBrowse Quantum Foundations for related work on records, access and measurement, and Mathematics for exact bounds and certified constructions. The MIT software/certificate archive remains a distinct record from these manuscript PDFs.
Preprint and reproducibility archive; not peer reviewed. What this record contains. The full text of the manuscript "Identical Few-Particle Gauge Hamiltonians, Programmable Collective Charge Response" (M. J. Baek), its Supplementary Information with complete proofs, and the archive that certifies every closed-form value the paper states. The result. Few-particle dynamics are routinely used to infer collective response in paired quantum matter. This work constructs finite-range interacting response twins that defeat that inference exactly. For any prescribed finite p, two positive finite-range parents have complete static gauge Hamiltonians that coincide at every Peierls link phase on every sector N ≤ p and first separate at N = p+1; their zero-twist finite-density ground rays are the same Dicke condensate, yet their collective charge curvatures differ extensively. The obstruction has no universal depth, and the paper locates it exactly: the blind depth equals the spectator body order, the algebraic bound is independent of geometric range, and bounded range still bounds depth only through the number of sites a ball can hold — so no arbitrary-depth family of uniformly fixed range is claimed. Conversely, a structurally closed exact-pair tower closes at depth two. What is hidden is designable: with d(d+1)/2 displacement families the whole symmetric response-tensor difference is locally realizable at interior filling, and a triangular-lattice twin pair differs only in shear while both diagonal responses stay equal. A 4×4 hard-core-qubit discriminator gives an exact factor-of-two contrast with an internal null control and a state-preparation certificate in 17 equal-time settings. What is certified, and what is not. Results proved in closed form are stated as theorems and proved in full in the Supplementary Information; results established by exact rational or symbolic computation are labelled computer-assisted and carry the script that produces them; the 16-qubit discriminator is a blueprint with an end-to-end noise simulation, not a hardware demonstration, which is not claimed anywhere. Scope limits, open proof lines and one refuted conjecture are recorded explicitly rather than omitted. The archive. response_twins_unified_v1.0.zip contains the manuscript and Supplementary sources, the proof notes, the complete fail-closed verification harness (31 executed stages in release mode — 27 claim-bearing certificate stages, 1 non-claim diagnostic stage and three fail-closed gates — and 24 in quick mode) with one frozen log per stage, independent reimplementations of the load-bearing calculations, negative controls that must fail, the exact-arithmetic certificates behind every closed-form value in the paper, the figure-generation scripts, the scientific claim and provenance record (79 rows with status and scope notes, 50 of them naming the in-archive script or certificate that checks them, the rest saying in words why not), and a per-file SHA-256 manifest of all 209 payload files. Verifying it. Extract the archive and run python3 REPRODUCIBILITY/run_all.py --mode quick for the fast subset or --mode release for all 31 stages; bash BUILD.sh rebuilds both PDFs from source. The three gates check journal-format limits, the release payload against its manifest, and every number the documentation states about the artefacts. Running the harness does not modify the archive: all runtime output is written outside the immutable tree, so verification cannot invalidate the manifest. README.md separates reproducing the content (TeX Live 2023 or newer) from reproducing the archived PDF bytes, which needs the exact producing build recorded inside the PDFs. Licences. Manuscript, Supplementary Information and documentation CC BY 4.0; source code MIT; certificate data CC0 1.0. LICENSE.md is the authoritative per-file mapping and is included both in the archive and as a separate file on this record.