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 AE; Information Topological Dynamics and Lower Bounds of Circuit Complexity: A Testable Derivation

changzheng zhou, ZIQING zhou

Published Feb 28, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.18814240

Related papers

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

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 Essence of Emergent Origins I: The Three-Criteria Theory for Topological Order Emergence: Axiomatization, Challenges, and a Unified Framework

zhou, changzheng, ZIQING zhou

This paper proposes a theoretical framework for topological order emergencebased on three criteria: structural stability (S), emergent entropy (E), and decoherence resilience (D). Through axiomatic definitions of the mathematical formsand physical connotations of each criterion, a phenomenological criterion system fortopological order emergence is established. The article systematically explores thephysical origin and universality challenge of the threshold value 0.5, analyzes thecoupling relationships and independence conditions among the criteria, constructsa specific correspondence bridge with category theory invariants, and designs a setof jointly measurable experimental verification schemes. Furthermore, this framework is placed within the context of quantum information theory, proposing thatthe emergence of topological order may correspond to the fundamental limits ofquantum information processing, thereby providing new theoretical perspectivesand operational tools for the identification, classification, and detection of topological phases.

•Dec 7, 2025•0 citations

Spacetime Quantum Circuit Complexity via Measurements

Du, Zhenyu, Zi-Wen Liu, Xiongfeng Ma

Quantum circuit complexity is a fundamental concept whose importance permeates quantum information, computation, many-body physics and high-energy physics. While extensively studied in closed systems, its characterization and behaviors in the widely important setting where the system is embedded within a larger one -- encompassing measurement-assisted state preparation -- lack systematic understanding. We introduce the notion of embedded complexity that characterizes the complexity of projected states and measurement operators in this general setting incorporating auxiliary systems and measurements. For random circuits and certain strongly interacting time-independent Hamiltonian dynamics, we show that the embedded complexity is lower-bounded by the circuit volume -- the total number of gates acting on both the subsystem and its complement. This strengthens the complexity linear growth theorems, enriches the understanding of deep thermalization, and indicates that measurement-assisted methods generically cannot yield significant advantages in state preparation cost, contrary to expectations. We further demonstrate a spacetime conversion of certain circuit models that concentrates circuit volume onto a subsystem, and showcase applications for random circuit sampling and shadow tomography. Our theory establishes a unified framework for space and time aspects of quantum circuit complexity, yielding profound new insights and applications across quantum information and physics.

arXiv:2408.16602•Aug 29, 2024•0 citations

Axiomatic Emergence AB; The Physical Origin of Quantum Logic

changzheng zhou, ZIQING zhou

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.

•Jan 29, 2026•0 citations

Universal Lower Bound on Topological Entanglement Entropy

Isaac H. Kim, Michael Levin, Ting-Chun Lin +2 more

Entanglement entropies of two-dimensional gapped ground states are expected to satisfy an area law, with a constant correction term known as the topological entanglement entropy (TEE). In many models, the TEE takes a universal value that characterizes the underlying topological phase. However, the TEE is not truly universal: it can differ even for two states related by constant-depth circuits, which are necessarily in the same phase. The difference between the TEE and the value predicted by the anyon theory is often called the "spurious" topological entanglement entropy. We show that this spurious contribution is always non-negative, thus the value predicted by the anyon theory provides a universal lower bound. This observation also leads to a definition of TEE that is invariant under constant-depth quantum circuits.

arXiv:2302.00689•Physical Review Letters•Oct 19, 2023•23 citations
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 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 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 a theoretical framework for topological order emergencebased on three criteria: structural stability (S), emergent entropy (E), and decoherence resilience (D). Through axiomatic definitions of the mathematical formsand physical connotations of each criterion, a phenomenological criterion system fortopological order emergence is established. The article systematically explores thephysical origin and universality challenge of the threshold value 0.5, analyzes thecoupling relationships and independence conditions among the criteria, constructsa specific correspondence bridge with category theory invariants, and designs a setof jointly measurable experimental verification schemes. Furthermore, this framework is placed within the context of quantum information theory, proposing thatthe emergence of topological order may correspond to the fundamental limits ofquantum information processing, thereby providing new theoretical perspectivesand operational tools for the identification, classification, and detection of topological phases.
Quantum circuit complexity is a fundamental concept whose importance permeates quantum information, computation, many-body physics and high-energy physics. While extensively studied in closed systems, its characterization and behaviors in the widely important setting where the system is embedded within a larger one -- encompassing measurement-assisted state preparation -- lack systematic understanding. We introduce the notion of embedded complexity that characterizes the complexity of projected states and measurement operators in this general setting incorporating auxiliary systems and measurements. For random circuits and certain strongly interacting time-independent Hamiltonian dynamics, we show that the embedded complexity is lower-bounded by the circuit volume -- the total number of gates acting on both the subsystem and its complement. This strengthens the complexity linear growth theorems, enriches the understanding of deep thermalization, and indicates that measurement-assisted methods generically cannot yield significant advantages in state preparation cost, contrary to expectations. We further demonstrate a spacetime conversion of certain circuit models that concentrates circuit volume onto a subsystem, and showcase applications for random circuit sampling and shadow tomography. Our theory establishes a unified framework for space and time aspects of quantum circuit complexity, yielding profound new insights and applications across quantum information and physics.
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.
Entanglement entropies of two-dimensional gapped ground states are expected to satisfy an area law, with a constant correction term known as the topological entanglement entropy (TEE). In many models, the TEE takes a universal value that characterizes the underlying topological phase. However, the TEE is not truly universal: it can differ even for two states related by constant-depth circuits, which are necessarily in the same phase. The difference between the TEE and the value predicted by the anyon theory is often called the "spurious" topological entanglement entropy. We show that this spurious contribution is always non-negative, thus the value predicted by the anyon theory provides a universal lower bound. This observation also leads to a definition of TEE that is invariant under constant-depth quantum circuits.