Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Invariant Couplings and Recorded-Exchange Control

Jonathan Washburn

Published Oct 25, 2026• 0 citations
Publisher

Abstract

A symmetry specifies which interactions are compatible with a system; it does not specify which interactions its controls can produce. We resolve this distinction for a finite recognition apparatus with a main signal, a retained record and an independent clock. An explicit unitary change of coordinates turns the two signal ports into four equivalent copies of a four-dimensional symplectic representation. The invariant source Hamiltonians are therefore exactly the Hermitian 4×4 coefficient matrices acting between those copies. The original controls preserve one decoded record component, excluding even a simple exchange allowed by the symmetry. Adding forward waits under one fixed positive-strength recorded-exchange Hamiltonian removes this obstruction: every invariant source unitary, with identity on the clock, lies in the operator-norm closure of the resulting finite programs. The proof derives the required operations from the stated inventory: a clock echo removes unwanted clock motion, and a record-restoring subroutine supplies control of the main register. We also carry the original energy readout through the same programs, retaining its reference and positivity conditions. The deposit includes the paper and its LaTeX source with six vector schematics. AI-use disclosure: OpenAI Codex assisted with mathematical formalization, manuscript drafting and editing, schematic code, and source and layout checks. The results are supported by explicit mathematical arguments and machine-checked proofs in the author's research project.

DOI
10.5281/zenodo.23647451

Related papers

Invariant Couplings and Recorded-Exchange Control

Jonathan Washburn

A symmetry specifies which interactions are compatible with a system; it does not specify which interactions its controls can produce. We resolve this distinction for a finite recognition apparatus with a main signal, a retained record and an independent clock. An explicit unitary change of coordinates turns the two signal ports into four equivalent copies of a four-dimensional symplectic representation. The invariant source Hamiltonians are therefore exactly the Hermitian $4\times4$ coefficient matrices acting between those copies. The original controls preserve one decoded record component, excluding even a simple exchange allowed by the symmetry. Adding forward waits under one fixed positive-strength recorded-exchange Hamiltonian removes this obstruction: every invariant source unitary, with identity on the clock, lies in the operator-norm closure of the resulting finite programs. The proof derives the required operations from the stated inventory: a clock echo removes unwanted clock motion, and a record-restoring subroutine supplies control of the main register. We also carry the original energy readout through the same programs, retaining its reference and positivity conditions.

•Oct 25, 2026•0 citations

Histories as Dynamical Resources

Washburn

Keeping a record changes which alternatives can interfere. On a pair of eight-state clock channels, we derive three recording operations whose identical final measurement has probabilities 1/4, 9/32, and 3/8. The full-current instrument retains fifteen distinct histories and transfers incoming occupation phase into their relative phases. Requiring its physical realization to conserve both native clock energy and occupation has a stronger consequence: every collective one-channel observable is conserved, and all admissible operations lie in the permutation commutant. This yields an exact reference-count balance, a sharp state-dependent disturbance bound, and a finite-reference obstruction to exact neutral recording. We characterize the complete finite-reference attainable region by an explicit finite algebraic synthesis problem, including its no-reference endpoint. A conserving collision construction then supplies a concrete attainable family, with an exact diamond-error formula and a uniform reference-return bound. These results connect the choice of record to observable dynamics and to the reference that pays for their implementation. A finite discrimination protocol states the required preparation, error tolerance, sample count, and independently calibrated time and energy scales. First public preprint release, version 1.0. The files include the PDF, the main TeX file, and a complete source archive with editable schematics and relevant verification supplements. AI-use disclosure: AI assistance was used for source analysis, mathematical exploration, manuscript drafting and revision, diagram preparation, and computational verification support. GPT-6 Astra reviews assessed arguments, scope, readability, and schematics. These were internal model reviews, not external peer review. Jonathan Washburn is the sole listed author and is responsible for the released manuscript.

•Sep 17, 2026•0 citations

Finite Quantum Records and Source-Inclusive Coherence Tests

Qingchun Zhang

A durable quantum record, the location of its coherence, and a uniquely actual outcome are different physical questions. We study their separation in a supplied finite-dimensional quantum theory. An explicit, time-independent apparatus couples a system–detector encoding to a controller, a distinct archive, and a finite returning source. A conditional energy penalty suppresses release of the original record without deleting its return coupling. An invariant reduction and a one-sided spectral-gap estimate yield a certified interval with archive occupation above 0.98438, controller-latched occupation above 0.99161, and filled-but-unlatched weight below 2.402 × 10^-7 in one stated design. The same record statistics admit different source-label overlaps and hence different coherence on a specified retained boundary. A conserved product of complementary exchanges accesses that coherence when the finite source is included. Given a calibrated multiregister reader, its finite-duration response separates the coherent apparatus from an independently added archive-gated reduction law, with the added process left active during readout. A conservative example retains a response gap above 0.01717 after separately stipulated one-percent error allowances. The contribution is the finite construction and its quantitative retention, access, and readout interfaces. Quantum carriers, Hamiltonian couplings, trace readout, source preparation, and the reader are supplied; local reader synthesis, empirical calibration, absolute rate selection, and unique-event actualization are not established. Paper code: CFQR-P1 (Complementarity-First Quantum Records — Paper 1). The associated bundle contains the technical supplement, editable LaTeX, numerical checking programs and rational certificates, and selected Lean sources with returned build and axiom-audit evidence. The 39 supporting declarations are partially formalized; eleven recorded type excerpts contain printing elisions. This is not end-to-end formalization, external human peer review, an experimental detection of fundamental collapse, or a derivation of unique-event actualization. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; author-owned software is MIT, subject to the bundle’s licence map and third-party notices.

•Oct 15, 2026•0 citations

Exact Control and Encoded Readout in a Native Recognition Register

Jonathan Washburn

Can fixed recognition interactions supply the control needed to write an exact record? We prove full unitary controllability on the 1,536-dimensional neutral sector of two source–reference pairs. The allowed controls are simultaneous sums of explicit local braid and paired-contact Hamiltonians, with adjustable positive strengths and durations; the original holding and positive scalar energy charges remain present. The main algebraic step converts effective control on a 1,024-dimensional matched subspace into control supported there, then uses a contact with an explicit right inverse to reach the remaining coordinates. Compact-group control gives actual finite words. An exact eight-label coherent readout follows, together with arbitrary encoded interventions and preparation of each label from one encoded blank. The four active cells sit in a fourteen-cell register: the other ten evolve by a retained unitary, with the same identity valid for every finite external reference. The result establishes exact existence within the prepared encoding, without a uniform synthesis-time or pulse-count bound.

•Nov 2, 2026•0 citations

Bounded Local Readout of Source-Inclusive Quantum Records

Qingchun Zhang

A source-inclusive coherence observable is useful only when its measurement resources are admitted. This preprint constructs a bounded local reader for the conserved exchange observable of a specified finite quantum-record apparatus. A degree-three graph uses one independently prepared probe, twenty relays with arbitrary joint states, and finite-duration two-register extraction and full-SWAP interactions. The original apparatus Hamiltonian and an independently added archive-gated process remain active throughout their respective implementations. A prefix-dependent control-frame comparison, symmetry-resolved effect estimate, and explicit gain, phase and finite-slew waveform bounds yield a sufficient response separation greater than 0.005139889 for the stated fixed, fully accessible sixteen-position source and remaining response-error budgets. This is a conditional mathematical result, not measured hardware calibration, a partial-source-access theorem, or a unique diagnosis or derivation of fundamental collapse. The package contains the main manuscript, technical supplement, editable LaTeX, direct numerical reproduction sources, and accepted returned Mac evidence for 56 paper-specific supporting Lean declarations. That subset verifies selected algebra, scalar inequalities and the actual-constant numerical expression; it does not formalize the full physical/continuous-time theorem end-to-end. Separate-session AI review, numerical reproduction and returned kernel evidence are distinguished. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; newly authored numerical and Lean software is MIT. Predecessor and third-party notices remain unchanged; the reproduction package contains the licence map. No external funding; no competing interests declared. Public preprint v1.0; edition date 18 October 2026; DOI 10.5281/zenodo.23442579.

•Oct 18, 2026•0 citations

Exact Control and Encoded Readout in a Native Recognition Register

Jonathan Washburn

Can fixed recognition interactions supply the control needed to write an exact record? We prove full unitary controllability on the 1,536-dimensional neutral sector of two source–reference pairs. The allowed controls are simultaneous sums of explicit local braid and paired-contact Hamiltonians, with adjustable positive strengths and durations; the original holding and positive scalar energy charges remain present. The main algebraic step converts effective control on a 1,024-dimensional matched subspace into control supported there, then uses a contact with an explicit right inverse to reach the remaining coordinates. Compact-group control gives actual finite words. An exact eight-label coherent readout follows, together with arbitrary encoded interventions and preparation of each label from one encoded blank. The four active cells sit in a fourteen-cell register: the other ten evolve by a retained unitary, with the same identity valid for every finite external reference. The result establishes exact existence within the prepared encoding, without a uniform synthesis-time or pulse-count bound. The paper and source archive, including verify_certificates.py, are available at https://doi.org/10.5281/zenodo.23875346.

•Nov 2, 2026•0 citations
A symmetry specifies which interactions are compatible with a system; it does not specify which interactions its controls can produce. We resolve this distinction for a finite recognition apparatus with a main signal, a retained record and an independent clock. An explicit unitary change of coordinates turns the two signal ports into four equivalent copies of a four-dimensional symplectic representation. The invariant source Hamiltonians are therefore exactly the Hermitian 4×4 coefficient matrices acting between those copies. The original controls preserve one decoded record component, excluding even a simple exchange allowed by the symmetry. Adding forward waits under one fixed positive-strength recorded-exchange Hamiltonian removes this obstruction: every invariant source unitary, with identity on the clock, lies in the operator-norm closure of the resulting finite programs. The proof derives the required operations from the stated inventory: a clock echo removes unwanted clock motion, and a record-restoring subroutine supplies control of the main register. We also carry the original energy readout through the same programs, retaining its reference and positivity conditions. The deposit includes the paper and its LaTeX source with six vector schematics. AI-use disclosure: OpenAI Codex assisted with mathematical formalization, manuscript drafting and editing, schematic code, and source and layout checks. The results are supported by explicit mathematical arguments and machine-checked proofs in the author's research project.
A symmetry specifies which interactions are compatible with a system; it does not specify which interactions its controls can produce. We resolve this distinction for a finite recognition apparatus with a main signal, a retained record and an independent clock. An explicit unitary change of coordinates turns the two signal ports into four equivalent copies of a four-dimensional symplectic representation. The invariant source Hamiltonians are therefore exactly the Hermitian 4×44\times44×4 coefficient matrices acting between those copies. The original controls preserve one decoded record component, excluding even a simple exchange allowed by the symmetry. Adding forward waits under one fixed positive-strength recorded-exchange Hamiltonian removes this obstruction: every invariant source unitary, with identity on the clock, lies in the operator-norm closure of the resulting finite programs. The proof derives the required operations from the stated inventory: a clock echo removes unwanted clock motion, and a record-restoring subroutine supplies control of the main register. We also carry the original energy readout through the same programs, retaining its reference and positivity conditions.
Keeping a record changes which alternatives can interfere. On a pair of eight-state clock channels, we derive three recording operations whose identical final measurement has probabilities 1/4, 9/32, and 3/8. The full-current instrument retains fifteen distinct histories and transfers incoming occupation phase into their relative phases. Requiring its physical realization to conserve both native clock energy and occupation has a stronger consequence: every collective one-channel observable is conserved, and all admissible operations lie in the permutation commutant. This yields an exact reference-count balance, a sharp state-dependent disturbance bound, and a finite-reference obstruction to exact neutral recording. We characterize the complete finite-reference attainable region by an explicit finite algebraic synthesis problem, including its no-reference endpoint. A conserving collision construction then supplies a concrete attainable family, with an exact diamond-error formula and a uniform reference-return bound. These results connect the choice of record to observable dynamics and to the reference that pays for their implementation. A finite discrimination protocol states the required preparation, error tolerance, sample count, and independently calibrated time and energy scales. First public preprint release, version 1.0. The files include the PDF, the main TeX file, and a complete source archive with editable schematics and relevant verification supplements. AI-use disclosure: AI assistance was used for source analysis, mathematical exploration, manuscript drafting and revision, diagram preparation, and computational verification support. GPT-6 Astra reviews assessed arguments, scope, readability, and schematics. These were internal model reviews, not external peer review. Jonathan Washburn is the sole listed author and is responsible for the released manuscript.
A durable quantum record, the location of its coherence, and a uniquely actual outcome are different physical questions. We study their separation in a supplied finite-dimensional quantum theory. An explicit, time-independent apparatus couples a system–detector encoding to a controller, a distinct archive, and a finite returning source. A conditional energy penalty suppresses release of the original record without deleting its return coupling. An invariant reduction and a one-sided spectral-gap estimate yield a certified interval with archive occupation above 0.98438, controller-latched occupation above 0.99161, and filled-but-unlatched weight below 2.402 × 10^-7 in one stated design. The same record statistics admit different source-label overlaps and hence different coherence on a specified retained boundary. A conserved product of complementary exchanges accesses that coherence when the finite source is included. Given a calibrated multiregister reader, its finite-duration response separates the coherent apparatus from an independently added archive-gated reduction law, with the added process left active during readout. A conservative example retains a response gap above 0.01717 after separately stipulated one-percent error allowances. The contribution is the finite construction and its quantitative retention, access, and readout interfaces. Quantum carriers, Hamiltonian couplings, trace readout, source preparation, and the reader are supplied; local reader synthesis, empirical calibration, absolute rate selection, and unique-event actualization are not established. Paper code: CFQR-P1 (Complementarity-First Quantum Records — Paper 1). The associated bundle contains the technical supplement, editable LaTeX, numerical checking programs and rational certificates, and selected Lean sources with returned build and axiom-audit evidence. The 39 supporting declarations are partially formalized; eleven recorded type excerpts contain printing elisions. This is not end-to-end formalization, external human peer review, an experimental detection of fundamental collapse, or a derivation of unique-event actualization. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; author-owned software is MIT, subject to the bundle’s licence map and third-party notices.
Can fixed recognition interactions supply the control needed to write an exact record? We prove full unitary controllability on the 1,536-dimensional neutral sector of two source–reference pairs. The allowed controls are simultaneous sums of explicit local braid and paired-contact Hamiltonians, with adjustable positive strengths and durations; the original holding and positive scalar energy charges remain present. The main algebraic step converts effective control on a 1,024-dimensional matched subspace into control supported there, then uses a contact with an explicit right inverse to reach the remaining coordinates. Compact-group control gives actual finite words. An exact eight-label coherent readout follows, together with arbitrary encoded interventions and preparation of each label from one encoded blank. The four active cells sit in a fourteen-cell register: the other ten evolve by a retained unitary, with the same identity valid for every finite external reference. The result establishes exact existence within the prepared encoding, without a uniform synthesis-time or pulse-count bound.
A source-inclusive coherence observable is useful only when its measurement resources are admitted. This preprint constructs a bounded local reader for the conserved exchange observable of a specified finite quantum-record apparatus. A degree-three graph uses one independently prepared probe, twenty relays with arbitrary joint states, and finite-duration two-register extraction and full-SWAP interactions. The original apparatus Hamiltonian and an independently added archive-gated process remain active throughout their respective implementations. A prefix-dependent control-frame comparison, symmetry-resolved effect estimate, and explicit gain, phase and finite-slew waveform bounds yield a sufficient response separation greater than 0.005139889 for the stated fixed, fully accessible sixteen-position source and remaining response-error budgets. This is a conditional mathematical result, not measured hardware calibration, a partial-source-access theorem, or a unique diagnosis or derivation of fundamental collapse. The package contains the main manuscript, technical supplement, editable LaTeX, direct numerical reproduction sources, and accepted returned Mac evidence for 56 paper-specific supporting Lean declarations. That subset verifies selected algebra, scalar inequalities and the actual-constant numerical expression; it does not formalize the full physical/continuous-time theorem end-to-end. Separate-session AI review, numerical reproduction and returned kernel evidence are distinguished. Author-owned manuscripts, documentation and mathematical data are CC BY 4.0; newly authored numerical and Lean software is MIT. Predecessor and third-party notices remain unchanged; the reproduction package contains the licence map. No external funding; no competing interests declared. Public preprint v1.0; edition date 18 October 2026; DOI 10.5281/zenodo.23442579.
Can fixed recognition interactions supply the control needed to write an exact record? We prove full unitary controllability on the 1,536-dimensional neutral sector of two source–reference pairs. The allowed controls are simultaneous sums of explicit local braid and paired-contact Hamiltonians, with adjustable positive strengths and durations; the original holding and positive scalar energy charges remain present. The main algebraic step converts effective control on a 1,024-dimensional matched subspace into control supported there, then uses a contact with an explicit right inverse to reach the remaining coordinates. Compact-group control gives actual finite words. An exact eight-label coherent readout follows, together with arbitrary encoded interventions and preparation of each label from one encoded blank. The four active cells sit in a fourteen-cell register: the other ten evolve by a retained unitary, with the same identity valid for every finite external reference. The result establishes exact existence within the prepared encoding, without a uniform synthesis-time or pulse-count bound. The paper and source archive, including verify_certificates.py, are available at https://doi.org/10.5281/zenodo.23875346.