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.
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
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 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.
Recently, the dynamics of quantum systems that involve both unitary evolution and quantum measurements have attracted attention due to the exotic phenomenon of measurement-induced phase transitions. The latter refers to a sudden change in a property of a state of n qubits, such as its entanglement entropy, depending on the rate at which individual qubits are measured. At the same time, quantum complexity emerged as a key quantity for the identification of complex behaviour in quantum many-body dynamics. In this work, we investigate the dynamics of the quantum state complexity in monitored random circuits, where n qubits evolve according to a random unitary circuit and are individually measured with a fixed probability at each time step. We find that the evolution of the exact quantum state complexity undergoes a phase transition when changing the measurement rate. Below a critical measurement rate, the complexity grows at least linearly in time until {saturating to a value e Ω ( n ) .} Above, the complexity does not exceed poly ( n ) . In our proof, we make use of percolation theory to find paths along which an exponentially long quantum computation can be run below the critical rate, and to identify events where the state complexity is reset to zero above the critical rate. We lower bound the exact state complexity in the former regime using recently developed techniques from algebraic geometry. Our results combine quantum complexity growth, phase transitions, and computation with measurements to help understand the behavior of monitored random circuits and to make progress towards determining the computational power of measurements in many-body systems.
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.