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

Symplectic Symmetry from a Source with Memory

Washburn

Published Oct 25, 2026• 1 citation
Publisher

Abstract

Which changes of frame preserve a source together with the records it can carry? For the native eight-state cell of Recognition Science, we classify the unitary transformations preserving its six-dimensional contact space and admitting covariance of the full populated-record source. The source forces commutation with the literal half-cycle. In the contact coordinates this is the conformal symplectic equation BᵀJB = wJ. The represented group is (Sp(2) × U(1))/ℤ₂, with an eleven-dimensional Lie algebra. We derive the source commutant, the faithful representation and its observable kernel, and show how one shared control transports both retained references while leaving the readers unchanged in operator closure. The mechanism is explicit: record mixing identifies three source components, and the half-cycle turns that identification into an alternating form on the contact carrier.

DOI
10.5281/zenodo.23647586

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

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×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.

•Oct 25, 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

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

Non-Abelian M-Event Dynamics on the Physical–Observation State Bundle

Xianwei Meng

Born probabilities determine the distribution of individual records, but leave their temporal relations open. In the U(1) M-event model a transported circle phase carries path memory; fixed transports on the same fiber nevertheless commute. We extend the event selector to a nontrivial compact connected finite-dimensional Lie group within the physical–observation dual-axis structure. One action governs the selector, its conjugate charge and their coupled motion on the two-axis base. A Haar initial selector, independent of the other initial data and prescribed controls, preserves the Born probabilities at every observation. Non-Abelian transport changes the relations between records. For balanced hemisphere readout on the full SU(2) group, we derive the exact law Pmis = α/π, relating the mismatch probability to the transport’s conjugacy angle. In a U(1) × SU(2) realization, a central charge sustains the original M response, while a periodic potential preserves its orbit and phase integral and makes finite deviations exactly harmonic. A classical pointer action gives hemisphere readout and a two-period SU(2) return for the stated apparatus preparation. With the faithful fixed-axis coupling, four blocks of 25 periods produce α25 = 1.012373567 . . .. If readout retains the selector after either outcome, the third supercycle differs from the initial record with probability 96.6746%, and the sixth agrees with it with probability 93.3491%. Independent response and matrix measurements fix these values before the event sequence is observed. Scans of axis angle and block length test the relation between noncommuting transport and event memory.

•Sep 21, 2026•0 citations

Complex Structure and Composition from Finite Real Source Histories: An Artian Frame-Cycle Construction

Attar Ali

How a finite real cycle acquires a complex structure and a rule for composition Quantum theory uses a common imaginary unit when individual systems become a composite. This framework constructs that compatibility from finite real source histories. On the complete contrast sector of a three-cycle, the forward and backward comparisons give \[\boxed{J=\frac{P-P^2}{\sqrt{3}},\qquad J^2=-I}\] The complex structure appears after the real comparison is specified. At a qualified unmarked boundary, opposite reference shifts select \[\boxed{Q_{AB}=\frac{I-J_A\otimes J_B}{2}}\] The range is the balanced complex tensor product. Its many-source composition is associative. A finite controlled contact supplies a nonfactorizable complex-linear operation, and exact residual bounds quantify departure from the selected sector. A source model that produces the contact A reversible controller compares operation orders on 24 proper signed frames. Its ordered, arrow-insensitive axis detector produces the retained cyclic response. The contact algebra gives \[\frac{[G,G]}{[[G,G],[G,G]]}\cong C_3.\] The construction prints the controller, scratch cleanup, full contrast probes, admissible operations and refusal states. A triaxial real response tensor realizes the detector and provides an explicit map between material contrasts and event-count contrasts. A record must survive the test of future operations A present tensor can hide a material marker that a later operation reveals. The framework derives independent force-gradient calibration and a delayed odd-field release. With a nonzero release field, energy and vector torque reconstruct the entire marker change: \[D_U=-\Delta\mathbf{p}\cdot\mathbf{E},\qquad \mathbf{D}_{\tau}=\Delta\mathbf{p}\times\mathbf{E}.\] \[\boxed{\Delta\mathbf{p}=\frac{\mathbf{E}\times\mathbf{D}_{\tau}-D_U\mathbf{E}}{|\mathbf{E}|^2}}\] The test includes shared calibration errors, stray fields, finite release pulses, marker relaxation and a complete operation inventory. It distinguishes detection of a retained record from agreement with its frozen prediction and from discrimination between physical theories. From proved structure to existing experiments The paper adds a conditional probability-correspondence theorem for the balanced composite, examines independent-source quantum-network experiments, and reproduces all eight measured rows of a public torque dataset. These supply composition benchmarks and demonstrated apparatus capabilities. Their published significances are kept attached to the hypotheses they actually test. The calibrated material release law is also a conventional electrostatic prediction; it is not presented as a QTT-exclusive signal. One material coefficient, two readouts A new archival calculation transfers a published same-particle libration calibration to a separate precession measurement. In the qualified rotor regime, the cross-readout relation is \[\Xi=\frac{\omega_s\Omega E_l\cos\phi_l}{\omega_{\mathrm{lib}}^2E_p}=\frac{a_{\mathrm{prec}}}{a_{\mathrm{lib}}}.\] An unchanged dipole-to-inertia coefficient gives unity. The calculation yields a slope of 2.909 from the libration calibration, compared with the published precession slope of 2.950, a central difference of 1.4135%. This shared electrostatic consistency relation eliminates the separate dipole and inertia; unequal field gains, dynamical corrections and shared uncertainty remain explicit. Reversal and long-term dipole-stability observations identify complementary laboratory capabilities. The complete matched-tensor delayed-release test remains an experimental target. When do two descriptions differ in any future experiment? The finite-reference extension follows a controlled source contact through shared references, fresh references, inverse operations, intermediate measurements and feedback. Its complete order-three response is \[g_n=\sum_{k=0}^{2}p_k\zeta^{kn},\qquad \zeta=e^{2\pi i/3},\qquad g_3=1,\qquad g_2=\overline{g_1}.\] A finite observable-span algorithm tests two fully specified models across every permitted future word. It either certifies agreement or returns the preparation, operation sequence, terminal outcome and exact probability difference. In the populated compatible-instrument benchmark, the complete quantum representation gives the same records without an additional target fit. A source-selected physical coupling or preparation remains a distinct route to predictive value. The framework includes nine vector figures, the retained source proofs and countermodels, complete reference-history benchmarks, calibration and vector-reconstruction theorems, runnable exact and numerical checks, published-input receipts, a data assessment and an experimental packet specification. The introduction defines the QTT terms needed to follow the construction without prior familiarity with the corpus. The probability-interface theorem, finite-memory bounds and covariance-weighted witness specify which further laboratory comparisons can distinguish physical models. Source anchors QTT Main Book, especially pp. 56, 248-250, 352 and 827-829; Artian's Completed-Event Four-Capacity Theorem; Frame-cycle derivation map, completed-event lexicon, and Artian's Universe and laboratory readout. Stable citation: 10.5281/zenodo.22882084.

•Sep 21, 2026•7 citations
Which changes of frame preserve a source together with the records it can carry? For the native eight-state cell of Recognition Science, we classify the unitary transformations preserving its six-dimensional contact space and admitting covariance of the full populated-record source. The source forces commutation with the literal half-cycle. In the contact coordinates this is the conformal symplectic equation BᵀJB = wJ. The represented group is (Sp(2) × U(1))/ℤ₂, with an eleven-dimensional Lie algebra. We derive the source commutant, the faithful representation and its observable kernel, and show how one shared control transports both retained references while leaving the readers unchanged in operator closure. The mechanism is explicit: record mixing identifies three source components, and the half-cycle turns that identification into an alternating form on the contact carrier.
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.
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.
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.
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.
Born probabilities determine the distribution of individual records, but leave their temporal relations open. In the U(1) M-event model a transported circle phase carries path memory; fixed transports on the same fiber nevertheless commute. We extend the event selector to a nontrivial compact connected finite-dimensional Lie group within the physical–observation dual-axis structure. One action governs the selector, its conjugate charge and their coupled motion on the two-axis base. A Haar initial selector, independent of the other initial data and prescribed controls, preserves the Born probabilities at every observation. Non-Abelian transport changes the relations between records. For balanced hemisphere readout on the full SU(2) group, we derive the exact law Pmis = α/π, relating the mismatch probability to the transport’s conjugacy angle. In a U(1) × SU(2) realization, a central charge sustains the original M response, while a periodic potential preserves its orbit and phase integral and makes finite deviations exactly harmonic. A classical pointer action gives hemisphere readout and a two-period SU(2) return for the stated apparatus preparation. With the faithful fixed-axis coupling, four blocks of 25 periods produce α25 = 1.012373567 . . .. If readout retains the selector after either outcome, the third supercycle differs from the initial record with probability 96.6746%, and the sixth agrees with it with probability 93.3491%. Independent response and matrix measurements fix these values before the event sequence is observed. Scans of axis angle and block length test the relation between noncommuting transport and event memory.
How a finite real cycle acquires a complex structure and a rule for composition Quantum theory uses a common imaginary unit when individual systems become a composite. This framework constructs that compatibility from finite real source histories. On the complete contrast sector of a three-cycle, the forward and backward comparisons give J=P−P23,J2=−I\boxed{J=\frac{P-P^2}{\sqrt{3}},\qquad J^2=-I}J=3​P−P2​,J2=−I​ The complex structure appears after the real comparison is specified. At a qualified unmarked boundary, opposite reference shifts select QAB=I−JA⊗JB2\boxed{Q_{AB}=\frac{I-J_A\otimes J_B}{2}}QAB​=2I−JA​⊗JB​​​ The range is the balanced complex tensor product. Its many-source composition is associative. A finite controlled contact supplies a nonfactorizable complex-linear operation, and exact residual bounds quantify departure from the selected sector. A source model that produces the contact A reversible controller compares operation orders on 24 proper signed frames. Its ordered, arrow-insensitive axis detector produces the retained cyclic response. The contact algebra gives [G,G][[G,G],[G,G]]≅C3.\frac{[G,G]}{[[G,G],[G,G]]}\cong C_3.[[G,G],[G,G]][G,G]​≅C3​. The construction prints the controller, scratch cleanup, full contrast probes, admissible operations and refusal states. A triaxial real response tensor realizes the detector and provides an explicit map between material contrasts and event-count contrasts. A record must survive the test of future operations A present tensor can hide a material marker that a later operation reveals. The framework derives independent force-gradient calibration and a delayed odd-field release. With a nonzero release field, energy and vector torque reconstruct the entire marker change: DU=−Δp⋅E,Dτ=Δp×E.D_U=-\Delta\mathbf{p}\cdot\mathbf{E},\qquad \mathbf{D}_{\tau}=\Delta\mathbf{p}\times\mathbf{E}.DU​=−Δp⋅E,Dτ​=Δp×E. Δp=E×Dτ−DUE∣E∣2\boxed{\Delta\mathbf{p}=\frac{\mathbf{E}\times\mathbf{D}_{\tau}-D_U\mathbf{E}}{|\mathbf{E}|^2}}Δp=∣E∣2E×Dτ​−DU​E​​ The test includes shared calibration errors, stray fields, finite release pulses, marker relaxation and a complete operation inventory. It distinguishes detection of a retained record from agreement with its frozen prediction and from discrimination between physical theories. From proved structure to existing experiments The paper adds a conditional probability-correspondence theorem for the balanced composite, examines independent-source quantum-network experiments, and reproduces all eight measured rows of a public torque dataset. These supply composition benchmarks and demonstrated apparatus capabilities. Their published significances are kept attached to the hypotheses they actually test. The calibrated material release law is also a conventional electrostatic prediction; it is not presented as a QTT-exclusive signal. One material coefficient, two readouts A new archival calculation transfers a published same-particle libration calibration to a separate precession measurement. In the qualified rotor regime, the cross-readout relation is Ξ=ωsΩElcos⁡ϕlωlib2Ep=aprecalib.\Xi=\frac{\omega_s\Omega E_l\cos\phi_l}{\omega_{\mathrm{lib}}^2E_p}=\frac{a_{\mathrm{prec}}}{a_{\mathrm{lib}}}.Ξ=ωlib2​Ep​ωs​ΩEl​cosϕl​​=alib​aprec​​. An unchanged dipole-to-inertia coefficient gives unity. The calculation yields a slope of 2.909 from the libration calibration, compared with the published precession slope of 2.950, a central difference of 1.4135%. This shared electrostatic consistency relation eliminates the separate dipole and inertia; unequal field gains, dynamical corrections and shared uncertainty remain explicit. Reversal and long-term dipole-stability observations identify complementary laboratory capabilities. The complete matched-tensor delayed-release test remains an experimental target. When do two descriptions differ in any future experiment? The finite-reference extension follows a controlled source contact through shared references, fresh references, inverse operations, intermediate measurements and feedback. Its complete order-three response is gn=∑k=02pkζkn,ζ=e2πi/3,g3=1,g2=g1‾.g_n=\sum_{k=0}^{2}p_k\zeta^{kn},\qquad \zeta=e^{2\pi i/3},\qquad g_3=1,\qquad g_2=\overline{g_1}.gn​=∑k=02​pk​ζkn,ζ=e2πi/3,g3​=1,g2​=g1​​. A finite observable-span algorithm tests two fully specified models across every permitted future word. It either certifies agreement or returns the preparation, operation sequence, terminal outcome and exact probability difference. In the populated compatible-instrument benchmark, the complete quantum representation gives the same records without an additional target fit. A source-selected physical coupling or preparation remains a distinct route to predictive value. The framework includes nine vector figures, the retained source proofs and countermodels, complete reference-history benchmarks, calibration and vector-reconstruction theorems, runnable exact and numerical checks, published-input receipts, a data assessment and an experimental packet specification. The introduction defines the QTT terms needed to follow the construction without prior familiarity with the corpus. The probability-interface theorem, finite-memory bounds and covariance-weighted witness specify which further laboratory comparisons can distinguish physical models. Source anchors QTT Main Book, especially pp. 56, 248-250, 352 and 827-829; Artian's Completed-Event Four-Capacity Theorem; Frame-cycle derivation map, completed-event lexicon, and Artian's Universe and laboratory readout. Stable citation: 10.5281/zenodo.22882084.