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:2504.05462 · Machine Learning Science and Technology

Quantum mechanics and neural networks

Christian Ferko, James Halverson

Published Dec 24, 2025• 12 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/2632-2153/ae3105

Related papers

Neural Network Field Theory at Finite Width

Christian Ferko, Aaron Mutchler

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.

arXiv:2608.21588•Aug 21, 2026•1 citation

A quantum information theoretic view on a deep quantum neural network

Beatrix C. Hiesmayr

We discuss a quantum version of an artificial deep neural network where the role of neurons is taken over by qubits and the role of weights is played by unitaries. The role of the non-linear activation function is taken over by subsequently tracing out layers (qubits) of the network. We study two examples and discuss the learning from a quantum information theoretic point of view. In detail, we show that the lower bound of the Heisenberg uncertainty relations is defining the change of the gradient descent in the learning process. We raise the question if the limit by Nature to two non-commuting observables, quantified in the Heisenberg uncertainty relations, is ruling the optimization of the quantum deep neural network. We find a negative answer.

arXiv:2212.12906•AIP conference proceedings•Jan 1, 2024•5 citations

Developments of Neural Networks in Quantum Physics

Yue Ban, Javier Echanobe, E. Torrontegui +1 more

Quantum machine learning emerges from the symbiosis of quantum mechanics and machine learning. In particular, the latter gets displayed in quantum sciences as: (i) the use of classical machine learning as a tool applied to quantum physics problems, (ii) or the use of quantum resources such as superposition, entanglement, or quantum optimization protocols to enhance the performance of classification and regression tasks compare to their classical counterparts. This paper reviews examples in these two scenarios. On the one hand, the application of classical neural network to design a new quantum sensing protocol. On the other hand, the design of a quantum neural network based on the dynamics of a quantum perceptron optimized with the aid of shortcuts to adiabaticity gives rise to a short operation time and robust performance. These examples demonstrate the mutual reinforcement of both neural networks and quantum physics.

•May 27, 2021•0 citations

Quantum mechanics on non commutative spaces and squeezed states: a functional approach

Musongela Lubo

We review here the quantum mechanics of some noncommutative theories in which no state saturates simultaneously all the non trivial Heisenberg uncertainty relations. We show how the difference of structure between the Poisson brackets and the commutators in these theories generically leads to a harmonic oscillator whose positions and momenta mean values are not strictly equal to the ones predicted by classical mechanics. This raises the question of the nature of quasi classical states in these models. We propose an extension based on a variational principle. The action considered is the sum of the absolute values of the expressions associated to the non trivial Heisenberg uncertainty relations. We first verify that our proposal works in the usual theory i.e we recover the known Gaussian functions. Besides them, we find other states which can be expressed as products of Gaussians with specific hyper geometrics. We illustrate our construction in two models defined on a four dimensional phase space: a model endowed with a minimal length uncertainty and the non commutative plane. Our proposal leads to second order partial differential equations. We find analytical solutions in specific cases. We briefly discuss how our proposal may be applied to the fuzzy sphere and analyze its shortcomings.

arXiv:hep-th/0304039•Apr 4, 2003•7 citations

On quantum neural networks

Alexandr Alexandrovich Ezhov

The early definition of a quantum neural network as a new field that combines the classical neurocomputing with quantum computing was rather vague and satisfactory in the 2000s. The widespread in 2020 modern definition of a quantum neural network as a model or machine learning algorithm that combines the functions of quantum computing with artificial neural networks deprives quantum neural networks of their fundamental importance. We argue that the concept of a quantum neural network should be defined in terms of its most general function as a tool for representing the amplitude of an arbitrary quantum process. Our reasoning is based on the use of the Feynman path integral formulation in quantum mechanics. This approach has been used in many works to investigate the main problem of quantum cosmology, such as the origin of the Universe. In fact, the question of whether our Universe is a quantum computer was posed by Seth Lloyd, who gave the answer is yes, but we argue that the universe can be thought of as a quantum neural network.

arXiv:2104.07106•Apr 12, 2021•2 citations

A Quantum Approach to Neural Networks

Prof. Ahlam Ansari, Ashhar Shaikh, Faraz Shaikh +1 more

Artificial neural networks, usually just called neural networks, computing systems indefinitely inspired by the biological neural networks and they are extensive in both research as well as industry. It is critical to design quantum Neural Networks for complete quantum learning tasks. In this project, we suggest a computational neural network model based on principles of quantum mechanics which form a quantum feed-forward neural network proficient in universal quantum computation. This structure takes input from one layer of qubits and drives that input onto another layer of qubits. This layer of qubits evaluates this information and drives on the output to the next layer. Eventually, the path leads to the final layer of qubits. The layers do not have to be of the same breadth, meaning they need not have the same number of qubits as the layer before and/or after it. This assembly is trained on which path to take identical to classical ANN. The intended project can be compiled by the subsequent points provided here: 1. The expert training of the quantum neural network utilizing the fidelity as a cost function, providing both conventional and efficient quantum implementations. 2. Use of methods that enable quick optimization with reduced memory requirements. 3. Benchmarking our proposal for the quantum task of learning an unknown unitary and find extraordinary generality and a remarkable sturdiness to noisy training data.

International Journal of Advanced Research in Science Communication and Technology•May 12, 2021•0 citations
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.
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.
We discuss a quantum version of an artificial deep neural network where the role of neurons is taken over by qubits and the role of weights is played by unitaries. The role of the non-linear activation function is taken over by subsequently tracing out layers (qubits) of the network. We study two examples and discuss the learning from a quantum information theoretic point of view. In detail, we show that the lower bound of the Heisenberg uncertainty relations is defining the change of the gradient descent in the learning process. We raise the question if the limit by Nature to two non-commuting observables, quantified in the Heisenberg uncertainty relations, is ruling the optimization of the quantum deep neural network. We find a negative answer.
Quantum machine learning emerges from the symbiosis of quantum mechanics and machine learning. In particular, the latter gets displayed in quantum sciences as: (i) the use of classical machine learning as a tool applied to quantum physics problems, (ii) or the use of quantum resources such as superposition, entanglement, or quantum optimization protocols to enhance the performance of classification and regression tasks compare to their classical counterparts. This paper reviews examples in these two scenarios. On the one hand, the application of classical neural network to design a new quantum sensing protocol. On the other hand, the design of a quantum neural network based on the dynamics of a quantum perceptron optimized with the aid of shortcuts to adiabaticity gives rise to a short operation time and robust performance. These examples demonstrate the mutual reinforcement of both neural networks and quantum physics.
We review here the quantum mechanics of some noncommutative theories in which no state saturates simultaneously all the non trivial Heisenberg uncertainty relations. We show how the difference of structure between the Poisson brackets and the commutators in these theories generically leads to a harmonic oscillator whose positions and momenta mean values are not strictly equal to the ones predicted by classical mechanics. This raises the question of the nature of quasi classical states in these models. We propose an extension based on a variational principle. The action considered is the sum of the absolute values of the expressions associated to the non trivial Heisenberg uncertainty relations. We first verify that our proposal works in the usual theory i.e we recover the known Gaussian functions. Besides them, we find other states which can be expressed as products of Gaussians with specific hyper geometrics. We illustrate our construction in two models defined on a four dimensional phase space: a model endowed with a minimal length uncertainty and the non commutative plane. Our proposal leads to second order partial differential equations. We find analytical solutions in specific cases. We briefly discuss how our proposal may be applied to the fuzzy sphere and analyze its shortcomings.
The early definition of a quantum neural network as a new field that combines the classical neurocomputing with quantum computing was rather vague and satisfactory in the 2000s. The widespread in 2020 modern definition of a quantum neural network as a model or machine learning algorithm that combines the functions of quantum computing with artificial neural networks deprives quantum neural networks of their fundamental importance. We argue that the concept of a quantum neural network should be defined in terms of its most general function as a tool for representing the amplitude of an arbitrary quantum process. Our reasoning is based on the use of the Feynman path integral formulation in quantum mechanics. This approach has been used in many works to investigate the main problem of quantum cosmology, such as the origin of the Universe. In fact, the question of whether our Universe is a quantum computer was posed by Seth Lloyd, who gave the answer is yes, but we argue that the universe can be thought of as a quantum neural network.
Artificial neural networks, usually just called neural networks, computing systems indefinitely inspired by the biological neural networks and they are extensive in both research as well as industry. It is critical to design quantum Neural Networks for complete quantum learning tasks. In this project, we suggest a computational neural network model based on principles of quantum mechanics which form a quantum feed-forward neural network proficient in universal quantum computation. This structure takes input from one layer of qubits and drives that input onto another layer of qubits. This layer of qubits evaluates this information and drives on the output to the next layer. Eventually, the path leads to the final layer of qubits. The layers do not have to be of the same breadth, meaning they need not have the same number of qubits as the layer before and/or after it. This assembly is trained on which path to take identical to classical ANN. The intended project can be compiled by the subsequent points provided here: 1. The expert training of the quantum neural network utilizing the fidelity as a cost function, providing both conventional and efficient quantum implementations. 2. Use of methods that enable quick optimization with reduced memory requirements. 3. Benchmarking our proposal for the quantum task of learning an unknown unitary and find extraordinary generality and a remarkable sturdiness to noisy training data.