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

Axiomatic Emergence T; The Physical Origin of Subfactors and Planar Algebraic Structures

changzheng zhou, ZIQING zhou

Published Jan 24, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.18359667

Related papers

Axiomatic Emergence U; Algebraic Origin and Physical Argumentation of Non-Hermitian Quantum Systems

changzheng zhou, ZIQING zhou

This paper aims to establish a general theoretical framework that, starting fromtwo basic axioms about the realizability of the physical world, deduces the necessary form of algebraic structures required to describe quantum systems. These twoaxioms are: Generalized Information Flow Constraint (G1) and Finite-Step Computability (G2). We prove that for open quantum systems (non-Hermitian systems)incorporating dissipation and gain, their observable algebra must be organized intoa generalized factor with a specific “weight” structure. Under the requirement offinite generation (G2), the “relative size” index of subalgebra embeddings exhibitsdiscreteness, which constitutes the mathematical foundation for the emergent generalized braiding algebras and dissipative quantum error-correcting codes in a classof non-Hermitian topological orders. This work not only provides a unified algebraicperspective for understanding non-Hermitian topological matter but also proposesexperimental verification ideas based on dissipative topological superconductingsystems and noisy quantum processors.

•Jan 26, 2026•0 citations

Axiomatic Emergence Z; The Physical Origin of Lower Bounds of Computational Complexity

changzheng zhou, ZIQING zhou

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.

•Jan 28, 2026•0 citations

The Ladder of Stability L: Constraints of the Jones Index on Excitation Gaps in Non-Abelian Topological Order– Predictions and Tests Based on the Subfactor Framework

changzheng zhou, ZIQING zhou

The low-energy excitations of non-Abelian topological order are described byanyon fusion categories. In the thermodynamic limit, the algebra of local observables may form a tower of von Neumann subfactor inclusions, and the correspondence between the Jones index and the total quantum dimension of anyons hasbeen supported by Longo’s theorem in algebraic quantum field theory and by explicit calculations in Kitaev’s quantum double model. Taking this as a startingpoint, this paper does not presuppose the universal validity of subfactor structures in generic strongly correlated lattice systems; instead, it sets them as explicittheoretical hypotheses and systematically constructs a derivation chain from thediscrete sequence of Jones indices to constraints on physical excitation gap ratios.The central link is the definition of a subfactorizable Hamiltonian– expressing thelow-energy effective Hamiltonian, within an energy cutoff, as a quadratic form inTemperley-Lieb projections– thereby using the representation theory of the TLalgebra to establish a mapping between anyon excitations and Bratteli diagramnodes, leading to the conclusion that the gap ratio depends only on the Jones parameter τ. The discrete valueing of the Jones index when it is less than 4 forcesτ to be locked to a countable set, yielding the rigid prediction that within thesame topological phase region the ratio of different excitation gaps cannot driftcontinuously with external parameters. This paper designs an experimental testscheme based on scanning tunneling spectroscopy and transport measurements,and systematically provides falsification conditions, so that each hypothesis in thetheoretical framework can be independently tested. The contribution of this paper lies in extending subfactor algebra theory from exactly solvable models to atheoretical framework with operational physical predictions, through a cautioushypothesis–deduction–test structure.

•May 18, 2026•0 citations

The Ladder of Rules C: The Axioms of Information Conservation and Computability- Two Physical Boundaries of Structural Openness

changzheng zhou, ZIQING zhou

Structural openness endows a system with the ability to transform its own constraints at the meta-rule level. However, without rigid boundaries, it leads to theparadoxes of information creation and computational infeasibility. This paper proposes two fundamental axioms: the information conservation axiom requires thatrule transformations do not alter the total amount of discriminative informationthe system can process, which is equivalent to requiring the corresponding physical map to be a doubly stochastic completely positive trace-preserving map; thecomputability axiom requires that the transformation process be completable by aTuring machine in finitely many steps and that the output rules have finite Kolmogorov complexity, which is equivalent to a Kraus representation of finite rankwith computable matrix entries. By introducing a rule-physics two-layer semanticfunctor, rule transformations are strictly mapped to Heisenberg-picture maps onthe projection lattice, thereby establishing an invertible translation between therule layer and the physical layer. The intersection of the two axioms constitutesthe admissible set, which is proved to be a discretely generated monoid. Furthermore, the fixed-point algebra of a rule transformation yields a subfactor inclusionwhose Jones index lies in the discrete spectrum {4cos2(π/n)} and is strictly lessthan 4, quantising the information twist. Modelling rule recursion as a cascadeof hierarchical quantum channels, the Holevo bound gives an upper bound on thedecay of information transmission capacity with recursion depth. Three independent paths — information capacity, finite description length, and the discrete Jonesspectrum — converge to the same conclusion: the recursion depth must be finite,and its upper bound is locked by the system dimension, computational resources,and the discrete Jones spectrum without any external parameters. This frameworktransforms the boundaries of structural openness into computable mathematicalphysical objects.

•May 24, 2026•0 citations

Axiomatic Emergence Y; The Physical Origin of Topological Order

changzheng zhou, ZIQING zhou

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

•Jan 28, 2026•0 citations

The Ladder of Stability F; Experimental Prediction of Discrete Locking of the Spectral Gap in Topological Quantum Platforms

changzheng zhou, ZIQING zhou

Within the theoretical framework of the Ladder of Stability series, this paperadvances the rigidity classification of Jones subfactor indices and Coxeter–Dynkindiagrams into a testable quantitative prediction on topological quantum platforms.Based on the standard correspondence between the quantum dimensions of fusion categories in non-abelian topological order and subfactor inclusion indices, wepropose an effective bridging hypothesis B-J that couples the low-energy excitation gap ∆ to the Jones index [M : N] through a monotonic inverse relationship.This leads to the derivation that, within regions where topological invariants remain constant, the energy gap is locked to a set of discrete steps determined by{4cos2(π/n) | n ≥ 3}, with inter-step ratios that are universal across materialplatforms. The paper systematically analyses the spatial fluctuations of the scaling constant C, derives an upper bound nmax for the number of distinguishablelevels, and thereby strictly confines the experimental test to the low-level regionn ≤ 6. A bivariate test protocol based on scanning tunnelling spectroscopy andtransport measurements is presented, together with precise falsification conditionsthat include Kolmogorov–Smirnov statistical tests and false-positive control provisions. This work transforms the structural rigidity of operator algebras into anoperationally falsifiable empirical prediction, completing a crucial step from mathematical structure to physical observation.

•May 17, 2026•0 citations
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.
This paper aims to establish a general theoretical framework that, starting fromtwo basic axioms about the realizability of the physical world, deduces the necessary form of algebraic structures required to describe quantum systems. These twoaxioms are: Generalized Information Flow Constraint (G1) and Finite-Step Computability (G2). We prove that for open quantum systems (non-Hermitian systems)incorporating dissipation and gain, their observable algebra must be organized intoa generalized factor with a specific “weight” structure. Under the requirement offinite generation (G2), the “relative size” index of subalgebra embeddings exhibitsdiscreteness, which constitutes the mathematical foundation for the emergent generalized braiding algebras and dissipative quantum error-correcting codes in a classof non-Hermitian topological orders. This work not only provides a unified algebraicperspective for understanding non-Hermitian topological matter but also proposesexperimental verification ideas based on dissipative topological superconductingsystems and noisy quantum processors.
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.
The low-energy excitations of non-Abelian topological order are described byanyon fusion categories. In the thermodynamic limit, the algebra of local observables may form a tower of von Neumann subfactor inclusions, and the correspondence between the Jones index and the total quantum dimension of anyons hasbeen supported by Longo’s theorem in algebraic quantum field theory and by explicit calculations in Kitaev’s quantum double model. Taking this as a startingpoint, this paper does not presuppose the universal validity of subfactor structures in generic strongly correlated lattice systems; instead, it sets them as explicittheoretical hypotheses and systematically constructs a derivation chain from thediscrete sequence of Jones indices to constraints on physical excitation gap ratios.The central link is the definition of a subfactorizable Hamiltonian– expressing thelow-energy effective Hamiltonian, within an energy cutoff, as a quadratic form inTemperley-Lieb projections– thereby using the representation theory of the TLalgebra to establish a mapping between anyon excitations and Bratteli diagramnodes, leading to the conclusion that the gap ratio depends only on the Jones parameter τ. The discrete valueing of the Jones index when it is less than 4 forcesτ to be locked to a countable set, yielding the rigid prediction that within thesame topological phase region the ratio of different excitation gaps cannot driftcontinuously with external parameters. This paper designs an experimental testscheme based on scanning tunneling spectroscopy and transport measurements,and systematically provides falsification conditions, so that each hypothesis in thetheoretical framework can be independently tested. The contribution of this paper lies in extending subfactor algebra theory from exactly solvable models to atheoretical framework with operational physical predictions, through a cautioushypothesis–deduction–test structure.
Structural openness endows a system with the ability to transform its own constraints at the meta-rule level. However, without rigid boundaries, it leads to theparadoxes of information creation and computational infeasibility. This paper proposes two fundamental axioms: the information conservation axiom requires thatrule transformations do not alter the total amount of discriminative informationthe system can process, which is equivalent to requiring the corresponding physical map to be a doubly stochastic completely positive trace-preserving map; thecomputability axiom requires that the transformation process be completable by aTuring machine in finitely many steps and that the output rules have finite Kolmogorov complexity, which is equivalent to a Kraus representation of finite rankwith computable matrix entries. By introducing a rule-physics two-layer semanticfunctor, rule transformations are strictly mapped to Heisenberg-picture maps onthe projection lattice, thereby establishing an invertible translation between therule layer and the physical layer. The intersection of the two axioms constitutesthe admissible set, which is proved to be a discretely generated monoid. Furthermore, the fixed-point algebra of a rule transformation yields a subfactor inclusionwhose Jones index lies in the discrete spectrum {4cos2(π/n)} and is strictly lessthan 4, quantising the information twist. Modelling rule recursion as a cascadeof hierarchical quantum channels, the Holevo bound gives an upper bound on thedecay of information transmission capacity with recursion depth. Three independent paths — information capacity, finite description length, and the discrete Jonesspectrum — converge to the same conclusion: the recursion depth must be finite,and its upper bound is locked by the system dimension, computational resources,and the discrete Jones spectrum without any external parameters. This frameworktransforms the boundaries of structural openness into computable mathematicalphysical objects.
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
Within the theoretical framework of the Ladder of Stability series, this paperadvances the rigidity classification of Jones subfactor indices and Coxeter–Dynkindiagrams into a testable quantitative prediction on topological quantum platforms.Based on the standard correspondence between the quantum dimensions of fusion categories in non-abelian topological order and subfactor inclusion indices, wepropose an effective bridging hypothesis B-J that couples the low-energy excitation gap ∆ to the Jones index [M : N] through a monotonic inverse relationship.This leads to the derivation that, within regions where topological invariants remain constant, the energy gap is locked to a set of discrete steps determined by{4cos2(π/n) | n ≥ 3}, with inter-step ratios that are universal across materialplatforms. The paper systematically analyses the spatial fluctuations of the scaling constant C, derives an upper bound nmax for the number of distinguishablelevels, and thereby strictly confines the experimental test to the low-level regionn ≤ 6. A bivariate test protocol based on scanning tunnelling spectroscopy andtransport measurements is presented, together with precise falsification conditionsthat include Kolmogorov–Smirnov statistical tests and false-positive control provisions. This work transforms the structural rigidity of operator algebras into anoperationally falsifiable empirical prediction, completing a crucial step from mathematical structure to physical observation.