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

arXiv:2608.21588

Neural Network Field Theory at Finite Width

Christian Ferko, Aaron Mutchler

Published Aug 21, 2026• 1 citation
arXivHTMLPDF

Abstract

Under mild assumptions, any quantum mechanical (QM) model or quantum field theory (QFT) admits a representation in terms of an ensemble of neural networks with countably many random parameters. We investigate the features of NN-QM and NN-FT models with finitely many parameters, such as a feedforward network of width $N < \infty$. We find that, generically, such models must violate one of the properties of conventional Euclidean QFTs, such as reflection positivity or cluster decomposition. We present several complementary ways of understanding which features can and cannot be preserved at finite $N$, both in QM and in QFT.

DOI
10.48550/arxiv.2608.21588

Related papers

What Neural Network Field Theory Can and Cannot Realise on a Computer

Thomas R. Harvey

One aim of neural network field theory is to put a quantum or effective field theory on a computer, with the network ensemble itself as the theory. We ask how far that aim can be pushed for a function class regular enough to be computed with. Our main result is a no-go theorem with assumptions that hold for standard network architectures. We use it to separate four versions of neural network field theory, according to whether the defining object is the finite width ensemble or its infinite width limit, and whether the target we want to compute is a quantum or an effective field theory. Neither finite width interpretation is straightforwardly consistent. For finite width ensembles with finite variance at each point, the QFT interpretation fails reflection positivity, while the EFT interpretation establishes no scale separation by which the positivity violation can be placed outside its domain of validity. Of the two limit versions, one can be simulated in full and the other only in part, as only its smeared correlators are computable with a controlled error. As such, at the level of a controlled numerical computation, the QFT and EFT versions cannot be distinguished. One dimension escapes the obstruction, yet reflection positivity is shown to still fail there at every finite width for the cosine network. Two escapes from the theorem remain, giving up either finite variance at a point or exact rotation invariance, and we discuss both of these possibilities.

arXiv:2608.21523•Aug 21, 2026•2 citations

Renormalization in the neural network-quantum field theory correspondence

Harold Erbin, Vincent Lahoche, Dine Ousmane Samary

A statistical ensemble of neural networks can be described in terms of a quantum field theory (NN-QFT correspondence). The infinite-width limit is mapped to a free field theory, while finite N corrections are mapped to interactions. After reviewing the correspondence, we will describe how to implement renormalization in this context and discuss preliminary numerical results for translation-invariant kernels. A major outcome is that changing the standard deviation of the neural network weight distribution corresponds to a renormalization flow in the space of networks.

arXiv:2212.11811•Dec 22, 2022•15 citations

Neural Network Quantum Field Theory from Transformer Architectures

Dmitry Sergeevich Ageev, Y. Ageeva

We propose a neural-network construction of Euclidean scalar quantum field theories from transformer attention heads, defining $n$-point correlators by averaging over random network parameters in the NN-QFT framework. For a single attention head, shared random softmax weights couple different width coordinates and induce non-Gaussian field statistics that persist in the infinite-width limit $d_k\to\infty$. We compute the two-point function in an attention-weight representation and show how Euclidean-invariant kernels can be engineered via random-feature token embeddings. We then analyze the connected four-point function and identify an "independence-breaking" contribution, expressible as a covariance over query-key weights, which remains finite at infinite width. Finally, we show that summing many independent heads with standard $1/N_h$ normalization suppresses connected non-Gaussian correlators as $1/N_h$, yielding a Gaussian NN-QFT in the large-head limit.

arXiv:2602.10209•Feb 10, 2026•5 citations

Criticality in Neural Network Function Space through Wilsonian Fixed Points and Finite-Width Corrections

Eric Howard, Iftekher S. Chowdhury, Hardique Dasore +1 more

Neural networks can be studied not only as parameterized computational models but also as probability distributions over functions. In this paper we develop a Wilsonian interpretation of criticality in the neural network-quantum field theory correspondence, treating the infinite width Gaussian-process limit as a free field fixed point and finite width corrections as perturbations that create non-Gaussian interactions. In this way, we do not see the departure from infinite width as a small approximation error but as the process by which interaction, complexity, expressivity and phase-like behaviour enter neural network function space. Width, depth, activation nonlinearity, initialization variance, and training dynamics are considered as control parameters that change the effective action of the network ensemble. The critical regime is when the higher-order connected correlation functions become non-negligible, and when the finite width operators become relevant or marginal scaling factors, and when the function distribution becomes sensitive to scale-dependent structure. There we can view overparameterization as suppressing a relationship of interacting terms and we find that the critical structure of finite neural networks is given by finite-width effects. This framework is a theoretical basis for studying trainability, generalization, and architectural universality of neural network functions through Wilsonian fixed points, perturbations, and critical surfaces.

cond-mat.dis-nnCross-listedarXiv:2608.20403•Aug 5, 2026

Universality of Neural Network Field Theory

Christian Ferko, James Halverson, Aaron Mutchler

We prove that any quantum field theory, or more generally any probability distribution over tempered distributions in $\mathbb{R}^d$, admits a neural network description with a countable infinity of parameters. As an example, we realize the $2d$ Liouville theory as a neural network and numerically compute the three-point function of vertex operators, finding agreement with the DOZZ formula.

arXiv:2601.14453•Jan 20, 2026•14 citations

Quantum mechanics and neural networks

Christian Ferko, James Halverson

Abstract We demonstrate that any Euclidean-time quantum mechanical theory may be represented as a neural network (NN), ensured by the Kosambi–Karhunen–Loève theorem, mean-square path continuity, and finite two-point functions. The additional constraint of reflection positivity, which is related to unitarity, may be achieved by a number of mechanisms, such as imposing NN parameter space splitting or the Markov property. Non-differentiability of the networks is related to the appearance of non-trivial commutators. Neural networks acting on Markov processes are no longer Markov, but still reflection positive, which facilitates the definition of deep NN quantum systems. We illustrate these principles in several examples using numerical implementations, recovering classic quantum mechanical results such as Heisenberg uncertainty, non-trivial commutators, and the spectrum.

arXiv:2504.05462•Machine Learning Science and Technology•Dec 24, 2025•12 citations
Under mild assumptions, any quantum mechanical (QM) model or quantum field theory (QFT) admits a representation in terms of an ensemble of neural networks with countably many random parameters. We investigate the features of NN-QM and NN-FT models with finitely many parameters, such as a feedforward network of width N<∞N < \inftyN<∞. We find that, generically, such models must violate one of the properties of conventional Euclidean QFTs, such as reflection positivity or cluster decomposition. We present several complementary ways of understanding which features can and cannot be preserved at finite NNN, both in QM and in QFT.
One aim of neural network field theory is to put a quantum or effective field theory on a computer, with the network ensemble itself as the theory. We ask how far that aim can be pushed for a function class regular enough to be computed with. Our main result is a no-go theorem with assumptions that hold for standard network architectures. We use it to separate four versions of neural network field theory, according to whether the defining object is the finite width ensemble or its infinite width limit, and whether the target we want to compute is a quantum or an effective field theory. Neither finite width interpretation is straightforwardly consistent. For finite width ensembles with finite variance at each point, the QFT interpretation fails reflection positivity, while the EFT interpretation establishes no scale separation by which the positivity violation can be placed outside its domain of validity. Of the two limit versions, one can be simulated in full and the other only in part, as only its smeared correlators are computable with a controlled error. As such, at the level of a controlled numerical computation, the QFT and EFT versions cannot be distinguished. One dimension escapes the obstruction, yet reflection positivity is shown to still fail there at every finite width for the cosine network. Two escapes from the theorem remain, giving up either finite variance at a point or exact rotation invariance, and we discuss both of these possibilities.
A statistical ensemble of neural networks can be described in terms of a quantum field theory (NN-QFT correspondence). The infinite-width limit is mapped to a free field theory, while finite N corrections are mapped to interactions. After reviewing the correspondence, we will describe how to implement renormalization in this context and discuss preliminary numerical results for translation-invariant kernels. A major outcome is that changing the standard deviation of the neural network weight distribution corresponds to a renormalization flow in the space of networks.
We propose a neural-network construction of Euclidean scalar quantum field theories from transformer attention heads, defining nnn-point correlators by averaging over random network parameters in the NN-QFT framework. For a single attention head, shared random softmax weights couple different width coordinates and induce non-Gaussian field statistics that persist in the infinite-width limit dk→∞d_k\to\inftydk​→∞. We compute the two-point function in an attention-weight representation and show how Euclidean-invariant kernels can be engineered via random-feature token embeddings. We then analyze the connected four-point function and identify an "independence-breaking" contribution, expressible as a covariance over query-key weights, which remains finite at infinite width. Finally, we show that summing many independent heads with standard 1/Nh1/N_h1/Nh​ normalization suppresses connected non-Gaussian correlators as 1/Nh1/N_h1/Nh​, yielding a Gaussian NN-QFT in the large-head limit.
Neural networks can be studied not only as parameterized computational models but also as probability distributions over functions. In this paper we develop a Wilsonian interpretation of criticality in the neural network-quantum field theory correspondence, treating the infinite width Gaussian-process limit as a free field fixed point and finite width corrections as perturbations that create non-Gaussian interactions. In this way, we do not see the departure from infinite width as a small approximation error but as the process by which interaction, complexity, expressivity and phase-like behaviour enter neural network function space. Width, depth, activation nonlinearity, initialization variance, and training dynamics are considered as control parameters that change the effective action of the network ensemble. The critical regime is when the higher-order connected correlation functions become non-negligible, and when the finite width operators become relevant or marginal scaling factors, and when the function distribution becomes sensitive to scale-dependent structure. There we can view overparameterization as suppressing a relationship of interacting terms and we find that the critical structure of finite neural networks is given by finite-width effects. This framework is a theoretical basis for studying trainability, generalization, and architectural universality of neural network functions through Wilsonian fixed points, perturbations, and critical surfaces.
We prove that any quantum field theory, or more generally any probability distribution over tempered distributions in Rd\mathbb{R}^dRd, admits a neural network description with a countable infinity of parameters. As an example, we realize the 2d2d2d Liouville theory as a neural network and numerically compute the three-point function of vertex operators, finding agreement with the DOZZ formula.
Abstract We demonstrate that any Euclidean-time quantum mechanical theory may be represented as a neural network (NN), ensured by the Kosambi–Karhunen–Loève theorem, mean-square path continuity, and finite two-point functions. The additional constraint of reflection positivity, which is related to unitarity, may be achieved by a number of mechanisms, such as imposing NN parameter space splitting or the Markov property. Non-differentiability of the networks is related to the appearance of non-trivial commutators. Neural networks acting on Markov processes are no longer Markov, but still reflection positive, which facilitates the definition of deep NN quantum systems. We illustrate these principles in several examples using numerical implementations, recovering classic quantum mechanical results such as Heisenberg uncertainty, non-trivial commutators, and the spectrum.