Operational BHR/BMR Bridge: Heritage/Memory Bifurcation as Two Readouts of One Two-Qubit State, with Embedding in the JANO-1 Circuit — RCD Program, Technical Note JANO-BR-0 (v0.1)
Technical Note JANO-BR-0 of the RCD program (continues “La doble herencia de la coherencia”, DOI 10.5281/zenodo.23520439; the Adjudication Record “Relational Memory under Causal Erasure”, DOI 10.5281/zenodo.23717352; BMR-1, DOI 10.5281/zenodo.23717139; and REP-0, DOI 10.5281/zenodo.23774093). Question: can the heritage/memory bifurcation of BHR-BMR become a physical readout of one and the same circuit? Results (exact, no hardware): in BHR-3 the mixed relational-memory state ρ_mix(r) has rank 2 whenever Ω₃ > 0, so a single qubit c purifies it, |Ψ(r)⟩ = √λ₊|0⟩|ψ₊⟩ + √λ₋|1⟩|ψ₋⟩, with a three-gate {Ry, CNOT} construction and a closed map r ↦ (θ_c, η); tracing out c returns ρ_mix (R⊥), while measuring c in the HJW basis leaves the system exactly in the coherent-heritage state ρ_coh with probability p_coh = Tr D_coh/Tr D_mix and in the residual-memory state |−⟩ (independent of r) with probability p_M; the three readouts are tied by the exact identity V_mix = p_coh·V_coh − p_M (at r = 1: 145/149 = 147/149 − 2/149). Verified against the original JANO-1 code: the five-qubit JANO-1 circuit with α = α_BR(r) = arcsin √λ₋(r) is literally this purification, and its frozen observables reduce to P_rec = λ₊ and R∥ = R⊥ = √(2λ₊λ₋) = √S_lin(ρ_mix) — a spectral readout of the memory — while the HJW readout is the complementary face that separates heritage from memory. Stated limit: the construction reproduces ρ_mix(r) by design and is not a falsifiable prediction of RCD; hardware stays closed. Scripts with SHA-256 manifest. English and Spanish versions; the Spanish text prevails.
Technical Note JANO-BR-0 of the RCD program (continues “La doble herencia de la coherencia”, DOI 10.5281/zenodo.23520439; the Adjudication Record “Relational Memory under Causal Erasure”, DOI 10.5281/zenodo.23717352; BMR-1, DOI 10.5281/zenodo.23717139; and REP-0, DOI 10.5281/zenodo.23774093). Question: can the heritage/memory bifurcation of BHR-BMR become a physical readout of one and the same circuit? Results (exact, no hardware): in BHR-3 the mixed relational-memory state ρ_mix(r) has rank 2 whenever Ω₃ > 0, so a single qubit c purifies it, |Ψ(r)⟩ = √λ₊|0⟩|ψ₊⟩ + √λ₋|1⟩|ψ₋⟩, with a three-gate {Ry, CNOT} construction and a closed map r ↦ (θ_c, η); tracing out c returns ρ_mix (R⊥), while measuring c in the HJW basis leaves the system exactly in the coherent-heritage state ρ_coh with probability p_coh = Tr D_coh/Tr D_mix and in the residual-memory state |−⟩ (independent of r) with probability p_M; the three readouts are tied by the exact identity V_mix = p_coh·V_coh − p_M (at r = 1: 145/149 = 147/149 − 2/149). Verified against the original JANO-1 code: the five-qubit JANO-1 circuit with α = α_BR(r) = arcsin √λ₋(r) is literally this purification, and its frozen observables reduce to P_rec = λ₊ and R∥ = R⊥ = √(2λ₊λ₋) = √S_lin(ρ_mix) — a spectral readout of the memory — while the HJW readout is the complementary face that separates heritage from memory. Stated limit: the construction reproduces ρ_mix(r) by design and is not a falsifiable prediction of RCD; hardware stays closed. Scripts with SHA-256 manifest. English and Spanish versions; the Spanish text prevails.
We present a development of the RCD program (Radial Coherential Dynamics) in the complex scalar sector of quantum sequential growth of causal sets. The central question is not only how a causal history grows, but how much of the information about HOW IT WAS FORMED can survive when one of its elements is erased without privileging any temporal label. The central result is an exact separation between coherent inheritance and memory of the cut. For the erasure branches a_i (i = 0, …, N−1), define the branch matrix 𝒜_N = N^(−1/2) [a_0, …, a_{N−1}], the uniform register mode |u_N⟩ = N^(−1/2)(1, …, 1), and Q_N = I − |u_N⟩⟨u_N|. The memory matrix M_N = D_mix − D_coh = 𝒜_N Q_N 𝒜_N† ⪰ 0 identifies exactly the memory sector orthogonal to coherent inheritance. Its trace, Tr M_N = (1/2N²) Σ_{i,j} ‖a_i − a_j‖², is the pairwise dispersion of the causally distinct erasure alternatives: relational memory is precisely that dispersion. The Relational Inheritance Bifurcation theorem (BHR-3) shows already at N = 3 that the inherited amplitude can coincide exactly while non-zero memory of the mode of formation persists: Δ₃^coh = 0 together with Ω₃ > 0, where D_mix − D_coh = Ω₃ · [[1, −1], [−1, 1]]. At the exact point r = 1, Ω₃ = 1/294; the reading with the register traced out has spectrum {147/149, 2/149} and visibility 145/149, while the coherent reading remains pure. One and the same observable inheritance can therefore coexist with residual relational information about its formation. The second main result is an exact memory-flow law. On the star family 𝒮_N — an antichain of N−1 elements with one element above all of them — covariant coherent erasure is closed for every N. With p = ε/(t₀+ε), p′ = (N−1) p / N, P := p/N = constant, and the complete coupling trajectory is ε_n = n ε_N / (N + (N−n) ε_N). The memory has rank one, M_N = (N−1)|P|² J with J = [[1, −1], [−1, 1]], so that Ξ := M_N/(N−1) = |P|² J is an exact invariant of the flow, M_{N−1} = M_N − Ξ, and 𝓜_N − 𝓜_{N−1} = 2|P|²: each coarse-graining step transports an exactly determined amount of relational memory. The star spine 𝒮₄ also appears as an exact component of the closure variety of the 4→3 flow. The non-degenerate regular branch C₁₂ is born tangent to this spine and inherits, at leading order, its memory-contraction factor 2/3. The deposit also contains the prior results leading to this structure: absence of a non-trivial scalar fixed point under uniform incoherent erasure (𝔗_mix); absence of a non-trivial fixed point under the uniform coherent superposition (𝔗_coh), which equals the classical PF-0 condition complexified; the need to formulate erasure covariantly by classes; the rational renormalization map on the closure variety; and the minimal register compression, rank D_mix = rank M_N + 1. These results motivate the Principle of Relational Memory of the Cut, dynamical version (PMRC-D): every fundamental physical differentiation that produces causally distinguishable histories must also determine, through a covariant rule, which information of that differentiation remains recorded and which information may interfere coherently. The emerging working thesis is: "The inheritance of a history does not by itself determine the memory of how it was formed." The program remains open toward closed sectors with several independent memory modes and a covariant dynamics capable of transporting those modes under coarse-graining. Exact results are N ≤ 4 except those with closed proofs for all N (the star spine and its flow); the 5→4 step outside 𝒮_N is numerical; the physical universality of PMRC-D remains open. No claim is made about the emergence of time, Mermin's 25 % or the necessity of H > 1 as a law. Deposit contents: RCD Adjudication Record v0.2 (signed Spanish original and English version; the Spanish text prevails), diligence notes 𝔗_mix-0, 𝔗_coh-0/𝔗_flow-0 and BMR-0 (Relational Memory), reproducible code with SHA-256 manifests, and README. Panel Cerezo credits: ChatGPT (formulation of the diligences, BHR-3, PMRC-D, 𝒜QA† form, invariant Ξ, series of C₁₂) and Claude (exact computation, lemmas, curve C and map R, star spine 𝒮_N, cross-verification and drafting), under the direction and adjudication of the principal.
Technical note BMR-1 of the RCD program (Radial Coherential Dynamics), continuing "Relational Memory under Causal Erasure" (10.5281/zenodo.23630978). The previous record found an exact memory-flow law on the star family, which carries a single memory mode. This note asks for the minimal causal architecture able to carry two independent memories and survive its own coarse-graining. Three exact results. (1) Branch–rank lemma: if the N erasure positions produce r distinct branches, rank M_N ≤ r − 1, with equality under affine independence; two modes require at least three causally inequivalent erasures. (2) The P2_n sector (a chain with one pendant element at height ≤ 2) is closed under erasure for all n ≥ 4, has unbounded height and two exact memory modes: exact transfer map R_n, two flow invariants (y, J), closed-form solution, Hermitian memory M_n with rank 2 iff uv ≠ 0, and linear transport of (|u|², Re ūv, Im ūv, |v|²) with spectrum {a², ac, ac, c²}, a = (n−2)/n, c = (n−3)/n; the relative phase is carried as an independent memory component. (3) Step-closure theorem: the support of every Rideout–Sorkin (RS) amplitude is fixed by the local pair (|↓x|, #max ↓x) and always contains the antichain, so no closed family omitting it, P2_n in particular, admits an RS realization; the star is the only RS-supportable family found. An exact classification of RS closure families 5→4 on restricted supports finds only the star line, plus a certified isolated conjugate pair that closes one step and not the next. The obstruction is against the locality of the RS amplitude support, not against scalar amplitudes as such. Includes the erasure automaton of unlabeled posets up to N = 7 (1, 2, 5, 16, 63, 318, 2045 classes) and all scripts with a SHA-256 manifest. Exact results are stated as such; the enumeration of isolated points on large supports is not certified. English and Spanish versions; the Spanish text prevails. Developed at the Panel Cerezo: ChatGPT (formulation of BMR-1, branch–rank lemma, Hermitian correction), Claude (automaton, P2_n, step-closure theorem, classification, verification and drafting), under the direction and adjudication of the principal.
Technical Note I-C of the RCD program, Act I (continues I-B1, DOI 10.5281/zenodo.23990720; I-B0, DOI 10.5281/zenodo.23965760; and I-A0/I-A1, DOI 10.5281/zenodo.23961107). I-B1 left the boundary that every realization is a sample entering conditionally; I-C asks whether an event can be registered without consuming the coherence needed for the next one, leave an inheritable trace, and take part in an inheritance network. In the tracial sector ρ = P/r (r = 2, 3, 4; no hardware; theorems with numerical control, 92 checks with declared tolerances, all passed), results: (I) Register-with-Residual-Capacity Theorem. A rank-one reading on the whole system admits only nuclear instruments (Haapasalo–Pellonpää) and hence breaks entanglement (Horodecki–Shor–Ruskai); the family A_η(Q) = (1−η)P + ηrQ with Lüders operation L_Q = aP + bQ gives, for 0 < η < 1, an informative reading (I_η > 0, with I₁ = ln r − H_r + 1) together with a non-entanglement-breaking depolarizing channel, p_η = 1 − b²/(r+1) > 1/(r+1), whose posterior state (1−η)P/r + ηQ is the I-B1 segment produced by a mechanism. Exact non-Markovianity on labels, k(Q₃|Q₁,Q₂) − k(Q₃|Q₂) = η²√(1−η²) in r = 2. Finite-history reversal theorem: w_n(Q₁…Q_n) = w_n(Q_n…Q₁) for every n, so no arrow comes from label statistics. Four separate persistences: the classical archive; the averaged residual, decaying as ηp_ηⁿ and never zero; entanglement with discarded registers, dying at n_EB = ⌈ln(1/(r+1))/ln p_η⌉; and entanglement with kept registers, with Schmidt rank r along every trajectory and the exact bound λ_min ≥ [(1−η)/(1+(r−1)η)]ⁿ/r — flagged-survival corollary: with the classical register kept the negativity is an integral of branch negativities and stays positive for every finite n; the classical register is the flag that preserves the resolution of entangled branches, not a source of entanglement. (II) Inheritance network, ratified conditionally under a declared connection scheme H_con (carrier registers): acyclicity by strict inclusion, invariance of density, state, registers and predecessors under all compatible linear extensions and relabeling, rhombus with incomparability sustained by commutation and no-signaling, and the exact counterexample 13/8, 5/4, 1/16 showing that a product label does not imply independence (local statistics factorize iff the posterior is a product). Orientation: the boundary source dies (P/r has a preimage; in a qubit L_{Q⊥}L_Q = √(1−η²)P), the contraction source belongs to the average, and accumulation remains declared. Locality no-go: the Kraus operators span M_r, the commutant is trivial and Fix(Φ_η) = ℂP, even for product labels on ℂ²⊗ℂ²: locality cannot be extracted from the algebra of the global instrument. Diagnostics: Rideout–Sorkin Bell causality transcribed to the label law fails; the prefixed rhombus network is not sprinkling-like. Not claimed: time, space, gravity, irreversibility, Bell causality, asymptotic quantum capacity, or the derivation of η, accumulation, connections or factorization; the event debt (No Free Actualization) remains open. Scripts with SHA-256 manifest; run incidents documented. English and Spanish versions; the Spanish text prevails.
We propose to read spatial entanglement and interference between histories as two inheritances of a single coherence prior to the cut: a transverse residue across the partition A|B and a longitudinal residue along the causal order. The hypothesis proper to RCD is the Principle of Double Inheritance of Coherence (PDHC): one rule of differentiation determines at once what stays separated and what stays ordered. To make it an instrument we design JANO-1, a five-qubit circuit for superconducting processors in which a single cut, placed in superposition and then erased, is read twice: as entanglement between two qubits that never interacted and as an interference fringe between the histories “cut” and “no cut”. Exact simulation fixes the three predicted curves with one knob (the amplitude of the cut) and shows that a second knob (the coherence of the cut) makes the pair of residues fill a region, not a curve; the strong hypothesis is therefore stated as a precise question for the amplitude rule of PF2, and the JANO-2 phase returns to design. Nothing has run on hardware; the preregistration is conditional on a second key. Files: English version, Spanish version (the Spanish text is the reference text), and the Python code that reproduces every figure. Developed at the Panel Cerezo with cross-checking among AI tools (ChatGPT, Grok, Claude); the authorship of each contribution is stated in §10.
Causal-relational closure (CRC) distinguishes fixed local events from relations that remain open until an admissible future operation completes them. Two applications are simulated within standard quantum mechanics. The first is a relation-held quantum memory. A write event leaves a uniformly random record and a maximally mixed mediator, so the information exists only as a relation completed when read. After the record is scrambled into a six-qubit environment and discarded, recovery through the environment reaches average fidelity 0.870. A qubit spread over six hardware qubits running an unrelated Bernstein–Vazirani computation is recovered exactly. Tworobust versions follow. In the first, the data occupies the logical qubit of a Bacon–Shor subsystem code and the computation its gauge qubits; with gate and check noise of probability 10^−3, the data error falls 10 and 78 times below an unprotected qubit for code distances three and five. In the second, carriers are replaced while the relation is open, protection narrows once a record fixes the read basis, and faults are closed at read time. Under carrier-ageing noise, the error of the recorded-basis readout falls 19 to 290 times below a static Bacon–Shor memory, and 6 to 102 times with ancilla-based extraction. The second application is a post-hoc entanglement topology for quantum key distribution: a relay closes the requested pairing after users record key bits. Halving the stored qubits doubles the tolerable request latency, and relay storage conditioned on basis records extends it ninefold for an honest relay when bit flips are twentyfold slower than dephasing.
Technical Note I-A0/I-A1 of the RCD program, Act I (continues MEM-0, DOI 10.5281/zenodo.23926847). The Act I target sheet (v0.3, frozen, included) asks how a perfectly symmetric coherence can produce an inheritable distinction with no clock, no geometry and no external cut, and names three walls: I-A (Schur, fixed-point algebra), I-B (Petz, recoverability), I-C (Wiesbrock–Borchers, inheritance). This note closes the first two diligences of wall I-A in the finite control species: the algebra M_d(C), a state ω_ρ(A) = Tr(ρA) and the unchosen symmetry group G₀ = Aut(M_d, ω_ρ) ≅ ∏ U(n_a)/U(1). Results (theorems with numerical control in d = 2, 3, 4; no hardware): (I-A0) No-New-Distinction Theorem — the fixed-point algebra equals the double commutant {ρ}″ = W*(ρ) = ⊕ C P_a; no covariant distinction is born de novo: the maximally mixed state has none (and trivial modular flow), a non-tracial state has exactly the 2^{m−1} − 1 sums of spectral projections, a pure state exactly one; covariant channels preserve W*(ρ); general lemma: an invariant input cannot select, by an equivariant deterministic rule, a non-invariant member of an orbit. (I-A1, Theorem I) Canonical Minimal Orbit — the minimal projections (rank 1) fall into G₀-orbits classified by p_a(Q) = Tr(P_a Q); the Haar barycenter of an orbit is Σ (p_a/n_a) P_a; exactly one orbit has barycenter ρ, namely p_a = n_a λ_a, of dimension Σ_{λ_a>0}(2n_a − 1) − 1; symmetry selects none of its members but (M_d, ρ) determines the whole homogeneous space of elementary distinctions, with ρ as its barycenter (pure → a point; tracial → CP^{d−1}; ρ = P/r → CP^{r−1}). (I-A1, Theorem II) Measure — G₀-invariant measures on minimal projections with barycenter ρ correspond to measures ν on the simplex with mean p*; the measure is unique with no hypothesis iff ρ = P/r (p* a vertex), otherwise a convex set of covariant decompositions exists (covariant Schrödinger–HJW, explicit two-orbit mixtures exhibited); under ergodicity the measure is the homogeneous μ_ρ, unique for every ρ. First-moment identity ∫ Tr(QE) dμ_ρ = Tr(ρE) recorded as a linear detector, not as Born. Stated limits: finite species only; ergodicity is a declared hypothesis, not derived; nothing here is time, space, register, probability law or physical selection; I-B and I-C are not opened. Scripts with SHA-256 manifest. English and Spanish versions; the Spanish text prevails. Erratum (v0.2, 5 November 2026): v0.1 of this note and v0.2 of the I-A1 report stated 16 control states; there are 17 (3 in d = 2, 5 in d = 3, 9 in d = 4; 3 pure and 14 of rank > 1), all contained in ia1.out and all passing the gates. Documentary error with no effect on any result or theorem; the I-A0 count (13 cases) is correct. This version corrects the note and the I-A1 report; code and outputs are unchanged.