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.
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.
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.
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.
This record contains the revision 9 preprint and its verification and figure-reproduction materials. We determine when correlated readout-label errors cancel in a fixed measurement-based quantum wire and how finite correlation and independent noise determine its optimal length. Quantum operations and X measurements are ideal. A stationary binary Markov component with marginal 0 < p < 1/2 and persistence 0 ≤ c ≤ 1, combined with independent flips of probability 0 ≤ r < 1/2, yields an exact output Pauli channel through two-dimensional transfer matrices. The channel acts on arbitrary inputs, including reference-entangled inputs, and its entanglement infidelity equals its half-diamond distance from the identity. Common-mode errors cancel at lengths divisible by four when c = 1 and r = 0. Every fixed c < 1 instead gives a completely depolarizing long-wire limit; two residue-class crossover functions resolve the singular limit. Fidelity decreases within each even residue class, so its maximum over all positive even lengths is attained at two or four steps. Exact boundaries select the maximizer, and an effective depolarizing penalty quantifies the overhead tolerance of the four-step advantage. Contents. The ZIP includes the latest 19-page manuscript PDF, its authoritative LaTeX source, the three manuscript figures, the unchanged ESM_1.zip containing Python verification and figure-generation code, numerical data, saved execution records and provenance, plus licensing information, a BibTeX citation, and SHA-256 checksums. Scientific files are unchanged from the supplied revision 9 materials. The packaging did not rerun calculations or recompile the manuscript. The earlier reference-only PDF and submission-preparation working records are excluded. Licenses. MIT applies to Python source code, including code inside ESM_1.zip. CC BY 4.0 applies to the manuscript, LaTeX source, figures, numerical data, documentation, and other non-code research materials. These licenses apply to the respective material categories; see the README and license files for scope. Funding. No funding or grants were received for this study. Competing interests. The author has no relevant financial or non-financial interests to disclose. AI-assisted preparation. ChatGPT (OpenAI) was used to assist with mathematical analysis, code development, figure preparation, English-language editing, LaTeX submission preparation, and organization of supplementary files. The author carefully reviewed the mathematical reasoning, code, figures, and manuscript text, and takes full responsibility for the scientific content and the final manuscript.
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.
This research manuscript develops exact measurement-resource formulas for quantum erasure correction with stabilizer codes and an optimal sparse algorithm for selecting native surface-code checks. It studies known erasure locations, where the stabilizer observables may be chosen after the erased sites are identified. The central question is how many independent syndrome outcomes are necessary to distinguish Pauli errors on those sites, modulo stabilizers. For every prime-dimensional [[n,k,d]]_p stabilizer code encoding at least one logical qudit, the manuscript proves that the worst-case syndrome-resolving budget for δ erased sites is exactly 2δ whenever 0 ≤ δ < d. This includes degenerate codes. The result concerns the number of independent p-valued outcomes in the stated noiseless measurement model. The work is directly connected to the measurement-reduction setting studied by Ryutaroh Matsumoto in “Reducing measurements in quantum erasure correction by quantum local recovery,” Computational and Applied Mathematics, DOI: 10.1007/s40314-026-03881-4. It addresses the relationship between erasure-dependent measurement costs and code invariants, together with efficient selection of sufficient surface-code checks. The manuscript presents four connected results: Exact paired-column rank profile. For any matrix G over any field whose columns are partitioned into n labeled pairs, let r be its rank and ν the largest number of complete pairs whose columns are jointly independent. The maximum projected rank over all sets of δ pairs is exactly R(δ) = min{2δ, δ + ν, r}. A single ordering of the pairs realizes every maximum through its successive prefixes. The full profile therefore follows from two invariants, rather than requiring a separate optimization at every erasure size. Distance bounds and the exact worst-case syndrome budget. For an isotropic stabilizer space with k > 0, every inclusionwise maximal complete-pair independent set A satisfies d ≤ |A| + 1. Consequently, ν ≥ d − 1, yielding the exact 2δ worst-case budget below distance. The argument also gives a constructive extension property: every independent-pair set smaller than d − 1 can be enlarged by adding another pair. Particular correctable erasure patterns can require fewer outcomes because of stabilizers supported inside the erased region. Checkable CSS certificates. For Calderbank–Shor–Steane codes, complete-pair independence becomes simultaneous column independence in the X-check and Z-check matrices. Classical matroid intersection supplies an exact rank-partition certificate for ν. A matching independent set and partition provide lower and upper certificates that can be verified using finite-field elimination. Optimal native surface-code check selection. For binary check matrices with at most two nonzero entries per column, the restricted matrix is represented by a sparse graph with boundary pins. Connected components determine a minimum-cardinality native check basis in O(v_I + e_I) time. A pinned component retains every check; an unpinned component omits one check. With nonnegative additive costs, omitting a most expensive check in each unpinned component also minimizes total cost. The two CSS check systems are processed independently. The accompanying verification uses exact arithmetic over GF(2), GF(3), and GF(5). The algebra audit covers 120 general paired matrices and 12,276 subset-rank evaluations, including exact distance checks for 137 positive-logical-dimension code instances and 401 maximal-set distance checks. The graph audit covers 1,785 exhaustive sparse column multisets, 5,355 matrix/cost combinations, 500 additional seeded instances, and named boundary regressions. Both audit programs passed again during preparation of the release. These finite checks support implementation correctness; the general mathematical statements are supported by the supplied proofs. The release includes the complete manuscript, editable LaTeX source, Python native-check selector, exact audit programs, recorded results, generator data, figures, reproduction instructions, and an explicit claim-status record. The selector and audits require only Python 3.10 or later and its standard library; matplotlib is needed only to regenerate the figure. The results apply to independent syndrome information and classical check selection. They do not establish bounds for arbitrary coherent recovery, noisy fault-tolerant extraction, physical circuit depth, or one fixed measurement schedule that must serve every erasure pattern. At or above distance, the general formula remains an algebraic rank profile rather than a universal recovery guarantee. Classical matroid parity, matroid intersection, and incidence-rank methods are acknowledged foundations; historical priority for the presented combination is not certified. Ōrynthéa ∿ Qhuil is relevant to research on quantum error correction, erasure decoding, stabilizer and CSS codes, surface codes, quantum local recovery, measurement complexity, and matroid optimization. This mathematical research under the author designation Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
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.