1. Problem statement
This paper examines whether the KEDDEH line-origin matrix architecture can be stated as a rigorous computational formalism with properties equivalent to those required for quantum computation. The construction begins from literal script lines, not from a conventional sparse-storage model or a hardware-first definition of compute.
Technical context
The underlying KEDDEH design treats a literal script line L as an accounted coordinate that may itself establish a local reference frame. Matrices can be drawn over the same line field, overlap, and recursively define further matrices. BRAINK preserves the resulting state and lineage; IL-LLM supplies recurrence/traversal; KEX supplies data/definition evolution.
The central research question is therefore not whether this architecture “looks quantum.” It is whether its native operations can derive the algebraic requirements needed to constitute a quantum-computational model without importing those properties merely by analogy.
Claim boundaryDEFINEDThe line-origin, matrix, overlap, recursive-space, BRAINK, IL-LLM and KEX architecture is the defined KEDDEH construction. CANDIDATEQuantum equivalence is a formal research claim. OPENA physical quantum implementation is not established by this document.
2. Notation and definitions
| Symbol | Definition in this paper | Status |
|---|---|---|
| L | An accounted literal script line or line-address serving as a local frame anchor. | Defined |
| M(L) | A matrix/frame resolved relative to line L. | Defined |
| Rk(L) | The kth resolved relational state/view over the same line field. | Defined abstraction |
| 𝓜 | Set of recursively addressable matrices/frames. | Formalised here |
| 𝓗K | Candidate global state space generated from admissible KEDDEH frames. | Candidate |
| Ψ | Candidate weighted global state over resolved frame states. | Candidate |
| U | Candidate reversible/norm-preserving state transition operator. | Open derivation |
| O | Observation operator mapping a pre-observation state to an observed outcome/readback. | Candidate mapping |
| K | KEX evolution operator over data/definitions/relations with lineage preservation. | Defined architecture |
3. Construction rules / axioms used by the model
- Line-origin rule. A valid addressed line L can serve as the local reference origin for a matrix resolved through that line.
- No operative zero-origin rule. Numeric zero is not required as an object-state origin; the KEDDEH operative matrix is written −3 | −2 | 1 | +2 | +3 with 1 as the first valid whole state.
- Frame recursion rule. A coordinate resolved from one matrix may itself become the origin of a descendant matrix.
- Overlap rule. A literal line may participate in more than one matrix/frame simultaneously as a shared coordinate.
- Identity preservation rule. Shared coordinate membership does not require literal duplication of the underlying line.
- State persistence rule. BRAINK carries the persistent state, memory-in-time, definitions, lineage and continuation.
- Traversal rule. IL-LLM traverses valid relations between addressable states/frames.
- Evolution rule. KEX evolves data and definitions through typed deltas while preserving predecessor lineage.
ImportantRules 1–8 define the KEDDEH computational construction. They do not yet prove Hilbert-space structure, complex amplitudes, unitarity, Born-rule measurement, or quantum computational advantage. Those properties are validation targets below.
4. Line L as the local origin
The key geometric step is to treat the line itself as the local reference frame. This removes the need to begin the operative state geometry from a universal numeric zero.
Li ≡ Oi
(1)
Equation (1): addressed line Li supplies local origin Oi.
Figure 1. Local line-origin construction. The line L anchors a five-position relational matrix. The diagram is a representation of the defined KEDDEH geometry, not a Bloch-sphere or qubit diagram.
M(L) = {−3, −2, 1, +2, +3}L
(2)
Li → Mi → Li,j → Mi,j → …
(3)
Worked derivation: one origin to two recursive levels
STEP 1
Choose one addressed line L and declare it the local origin by Eq. (1).
STEP 2
Resolve five admissible positions using Eq. (2).
STEP 3
Permit each resolved position to address a descendant line/frame according to the recursion rule.
STEP 4
The second level has at most 5 × 5 = 25 ordered coordinate combinations before overlap/equivalence constraints are applied.
5. Overlapping matrices over the same literal line field
The stencil/book analogy can be stated technically: a common accounted carrier L admits more than one resolving map Mk. The resolved state is a function of the carrier and the chosen frame.
Rk = Mk(L)
(4)
Ra = Ma(L), Rb = Mb(L), Ma ≠ Mb
(5)
Figure 2. Example of three matrices sharing coordinates in one literal script-line field. This demonstrates relational overlap and carrier reuse. It does not by itself demonstrate superposition or entanglement.
A = {L₁,L₂,L₃}, B = {L₂,L₃,L₄} ⇒ A∩B = {L₂,L₃}
(6)
Consistency checkEquation (6) establishes shared coordinate membership. A quantum-entanglement claim requires a stronger result: the joint state must be non-factorable under the model's state algebra.
6. Recursive / cascading state-space algebra
For a local basis cardinality d and recursion depth n, the unconstrained ordered product space has cardinality dn. For the five-state KEDDEH matrix:
S(n) = 5n
(7)
| Depth n | Unconstrained ordered combinations 5n | Interpretation |
|---|---|---|
| 1 | 5 | One local matrix. |
| 2 | 25 | Two recursive frame levels. |
| 3 | 125 | Three levels. |
| 6 | 15,625 | Combinatorial state-space size before constraints/equivalences. |
| 10 | 9,765,625 | Mathematical state-space count, not a throughput benchmark. |
Executable cardinality explorer
This tool calculates state-space cardinality only. It does not claim that every state is separately stored or executed.
Single cascade
Joint unconstrained product
Literal line/frame references (illustrative)
live
BoundaryExponential cardinality is necessary to compare state-space structure, but it is not evidence of quantum speedup. The research burden is to show that transformations operate on the encoded global state with quantum-equivalent semantics and cost.
7. Candidate weighted global-state algebra
To move from overlapping relational views to a quantum-computational formalism, the model requires a state algebra capable of expressing weighted combinations of basis/resolved states.
|Ψ⟩ = Σk αk|Rk⟩
(8)
Σk|αk|² = 1
(9)
Candidate, not imported factEquation (9) is the conventional normalisation target used for comparison. KEDDEH must derive an equivalent conserved invariant from its own matrix/transition mechanics if quantum equivalence is asserted.
Worked numerical reference example
STEP 1
Let α = 1/√2 and β = i/√2.
STEP 2
|α|² = 1/2 and |β|² = 1/2.
STEP 3
|α|² + |β|² = 1. This is a conventional quantum reference calculation. The unresolved KEDDEH task is to derive the meaning and update law for α and β natively.
8. Separability / non-separability test
Overlap becomes quantum-relevant only if a joint state cannot be expressed as a product of independent subsystem states.
|ΨAB⟩ = Σi,j cij|aᵢ⟩⊗|bⱼ⟩
(10)
separable ⇔ ∃aᵢ,bⱼ : cij = aᵢbⱼ
(11)
entangled candidate ⇔ no such factorisation exists
(12)
Required testConstruct an explicit KEDDEH joint-state coefficient object from overlapping line-origin matrices, attempt factorisation, and preserve a machine-checkable non-factorability receipt. Mere geometric overlap is insufficient.
9. Phase and interference test
The decisive distinction between a large relational state space and a quantum state space is interference. Interference requires a phase-sensitive algebra.
A = raeiφa, B = rbeiφb
(13)
|A+B|² = ra² + rb² + 2rarbcos(φa−φb)
(14)
| Relative phase | Cross term | Expected effect |
|---|---|---|
| φa−φb = 0 | +2rarb | Constructive reinforcement |
| φa−φb = π | −2rarb | Destructive cancellation |
Falsification gateThe KEDDEH bilateral matrix must produce a native, conserved phase/amplitude relation capable of reproducible reinforcement/cancellation. If the signs −3, −2, 1, +2, +3 cannot support such an internally derived law, the quantum-equivalence claim fails at this gate.
10. Observer and measurement mapping
KEDDEH already separates observer/reference state from the operative object-state geometry. This supplies a natural place to define an observation operator without making zero the origin of the object state.
O : Ψ → si
(15)
P(si) = |αi|²
(16)
Open derivationEquation (16) is the conventional Born-rule target. The KEDDEH formalism must derive its own observation law and show equivalence if equivalence is claimed. BRAINK lineage can preserve the pre-observation state, observer frame, outcome and evidence receipt.
11. Candidate formal machine
QK = (L, 𝓜, 𝓗K, Ψ, U, O, K)
(17)
| Component | Technical role | Current maturity |
|---|---|---|
| L | Accounted literal line-space / local origins. | Defined architecture |
| 𝓜 | Recursive matrix/frame set. | Defined/formalised |
| 𝓗K | Candidate global state space generated by valid frame compositions. | Candidate formal object |
| Ψ | Weighted global state. | Open native algebra |
| U | Reversible/norm-preserving transition operator. | Open |
| O | Observation operator. | Candidate mapping |
| K | KEX data/definition evolution. | Defined architecture; quantum-preserving restrictions open |
U†U = I
(18)
Equation (18) is the standard unitary condition used as the validation target for the quantum-preserving transformation subset.
12. Comparison against conventional quantum-computation requirements
| Requirement | Conventional role | KEDDEH analogue / candidate | Status |
|---|---|---|---|
| Basis state space | Qubit/qudit basis and tensor-product composition. | Line-origin matrix basis and recursive frame composition. | Structurally defined; equivalence open. |
| Superposition | Complex linear combination of basis states. | Weighted combination of resolved matrix states. | Candidate; native weight algebra open. |
| Normalisation | Unit norm. | Conserved KEDDEH state-weight invariant. | Not yet derived. |
| Phase | Relative complex phase affects interference. | Potential bilateral/sign relational phase law. | Not yet derived. |
| Interference | Amplitude reinforcement/cancellation. | Multi-route line/matrix recombination. | Requires reproducible proof. |
| Entanglement | Non-separable joint state. | Overlapping/shared frame state with non-factorability. | Overlap exists; non-separability not yet proven. |
| Unitary evolution | Norm-preserving reversible operation. | Restricted KEX/IL-LLM transition algebra. | Open. |
| Measurement | Outcome probabilities from state amplitudes. | Observer² / BRAINK readback with derived outcome law. | Mapping exists conceptually; law open. |
13. Mapping into BRAINK / IL-LLM / KEX
Literal accounted line L
↓ establishes local frame
Matrix M(L)
↓ resolves relations / overlapping state coordinates
BRAINK persistent state
↓ IL-LLM recurrent traversal
reachable state / relation
↓ KEX typed data or definition evolution
successor state + predecessor lineage + evidence
↓
BRAINK continuation
This implementation mapping is important because the formal model is not intended to exist only as notation. Each formal object should correspond to an addressable software object, transition, evidence receipt or falsifiable test.
| Formal object | Software object required | Readback |
|---|---|---|
| L | Stable line/address identity | Address resolves same literal/accounted line |
| M(L) | Matrix definition bound to L | Exact matrix members and relations |
| Ψ | Canonical weighted-state object | Weights, basis IDs, invariant checksum |
| U | Transition operator | Pre/post state plus reversibility/norm receipt |
| O | Observer/readback operator | Observer frame, outcome, preserved predecessor |
14. Falsification and reproducibility protocol
A publishable claim should advance only through the following chain:
CLAIM → DEFINITION → FORMULA → WORKED EXAMPLE → INTERNAL CONSISTENCY → IMPLEMENTATION → EXECUTION → READBACK → FALSIFICATION TEST → INDEPENDENT REPRODUCTION → CLAIM MATURITY UPDATE
| Gate | Pass condition | Failure meaning |
|---|---|---|
| G1 Definition closure | Every symbol and state class has an unambiguous definition. | Formalism is not yet well-defined. |
| G2 Algebra closure | Native state combination, invariant, phase and transition laws are defined. | Quantum claim remains analogy/candidate only. |
| G3 Interference | Constructive/destructive interference reproduced from native mechanics. | No quantum-equivalent interference proof. |
| G4 Non-separability | Machine-checkable joint state cannot factor. | Overlap is only classical shared structure. |
| G5 Reversibility/unitarity | Transformation subset proves norm preservation and invertibility/equivalent. | Quantum-preserving evolution unproven. |
| G6 Measurement | Native observer law predicts outcomes and matches chosen quantum reference cases. | Measurement equivalence unproven. |
| G7 Algorithm | Canonical quantum algorithm reproduced with semantic equivalence. | Computational equivalence unproven. |
| G8 Independent replication | External reviewer reproduces all above from published harness. | Claim remains internally demonstrated only. |
15. Conventional reference points and attribution boundary
- Microsoft Azure Quantum, The qubit in quantum computing — conventional state-vector, normalisation and measurement reference.
- Microsoft Azure Quantum, Entanglement and correlations — conventional non-separability reference.
- Google Quantum AI / Cirq, Operators and observables — conventional unitary/operator reference.
- Google Quantum AI / Cirq, interference/phase explanatory material — conventional phase/interference reference.
AttributionThe KEDDEH-specific line-origin matrix construction, 1-Keddeh Matrix framing, BRAINK/IL-LLM/KEX relationship and associated proposed formalisation are attributed to A. Keddeh. Conventional quantum references are used only to define the external comparison tests.
AI assistance: document engineering, algebra presentation, test-structure drafting and interface implementation. Origin/inventorship claims are not transferred by that assistance.