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

arXiv:2610.13951

Predictive Holonomy and Minimal Completion of Coarse Dynamics

Maxim V. Churilov

quant-phmath-phSubmitted Aug 7, 2026• Announced Aug 10, 2026
arXivHTMLPDF

Abstract

A coarse description of a dynamical system generally fails to evolve autonomously: evolving and coarse-graining in different orders gives different predictions, and the compressed propagator fails the semigroup law. We show that this path dependence is the observable boundary of missing state. For a finite continuous-time Markov chain with generator $L$, coarse channel $C$, and stochastic section $R$ satisfying $CR=I$, define $P=RC$, $Q=I-P$, and $K=CLR$. The exact coarse propagator $T_t=C\mathrm{e}^{tL}R$ obeys a Volterra equation with memory kernel $\mathcal{M}(t)=CLQ\,\mathrm{e}^{tQLQ}\,QLR$. Every memory jet $\mathcal{M}^{(k)}(0)$ is recursively recoverable from the short-time derivatives of $T_t$ alone. The rank of the block Hankel operator $\mathbb{H}_{\infty}=(\mathcal{M}^{(i+j)}(0))_{i,j\geq 0}$ is exactly the smallest number of auxiliary linear state variables required to turn the coarse dynamics into an exact autonomous, time-homogeneous system. A minimal completion is constructible by Ho--Kalman factorization and is unique up to similarity. If $d=\min\{k:\mathcal{M}^{(k)}(0)\neq 0\}$, then every smooth classical $f$-divergence generically scales as $t^{2d+4}$. Exact Markov examples realize exponents $4,6,8$ and closure ranks $1,2,3$. We also derive finite-sample singular-value certificates for hidden predictive coordinates, including a matrix-Bernstein bound with intrinsic-variance control. Finally, histories are identified when they induce the same future law under every admissible intervention, yielding the minimal counterfactual predictive state. The results turn coarse-graining into a constructive state-completion problem and separate ordinary linear realization from the harder requirement of a positive or Markov realization.

Comments
13 pages, 3 figures; ancillary symbolic and numerical verification code included

Related papers

The State Equation: Causal Cone Rank and Minimal Physical Memory

Максим Чурилов

We ask which finite classical or quantum memory is sufficient to generate the predictions of a stochastic process. Starting from its Hankel kernel \(H_p(u,v)=p(uv)\), we define causal cone rank by globally shift-compatible cone lifts of the canonical predictive realization. Within a specified realization class, the physical carrier minimum equals the corresponding minimum compatible lift dimension. The framework separates unconstrained Hankel rank, classical nonnegative realizations, and quantum completely positive instruments, and extends to action--outcome processes with interventionwise normalization. A declared linear coarse state has exactly \(\dim\ker(C|_{\operatorname{im} H_p})\) missing predictive coordinates. Finite temporal cuts give nonnegative- and positive-semidefinite-rank witnesses; an explicit two-time family exhibits a growing exact classical--quantum dimension gap, while its fixed-tolerance classical cost remains bounded. For an exact finite-dimensional time-homogeneous Markovian dilation, reset-conditioned closure rank obeys \(r_{\rm cl}\le d_S^2(d_E^2-1)\), with a saturating qubit--qubit example. We give nonasymptotic singular-value tests, while emphasizing that numerical rank and unconstrained truncated singular expansions do not themselves certify a physical realization.

•Nov 3, 2026•0 citations

Finite Quantum Histories: Holonomy Spectra, Minimal Clocks, and Exact Clock-Change Covariance

Maxim V. Churilov

We solve cyclic finite-dimensional quantum histories for arbitrary time-dependent unitary steps, without assuming that one step has finite order. The propagation Hamiltonian is a unitary connection Laplacian on a cycle; its complete gauge invariant is the monodromy $M=U_{L-1}\cdots U_0$. Its spectrum is $λ_{a,k}=1-\cos((2πk-θ_a)/L)$, where $e^{iθ_a}\in\mathrm{spec}(M)$. Thus the exact history sector is isomorphic to $\mathrm{Fix}(M)$, while frustration, the gap above a nonempty zero-energy sector, the determinant, and the finite-temperature trace are obtained in closed form. Ordinary spectral data recover the multiset of monodromy phase cosines but not phase orientation; low energy certifies proximity to an exact relational history. We then define the predictive quotient of a sharp finite clock relative to an accessible operator system as the unique coarsest event alphabet preserving all conditional statistics on a history sector. A finite-error theorem shows that threshold clustering recovers this quotient when the minimum diamond separation of inequivalent event channels exceeds four times the estimation error, and proves an optimal record-count bound. With full matrix access and homogeneous step $U$, the minimal number of clock events is the projective order of $U$. We distinguish the normalizer of the clock algebra from transformations preserving the coherent history code and classify oriented exact sharp clock changes by $U(r)\times\mathbb{Z}_L$ on a rank-$r$ history sector; without orientation the cyclic factor becomes dihedral. Reversible changes of full-information clock fibers are necessarily unitary, so irreversible coarse-graining is not exact clock covariance. Minimal realizations of a complete history Gram kernel are uniquely unitarily equivalent, with a finite-data Procrustes bound. Independent finite-matrix code verifies the main results.

quant-pharXiv:2608.05748•Aug 7, 2026•1 citation

Task-Sufficient Memory under Stochastic Clocks: Coarse-graining operators, fixed points, and finite-policy certification

Marcos Eduardo — Elias

What information about environmental memory must a quantum controller retain to guarantee a specified computational output? This preprint formulates that question in terms of task-sufficient process representations, intervention-valid predictions, stochastic clock laws, and explicit resource accounting. The central requirement is to preserve the outcomes and costs of the permitted decisions, with a stated accuracy contract and a finite-sample certificate. The paper connects two complementary lines of analysis. An operational construction studies Gaussian dephasing and controlled qubit tasks. A separate stochastic-clock analysis studies direct and inverse time changes, fractional relaxation, and the information that temporal coarse graining must transport. These constructions address related modelling questions but are not identified as a single microscopic noise model. The main elements are: Identical uncontrolled channels, different controlled responses. A continuum of Gaussian phase processes has the same uncontrolled coherence at every time and zero Breuer-Laine-Piilo backflow, yet different spin-echo responses. The construction shows why an uncontrolled channel family alone can fail to determine an intervention-dependent control decision. Task-sufficient equivalence and resource contracts. The manuscript defines a contract functional collecting accepted-output moments, acceptance probabilities, and physical costs over a declared policy family. Its finite linear task quotient identifies distinctions relevant to those predictions. Approximate sufficiency is accompanied by stability bounds that expose the sensitivity of conditional guarantees to low acceptance probabilities and small feasibility margins. Simultaneous finite-policy certification. Conservative confidence bounds certify conditional task bias and expected cost per accepted outcome after selection among a fixed, finite set of candidate policies. The assumptions include independent reset attempts, bounded observations and costs, and a trusted ideal reference. Failure to certify a candidate is explicitly distinguished from proof that no feasible physical policy exists. An explicit coarse-graining framework for stochastic clocks. The proposed decorated phase space records the process, permitted policy family, observable set, and clock law. The clock component transports stable laws under their natural scaling and relates domains of attraction to regular variation of waiting-time tails. Within the stated two-parameter clock-and-coupling family, the relaxation-rate direction scales with eigenvalue c^alpha. These clock results are placed in the established probabilistic renormalization literature; they do not establish hyperbolicity or convergence for the full decorated operator. A reset-sensitive fractional-relaxation calculation. Direct subordination of a quantum dynamical semigroup is distinguished from inverse-stable time change. For the latter, the paper compares uninterrupted evolution with independent renewal of the hidden clock and relevant environment. At half order and dimensionless rate one, the exact erfcx representation gives the short-time defect Delta(h) ~ 0.660989212585294 sqrt(h). The difference concerns the declared reset protocols, rather than a general assertion that every physical gate resets its environment. The reported classical benchmark uses ten candidate policies with explicit pulse depolarisation and separate X- and Z-expectation contracts. At the quasistatic endpoint, midpoint echo increases average identity-gate fidelity from 0.789293 to 0.990050. The fidelity crossover near r = 0.0467883 is distinct from the stricter X-task feasibility threshold r >= 0.9688074. For the selected Z-task input, dephasing is harmless and unnecessary echo pulses reduce the expectation. Conventional calibrated echo matches the best tested control performance; calibration, sampling, rejected attempts, and amortisation remain part of the resource account. Two questions are isolated as conjectures: boundedness of the task-quotient dimension along the coarse-graining orbit, and rigidity of the task quotient as a complete contract invariant. The manuscript specifies falsifiable numerical and experimental tests, including rescaled relaxation-profile collapse and finite tests of quotient-rank growth. It establishes no hardware advantage, scalable task-compression theorem, logical error-rate improvement, or error-correction overhead reduction. This illustrated version 2.0 contains 30 pages, four scientific figures, derivation and reproduction appendices, a methodological comparison with renormalization in one-dimensional dynamics, a glossary, and 58 references. The manuscript is dated 12 November 2026 and supersedes version 1.0 of 10 November 2026. The four figures show the uncontrolled/control-response contrast, task-dependent protection, finite-policy certification alongside dimensionless fractional relaxation, and the exact scalar clock-reset defect.

•Nov 13, 2026•0 citations

Path Dependence and Confluence in Quantum Coarse-Graining

Yoshiki Ueoka

Does a sequence of quantum coarse-grainings depend only on its initial and final resolutions, or can the intermediate route remain operationally observable? We study finite-dimensional closed systems whose coarse descriptions are partitions of a fixed orthogonal fine decomposition. Each partition defines a non-selective L\"uders channel, and a monotone coarse-graining path alternates unitary evolution with nested L\"uders maps. Although all projectors commute at equal time, we exhibit a four-state example in which two paths with identical endpoints give final coarse probabilities $3/8$ and $5/8$. We show that arbitrary saturated merge paths are connected by two rank-two local moves, so local channel equality is sufficient for global monotone confluence. For each local comparison we derive an all-time necessary-and-sufficient microscopic criterion: the path defect vanishes exactly when Hamiltonian evolution never generates a coherence sector selected by the difference of the intermediate L\"uders maps. Equivalently, no local source block can dynamically feed both ends of a selected coherence pair. The first nonzero order is determined by a two-arm Hamiltonian--Krylov distance. Finally, we distinguish hereditary confluence from fixed-source confluence, where a nonzero local defect can remain inaccessible from the chosen global source. These results characterize when the history of changing coarse resolutions may be removed from an endpoint-based operational description.

•Sep 12, 2026•0 citations

The PIHR Master Theorem: Minimal Realizations and Finite Recurrence of Recurrent Physical Architectures From Weighted Physical Histories to Canonical Structural Equivalence

Borros Arneth

Many physical systems generate an arbitrarily large or infinite family of histories from a finite set of elementary processes. Multiple scattering, repeated reflections, Green-function insertions, network traversals, resonant tunneling, and repeated loop windings are familiar examples. This work develops a structural description of such systems based on propagation, interaction, holonomy or closed-path monodromy, and recursive closure, collectively denoted PIHR. The central step is to replace a particular factorization of the physical equations by the complete weighted behaviour of their recurrent histories. Primitive return processes generate words in a history alphabet, and the corresponding physical amplitudes define a noncommutative weighted behaviour series. Its Hankel matrix encodes the response of every admissible past to every admissible continuation. Established realization theory then implies that finite Hankel rank is equivalent to the existence of a finite-dimensional linear realization, that the minimal realization dimension equals this rank, and that minimal realizations are unique up to similarity. These classical results are formulated here as a PIHR Master Theorem for recurrent physical architectures. A further consequence follows from the Cayley–Hamilton theorem: recursion-depth amplitudes generated by a finite minimal return kernel necessarily satisfy a finite linear recurrence. Thus an exponentially proliferating family of physical histories can possess finite architectural memory. A three-arm quantum network provides an explicit example in which the number of histories grows by a factor of nine at each return while the coherent amplitude sequence is governed by a recurrence of order at most three. Structural equivalence of minimal PIHR realizations yields a corresponding transfer principle for realization dimension, kernel spectra, recurrence laws, and boundary generating functions. PIHR is therefore proposed not as a replacement for established physical theories, but as a framework for identifying when infinite recurrent physical behaviour is generated by a finite, canonical internal architecture.

•Aug 18, 2026•0 citations

Non-Markov Corridor: Memory Windows, Process-Tensor Class, and the Minimal Nonlocal-in-Time Slot

Kenneth Searcy

Markov compression can fail even when the present reduced state matches. This paper forces the minimal bookkeeping slot required when state-only (Markov) update laws are not corridor-admissible. We formalize operational Markov failure: corridor-equivalent present reduced states can diverge under a declared future interface (single-time instrument or multi-time strategy), so any state-only update would encode a forbidden tie-break. A conditional finite-depth result follows: whenever bounded past depth suffices at the effective tier, there exists a minimal memory window k>=1 enabling refinement-stable prediction without hidden history tags. In the general adaptive setting, the corridor pressures a multi-time process-tensor / quantum-comb class object: a CP-under-extension, multilinear, coarse-graining-stable, causal/normalized functional on instrument slots. Finally, we show containment: in compressible regimes the multi-time slot reduces (up to corridor equivalence) to CPTP state-only dynamics and, under homogeneity plus generator stabilization, to the Lindblad-class semigroup slot.

•Feb 19, 2026•0 citations
A coarse description of a dynamical system generally fails to evolve autonomously: evolving and coarse-graining in different orders gives different predictions, and the compressed propagator fails the semigroup law. We show that this path dependence is the observable boundary of missing state. For a finite continuous-time Markov chain with generator LLL, coarse channel CCC, and stochastic section RRR satisfying CR=ICR=ICR=I, define P=RCP=RCP=RC, Q=I−PQ=I-PQ=I−P, and K=CLRK=CLRK=CLR. The exact coarse propagator Tt=CetLRT_t=C\mathrm{e}^{tL}RTt​=CetLR obeys a Volterra equation with memory kernel M(t)=CLQ etQLQ QLR\mathcal{M}(t)=CLQ\,\mathrm{e}^{tQLQ}\,QLRM(t)=CLQetQLQQLR. Every memory jet M(k)(0)\mathcal{M}^{(k)}(0)M(k)(0) is recursively recoverable from the short-time derivatives of TtT_tTt​ alone. The rank of the block Hankel operator H∞=(M(i+j)(0))i,j≥0\mathbb{H}_{\infty}=(\mathcal{M}^{(i+j)}(0))_{i,j\geq 0}H∞​=(M(i+j)(0))i,j≥0​ is exactly the smallest number of auxiliary linear state variables required to turn the coarse dynamics into an exact autonomous, time-homogeneous system. A minimal completion is constructible by Ho--Kalman factorization and is unique up to similarity. If d=min⁡{k:M(k)(0)≠0}d=\min\{k:\mathcal{M}^{(k)}(0)\neq 0\}d=min{k:M(k)(0)=0}, then every smooth classical fff-divergence generically scales as t2d+4t^{2d+4}t2d+4. Exact Markov examples realize exponents 4,6,84,6,84,6,8 and closure ranks 1,2,31,2,31,2,3. We also derive finite-sample singular-value certificates for hidden predictive coordinates, including a matrix-Bernstein bound with intrinsic-variance control. Finally, histories are identified when they induce the same future law under every admissible intervention, yielding the minimal counterfactual predictive state. The results turn coarse-graining into a constructive state-completion problem and separate ordinary linear realization from the harder requirement of a positive or Markov realization.
We ask which finite classical or quantum memory is sufficient to generate the predictions of a stochastic process. Starting from its Hankel kernel Hp(u,v)=p(uv)H_p(u,v)=p(uv)Hp​(u,v)=p(uv), we define causal cone rank by globally shift-compatible cone lifts of the canonical predictive realization. Within a specified realization class, the physical carrier minimum equals the corresponding minimum compatible lift dimension. The framework separates unconstrained Hankel rank, classical nonnegative realizations, and quantum completely positive instruments, and extends to action--outcome processes with interventionwise normalization. A declared linear coarse state has exactly dim⁡ker⁡(C∣im⁡Hp)\dim\ker(C|_{\operatorname{im} H_p})dimker(C∣imHp​​) missing predictive coordinates. Finite temporal cuts give nonnegative- and positive-semidefinite-rank witnesses; an explicit two-time family exhibits a growing exact classical--quantum dimension gap, while its fixed-tolerance classical cost remains bounded. For an exact finite-dimensional time-homogeneous Markovian dilation, reset-conditioned closure rank obeys rcl≤dS2(dE2−1)r_{\rm cl}\le d_S^2(d_E^2-1)rcl​≤dS2​(dE2​−1), with a saturating qubit--qubit example. We give nonasymptotic singular-value tests, while emphasizing that numerical rank and unconstrained truncated singular expansions do not themselves certify a physical realization.
We solve cyclic finite-dimensional quantum histories for arbitrary time-dependent unitary steps, without assuming that one step has finite order. The propagation Hamiltonian is a unitary connection Laplacian on a cycle; its complete gauge invariant is the monodromy M=UL−1⋯U0M=U_{L-1}\cdots U_0M=UL−1​⋯U0​. Its spectrum is λa,k=1−cos⁡((2πk−θa)/L)λ_{a,k}=1-\cos((2πk-θ_a)/L)λa,k​=1−cos((2πk−θa​)/L), where eiθa∈spec(M)e^{iθ_a}\in\mathrm{spec}(M)eiθa​∈spec(M). Thus the exact history sector is isomorphic to Fix(M)\mathrm{Fix}(M)Fix(M), while frustration, the gap above a nonempty zero-energy sector, the determinant, and the finite-temperature trace are obtained in closed form. Ordinary spectral data recover the multiset of monodromy phase cosines but not phase orientation; low energy certifies proximity to an exact relational history. We then define the predictive quotient of a sharp finite clock relative to an accessible operator system as the unique coarsest event alphabet preserving all conditional statistics on a history sector. A finite-error theorem shows that threshold clustering recovers this quotient when the minimum diamond separation of inequivalent event channels exceeds four times the estimation error, and proves an optimal record-count bound. With full matrix access and homogeneous step UUU, the minimal number of clock events is the projective order of UUU. We distinguish the normalizer of the clock algebra from transformations preserving the coherent history code and classify oriented exact sharp clock changes by U(r)×ZLU(r)\times\mathbb{Z}_LU(r)×ZL​ on a rank-rrr history sector; without orientation the cyclic factor becomes dihedral. Reversible changes of full-information clock fibers are necessarily unitary, so irreversible coarse-graining is not exact clock covariance. Minimal realizations of a complete history Gram kernel are uniquely unitarily equivalent, with a finite-data Procrustes bound. Independent finite-matrix code verifies the main results.
What information about environmental memory must a quantum controller retain to guarantee a specified computational output? This preprint formulates that question in terms of task-sufficient process representations, intervention-valid predictions, stochastic clock laws, and explicit resource accounting. The central requirement is to preserve the outcomes and costs of the permitted decisions, with a stated accuracy contract and a finite-sample certificate. The paper connects two complementary lines of analysis. An operational construction studies Gaussian dephasing and controlled qubit tasks. A separate stochastic-clock analysis studies direct and inverse time changes, fractional relaxation, and the information that temporal coarse graining must transport. These constructions address related modelling questions but are not identified as a single microscopic noise model. The main elements are: Identical uncontrolled channels, different controlled responses. A continuum of Gaussian phase processes has the same uncontrolled coherence at every time and zero Breuer-Laine-Piilo backflow, yet different spin-echo responses. The construction shows why an uncontrolled channel family alone can fail to determine an intervention-dependent control decision. Task-sufficient equivalence and resource contracts. The manuscript defines a contract functional collecting accepted-output moments, acceptance probabilities, and physical costs over a declared policy family. Its finite linear task quotient identifies distinctions relevant to those predictions. Approximate sufficiency is accompanied by stability bounds that expose the sensitivity of conditional guarantees to low acceptance probabilities and small feasibility margins. Simultaneous finite-policy certification. Conservative confidence bounds certify conditional task bias and expected cost per accepted outcome after selection among a fixed, finite set of candidate policies. The assumptions include independent reset attempts, bounded observations and costs, and a trusted ideal reference. Failure to certify a candidate is explicitly distinguished from proof that no feasible physical policy exists. An explicit coarse-graining framework for stochastic clocks. The proposed decorated phase space records the process, permitted policy family, observable set, and clock law. The clock component transports stable laws under their natural scaling and relates domains of attraction to regular variation of waiting-time tails. Within the stated two-parameter clock-and-coupling family, the relaxation-rate direction scales with eigenvalue c^alpha. These clock results are placed in the established probabilistic renormalization literature; they do not establish hyperbolicity or convergence for the full decorated operator. A reset-sensitive fractional-relaxation calculation. Direct subordination of a quantum dynamical semigroup is distinguished from inverse-stable time change. For the latter, the paper compares uninterrupted evolution with independent renewal of the hidden clock and relevant environment. At half order and dimensionless rate one, the exact erfcx representation gives the short-time defect Delta(h) ~ 0.660989212585294 sqrt(h). The difference concerns the declared reset protocols, rather than a general assertion that every physical gate resets its environment. The reported classical benchmark uses ten candidate policies with explicit pulse depolarisation and separate X- and Z-expectation contracts. At the quasistatic endpoint, midpoint echo increases average identity-gate fidelity from 0.789293 to 0.990050. The fidelity crossover near r = 0.0467883 is distinct from the stricter X-task feasibility threshold r >= 0.9688074. For the selected Z-task input, dephasing is harmless and unnecessary echo pulses reduce the expectation. Conventional calibrated echo matches the best tested control performance; calibration, sampling, rejected attempts, and amortisation remain part of the resource account. Two questions are isolated as conjectures: boundedness of the task-quotient dimension along the coarse-graining orbit, and rigidity of the task quotient as a complete contract invariant. The manuscript specifies falsifiable numerical and experimental tests, including rescaled relaxation-profile collapse and finite tests of quotient-rank growth. It establishes no hardware advantage, scalable task-compression theorem, logical error-rate improvement, or error-correction overhead reduction. This illustrated version 2.0 contains 30 pages, four scientific figures, derivation and reproduction appendices, a methodological comparison with renormalization in one-dimensional dynamics, a glossary, and 58 references. The manuscript is dated 12 November 2026 and supersedes version 1.0 of 10 November 2026. The four figures show the uncontrolled/control-response contrast, task-dependent protection, finite-policy certification alongside dimensionless fractional relaxation, and the exact scalar clock-reset defect.
Does a sequence of quantum coarse-grainings depend only on its initial and final resolutions, or can the intermediate route remain operationally observable? We study finite-dimensional closed systems whose coarse descriptions are partitions of a fixed orthogonal fine decomposition. Each partition defines a non-selective L\"uders channel, and a monotone coarse-graining path alternates unitary evolution with nested L\"uders maps. Although all projectors commute at equal time, we exhibit a four-state example in which two paths with identical endpoints give final coarse probabilities 3/83/83/8 and 5/85/85/8. We show that arbitrary saturated merge paths are connected by two rank-two local moves, so local channel equality is sufficient for global monotone confluence. For each local comparison we derive an all-time necessary-and-sufficient microscopic criterion: the path defect vanishes exactly when Hamiltonian evolution never generates a coherence sector selected by the difference of the intermediate L\"uders maps. Equivalently, no local source block can dynamically feed both ends of a selected coherence pair. The first nonzero order is determined by a two-arm Hamiltonian--Krylov distance. Finally, we distinguish hereditary confluence from fixed-source confluence, where a nonzero local defect can remain inaccessible from the chosen global source. These results characterize when the history of changing coarse resolutions may be removed from an endpoint-based operational description.
Many physical systems generate an arbitrarily large or infinite family of histories from a finite set of elementary processes. Multiple scattering, repeated reflections, Green-function insertions, network traversals, resonant tunneling, and repeated loop windings are familiar examples. This work develops a structural description of such systems based on propagation, interaction, holonomy or closed-path monodromy, and recursive closure, collectively denoted PIHR. The central step is to replace a particular factorization of the physical equations by the complete weighted behaviour of their recurrent histories. Primitive return processes generate words in a history alphabet, and the corresponding physical amplitudes define a noncommutative weighted behaviour series. Its Hankel matrix encodes the response of every admissible past to every admissible continuation. Established realization theory then implies that finite Hankel rank is equivalent to the existence of a finite-dimensional linear realization, that the minimal realization dimension equals this rank, and that minimal realizations are unique up to similarity. These classical results are formulated here as a PIHR Master Theorem for recurrent physical architectures. A further consequence follows from the Cayley–Hamilton theorem: recursion-depth amplitudes generated by a finite minimal return kernel necessarily satisfy a finite linear recurrence. Thus an exponentially proliferating family of physical histories can possess finite architectural memory. A three-arm quantum network provides an explicit example in which the number of histories grows by a factor of nine at each return while the coherent amplitude sequence is governed by a recurrence of order at most three. Structural equivalence of minimal PIHR realizations yields a corresponding transfer principle for realization dimension, kernel spectra, recurrence laws, and boundary generating functions. PIHR is therefore proposed not as a replacement for established physical theories, but as a framework for identifying when infinite recurrent physical behaviour is generated by a finite, canonical internal architecture.
Markov compression can fail even when the present reduced state matches. This paper forces the minimal bookkeeping slot required when state-only (Markov) update laws are not corridor-admissible. We formalize operational Markov failure: corridor-equivalent present reduced states can diverge under a declared future interface (single-time instrument or multi-time strategy), so any state-only update would encode a forbidden tie-break. A conditional finite-depth result follows: whenever bounded past depth suffices at the effective tier, there exists a minimal memory window k>=1 enabling refinement-stable prediction without hidden history tags. In the general adaptive setting, the corridor pressures a multi-time process-tensor / quantum-comb class object: a CP-under-extension, multilinear, coarse-graining-stable, causal/normalized functional on instrument slots. Finally, we show containment: in compressible regimes the multi-time slot reduces (up to corridor equivalence) to CPTP state-only dynamics and, under homogeneity plus generator stabilization, to the Lindblad-class semigroup slot.