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

International Conference on System Reliability and Safety (ICSRS)

Quantum Physics Stochastic Neural Networks (QPNN)

Umberto Alibrandi, Claudio M. Perez, Khalid M. Mosalam

Published Nov 20, 2024• 0 citations
Publisher

Abstract

In this paper we introduce a framework of Quantum Probability (QP) as a generalized probability theory under limited information. We show that the proposed QP includes the Classical Probability (CP) as a particular case. Moreover, QP is linked to the classical mechanics through the concepts of action, Lagrangian and Hamiltonian. Starting from our QP formalism we sketch the formulation of Quantum Physics Neural Networks (QPNN) able to take into account limited information and model uncertainty. Relations with statistical physics and Ising model, Reduced Boltzmann Machines (RBM) and Deep Belief Networks (DBN) are discussed. It is also discussed their connection with Quantum Imprecise Bayesian Network (QIBN), recently proposed for sustainability and resilience of socio-ecological technical systems under uncertainty.

DOI
10.1109/icsrs63046.2024.10927527

Related papers

Can quantum probability provide a new direction for cognitive modeling?

Emmanuel M. Pothos, Jerome R. Busemeyer

Classical (Bayesian) probability (CP) theory has led to an influential research tradition for modeling cognitive processes. Cognitive scientists have been trained to work with CP principles for so long that it is hard even to imagine alternative ways to formalize probabilities. However, in physics, quantum probability (QP) theory has been the dominant probabilistic approach for nearly 100 years. Could QP theory provide us with any advantages in cognitive modeling as well? Note first that both CP and QP theory share the fundamental assumption that it is possible to model cognition on the basis of formal, probabilistic principles. But why consider a QP approach? The answers are that (1) there are many well-established empirical findings (e.g., from the influential Tversky, Kahneman research tradition) that are hard to reconcile with CP principles; and (2) these same findings have natural and straightforward explanations with quantum principles. In QP theory, probabilistic assessment is often strongly context- and order-dependent, individual states can be superposition states (that are impossible to associate with specific values), and composite systems can be entangled (they cannot be decomposed into their subsystems). All these characteristics appear perplexing from a classical perspective. However, our thesis is that they provide a more accurate and powerful account of certain cognitive processes. We first introduce QP theory and illustrate its application with psychological examples. We then review empirical findings that motivate the use of quantum theory in cognitive theory, but also discuss ways in which QP and CP theories converge. Finally, we consider the implications of a QP theory approach to cognition for human rationality.

Behavioral and Brain Sciences•May 14, 2013•472 citations

Quantum machine learning

Jonathan Allcock, Shengyu Zhang

Quantum machine learning is at the crossroads of two of the most exciting current areas of research: quantum computing and classical machine learning. Although the field is still in its infancy, the body of literature is already large enough to warrant several review articles [1–3]. This short survey focuses on a selection of significant recent results on the subtopic of quantum neural networks, an area that hopes to build on the enormous impact that classical neural networks have had. In particular, we concentrate on quantum generalizations of popular neural-network concepts such as Boltzmann machines, generative adversarial networks and autoencoders, as well as applications of classical neural networks to quantum information and vice versa. Examples of Boltzmann machines. In a fully connected Boltzmann machine, connections exist between all visible and hidden neurons. In a restricted Boltzmann machine (RBM), there are no connections between neurons of the same type. A deep Boltzmann machine (DBM) consists of adding one or more additional layers of hidden neurons to an RBM, with no connections between neurons in the same layer. The energy-based nature of BMs gives a natural framework for considering quantum generalizations of their behavior. The BM energy function is equivalent to the Hamiltonian of a simple Ising model and one might hope that more general Hamiltonians allowed by quantum mechanics could explain certain data sets better than classically. Amin et al. [4] adopt this approach, and take the so-called transverse field Ising Hamiltonian as the energy function. This increased generality brings certain difficulties, however, as the transverse field term makes training the quantum Boltzmann machine (QBM) non-trivial. Although the general scaling and performance of QBMs is not yet well understood, for certain small-size examples the authors observe that their QBMs can learn data distributions better than classical BMs. Kieferova and Wiebe [5] extend the formalism of Amin et al. and consider more general Hamiltonians that, unlike the transverse Ising model, are not in general believed to be classically efficiently simulatable. Furthermore, they propose new methods for training that allow for parameters corresponding to quantum terms to be learned. Finally, their QBM enables a form of quantum-state tomography that can learn non-classical data, and also generate copies of the reconstructed state. Again, small-scale numerical evidence suggests that their proposals may provide an advantage over classical BMs, although their tendency to overfit data must be investigated further. The practical value of BMs, either classical or quantum, relies in part on the ease with which they are trained. This in turn depends on sampling efficiently from the Boltzmann distribution. Classically this can be done approximately only for the special case of restricted Boltzmann machines (RBM), i.e. where connections are between visible and hidden units, and no connections exist between neurons of the same type. Wiebe et al. [6] propose two quantum algorithms for Boltzmann sampling, based on starting from a state corresponding to the product distribution that is closest to the target Boltzmann distribution. While small-scale numerical studies are encouraging, true bounds on the running time of their algorithms rely on a problem-dependent parameter κ, the scaling of which is hard to estimate. The hope remains though that empirically their algorithms work well in practice, even for multi-layer and fully connected BMs. The expressive power of BMs for compactly representing complicated probability distributions has led to another line of investigation, namely their use for representing quantum many-body wave functions. The authors apply this technique to two prototypical spin models and achieve high accuracy in both ground-state estimation and dynamical evolution, improving on existing state-of-the-art techniques. Their results indicate that RBM states can capture complex many-body correlations in an efficient manner—evidence reinforced by the work of Deng et al. [8], who show that certain topological quantum states in one, two and three dimensions can be represented by RBM states with a number of parameters only linear in the system size. In a subsequent study, however, Gao and Duan [9] prove that although RBM states can indeed represent many highly entangled states, their expressive power is limited in that they cannot represent arbitrary states generated by polynomial-sized quantum circuits, nor those that are the ground states of k-local Hamiltonians with polynomial-sized energy gaps, unless the polynomial hierarchy from computational complexity theory collapses. On the other hand, they show that these two important classes of states can be efficiently represented by a deep Boltzmann machine of three layers. Intriguingly though, another paper by Deng et al. [10] gives an analytic construction of a family of RBM states with a number of parameters linear in the system size that exhibits maximal volume-law entanglement, and that cannot be represented efficiently by either matrix product states (MPS) or tensor-network (TN) states. This shows that the expressive power of even efficiently parametrized RBM states is not limited by entanglement in the same way that other popular compact representations are. This gives the hope that RBM states may prove a valuable tool in understanding entangled quantum systems intractable by traditional methods. Levine et al. [11] establish another connection between the many-body wave function and neural networks, this time in the form of convolutional arithmetic circuits (ConvAC), a variant of the popular convolutional neural networks in widespread use today. By proving a one-to-one equivalence between a ConvAC circuit and TN quantum states, the authors are able to use tools from quantum information theory to analyze the entanglement present in the corresponding TN, and quantify the neural network's ability to model complex correlations between its inputs. This in turn can be used to obtain bounds on the expressivity of a given ConvAC architecture and be of practical use in choosing network parameters tailored to the data. While ConvAC are not widely used in practice, the authors empirically validate that the insights gained can be applied successfully to more common convolutional neural-network designs. Generative adversarial networks (GAN) are machine-learning algorithms in which two players—a generator and a discriminator—compete against each another. The generator's goal is to create and send fake data samples to the discriminator and maximize the probability that the discriminator erroneously believes that the sample comes from some true data distribution. The discriminator attempts to discern real from fake data as best as possible. Under reasonable assumptions the game converges to a point where the discriminator is unable to discriminate with probability greater than 1/2 (i.e. no better than random guessing), and the generator in fact has learned to generate data from the true distribution. Lloyd and Weedbrook [12] consider the natural extension in which one or both of the generator and discriminator are equipped with quantum information processors. When the data to be learned are a quantum state and both parties have quantum processors, the authors show that the unique end point of the adversarial game also coincides with the generator producing a quantum state corresponding to the true data statistics, and the discriminator unable to discern true from false data better than random guessing. They further argue that a different outcome may hold when the true samples are produced by the measurement of some quantum state, and the generator is purely classical. The concept of quantum supremacy is based on the assumption that there exist probability distributions accessible to a quantum computer that no classical computer can efficiently sample from. If the true data correspond to one of these distributions, then no classical generator can efficiently generate fake data reproducing the true statistics and, in principle, the discriminator can successfully discriminate true from fake data. However, whether the discriminator can efficiently find the measurements required to do so is unclear. Quantum-computing techniques have also found applications in autoencoders—neural networks where a larger number of input and output neurons are connected via a smaller number of intermediary latent neurons. The goal is to tune the weights of the network so that a training set of classical bit strings can be approximately recovered after being passed through the autoencoder. Romero et al. [13] consider instead a training set of quantum states, and ask whether a quantum circuit with a similar bottleneck structure can compress and approximately recover the data. The circuits that they consider consist of gates chosen from some set of parametrized unitary operations, and arranged in some fixed order. The parameters are then optimized classically so that the circuit best predicts the training-set labels. The authors demonstrate the validity of this approach by showing that ground states of the Hubbard model and certain molecules can indeed be compressed and recovered by such circuits. However, in general, the performance of such quantum autoencoders will be highly dependent on the kind of programmable circuit on which they are based, and at present there does not seem to be a structured way of determining this. Quantum neural networks are still in their infancy and, while the above works are important steps towards bridging our understanding between classical neural networks and quantum computing, many questions remain unanswered. If the expressivity of Boltzmann machine states is not restricted by entanglement in the same way that MPS and tensor-network states are, what is the best way of understanding their limitations? How can physicists use the correspondence between ConvAC and TN to their advantage in finding efficient, expressive representations of many-body wave functions? Can classical data distributions be learned more efficiently by quantum GAN than classical GAN? Whatever the outcome of these and many other related questions, this promises to be an exciting and active area of research in the years to come.

National Science Review•Nov 29, 2018•51 citations

Stochastic Neural Networks for Quantum Devices

Bodo Rosenhahn, Tobias J. Osborne, Christoph Hirche

This work presents a formulation to express and optimize stochastic neural networks as quantum circuits in gate-based quantum computing. Motivated by a classical perceptron, stochastic artificial neurons are introduced and combined into a quantum neural network. The Kiefer-Wolfowitz algorithm in combination with simulated annealing is used for training the network weights. Several topologies and models are presented, including shallow fully connected networks, Hopfield Networks, Restricted Boltzmann Machines, Autoencoders and convolutional neural networks. We also demonstrate the combination of our optimized neural networks as an oracle for the Grover algorithm to realize a quantum generative AI model.

quant-pharXiv:2602.22241•Quantum Machine Intelligence•Feb 25, 2026•0 citations

Learning Potentials of Quantum Systems using Deep Neural Networks

Arijit Sehanobish, Héctor H. Corzo, Onur Kara +1 more

Attempts to apply Neural Networks (NN) to a wide range of research problems have been ubiquitous and plentiful in recent literature. Particularly, the use of deep NNs for understanding complex physical and chemical phenomena has opened a new niche of science where the analysis tools from Machine Learning (ML) are combined with the computational concepts of the natural sciences. Reports from this unification of ML have presented evidence that NNs can learn classical Hamiltonian mechanics. This application of NNs to classical physics and its results motivate the following question: Can NNs be endowed with inductive biases through observation as means to provide insights into quantum phenomena? In this work, this question is addressed by investigating possible approximations for reconstructing the Hamiltonian of a quantum system in an unsupervised manner by using only limited information obtained from the system's probability distribution.

arXiv:2006.13297•National Conference on Artificial Intelligence•Jun 23, 2020•13 citations

3. Uncertainty, statistics, probability

Arnold Neumaier

In this chapter, we consider the way quantum theory represents deterministic, statistical, and probabilistic aspects of Nature. After a discussion in Section 3.1 of uncertainty in general, we discuss in Sections 3.2-3.4 several formal notions of classical probability, their relation to the probability concept used in applied statistics, and their dependence on the description used. Section 3.5 briefly discusses various examples, where probabilistic features emerge from fully deterministic situations-a theme to be taken up in much more detail in Chapter 11. Section 3.6 then shows how the statistical aspects of the quantum formalism naturally follow from the weak law of large numbers. The notions of c-probability in the classical case and of q-probability in the quantum case are formally defined in Section 3.7. Historically, the concept of classical probability (including its use in stochastic processes) was given an undisputed formal mathematical foundation in 1933 in terms of the measure-theoretic setting of Kolmogorov [164]. Apart from this traditional axiomatic foundation of classical probability theory, there is a less well-known equivalent axiomatic treatment by Whittle [302] in terms of expectations. Here probabilities appear as the expectations of statements, {0, 1}-valued random variables. von Plato [240] discusses the history of the concept of probability. Krüger et al. [169] discuss the history of probability in the various fields of application. Sklar [275] discusses the philosophical problems of the probability concept, with an emphasis on statistical mechanics.

De Gruyter eBooks•Oct 24, 2019•0 citations

Theory and Simulation of Perceptron Through Quantum Mechanics Formalism

Huber Nieto–Chaupis

Inside field of Machine Learning or ML one finds the formulation of artificial neural networks or ANN as a robust method to predict data under minimal bias. It constitutes a key procedure inside field of Artificial Intelligence that has demonstrated to be fast, efficient and autonomous in some cases. A deep understanding at the usage of ANN would lead to construct advanced as well as robust tools to predict behavior of systems. Mathematically speaking, once data has been trained, ML emerges as a powerful algorithm to predict unseen data but with a certain probability. Inspired in Quantum Mechanics being a theory fundamental in physic based at probabilities one can wonder if ANN based at the concept of perceptron might be improved through a mathematical methodology by using the formalism of Quantum Mechanics. The aim of paper is to explore novel mathematical mechanisms that would allow to fine the probabilities of prediction inside ML.

IEEE Biennial Congress of Argentina (ARGENCON)•Sep 18, 2024•0 citations
In this paper we introduce a framework of Quantum Probability (QP) as a generalized probability theory under limited information. We show that the proposed QP includes the Classical Probability (CP) as a particular case. Moreover, QP is linked to the classical mechanics through the concepts of action, Lagrangian and Hamiltonian. Starting from our QP formalism we sketch the formulation of Quantum Physics Neural Networks (QPNN) able to take into account limited information and model uncertainty. Relations with statistical physics and Ising model, Reduced Boltzmann Machines (RBM) and Deep Belief Networks (DBN) are discussed. It is also discussed their connection with Quantum Imprecise Bayesian Network (QIBN), recently proposed for sustainability and resilience of socio-ecological technical systems under uncertainty.
Classical (Bayesian) probability (CP) theory has led to an influential research tradition for modeling cognitive processes. Cognitive scientists have been trained to work with CP principles for so long that it is hard even to imagine alternative ways to formalize probabilities. However, in physics, quantum probability (QP) theory has been the dominant probabilistic approach for nearly 100 years. Could QP theory provide us with any advantages in cognitive modeling as well? Note first that both CP and QP theory share the fundamental assumption that it is possible to model cognition on the basis of formal, probabilistic principles. But why consider a QP approach? The answers are that (1) there are many well-established empirical findings (e.g., from the influential Tversky, Kahneman research tradition) that are hard to reconcile with CP principles; and (2) these same findings have natural and straightforward explanations with quantum principles. In QP theory, probabilistic assessment is often strongly context- and order-dependent, individual states can be superposition states (that are impossible to associate with specific values), and composite systems can be entangled (they cannot be decomposed into their subsystems). All these characteristics appear perplexing from a classical perspective. However, our thesis is that they provide a more accurate and powerful account of certain cognitive processes. We first introduce QP theory and illustrate its application with psychological examples. We then review empirical findings that motivate the use of quantum theory in cognitive theory, but also discuss ways in which QP and CP theories converge. Finally, we consider the implications of a QP theory approach to cognition for human rationality.
Quantum machine learning is at the crossroads of two of the most exciting current areas of research: quantum computing and classical machine learning. Although the field is still in its infancy, the body of literature is already large enough to warrant several review articles [1–3]. This short survey focuses on a selection of significant recent results on the subtopic of quantum neural networks, an area that hopes to build on the enormous impact that classical neural networks have had. In particular, we concentrate on quantum generalizations of popular neural-network concepts such as Boltzmann machines, generative adversarial networks and autoencoders, as well as applications of classical neural networks to quantum information and vice versa. Examples of Boltzmann machines. In a fully connected Boltzmann machine, connections exist between all visible and hidden neurons. In a restricted Boltzmann machine (RBM), there are no connections between neurons of the same type. A deep Boltzmann machine (DBM) consists of adding one or more additional layers of hidden neurons to an RBM, with no connections between neurons in the same layer. The energy-based nature of BMs gives a natural framework for considering quantum generalizations of their behavior. The BM energy function is equivalent to the Hamiltonian of a simple Ising model and one might hope that more general Hamiltonians allowed by quantum mechanics could explain certain data sets better than classically. Amin et al. [4] adopt this approach, and take the so-called transverse field Ising Hamiltonian as the energy function. This increased generality brings certain difficulties, however, as the transverse field term makes training the quantum Boltzmann machine (QBM) non-trivial. Although the general scaling and performance of QBMs is not yet well understood, for certain small-size examples the authors observe that their QBMs can learn data distributions better than classical BMs. Kieferova and Wiebe [5] extend the formalism of Amin et al. and consider more general Hamiltonians that, unlike the transverse Ising model, are not in general believed to be classically efficiently simulatable. Furthermore, they propose new methods for training that allow for parameters corresponding to quantum terms to be learned. Finally, their QBM enables a form of quantum-state tomography that can learn non-classical data, and also generate copies of the reconstructed state. Again, small-scale numerical evidence suggests that their proposals may provide an advantage over classical BMs, although their tendency to overfit data must be investigated further. The practical value of BMs, either classical or quantum, relies in part on the ease with which they are trained. This in turn depends on sampling efficiently from the Boltzmann distribution. Classically this can be done approximately only for the special case of restricted Boltzmann machines (RBM), i.e. where connections are between visible and hidden units, and no connections exist between neurons of the same type. Wiebe et al. [6] propose two quantum algorithms for Boltzmann sampling, based on starting from a state corresponding to the product distribution that is closest to the target Boltzmann distribution. While small-scale numerical studies are encouraging, true bounds on the running time of their algorithms rely on a problem-dependent parameter κ, the scaling of which is hard to estimate. The hope remains though that empirically their algorithms work well in practice, even for multi-layer and fully connected BMs. The expressive power of BMs for compactly representing complicated probability distributions has led to another line of investigation, namely their use for representing quantum many-body wave functions. The authors apply this technique to two prototypical spin models and achieve high accuracy in both ground-state estimation and dynamical evolution, improving on existing state-of-the-art techniques. Their results indicate that RBM states can capture complex many-body correlations in an efficient manner—evidence reinforced by the work of Deng et al. [8], who show that certain topological quantum states in one, two and three dimensions can be represented by RBM states with a number of parameters only linear in the system size. In a subsequent study, however, Gao and Duan [9] prove that although RBM states can indeed represent many highly entangled states, their expressive power is limited in that they cannot represent arbitrary states generated by polynomial-sized quantum circuits, nor those that are the ground states of k-local Hamiltonians with polynomial-sized energy gaps, unless the polynomial hierarchy from computational complexity theory collapses. On the other hand, they show that these two important classes of states can be efficiently represented by a deep Boltzmann machine of three layers. Intriguingly though, another paper by Deng et al. [10] gives an analytic construction of a family of RBM states with a number of parameters linear in the system size that exhibits maximal volume-law entanglement, and that cannot be represented efficiently by either matrix product states (MPS) or tensor-network (TN) states. This shows that the expressive power of even efficiently parametrized RBM states is not limited by entanglement in the same way that other popular compact representations are. This gives the hope that RBM states may prove a valuable tool in understanding entangled quantum systems intractable by traditional methods. Levine et al. [11] establish another connection between the many-body wave function and neural networks, this time in the form of convolutional arithmetic circuits (ConvAC), a variant of the popular convolutional neural networks in widespread use today. By proving a one-to-one equivalence between a ConvAC circuit and TN quantum states, the authors are able to use tools from quantum information theory to analyze the entanglement present in the corresponding TN, and quantify the neural network's ability to model complex correlations between its inputs. This in turn can be used to obtain bounds on the expressivity of a given ConvAC architecture and be of practical use in choosing network parameters tailored to the data. While ConvAC are not widely used in practice, the authors empirically validate that the insights gained can be applied successfully to more common convolutional neural-network designs. Generative adversarial networks (GAN) are machine-learning algorithms in which two players—a generator and a discriminator—compete against each another. The generator's goal is to create and send fake data samples to the discriminator and maximize the probability that the discriminator erroneously believes that the sample comes from some true data distribution. The discriminator attempts to discern real from fake data as best as possible. Under reasonable assumptions the game converges to a point where the discriminator is unable to discriminate with probability greater than 1/2 (i.e. no better than random guessing), and the generator in fact has learned to generate data from the true distribution. Lloyd and Weedbrook [12] consider the natural extension in which one or both of the generator and discriminator are equipped with quantum information processors. When the data to be learned are a quantum state and both parties have quantum processors, the authors show that the unique end point of the adversarial game also coincides with the generator producing a quantum state corresponding to the true data statistics, and the discriminator unable to discern true from false data better than random guessing. They further argue that a different outcome may hold when the true samples are produced by the measurement of some quantum state, and the generator is purely classical. The concept of quantum supremacy is based on the assumption that there exist probability distributions accessible to a quantum computer that no classical computer can efficiently sample from. If the true data correspond to one of these distributions, then no classical generator can efficiently generate fake data reproducing the true statistics and, in principle, the discriminator can successfully discriminate true from fake data. However, whether the discriminator can efficiently find the measurements required to do so is unclear. Quantum-computing techniques have also found applications in autoencoders—neural networks where a larger number of input and output neurons are connected via a smaller number of intermediary latent neurons. The goal is to tune the weights of the network so that a training set of classical bit strings can be approximately recovered after being passed through the autoencoder. Romero et al. [13] consider instead a training set of quantum states, and ask whether a quantum circuit with a similar bottleneck structure can compress and approximately recover the data. The circuits that they consider consist of gates chosen from some set of parametrized unitary operations, and arranged in some fixed order. The parameters are then optimized classically so that the circuit best predicts the training-set labels. The authors demonstrate the validity of this approach by showing that ground states of the Hubbard model and certain molecules can indeed be compressed and recovered by such circuits. However, in general, the performance of such quantum autoencoders will be highly dependent on the kind of programmable circuit on which they are based, and at present there does not seem to be a structured way of determining this. Quantum neural networks are still in their infancy and, while the above works are important steps towards bridging our understanding between classical neural networks and quantum computing, many questions remain unanswered. If the expressivity of Boltzmann machine states is not restricted by entanglement in the same way that MPS and tensor-network states are, what is the best way of understanding their limitations? How can physicists use the correspondence between ConvAC and TN to their advantage in finding efficient, expressive representations of many-body wave functions? Can classical data distributions be learned more efficiently by quantum GAN than classical GAN? Whatever the outcome of these and many other related questions, this promises to be an exciting and active area of research in the years to come.
This work presents a formulation to express and optimize stochastic neural networks as quantum circuits in gate-based quantum computing. Motivated by a classical perceptron, stochastic artificial neurons are introduced and combined into a quantum neural network. The Kiefer-Wolfowitz algorithm in combination with simulated annealing is used for training the network weights. Several topologies and models are presented, including shallow fully connected networks, Hopfield Networks, Restricted Boltzmann Machines, Autoencoders and convolutional neural networks. We also demonstrate the combination of our optimized neural networks as an oracle for the Grover algorithm to realize a quantum generative AI model.
Attempts to apply Neural Networks (NN) to a wide range of research problems have been ubiquitous and plentiful in recent literature. Particularly, the use of deep NNs for understanding complex physical and chemical phenomena has opened a new niche of science where the analysis tools from Machine Learning (ML) are combined with the computational concepts of the natural sciences. Reports from this unification of ML have presented evidence that NNs can learn classical Hamiltonian mechanics. This application of NNs to classical physics and its results motivate the following question: Can NNs be endowed with inductive biases through observation as means to provide insights into quantum phenomena? In this work, this question is addressed by investigating possible approximations for reconstructing the Hamiltonian of a quantum system in an unsupervised manner by using only limited information obtained from the system's probability distribution.
In this chapter, we consider the way quantum theory represents deterministic, statistical, and probabilistic aspects of Nature. After a discussion in Section 3.1 of uncertainty in general, we discuss in Sections 3.2-3.4 several formal notions of classical probability, their relation to the probability concept used in applied statistics, and their dependence on the description used. Section 3.5 briefly discusses various examples, where probabilistic features emerge from fully deterministic situations-a theme to be taken up in much more detail in Chapter 11. Section 3.6 then shows how the statistical aspects of the quantum formalism naturally follow from the weak law of large numbers. The notions of c-probability in the classical case and of q-probability in the quantum case are formally defined in Section 3.7. Historically, the concept of classical probability (including its use in stochastic processes) was given an undisputed formal mathematical foundation in 1933 in terms of the measure-theoretic setting of Kolmogorov [164]. Apart from this traditional axiomatic foundation of classical probability theory, there is a less well-known equivalent axiomatic treatment by Whittle [302] in terms of expectations. Here probabilities appear as the expectations of statements, {0, 1}-valued random variables. von Plato [240] discusses the history of the concept of probability. Krüger et al. [169] discuss the history of probability in the various fields of application. Sklar [275] discusses the philosophical problems of the probability concept, with an emphasis on statistical mechanics.
Inside field of Machine Learning or ML one finds the formulation of artificial neural networks or ANN as a robust method to predict data under minimal bias. It constitutes a key procedure inside field of Artificial Intelligence that has demonstrated to be fast, efficient and autonomous in some cases. A deep understanding at the usage of ANN would lead to construct advanced as well as robust tools to predict behavior of systems. Mathematically speaking, once data has been trained, ML emerges as a powerful algorithm to predict unseen data but with a certain probability. Inspired in Quantum Mechanics being a theory fundamental in physic based at probabilities one can wonder if ANN based at the concept of perceptron might be improved through a mathematical methodology by using the formalism of Quantum Mechanics. The aim of paper is to explore novel mathematical mechanisms that would allow to fine the probabilities of prediction inside ML.