We propose that neural activity can be rigorously modeled as tensor network states, with cortical hierarchies mapping onto a Multi-scale Entanglement Renormalization Ansatz (MERA) architecture. Within this framework, we identify the effective bond dimension as a measurable neural correlate of consciousness, providing a computationally tractable alternative to integrated information theory. We prove that a tensor-network-based integration measure preserves key properties of established consciousness theories while remaining efficiently computable. The hierarchical organization of the visual cortex—from primary through associative areas—is shown to follow quantitative coarse-graining laws consistent with renormalization group structure. We derive explicit bounds on information capacity and learning complexity, and specify experimental protocols using standard neuroimaging technology. The framework yields falsifiable predictions: bond dimension values across cortical regions, exponential decay of bond dimension under anesthesia, and a universal consciousness threshold at loss of consciousness. Each claim is assigned an explicit epistemic level, separating proven mathematical theorems from empirically testable hypotheses and speculative interpretations. This approach opens pathways toward objective consciousness diagnostics in disorders of awareness and personalized anesthesia monitoring.
We propose that neural activity can be rigorously modeled as tensor network states, with cortical hierarchies mapping onto a Multi-scale Entanglement Renormalization Ansatz (MERA) architecture. Within this framework, we identify the effective bond dimension as a measurable neural correlate of consciousness, providing a computationally tractable alternative to integrated information theory. We prove that a tensor-network-based integration measure preserves key properties of established consciousness theories while remaining efficiently computable. The hierarchical organization of the visual cortex—from primary through associative areas—is shown to follow quantitative coarse-graining laws consistent with renormalization group structure. We derive explicit bounds on information capacity and learning complexity, and specify experimental protocols using standard neuroimaging technology. The framework yields falsifiable predictions: bond dimension values across cortical regions, exponential decay of bond dimension under anesthesia, and a universal consciousness threshold at loss of consciousness. Each claim is assigned an explicit epistemic level, separating proven mathematical theorems from empirically testable hypotheses and speculative interpretations. This approach opens pathways toward objective consciousness diagnostics in disorders of awareness and personalized anesthesia monitoring.
Far from equilibrium, neural systems self-organize across multiple scales. Exploiting multiscale self-organization in neuroscience and artificial intelligence requires a computational framework for modeling the effective non-equilibrium dynamics of stochastic neural trajectories. Non-equilibrium thermodynamics and representational geometry offer theoretical foundations, but we need scalable data-driven techniques for modeling collective properties of high-dimensional neural networks from partial subsampled observations. Renormalization is a coarse-graining technique central to studying emergent scaling properties of many-body and nonlinear dynamical systems. While widely applied in physics and machine learning, coarse-graining complex dynamical networks remains unsolved, affecting many computational sciences. Recent diffusion-based renormalization, inspired by quantum statistical mechanics, coarse-grains networks near entropy transitions marked by maximal changes in specific heat or information transmission. Here I explore diffusion-based renormalization of neural systems by generating symmetry-breaking representations across scales and offering scalable algorithms using tensor networks. Diffusion-guided renormalization bridges microscale and mesoscale dynamics of dissipative neural systems. For microscales, I developed a scalable graph inference algorithm for discovering community structure from subsampled neural activity. Using community-based node orderings, diffusion-guided renormalization generates renormalization group flow through metagraphs and joint probability functions. Towards mesoscales, diffusion-guided renormalization targets learning the effective non-equilibrium dynamics of dissipative neural trajectories occupying lower-dimensional subspaces, enabling coarse-to-fine control in systems neuroscience and artificial intelligence.
Quantum consciousness, the hypothesized subjective experience arising from quantum processes, has remained largely a philosophical debate with limited empirical validation. Traditional approaches to studying consciousness rely heavily on correlational studies, which often struggle to capture the nuances of subjective experience. This paper proposes a novel metric, the "Cognitive Resonance" measure, designed to quantify the level of conscious experience within a system by integrating neural network activity and quantum system dynamics. We argue that this metric offers a potential pathway to move beyond correlation-based measures, establishing a quantifiable link between subjective experience and fundamental quantum phenomena. The core mechanism centers around creating a metric that directly assesses the coherence and synchronized emergence of neural networks and quantum states, offering a potential testable framework for understanding the nature of consciousness. This work builds upon existing research in neural networks, quantum information theory, and subjective experience, aiming to provide a mathematically rigorous and potentially transformative approach to investigating this enduring mystery.
This preprint presents a rigorous, self-contained mathematical framework for numerically approximating the Riemann Zeta function using Multiscale Entanglement Renormalization Ansatz (MERA) tensor networks. By formally establishing a unitary equivalence between the MERA coarse-graining operator and a discretized Mellin integral (Lemma 3.1), we analytically derive the theoretical infrared fixed point (Theorem 3.1) to be γtarget=log(2π)2π2≈0.0931γtarget=2π2log(2π)≈0.0931. This derivation leverages the polygamma function evaluated at the center of the critical strip. A numerical implementation with bond dimension χ=2χ=2 achieves this target with an absolute error of 1.3×10−51.3×10−5 and a relative error of +0.0139%+0.0139%. We also provide strict, exponentially converging error bounds based on the singular value decomposition of Hankel/Mellin-type operators (Theorem 3.2). Notably, this mathematically derived fixed point provides the fundamental scale parameter for the Renormalization Group Scale (RG-S) within the R5+ modified gravity model. Keywords: Riemann Zeta Function, MERA, Tensor Networks, Mellin Transform, Renormalization Group, Functional Equation, Fixed Point, Numerical Analysis, R5+ Gravity.
This preprint presents a rigorous, self-contained mathematical framework for numerically approximating the Riemann Zeta function using Multiscale Entanglement Renormalization Ansatz (MERA) tensor networks. By formally establishing a unitary equivalence between the MERA coarse-graining operator and a discretized Mellin integral (Lemma 3.1), we analytically derive the theoretical infrared fixed point (Theorem 3.1) to be γtarget=log(2π)2π2≈0.0931γtarget=2π2log(2π)≈0.0931. This derivation leverages the polygamma function evaluated at the center of the critical strip. A numerical implementation with bond dimension χ=2χ=2 achieves this target with an absolute error of 1.3×10−51.3×10−5 and a relative error of +0.0139%+0.0139%. We also provide strict, exponentially converging error bounds based on the singular value decomposition of Hankel/Mellin-type operators (Theorem 3.2). Notably, this mathematically derived fixed point provides the fundamental scale parameter for the Renormalization Group Scale (RG-S) within the R5+ modified gravity model. Keywords: Riemann Zeta Function, MERA, Tensor Networks, Mellin Transform, Renormalization Group, Functional Equation, Fixed Point, Numerical Analysis, R5+ Gravity.
Tensor networks are a class of methods for studying many-body systems. They give a geometrical description of the internal structure of many-body states, operators, and partition functions, that can be used to implement efficient algorithms to simulate them numerically. In this thesis, after providing a very brief overview of the field, we present new tensor network methods for three different use cases. \n \nFirst, we present a new real-space renormalization group algorithm for tensor networks. Compared to existing methods, its advantages are its low computational cost, simplicity of implementation, and applicability to any network. We benchmark it on the 2D classical Ising model and find accuracy comparable with the best existing tensor network methods. Due to its simplicity and generalizability, we consider our algorithm to be an excellent candidate for implementation of real-space renormalization in higher dimensions, and discuss some of the details and the remaining challenges in 3D. \n \nSecond, we show how certain topological conformal defects of critical lattice theories can be represented as tensor networks, using the 2D classical Ising model as an example. Furthermore, we show how such tensor network descriptions, combined with a renormalization group algorithm, can be used to obtain accurate estimates of the universal properties of these defects. We also show how coarse-graining of defects can be applied to any conformal defect (i.e. not just topological ones), and yields a set of associated scaling dimensions. \n \nFinally, we leave behind the focus on renormalization group methods, and present a method for spatially resolving the overlap between two tensor network states, to obtain localized information about the similarities and differences between them. For a given region, the similarity of two states in this region can be quantified by the Uhlmann fidelity of their reduced density matrices, and we show how such fidelities can be efficiently computed in many cases when the two states are represented as tensor networks. We demonstrate the usefulness of evaluating such subsystem fidelities with three example applications: studying local quenches, comparing critical and non-critical states, and quantifying convergence in tensor network simulations.
Tensor network methods are powerful tools for studying quantum many-body systems. In this paper, we investigate the emergent statistical properties of random high-dimensional tensor-network states and the trainability of variational tensor networks. We utilize diagrammatic methods and map our problems to the calculations of different partition functions for high-dimensional Ising models with special structures. To address the notorious difficulty in cracking these models, we develop a combinatorial method based on solving the ``puzzle of polyominoes". With this method, we are able to rigorously study statistical properties of the high dimensional random tensor networks. We prove: (a) the entanglement entropy approaches the maximal volume law, except for a small probability that is bounded by an inverse polynomial of the bond dimension; (b) the typicality occurs for the expectation value of a local observable when the bond dimension increases. In addition, we investigate the barren plateaus (i.e., exponentially vanishing gradients) for the high-dimensional tensor network models. We prove that such variational models suffer from barren plateaus for global loss functions, rendering their training processes inefficient in general. Whereas, for local loss functions, we prove that the gradient is independent of the system size (thus no barren plateau occurs), but decays exponentially with the distance between the region where the local observable acts and the site that hosts the derivative parameter. Our results uncover in a rigorous fashion some fundamental properties for variational high-dimensional tensor networks, which paves a way for their future theoretical studies and practical applications.