Pilot-wave quantum theory in discrete space and time and the principle of least action

Pilot-wave quantum theory
in discrete space and time
and the principle of least action

Janusz Gluza, Jerzy Kosek,
July 26, 2019
Institute of Physics, University of Silesia,
Uniwersytecka 4, PL-40-007 Katowice, Poland,
Email: janusz.gluza@us.edu.pl
Institute of Physics, University of Silesia,
Uniwersytecka 4, PL-40-007 Katowice, Poland,
Email: jkosek@us.edu.pl

The idea of obtaining a pilot-wave quantum theory on a lattice with discrete time is presented. The motion of quantum particles is described by a -distributed Markov chain. Stochastic matrices of the process are found by the discrete version of the least-action principle. Probability currents are the consequence of Hamilton’s principle and the stochasticity of the Markov process is minimized. As an example, stochastic motion of single particles in a double-slit experiment is examined.

I Introduction

In classical physics the motion of a system of particles can be elegantly described by Hamilton’s principle of least action. It states that for given initial and final space-time configurations the real path of the system is the one for which an action takes a stationary value. In quantum mechanics formulated by Heisenberg in 1925 and by Schrödinger in 1926, the situation is different. It describes time evolution of the wave function (in the Schrödinger picture), while the classical notion of a sharp trajectory followed by a physical system is rejected. One of the alternatives is a pilot-wave formulation of quantum mechanics proposed by de Broglie in 1927 [1], and re-discovered by Bohm in 1952 [2], where particles have definite positions during their motion, similarly as in classical mechanics. This idea was later extended to quantum field theories (QFT), both bosonic and fermionic. In particular, some Bell-type QFTs describe creation and annihilation of particles, which, in addition, follow real trajectories [3], [4], [5], [6]. These models deal with continuous space-time, and generalize a lattice quantum field theory proposed by Bell [7], where the latter is based on specific choices of probability currents and jump rates.

Despite these prominent achievements there are several motivations for developing an analogical approach to quantum (field) theory in discrete space-time. First, space-time is treated as continuous both by classical and standard quantum physics. However, one cannot exclude discrete space-time hypothesis. The situation can be similar to the discovery of a discrete nature of such fundamental quantities as quanta of energy, charge or angular momentum, etc. Of particular importance is the development of a quantum theory of gravity. Different proposals based on the idea of discrete space-time were given (in particular, see [9], the proposal focused on loop quantum gravity, which poses elementary extensions of space as the primitive ontology of the theory). Also the notion of a digital universe with discrete space-time is commonly used and exploited now (see, e.g. [10]). Moreover, discrete space-time models are well suited for calculations, and de facto all computer calculations are discrete in nature.

A quantum model aimed to develop a Bell-type stochastic process on a lattice in discrete time was studied in [11]. It was proven that a genuine analog of Bell’s process does not exist in discrete time, however, proposals of processes that could be used as a replacement were given. The problem is that in the discrete case there is not an obvious formula for the net probability current between discrete states, such that it could substitute the continuous case (see Eq. 6 below).

In this paper we present a new pilot-wave model on a lattice configuration space in discrete time. We take the positions of the particles as the primary variables, similar to Bohmian Mechanics and Bell-type QFTs [5]. The theoretical scheme presented here is used to find stochastic paths for massive particles in quantum theory.

We do not assume any arbitrary formula for a probability current. Rather, we describe the motion of quantum particles by a -distributed Markov chain, where stochastic matrices for any two subsequent instants are found by Hamilton’s principle. Thus, probability currents are the consequence of Hamilton’s principle. We extend the principle to a lattice configuration space. It states that for given initial and final quantum distributions—specified by a state vector —the action averaged over a statistical ensemble of identical systems takes a minimal value. This allows us to find unique stochastic matrices of the process. Additionally, the stochasticity of the Markov process is minimized. In the case of single non-relativistic particles it means that their mean square displacements over time are minimized.

Finally, Hamilton’s principle on a lattice with discrete time can be viewed as an optimal transport problem, where an average action is equivalent to the so-called optimal transport cost. (For an introduction to the optimal transport, see [12], [13]). We suppose that numerical methods developed in the field of optimal transport could be used (or adopted) in computation of quantum phenomena on a discrete space-time lattice.

The plan of this article is as follows. Section II briefly presents Bohmian mechanics and some other pilot-wave models with continuous time and continuous or discrete space, providing a theoretical background to the discrete space-time model. Section III defines stochastic matrices for a quantum system on a lattice configuration space. Section IV formulates the principle of least action on a lattice configuration space in discrete time. Section V defines minimal transition probabilities and proves it to be valid for our model. Section VI studies stochastic behavior of single massive particles. Section VII presents an example of double-slit experiment with massive particles. Section VIII summarizes our results and gives concluding remarks. Appendix A presents an algorithm for computing stochastic matrices with the minimal transition probabilities. Appendix B discusses the link between Hamilton’s principle and the optimal transport problem.

Ii Continuous-time pilot-wave models

In Bohmian mechanics space-time is continuous, and the state of the system at any time is described by a configuration of point particles moving in real space . The wave function given by the Schrödinger equation


plays the role of a guiding field for the particles; is the potential function; is the gradient relative to the space coordinates of particle , is its mass. The equations of motion are




is the usual quantum current. The system itself, depending upon its initial position, follows a deterministic trajectory.

The guidance equation, Eq. 2, implies the property called equivariance: a statistical ensemble of systems having a distribution in positions at preserves the character of this distribution at any later time , i.e. the distribution is . As a consequence, predictions of Bohmian mechanics are identical to the predictions of standard quantum mechanics.

Other types of pilot-wave models are stochastic models initiated by Nelson [14], [15]. Now, instead of Bohmian guidance equation one has a Langevin equation with stochastic parameters, while the wave function still satisfies the Schrödinger equation. Both de Broglie-Bohm and Nelson’s models can be generalized in a way that the guidance equation, Eq. 2, is supplemented with additional terms [16], [17]. For example, in the case of a single particle system a generalized equation is [17]


where is a free parameter, and is a Wiener process with and .

An important feature is that the generalized guidance equation, Eq. 4, gives rise to the same quantum distributions , and simultaneously the trajectories are different, depending on the choice of the parameters. For we get stochastic theories, while for deterministic ones.

So there is an infinity of possible wave-particle models in continuous space-time, both deterministic and stochastic. Bohmian mechanics is the one with the usual current () and no stochasticity ).

Ii-a Discrete-space and continuous-time models

An extension of Bohmian mechanics into the discrete configuration space and continuous time is Bell’s model [7]. It presents a Markov pure jump process on a lattice configuration space . Bell aimed to reproduce the quantum mechanical predictions for fermion number density in space. The same method—properly generalized—can be used to find stochastic evolution for any discrete beables (i.e. the quantities supposed as objective elements of reality), both in non-relativistic quantum mechanics and in QFT. 111In Bell’s model, a continuous real space is replaced by 3D spatial lattice . At given time , the actual configuration of fermion particles of the world is one of the possible lists of integers , where is the maximal index of the lattice sites, and are eigenvalues of fermion number operators acting at particular sites of the lattice (}, where is the number of Dirac fields).

Dynamics of the actual (field) configuration is stochastic—it is a consequence of the discretization of space. The transition probability from a configuration to other configuration () during a small interval is defined by Bell as


where stands for the probability current


is the state vector of a quantum (field) theory, evolving in a Hilbert space according to the Schrödinger equation; is the Hamiltonian, is a projection to , and the form an orthogonal decomposition, ; is the probability distribution at time 


The probability to stay in the same state is


Notice that the current is defined in analogy to the current , Eq. 3. As it is antisymmetric, i.e., , thus Eq. 5 implies or . So at least one of transitions or is forbidden.

Solution Eq. 5 can be generalized [17], [18]. For example, one can add to defined in Eq. 5 any solution of the homogeneous equation


This generalization makes both of the transitions and possible. For all one gets Bell’s solution, Eq. 5, with minimal transition probabilities (or, equivalently, with minimal jump rates). This means that at least one of the transitions or is forbidden.

Iii Stochastic matrices for quantum systems

In Sections III - VII we develop a new pilot-wave quantum model on a lattice in discrete time. Basic assumptions of the model are as follows: We consider a system of structureless and distinguishable particles and assume that all physical beables are definite positions of the particles. The configuration space is an ensemble of configurations of discrete particle positions. The state of the system at time is described by its actual configuration . The dynamics of the configuration is stochastic - it jumps from its actual position at time to another position at next time , where is a discrete time step. Moreover, transition probabilities , depend only on the actual configuration , and do not depend on the earlier states. This means that an evolution of the state of the configuration is a Markov process on with discrete time step .

Finally, we assume also that the transition probabilities depend on the state vector which is the solution to the appropriate Schrödinger equation defined on


where is the continuous time parameter. Some discrete values of make discrete instants , when stochastic jumps happen (i.e., , where means an integer part of ). 222A similar assumption is presented in [11], where a Markov process in discrete time is obtained by restriction to the integer times of Bell’s process in continuous time.

In the case of spinless particles we have an orthonormal basis of a Hilbert space labeled by . In general, the basis of a Hilbert space is indexed by the configuration , as well as by additional quantum numbers that are not related to beables, e.g. spin. Here we follow Bell who has shown in [19] that spinor-valued wave functions fully account for all phenomena involving spin. The same treatment of spin is in Bohmian Mechanics [20].333For example, the wave function of a spin- particle is a function , and for such particles it is a function In this way positions can be the primary outputs of the theory, while other quantities (momenta, energy, spin etc.) can be deduced from the positions.

Now, we define a stochastic matrix such that the quantum probability distribution at time


is transformed into the probability distribution at time


is a projection. Namely, the stochastic matrix includes probabilities of transitions from to , such that the following conditions are satisfied




These two equations express conservation of probability at particular sites at and at , respectively.

The relations Eqs. 11 - 14 are general and do not define stochastic matrices uniquely. However, such matrices can be always defined for any quantum system described by a wave function . One of the possible solutions is


which means that the transition probabilities depend only on the wave function at latter time . In this solution the probability is not locally conserved, but only on a global scale, as it involves jumps even from distant sites to a given .

In general, there is a lot of freedom to find solutions for this stochastic matrix, when the only requirement is that it restores given probability distributions, Eqs. 11 and 12. A unique solution locally conserving probability, based on the least action principle, is proposed below.

Iv Hamilton’s principle on a lattice in discrete time

Hamilton’s principle allows to formulate classical mechanics in a very general way. The formulation assumes continuous configuration space and continuous time. Now we adjust the principle to the discrete space-time case. It involves stochastic processes.

Let us consider a statistical ensemble of identically prepared systems undergoing identical initial conditions, which take up sites at time , , and jump to sites at .

We shall assume that the contribution from a single jump from to is the classical action, i.e., the time integral of the Lagrangian taken along the appropriate classical path , as if the system really follows this path


Now, let us define a total action for the statistical ensemble


In the lattice space the numbers belong to the discrete set of actions calculated along all possible paths connecting sites and , i.e. . and are subspaces of such that the wave function is non-zero there at times and , respectively. Therefore, for systems passing from to we can write


In the limit the quantity approaches the total transition probability from to , which is the transition probability multiplied by the probability


Thus, dividing Eq. 18 by and taking a large limit, we get an average value of the action


which depends on the choice of a stochastic matrix . Now, Hamilton’s principle may be readily extended to define a stochastic matrix for a Markov chain:

Among all possible stochastic matrices constrained by Eqs. 11 - 14, a real Markov chain is defined by a matrix minimizing the average action (21)

Constraints, Eqs. 11 - 12, depend on the wave function, so we call them the quantum constraints (the other ones, Eqs. 13 - 14, are also valid for classical stochastic matrices).

The description of the stochastic process will be completed by stating initial conditions. We assume that at some time the configuration is chosen randomly with probability distribution . The construction of the stochastic matrices guarantees that has quantum distribution at subsequent times . Non-equilibrium initial distributions are also valid (similarly as in other pilot-wave models, e.g. in Bohmian-type quantum mechanics), and an open question is how these distributions depend on time. However, we do not consider this question in this paper.

In this way we have completed a definition of a Markov chain, where the only beables are particles’ positions. Its properties are studied in Sections V - VII.

V Minimal transition probabilities

The stochastic quantum dynamics defined here imply validity of the usual rules of probability, despite the fact that specific quantum phenomena are restored. For example, the probability of finding a system at site at time is expressed by a sum of total transition probabilities over all the mutually exclusive alternative paths which start from positions at time and follow positions at , respectively:


and the multiplication rule is valid—as in any Markov process


On the other hand, counterintuitive quantum properties, as an interference (see Section VII), an entanglement, etc., are naturally embodied in the pilot-wave model.

A specific property of our model is that stochasticity of the Markov process is minimized. An analogical property holds in Bell-type models with continuous time [21]. As it was said in Section II this entails that at least one of two transitions or is forbidden. We will prove that an even more general property holds in our model. (Yet, we deal with discrete space-time.)

First, let us define as crossing transitions, a pair of transitions and such that




where and are the total transition probabilities from to and from to , respectively. Notice that in general and can be different from and (see Fig. 1). It occurs that Hamilton’s principle eliminates at least one of two crossing transitions, i.e. or is forbidden, as

Figure 1: A scheme of transformation which eliminates at least one of superfluous transitions or ; ; and are subspaces of such that is nonzero there at times and , respectively.

To prove it we assume that proposition is not true, i.e. and , while is minimal. Now we define new total transition probabilities such that they do not change the probabilities at , , , and (see Fig. 1), i.e.




(in general, depends on , and ). Eq. 27 implies that or . However, the new value is less than the old one , because


is less than (see Eq. 24). Thus we got a contradiction with the assumption that is minimal, q.e.d.

In particular, when and and Eq. 24 holds (e.g. for a ”free” Lagrangian such as considered in Section VI) one gets the characteristic feature of Bell-type models.

As a result, the crossing transitions are eliminated in the whole net. In the case of single particles in flat space-time this means that space-time trajectories cross themselves only in the space lattice nodes.

The non-crossing property is especially useful in the case of 1D Markov process on a flat space. In that case it is equivalent to Hamilton’s principle, Eq. 21. Thus, searching for a minimum of the average action can be replaced by searching for non-crossing transitions, which is a simpler task allowing stochastic matrices to be calculated in an efficient way.

Vi Stochasticity of motion

Hamilton’s principle implies that the crossing transitions in are eliminated. In consequence, the stochasticity of the motion in is minimized. Roughly speaking, it is because we get no more distant jumps than necessary for ensuring the quantum distributions.

To illustrate this, consider the motion of free single particles. We take Lorentz invariant action in Eq. 20 [22]


where is particle’s mass. In the non-relativistic limit we get


Now Eq. 20 reads




and we have used


Constant numbers and can be omitted because the minimum of


leads to the same matrix elements as the minimum of . The above formula can be written as




is mean square displacement of particles moving from position at to positions at .444 Eq. 37 can be expressed as the sum of the squared average distance of jumps and variance of the positions given , i.e. . The physical meaning of Hamilton’s principle is clear now: imposed on Eq. 36 the principle confines the motion of particles in a way that their mean square displacements over time are minimized.

The total mean square displacement, Eq. 35, is equivalent to the average action in the non-relativistic limit, and the stochasticity of the motion can be measured by it. It is easy to see that in a general case of more complex systems the average action can provide the measure of stochasticity.

Vii Double slit experiment

As an example, we analyze typical double-slit interference of single particles, where a monochromatic plane incident wave illuminates the diaphragm with two slits. Here we consider spinless massive particles (let’s call them electrons).

Vii-a An electron wave function

The wave function behind a single slit can be calculated with the aid of the Feynman path integrals [23]. Assuming propagation of the wave with a constant speed along the -axis perpendicular to the diaphragm one has


where is the field on a slit, and


is the propagator for a free particle of mass . For a plane incident wave we have . Substituting into Eqs. 38 and 39 after some algebra we get the wave function at point behind the slit




is de Broglie wavelength of the electron, and


are the Fresnel integrals. In the case of two identical slits a superposition of a suitably translated field of the single slit, Eq. 40, can be applied


where is the separation of the slits, and are their centers.

Notice that the above equation should be regarded as an approximation to the wave function for the lattice version of the Schrödinger equation, Eq. 10.

Figure 2: A scheme used in the calculation of trajectories: a particle jumps from position on line at time to a position on line at time .

Vii-B Simulation

The positions behind the diaphragm are restricted to the sites of a 2D regular lattice, , , and , . To simplify the calculation, we assume (see Fig. 2):

  1. at time the particle is at site on the line parallel to the diaphragm, and

  2. at time it jumps randomly to site , on the line ; , where is the constant speed of the wave along the -axis.

Stochastic matrices are computed as follows: First, the quantum distributions are calculated and , where and are normalization constants dependent on . Then, to find the minimum of Eq. 35 the imposed (quantum) constraints, Eqs. 11 - 14, are taken into account. However, due to computational reasons, directly searching for the minimum would present a challenging task and an equivalent procedure is used based on the non-crossing property of transitions; this made the calculation tractable (see Appendix A, where the algorithm is presented).

Figure 3: A net of possible transitions in a double slit experiment. The width of the slits mm, the distance between them mm. The wavelength nm. Colors indicate different ranges of total transition probabilities related to the maximal one in the net : gray ), olive , sea green , blue .

A net of possible transitions behind the diaphragm in the double slit experiment is shown in Fig. 3. Zooming into a picture we explicitly checked that paths crossed themselves only in the nodes of the net. This means that the stochastic matrix was really minimized.

The (computer) Monte Carlo algorithm to find the stochastic paths is straightforward. It starts in a diaphragm, where a position of a particle is chosen over the slit/slits width with a uniform distribution (here it is an equilibrium distribution). Next, the procedure is repeated recursively, for a given position a pseudo-random number is drawn and, depending on its value and the values of probabilities , the particle jumps to a new position .

In Fig. 4 the results are shown. We have taken nm (equal to wavelength of an electron moving with speed m/s). The band at the bottom shows the distribution of particles on the final screen m in the simulation, where particles have been used. For clarity only of the total number of trajectories is shown. Two shades of blue are used to visualize individual trajectories in a better way.

The picture reveals the interference phenomenon, and we have checked that for an initial equilibrium distribution it perfectly restored the equilibrium distributions . Additionally, the results tended to become closer to the theoretical distributions as more sampling particles were used, in agreement with the law of large numbers.

What we observe is that starting from the same initial state (source) and passing the diaphragm, particles move along stochastic paths and reach a wide range of positions in the final plane. These trajectories can cross each other. For comparison, in Bohmian mechanics an initial particle’s position at the slits implies a single trajectory, and trajectories do not cross each other [24, 25].

Figure 4: Interference of single particles in a double-slit experiment, the case of a near field. The width of the slits mm, the distance between them mm. The wavelength nm. Theoretical distributions are shown in Fig. 5 for clarity. The interference pattern (Fresnel fringes) shown at the bottom is built up of particles impacts on the screen  m.
Figure 5: Trajectories of single particles in a simulated double-slit experiment, which ended at a single point on the screen (blue curves), and the net of all other possible trajectories leading to this point (brown color); are the same as in Fig 4. The full black lines are theoretical probability distributions based on Feynman’s path integrals. The result explicitly shows that stochasticity of the motion is minimized—although there is a huge number of the possible trajectories the most probable ones form a narrow bunch, while the motion in the rest of the allowed (brown) region is remote.

Now let us examine the set of all possible paths which start from the same point source and reach the same final state. An example is shown in Fig. 5, where a brown region is composed of all these paths. In fact, we draw them going back from the final site on the screen to the source along all different segments of the net with non-zero probabilities . White areas inside the brown region are not allowed, and for them . Blue curves in Fig. 5 are the trajectories which ended at the given final state (they were selected from among the whole set of paths get in the simulation). These trajectories form a bunch focused in the neighborhood of the most probable trajectory and make a substantial contribution to the total transition probability (see Eq. 22).

Notice, that in general the most probable trajectories are not straight lines. Rather, they are bent curves, attracted into the local maxima or repelled from the local minima of the probability distribution function. A well exposed case is shown in Fig. 6. It implies that total action calculated along the most probable trajectories is not a minimal one (in the considered case of a flat space with constant potential, the classical action would be minimal for straight lines). So these curves are not predicted by classical Hamilton’s principle of least action. Notice also that Hamilton’s principle implies single path for two given space-time points, while here we have a huge number of the possible paths (brown regions).

Figure 6: Trajectories of single particles in a simulated double-slit experiment, which ended at a single point on the screen (blue curves), and the net of all other possible trajectories leading to this point (brown color); the case of a near field. The width of the slits mm, the distance between them mm. The wavelength nm. The full black lines are theoretical probability distributions based on Feynman’s path integrals. The interference pattern (Fresnel fringes) shown at the bottom is built up of particles impacts on the screen  m. Black arrows show approximate bending points of the trajectories, attracted into the local maxima of the distribution function. This clearly shows that even the most probable paths are different from Hamilton’s classical path of least action.

Finally, one can expect convergence to the classical trajectories when quantum effects can be neglected (i.e. when approximation of wave phenomena by classical mechanics is valid). Thus, let us study the model in the limit of a short wavelength. For example, for a wavelength nm we get in a two-slit experiment a set of random trajectories forming two independent parallel bunches (Fig. 7). They resemble trajectories of Newtonian (macroscopic) particles which do not possess wave properties and follow straight lines in an empty flat space with constant potential .

Figure 7: Trajectories of single particles in a double-slit experiment for the case of a short wavelength nm. The width of the slits is mm, the distance between them is mm. The trajectories form two narrow bunches as wave properties of particles are negligible, and they behave almost as classical Newtonian particles. Instead of an interference pattern two separated spots appear. The pattern shown at the bottom is built up of particles impacts on the screen m.

Viii Conclusions

We have shown how to describe the motion of quantum particles by a -distributed Markov process on a lattice in discrete time. The discreteness is by itself responsible for the randomness of the motion on the basic level, while Hamilton’s principle - extended by us to the discrete case - defines the stochastic matrices uniquely. An introduction of any additional stochastic parameters does not seem to be justified at that level of description. The consequence of Hamilton’s principle is that the stochasticity of the particles’ motion is minimized.

In our approach motion of the system remains random independently of the lattice spacings. Introducing Markovian process is crucial, if time is discretized. The transformation of a discrete distribution , e.g. at the slits, into the discrete distribution , e.g. far from the slits, cannot be made in a non-stochastic manner, as it would require transitions from every (initial or intermediate) state into a single subsequent state. However, such a constraint does not allow the required transformation for discrete distributions to be constructed as in general they change in time.

As an outlook, the model sketched here should be extended to the Lorentz invariant form and checked in simulations. We can take the Lorentz invariant action in calculations of . However, when we take regular space lattice then the stochastic matrices are dependent on that choice, and the model is not Lorentz invariant. The question is if it can be made Lorentz invariant, e.g., assuming that discrete space points are placed randomly according to Poisson statistics, as in causal quantum gravity models (see, e.q. [26] and [27]). Yet, the idea of a preferred Lorentz frame is also considered (see, e.g., [28].

Appendix A An algorithm for computing a minimal stochastic matrix

  for  to  do
  end for
  for  to  do
     for  to  do
        if  then
            = min
        end if
     end for
  end for
Algorithm 1 For given initial and final distributions an algorithm computes a ‘minimal’ stochastic matrix .

Let us look at the Algorithm (see the Algorithm 1 frame) for computing a minimal stochastic matrix in the 1D case. The algorithm finds the minimum of Eq. 20 by searching for non-crossing transitions and it simultaneously encompasses the (quantum) constraints, Eqs. 11 - 14. Auxiliary numbers and used in the pseudo-code are initially equal to the probabilities and , respectively, are the sites of the lattice. stands for a probability current (up to a constant factor ). It is equal to min, i.e. it is the maximal allowed current between sites and at a given step of computation, dependent on the actual values of probability to be transported from , and an actual value of probability that can be accepted at . These values change inside two loops, so currents, in general, depend on probabilities at all sites and .

The definition of probability current, done in the algorithm, ensures that at least one of transitions and is forbidden and or . It resembles prosperities of Bell’s definition of the transition probability, discussed in Section II-A. The difference is that here the current is not defined in analogy to the standard current, but it is the consequence of Hamilton’s principle.

Appendix B Hamilton’s principle and the optimal transport cost

Let be a complete, separable metric space (Polish space), and let and be two probability measures defined on . Then we can define the optimal transport cost from to [12], [13]. In the case of a discrete metric space it takes the form


where denotes the collection of all joint probability distributions on with marginals and , is the so-called cost function on .

Hamilton’s principle, Eqs. 20 and 21, can be viewed as optimal transport problem. make a collection of joint probability distributions on with marginals and , and the cost function is associated with an action , Eq. 16. So the cost function between an initial point and a final point is obtained by minimizing the action among paths that go from to . Finally, an average action is equal to the optimal transport cost.

When the cost is defined in terms of a distance , then the optimal transport cost can be replaced by the Wasserstein distance


where is the order of the Wasserstein distance. In such a case we get in Eq. 35: the total mean square displacement of particles , which is equal to the square of the Wasserstein distance of the order .

There are several numerical methods proposed in the field of optimal transport problem (see, e.q. [29], [30], [31]). We suppose that they could be adjusted to simulate quantum-mechanical problems more complicated than presented in this paper, based on Hamilton’s principle in discrete space-time.


We would like to thank Marek Gluza, Jaś Flaten and Piotr Migdał for many discussions and reading of the manuscript. JK would like to thank his wife Krystyna for her constant support and encouragement during the years of research and preparation of this paper.


  • [1] L. de Broglie, La nouvelle dynamique des quanta; in: J. Bordet (Ed.), Électrons et photons. Rapports et discussions du cinquième Conseil de physique tenu à Bruxelles du 24 au 29 octobre 1927 sous les auspices de l’Institut international de physique Solvay (Gauthier-Villars, Paris, 1928). English translation is included in: G. Bacciagalluppi and A. Valentini, Quantum Theory at the Crossroads: Reconsidering the 1927 Solvay Conference (Cambridge University Press, Cambridge, 2009).
  • [2] D. Bohm, A Suggested Interpretation of the Quantum Theory in Terms of ”Hidden” Variables, I and II, Phys. Rev. 85, 166 (1952).
  • [3] D. Dürr, S. Goldstein, R. Tumulka, and N. Zanghì, Trajectories and particle creation and annihilation in quantum field theory, J. Phys. A: Math. Gen. 36, 4143 (2003).
  • [4] D. Dürr, S. Goldstein, R. Tumulka, and N. Zanghì, Bohmian Mechanics and Quantum Field Theory, Phys. Rev. Lett. 93, 090402 (2004).
  • [5] D. Dürr, S. Goldstein, R. Tumulka, and N. Zanghì, Bell-type quantum field theories, J. Phys. A: Math. Gen. 38 (4), R1 (2005).
  • [6] D. Dürr, S. Goldstein, and N. Zanghì, Quantum physics without quantum philosophy ( Springer-Verlag, Berlin, 2013).
  • [7] J. S. Bell, Beables for quantum field theory, CERN preprint CERN-TH. 4035/84; reprinted in [8].
  • [8] J. S. Bell, Speakable and unspeakable in quantum mechanics (Cambridge University Press, Cambridge, 2004).
  • [9] A. Vassallo, and M. Esfeld, A proposal for a Bohmian ontology of quantum gravity, Foundations of Physics 44 (1) 1 (2014).
  • [10] A Computable Universe: Understanding and Exploring Nature as Computation, H. Zenil (Ed.), (World Scientific, 2013).
  • [11] J. Barrett, M. Leifer, and R. Tumulka, Bell’s jump process in discrete time, Europhys. Lett. 72 (5), 685 (2005).
  • [12] L. Ambrosio, N. Gigli, and G. Savare, Gradient flows in metric spaces and in the spaces of probability measures, (Springer Science & Business Media, 2008).
  • [13] C. Villani, Optimal transport: Old and new, vol. 338 (Springer, Verlag Berlin Heidelberg, 2009).
  • [14] E. Nelson, Derivation of the Schrödinger equation from Newtonian mechanics, Phys. Rev. 150, 1079 (1966).
  • [15] E. Nelson, Quantum Fluctuations (Princeton University Press, Dordrecht, 1985).
  • [16] E. Deotto and G.C. Ghirardi, Bohmian mechanics revisited, Found. Phys. 28, 1 (1998).
  • [17] G. Bacciagaluppi, Nelsonian Mechanics Revisited, Found. of Phys. Lett. 12, 1 (1999).
  • [18] J. C. Vink, Quantum mechanics in terms of discrete beables, Phys. Rev. A 48 (3), 1808 (1993).
  • [19] J. S. Bell, On the problem of hidden variables in quantum mechanics, Rev. Mod. Phys. 38 (3), 447 (1966); reprinted in [8].
  • [20] S. Goldstein, R. Tumulka, and N. Zanghì, Bohmian Trajectories as the Foundation of Quantum Mechanics, in: P. K. Chattaray (Ed.) Quantum Trajectories, (Taylor & Francis, Boca Raton, 2010); arXiv:0912.2666 [quant-ph].
  • [21] D. Dürr, S. Goldstein, R. Tumulka, and N. Zanghì, Quantum Hamiltonians and Stochastic Jumps, Commun. Math. Phys. 254 129 (2005).
  • [22] L. D. Landau and E. M. Lifshitz, The Classical Theory of Fields (Pergamon Press, Oxford, 1973).
  • [23] R. P. Feynman and A. R. Hibbs, Quantum Mechanics and Path Integrals (McGraw-Hill, New York, 1965).
  • [24] P. Ghose, A. S. Majumdar, S. Guha, and J. Sau, Bohmian trajectories for photons, Phys. Lett. A 290 (5), 205 (2001).
  • [25] C. Philippidis, C. Dewdney, and B. J. Hiley, Quantum interference and the quantum potential, Il Nuovo Cimento B, Series 11 52 (1), 15 (1979).
  • [26] J. Henson, The causal set approach to quantum gravity; in: D. Oriti (Ed.), Approaches to Quantum Gravity: Towards a New Understanding of Space, Time and Matter, 393 (Cambridge University Press, New York, 2009).
  • [27] F. Dowker, J. Henson, and R. Sorkin, Quantum Gravity Phenomenology, Lorentz Invariance and Discreteness, Mod. Phys. Lett. A, 19 (24), 1829 (2004).
  • [28] A. Valentini, On Galilean and Lorentz invariance in pilot-wave dynamics, Phys. Lett. A 228 (4), 215 (1997).
  • [29] C. R. Givens and R. M. Shortt, A class of Wasserstein metrics for probability distributions, Michigan Math. J., 31 (2), 231 (1984).
  • [30] L. Rüschendorf, The Wasserstein distance and approximation theorems, Z. Wahrsch. Verw. Gebiete 70 (1), 117 (1985).
  • [31] G.Ch. Pflug, and A. Pichler, Approximations for Probability Distributions and Stochastic Optimization Problems, International Series in Operations Research & Management Science 163, 343 (Springer, New York, 2011).
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description