Related papers: The Analogue of Bohm-Bell Processes on a Graph
We study the dynamics of electrons in crystalline solids in the presence of inhomogeneous external electric and magnetic fields. We present a manifestly gauge-invariant operator-based approach without relying on a semiclassical wavepacket…
The ontological aspect of Bohmian mechanics, as a hidden-variable theory that provides us with an objective description of a quantum world without observers, is widely known. Yet its practicality is getting more and more acceptance and…
This paper develops a deterministic model of quantum mechanics as an accumulation-and-threshold process. The model arises from an analogy with signal processing in wireless communications. Complex wavefunctions are interpreted as expressing…
A process model of quantum mechanics utilizes a combinatorial game to generate a discrete and finite causal space upon which can be defined a self-consistent quantum mechanics. An emergent space-time M and continuous wave function arise…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
The Bohmian formulation of quantum mechanics is used in order to describe the measurement process in an intuitive way without a reduction postulate in the framework of a deterministic single system theory. Thereby the motion of the hidden…
The stochastic theory of non-relativistic quantum mechanics presented here relies heavily upon the theory of stochastic processes, with its definitions, theorems and specific vocabulary as well. Its main hypothesis states indeed that the…
We define a Markov process on the partitions of $[n]=\{1,\ldots,n\}$ by drawing a sample in $[n]$ at each time of a Poisson process, by merging blocks that contain one of these points and by leaving all other blocks unchanged. This…
The dynamics of a point particle in a periodic array of spherical scatterers converges, in the limit of small scatterer size, to a random flight process, whose paths are piecewise linear curves generated by a Markov process with memory two.…
The transition law of every exchangeable Feller process on the space of countable graphs is determined by a $\sigma$-finite measure on the space of $\{0,1\}\times\{0,1\}$-valued arrays. In discrete-time, this characterization amounts to a…
We derive upper and lower bounds on the convergence behavior of certain classes of one-parameter quantum dynamical semigroups. The classes we consider consist of tensor product channels and of channels with commuting Liouvillians. We…
We develop an extension of Bohmian mechanics to a curved background space-time containing a singularity. The present paper focuses on timelike singularities. We use the naked timelike singularity of the super-critical Reissner-Nordstrom…
Quantum mechanics is able to predict challenging behaviors even in the simplest physical scenarios. These behaviors are possible because of the important dynamical role that phase plays in the evolution of quantum systems, and are very…
A classification for Brownian motions on metric graphs, that is, right continuous strong Markov processes which behave like a one-dimensional Brownian motion on the edges and feature effects like Walsh skewness, stickiness and jumps at the…
Markov branching systems form a fundamental class of stochastic models that are extensively applied in biology, physics, finance, and other domains. These systems are distinguished by their continuous-time evolution and inherent branching…
We define the probability structure of a continuous-time time-homogeneous Markov jump process, on a finite graph, that represents the continuous-time counterpart of the so-called Ruelle-Bowen discrete-time random walk. It constitutes the…
In a quantum (inhomogeneous) Markov process $\rho_1:=\Gamma_1(\rho)$, $\rho_2:=\Gamma_1(\rho_1)$, ..., where $\Gamma_i$ are CPTP maps and $\rho$ is the initial state, the the state of the system is either oscillatory or convergent to a…
Consider a system of interacting particles indexed by the nodes of a graph whose vertices are equipped with marks representing parameters of the model such as the environment or initial data. Each particle takes values in a countable state…
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they communicate and cooperate.Moreover, to model concurrent and…
The time evolution of the one-point probability vector of stochastic processes and quantum processes for $N$-level systems have been unified. Hence, quantum states and quantum operations can be regarded as generalizations of the one-point…