This paper starts from two fundamental principles—Information Conservation(A1) and Finite-Step Computability (A2)—to argue the mechanism for the naturalemergence of inherent lower bounds of computational complexity in physically realizable computational processes. Research shows that core concepts of computationalcomplexity (such as polynomial-time upper bounds, circuit depth lower bounds) arenot mere mathematical abstractions but are quantitative laws that must be followedby physical systems when performing information transformations under fundamental constraints such as energy, time, and information conservation. Specifically, thequantum speed limit together with Axiom A2 jointly sets a polynomial-time upperbound for any finite-energy physical system; while the Information Conservationaxiom (A1) combined with the principle of minimal physical realization complexity(A3) ensures that the logical difficulty of a computational task is inevitably reflected in the topological complexity of the spatiotemporal structure of its physicalrealization. This sets a lower bound for the circuit depth determined by topological invariants, and in quantum many-body systems, it directly manifests asvolume-law growth of entanglement entropy, whose coefficient is determined by theunderlying hardware architecture. To test this theoretical framework, this paperdesigns two cross-scale experimental paths: at the microscopic level, using superconducting quantum processors to precisely measure the volume-law coefficient ofentanglement in random quantum circuits; at the macroscopic cosmological level,inferring the “computational complexity” growth information of the early-universeinflationary process by detecting the phase coherence of the primordial gravitationalwave background. These schemes aim to place foundational issues of computationalcomplexity within the domain of empirically testable physical science.
This paper starts from two fundamental principles—Information Conservation(A1) and Finite-Step Computability (A2)—to argue the mechanism for the naturalemergence of inherent lower bounds of computational complexity in physically realizable computational processes. Research shows that core concepts of computationalcomplexity (such as polynomial-time upper bounds, circuit depth lower bounds) arenot mere mathematical abstractions but are quantitative laws that must be followedby physical systems when performing information transformations under fundamental constraints such as energy, time, and information conservation. Specifically, thequantum speed limit together with Axiom A2 jointly sets a polynomial-time upperbound for any finite-energy physical system; while the Information Conservationaxiom (A1) combined with the principle of minimal physical realization complexity(A3) ensures that the logical difficulty of a computational task is inevitably reflected in the topological complexity of the spatiotemporal structure of its physicalrealization. This sets a lower bound for the circuit depth determined by topological invariants, and in quantum many-body systems, it directly manifests asvolume-law growth of entanglement entropy, whose coefficient is determined by theunderlying hardware architecture. To test this theoretical framework, this paperdesigns two cross-scale experimental paths: at the microscopic level, using superconducting quantum processors to precisely measure the volume-law coefficient ofentanglement in random quantum circuits; at the macroscopic cosmological level,inferring the “computational complexity” growth information of the early-universeinflationary process by detecting the phase coherence of the primordial gravitationalwave background. These schemes aim to place foundational issues of computationalcomplexity within the domain of empirically testable physical science.
Within the framework of axiomatic emergence, by introducing a rigorous definition of information topological charge, and starting from the axioms of information conservation (A1) and finite-step computability (A2), we strictly derive a newlower bound formula for the depth of quantum circuits. This formula relates thelower bound of circuit depth to the topological complexity of the circuit (characterized by the square of the information topological charge) and the quantum speedlimit. More importantly, the derivation process is closed, and its results directlypredict a universal, counterintuitive negative correlation between the volume-lawcoefficient of subsystem entanglement entropy and the topological complexity of itscomplementary subsystem during the evolution of random quantum circuits. Thisprediction can be tested by running specific random circuits on superconductingquantum processors and performing precise measurements, thereby providing anunprecedented quantitative experimental adjudication for this theoretical framework. Through small-scale numerical simulations, we verify the suppression effectof the entanglement entropy growth coefficient under non-zero topological chargeconditions, and the results are qualitatively consistent with the theoretical predictions.
This paper aims to provide a unified physical origin explanation for topological order that transcends the Landau paradigm, starting from principled axioms.Based on two fundamental axioms—Information Conservation (A1) and Finite-StepComputability (A2)—we argue that topological order is not an accidental productof specific models, but rather a macroscopic quantum structure that inevitablyemerges from quantum many-body systems under the joint action of A1 (globalinformation constraints) and A2 (local interaction rules) in order to achieve robustnon-local information storage and processing. This paper systematically demonstrates that core features such as topological degeneracy, anyonic fractional statistics, and topological entanglement entropy can be logically derived from these twoaxioms, and integrates topological order with many-body dynamics from a unifiedspatiotemporal perspective, further proposing numerical and experimental testingschemes. This framework provides a new principled foundation for understandingthe nature, classification, and role of topological order in quantum computing andquantum gravity
This paper proposes and develops a research framework for deriving fundamental mathematical structures from underlying physical axioms. We prove that,starting from two basic principles that a self-referential computational system mustsatisfy Information Conservation (A1) and Computability (A2) the mathematicaldescription of its evolutionary process is necessarily organized into a specific category. The objects of this category correspond to discrete semantic levels of thesystem state, and the morphisms are completely positive trace-preserving (CPTP)maps, which directly embody the constraint of information conservation. The tensor product structure and dagger structure possessed by the category originate,respectively, from the parallel operations permitted by computability and the formal time-reversal symmetry implied by information conservation. Ultimately, wesystematically derive a complete dagger-compact category. Distinct from purelymathematical constructions, the credibility of this framework is rooted in an empirically testable physical prediction: in a quantum processor, the complexity growthdynamics of the system state should exhibit a periodic oscillation pattern related tothe logarithm of the system size (ln N). This explicit prediction provides a crucialfalsification condition for the theory.
This paper, based on two fundamental physical axioms—Information Conservation (A1) and Computability (A2)—systematically argues for the intrinsic logical structure necessary for describing physical reality. Research shows that in aself-referential universe model constrained by local observations, the truth-valuejudgment logic of physical propositions necessarily deviates from classical Booleanlogic. The core root lies in the “local-global inequivalence” of physical systems: theinformation contained in the global physical state cannot be completely determinedby any finite observational procedure within a finite spacetime region. This leads tothe invalidity of the law of excluded middle within the system, and consequently,the logical structure mathematically manifests as a non-distributive orthomodularlattice, i.e., Birkhoff–von Neumann quantum logic. This structure is proven tocorrespond exactly to the subobject lattice in the ∞-topos TA constructed previously. This theoretical framework finally leads to a testable cosmological prediction:the central value of the non-Gaussianity parameter fNL of the cosmic microwavebackground (CMB) temperature fluctuations is about −3.2. Next-generation CMBexperiments (such as CMB-S4) will be able to test this prediction precisely, andthe results can be used to evaluate whether the quantum logical structure emergingfrom the basic axioms is suitable for describing the real universe.
Based on the two fundamental principles—Information Conservation (A1) andFinite-Step Computability (A2)—this paper derives the core structures of operatoralgebras, namely subfactors, the Jones index, and planar algebras. The researchdemonstrates that the factor structure of the observable algebra in quantum systems, the finite index of subfactor inclusions, and its discrete set of possible values(the Jones index) are not pure mathematical abstractions, but rather the inevitablealgebraic forms of organization for physical systems under information constraintsand realizability requirements. Information Conservation necessitates the existenceof a unique finite faithful trace on the algebra, forcing the observable algebra tomanifest as a type II factor. Computability requires the algebraic description tobe finitely generated, which locks the index of a subfactor inclusion to be finite andquantizes its spectrum into the classical Jones index set. This discrete spectrum directly corresponds to planar algebras (e.g., Temperley–Lieb algebras) which encodethe braiding statistics of anyons in topological quantum systems and the algebraicproperties of fault-tolerant quantum error-correcting codes. Furthermore, this paper proposes two operable experimental verification schemes: validating Jones polynomial evaluations by measuring the statistical phases of anyon braiding in quantumHall systems, and indirectly determining the effective dimension parameter relatedto the Jones index by analyzing the scaling behavior of logical error rates in surface codes implemented on superconducting quantum processors. These schemesestablish a falsifiable, unified bridge between abstract algebra, topological order,and quantum information.
The problem of the origin of time, i.e., ”how time emerges from the foundationof quantum gravity,” is a central challenge in modern physics. This paper proposesa background-independent and computable emergence mechanism: time is not ana priori coordinate but rather a chain of partially ordered slices spontaneouslyorganized by quantum geometric states under the action of discrete renormalizationgroup flow. We construct a joint categorical framework that unifies the entanglement renormalization of spin networks and the geometric evolution of discrete Ricciflowas afunctorial evolution sequence. It is theoretically proven that when the jointevolution follows macroscopic monotonicity of entanglement entropy, this sequencenaturally generates a causal chain with a natural partial order. The macroscopic”time measure” is given by a topological invariant—the H0 barcode length in persistent homology—and its ”arrow of time” is locked by the irreversible growth ofentanglement entropy, without requiring additional thermodynamic or boundarycondition assumptions. We conduct large-scale numerical experiments on a 323periodic lattice, verifying the core theoretical prediction: the barcode lifetime Land the system’s low-energy spectral gap ∆ exhibit a universal inverse relationship, satisfying ∆ · L = 0.144(5), with a coefficient of determination R2 = 0.999.This mechanism directly leads to two observable cosmological predictions: 1) A”barcode modulation” in the low-ℓ power spectrum of the cosmic microwave background radiation, with characteristic scale ∆ℓ ≈ 3 and amplitude A ≈ 0.05; 2) Aprimordial stochastic gravitational wave background with peak frequency in the10−9–10−8 Hz range. These predictions can be tested by next-generation observational experiments such as CMB-S4 and SKA-PTA, thereby transforming the”origin of time” from a philosophical speculation into a computable, simulatable,and falsifiable physical problem.