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.
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 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.
Quantum error correction is fundamental to enabling reliable quantum computation and communication in the presence of noise and decoherence. Over the years, a diverse range of quantum coding strategies has been developed, each offering distinct approaches to mitigate quantum errors and achieve fault tolerance. This paper presents a comprehensive survey of major quantum code families, including stabilizer codes, topological codes, quantum LDPC codes, convolutional codes, turbo codes, Reed-Muller codes, continuous-variable bosonic codes, and subsystem codes. For each class, we discuss their construction principles, operational strategies, advantages, and inherent limitations. In addition to reviewing existing methodologies, we compare different coding techniques through structured tables and highlight the practical challenges that persist, such as resource overhead, decoding complexity, and scalability. Furthermore, we identify future research directions aimed at overcoming these challenges, including hybrid error correction approaches, machine learning-assisted decoders, and fault-tolerant architectures without magic state distillation. By consolidating the landscape of quantum error correction research, this work aims to serve as a foundational reference for researchers and practitioners working toward scalable, robust quantum technologies.
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.