Parameterized Universe Quantum Cellular Automaton Theory\\ Under Finite Information

Parameterized Universe Quantum Cellular Automaton Theory Under Finite Information Haobo Ma1Wenlin Zhang2 1Independent Researcher 2National University of Singapore November 24, 2025 Abstract Under framework of quantum cellular automaton (QCA), quasi-local operator algebra and finite information principle, this paper constructs class of explicitly parameterized “universe quantum cellular automaton” models. Core idea: assuming physically distinguishable information amount of physical universe has finite upper bound Imax, then entire universe can be encoded as finite bit string parameter vector Θ, uniquely determining universe-level QCA object under strict axiomatic system UQCA(Θ) = Λ(Θ),Hcell(Θ),A(Θ), αΘ, ωΘ 0 where Λ(Θ) finite lattice site set, Hcell(Θ) cellular Hilbert space, A(Θ) quasilocal C∗algebra, αΘautomorphism with finite propagation radius (realized by finite-depth local unitary circuit), ωΘ 0initial universe state generated by finite circuit. Under “finite information universe axiom”, we introduce global information capacity upper bound Imax, decompose universe parameter vector into structural parameters Θstr, dynamical parameters Θdyn and initial state parameters Θini. Prove in QCA algebraic framework: for each finite bit string Θ satisfying Iparam(Θ) + Smax(Θ) ≤Imax, exists universe QCA satisfying locality, reversibility and causal boundedness; where parameter information amount Iparam(Θ) and maximum von Neumann entropy Smax(Θ) of universe reachable Hilbert space satisfy Iparam(Θ) + Smax(Θ) ≤Imax thereby characterizing joint constraint of “finite information” on cell number, local Hilbert dimension and parameter precision. In continuous limit, construct class of scalable parameterized QCA family UQCA(Θ; a, ∆t), in appropriate limit of lattice spacing aand time step ∆t→0, prove convergence to effective field equations, including Dirac-type equation iγµ∂µ−m(Θ)ψ= 0 and equation system with gauge coupling and effective metric parameters, where mass m(Θ), gauge coupling and gravitational constant effective continuous parameters analytically derived from discrete angle parameters and structural data in 1 Θdyn. Furthermore, introduce observer network and causal feedback, define class of parameterized observer objects and consensus geometry at universe QCA level, making universe parameter Θ simultaneously determine physical laws and observable statistical structure. Appendices give formalized construction of quasi-local C∗algebra and QCA; strict correspondence theorem between finite-depth local circuits and QCA automorphisms; systematic derivation of Dirac–QCA continuous limit; proof of bounds on finite information inequality and relationships among cell number and local dimension; and abstract map examples from parameter vector to effective field theory constants and observer network statistics. This paper thereby provides axiomatizable, computable and parameterized “finite-information universe cellular automaton” theoretical framework, establishing mathematical foundation for viewing physical universe as quantum computation process with finite description complexity. Keywords: Quantum cellular automaton; Quasi-local C∗algebra; Finite information principle; Dirac continuous limit; Gauge and gravitational effective constants; Observer network and information geometry 1 Introduction & Historical Context Quantum cellular automaton initially proposed as natural model of quantum computation and discretized quantum field theory, its basic structure is arranging finite-dimensional quantum systems on discrete lattice sites, adopting discrete time steps iterated evolution by unitary evolution operator, requiring evolution to possess properties such as causality and translation invariance. Based on algebraically characterized reversible QCA theory, this class of models can be formalized as automorphisms defined on quasi-local C∗algebra, whose propagation radius finite, and under appropriate assumptions possess strong structural reversibility and Margolus block decomposition property. In subsequent work, QCA systematically used to construct discrete versions of free and interacting field theory, whose continuous limit can converge to Dirac, Weyl even generalized Dirac equations, widely applied in quantum walks, quantum simulation and quantum algorithm design. On other hand, discussion about “whether information amount universe can carry is finite” originates from black hole thermodynamics, Bekenstein entropy bound and holographic principle. Bekenstein’s proposed entropy–energy–radius inequality and Bousso’s holographic entropy bound show, given finite-area spacetime region, its contained physical degrees of freedom and information amount upper bound proportional to area rather than volume, thereby suggesting existence of some “finite information universe” universal constraint. Meanwhile, Lloyd in studying “limits of physical computation” pointed out, number of logical operations and storable information amount any concrete physical system can execute strictly controlled by energy, volume and fundamental constants c, ℏ, G, further strengthening concept of “universe as computation process”. Under these backgrounds, natural question is: if viewing “universe” as some QCA object, introducing formalized finite information axiom, can following structure be realized at strict mathematical level: 1. Use finite bit string Θ to encode universe structural data, dynamical laws and initial conditions; 2 2. In quasi-local algebra and QCA theory framework, uniquely construct universe-level QCA object UQCA(Θ) from Θ; 3. Under appropriate scaling limit, derive continuous field theory from UQCA(Θ), including Dirac-type fields, gauge fields and effective gravitational equations, whose mass, coupling constants and metric parameters analytically given by discrete components of Θ; 4. Use finite information principle to give unified inequality among universe cell number, local Hilbert dimension and parameter precision, constituting trade-off relationship among “universe scale–internal degrees of freedom–description complexity”. Existing QCA literature mostly focused on dynamical properties, universality and continuous limit under given local rules, less discuss parameter encoding and information capacity upper bound from “universe-level” perspective; while black hole and holographic literature mostly characterize entropy bounds at continuous geometry and quantum gravity level, not yet strictly interfaced with concrete discrete QCA evolution model. Goal of this paper is to build bridge between two: on algebraized QCA theory basis, introduce explicit finite information universe axiom, construct parameterized universe QCA model, analyze its continuous limit and information-theoretic constraints. Main contributions of this paper can be summarized as: 1. Propose finite information universe axiom within quasi-local C∗algebra QCA framework, formally introduce global information capacity upper bound Imax, decompose universe parameter vector Θ into structural parameters Θstr, dynamical parameters Θdyn and initial state parameters Θini; 2. Explicitly construct universe QCA object UQCA(Θ) from Θ, prove it satisfies locality, reversibility and finite propagation radius properties, give existence–uniqueness theorem under encoding redundancy sense; 3. Establish finite information inequality Iparam(Θ) + Smax(Θ) ≤Imax between parameter information amount Iparam(Θ) and maximum entropy Smax(Θ) of universe Hilbert space, thereby deriving cell number upper bound, local dimension upper bound and quantitative trade-off relationship between them; 4. Based on Dirac-type QCA and quantum walk continuous limit research, construct class of scalable parameterized QCA family, prove convergence to Dirac and gauge field equations in a, ∆t→0 limit, express mass and coupling constants as functions of discrete angle parameters in Θdyn; 5. Construct formalized framework of observer network and causal feedback, define parameterized observer objects, communication channels and consensus geometry at universe QCA level, discuss constraints of Θ on observable statistical structure. Based on this, this paper proposes axiomatizable and computable “parameterized finite information universe QCA” theory, providing structured starting point for further viewing universe as quantum computation process with finite description complexity. 3 2 Model & Assumptions 2.1 Quasi-local Algebra and Cellular Lattice Structure Let Λ be finite set, representing labels of distinguishable cells in universe. Structural parameter Θstr contains spatial dimension d∈ {1,2,3,4}, direction lattice lengths L1, . . . , Ld∈ N, and boundary conditions and possible additional connections or defects, used to encode discrete spatial structure of universe. This gives cellular set Λ(Θstr) = d Y i=1 {0,1, . . . , Li−1} number of lattice sites Ncell(Θstr) = d Y i=1 Li For each x∈Λ(Θstr), let cellular Hilbert space be Hx(Θstr)∼ =Cdcell(Θstr) where dcell(Θstr)∈Nspecified by structural parameters, can be further decomposed as tensor product of fermions, gauge fields and auxiliary registers, e.g., Hx∼ =Hf⊗ Hg⊗ Haux For any finite subset F⊂Λ, define HF=O x∈F Hx AF=B(HF) Global algebra taken as inductive limit A(Θstr) = [ F⊂Λ, F finite AF constituting quasi-local C∗algebra. This algebra describes all physically realizable observables. 2.2 Dynamical Parameters and QCA Automorphisms Dynamical parameters Θdyn specify evolution rule: select finite universal gate library G={G1, . . . , GK}, each gate Gjacts on limited neighboring sites. Typical choice: twoqubit gates plus single-qubit rotations. Encode Θdyn as finite-depth circuit sequence U(Θdyn) = UL· · · U2U1 where each layer Uℓtensor product of local gates. From this construct time-evolution automorphism αΘ(A) = U(Θdyn)†AU(Θdyn), A ∈ A(Θstr) 4 Under finite circuit depth assumption, αΘhas finite propagation radius, satisfies QCA locality condition. 2.3 Initial State Parameters Initial state parameters Θini specify initial density matrix ωΘ 0or pure state |ψ0⟩. Simplest case, |ψ0⟩generated by finite preparation circuit acting on reference state (e.g., vacuum or computational basis state). Encoding length of Θini depends on initial state entanglement structure and symmetry. 2.4 Finite Information Universe Axiom Axiom 2.1 (Finite Information Capacity).Exists universal constant Imax <∞such that parameter information amount Iparam(Θ) and maximum entropy Smax(Θ) of physically realizable universe satisfy Iparam(Θ) + Smax(Θ) ≤Imax where Iparam(Θ) = |Θstr|+|Θdyn|+|Θini| represents total bit length of parameter encoding, and Smax(Θ) = log2dim Htotal(Θ) = log2dNcell cell  maximum entropy universe can reach under given structure. This axiom directly constrains relationship between universe scale (Ncell), internal complexity (dcell) and description complexity (Iparam): cannot all be arbitrarily large simultaneously. 3 Construction of Parameterized Universe QCA 3.1 Formal Definition of Universe QCA Object Definition 3.1 (Universe QCA Object).Given parameter vector Θ = (Θstr,Θdyn,Θini), universe QCA object is quintuple UQCA(Θ) = Λ(Θ),Hcell(Θ),A(Θ), αΘ, ωΘ 0 where: 1. Λ(Θ) lattice site set determined by Θstr; 2. Hcell(Θ) cellular Hilbert space; 3. A(Θ) quasi-local C∗algebra; 4. αΘ:A(Θ) → A(Θ) automorphism with finite propagation radius, determined by Θdyn; 5. ωΘ 0initial state determined by Θini. 5 3.2 Existence and Uniqueness Theorem 3.2 (Existence of Parameterized Universe QCA).For any parameter vector Θ satisfying Axiom ??, there exists universe QCA object UQCA(Θ) satisfying Definition ??, and automorphism αΘhas finite propagation radius. Proof. Constructive proof: given Θ, explicitly build lattice, Hilbert space, gate sequence and initial state circuit. Finite propagation radius follows from finite circuit depth and local gate support. Details in Appendix A. Theorem 3.3 (Encoding Uniqueness).Under natural equivalence relation (physical indistinguishability), parameter vector Θuniquely determines universe QCA object up to isomorphism. 3.3 Finite Information Inequality and Constraints From Axiom ?? directly obtain: Corollary 3.4 (Cell Number Upper Bound).Under given local dimension dcell and parameter complexity Iparam, Ncell ≤Imax −Iparam log2dcell Corollary 3.5 (Local Dimension Upper Bound).Under given cell number Ncell and parameter complexity Iparam, dcell ≤2(Imax−Iparam)/Ncell These bounds reflect fundamental trade-off: large-scale universe (Ncell large) forces simple local structure (dcell small); complex local dynamics requires small total scale. 4 Continuous Limit and Effective Field Theory 4.1 Scalable Parameterized QCA Family Introduce scaling parameters: lattice spacing aand time step ∆t. Define family UQCA(Θ; a, ∆t) where as a, ∆t→0, cell number Ncell ∼a−dincreases, but parameter structure encoded in Θ remains fixed. 4.2 Dirac-QCA Continuous Limit For Dirac-type QCA with appropriate coin operator and shift operator, standard quantum walk theory shows: Theorem 4.1 (Dirac Equation as Continuum Limit).For properly parameterized QCA family UQCA(Θ; a, ∆t)with ∆t∼a, continuum limit yields effective Dirac equation iγµ∂µ−m(Θ)ψ= 0 6 where mass parameter m(Θ) = m0+O(θdyn) function of discrete angle parameters in Θdyn. Proof. Uses standard Taylor expansion and error analysis of quantum walk. See Appendix B for detailed derivation. 4.3 Gauge Fields and Gravitational Effective Constants Introducing internal gauge degrees of freedom and spacetime metric fluctuations, similar analysis yields:  Gauge coupling constants ggauge(Θ) as functions of discrete link variables;  Effective gravitational constant Geff(Θ) from lattice spacing and coupling structure;  Cosmological constant contribution from vacuum structure. All these effective continuous parameters ultimately determined by finite parameter vector Θ. 5 Observer Network and Consensus Geometry 5.1 Parameterized Observer Objects Define observer as local subsystem: region ΛO⊂Λ with Hilbert space HO=Nx∈ΛOHx. Observer parameters ΘO⊂Θ specify:  Internal memory structure;  Measurement operators;  Update rules. 5.2 Multi-Observer Consensus For multiple observers {Oi}, define consensus geometry based on causal communication and information sharing. Mutual information between observers i, j: I(Oi:Oj) = S(ρi) + S(ρj)−S(ρij) where ρi, ρjreduced states, ρij joint state. Definition 5.1 (Consensus Manifold).Parameter-dependent consensus manifold Mconsensus(Θ) equipped with metric induced by relative entropy between observers. 7 5.3 Observable Statistics Constrained by Θ Parameter vector Θ determines not only microscopic dynamics but also macroscopic observable statistics:  Correlation lengths;  Thermalization timescales;  Entanglement entropy scaling;  Effective temperature and particle spectra. This closes circle: Θ encodes universe, universe evolution generates observations, observations constrain Θ. 6 Discussion and Outlook This paper constructed rigorous mathematical framework for “parameterized finite-information universe QCA”. Key achievements: 1. Formalized finite information axiom in QCA context; 2. Proved existence/uniqueness of parameterized universe objects; 3. Derived quantitative information inequalities constraining universe scale; 4. Showed how continuous field theories emerge in scaling limit; 5. Connected parameter vector to observable statistics through observer network. Future directions:  Explicit construction of QCA models matching Standard Model;  Numerical simulation of universe evolution for specific Θ;  Connection with holographic principle and AdS/CFT;  Exploration of anthropic constraints on parameter space;  Quantum gravity interpretation of Imax. This framework provides concrete, computable approach to viewing universe as finiteinformation quantum computation. A Formal Construction of Quasi-local C∗Algebra and QCA This appendix gives detailed mathematical construction of quasi-local algebra structure. 8 A.1 Inductive Limit Construction For increasing sequence of finite regions F1⊂F2⊂ · · · ⊂ Λ, define A=[ n AFn in C∗-norm. This gives quasi-local algebra. A.2 Locality of Automorphisms Automorphism αhas propagation radius rif for any local operator Asupported on region R,α(A) supported on Rr={x: dist(x, R)≤r}. B Strict Correspondence: Finite-Depth Circuits ↔ QCA Automorphisms This appendix proves bijection between finite-depth local unitary circuits and QCA automorphisms with finite propagation radius. Theorem B.1 (Circuit–Automorphism Correspondence).Given gate library Gwith finiterange gates, there exists bijection between:  Finite-depth circuits Uof depth L;  QCA automorphisms αwith propagation radius r∼L. Proof. Forward direction obvious: circuit defines unitary, induces automorphism. Reverse uses decomposition theorem for quasi-local unitaries. See Hastings (2004), NachtergaeleSims (2006). C Systematic Derivation of Dirac–QCA Continuous Limit This appendix gives complete derivation of Dirac equation from QCA in scaling limit. C.1 Discrete Dirac Operator Start with discrete Dirac operator on lattice with spacing a: Daψ(x) = X µ γµψ(x+aˆµ)−ψ(x) a C.2 Taylor Expansion and Error Estimate Expand in a: Daψ(x) = X µ γµ∂µψ(x) + O(a) Error controlled by smoothness of ψ. 9