Related papers: A note on observables for counting trails and path…
We frame the issue of pedestrian dynamics modeling in terms of path-integrals, a formalism originally introduced in quantum mechanics to account for the behavior of quantum particles, later extended to quantum field theories and to…
In this paper, we analyze the potential for new types of searches using the formalism of scattering random walks on Quantum Computers. Given a particular type of graph consisting of nodes and connections, a "Tree Maze", we would like to…
We say that a vertex $v$ in a connected graph $G$ is decisive if the numbers of walks from $v$ of each length determine the graph $G$ rooted at $v$ up to isomorphism among all connected rooted graphs with the same number of vertices. On the…
Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability, theoretical computer science, network science, and machine…
A model of joint random walk of two agents on an infinite plane is considered. The agents possess no means of mutual classical communication, but have access to quantum entanglement resource which is used according to a pre-arranged…
A quantum walk model which reflects the $2$-cell embedding on the orientable closed surface of a graph in the dynamics is introduced. We show that the scattering matrix is obtained by finding the faces on the underlying surface which have…
The gravity is classically formulated as the geometric curvature of the space-time in general relativity which is completely different from the other well-known physical forces. Since seeking a quantum framework for the gravity is a great…
We describe how to construct and compute unambiguously path integrals for particles moving in a curved space, and how these path integrals can be used to calculate Feynman graphs and effective actions for various quantum field theories with…
Classical path search assumes complete graphs and scalar optimization metrics, yet real infrastructure networks are incomplete and require multi-dimensional evaluation. We introduce the concept of traversal: a generalization of paths that…
Although the path-integral formalism is known to be equivalent to conventional quantum mechanics, it is not generally obvious how to implement path-based calculations for multi-qubit entangled states. Whether one takes the formal view of…
We study the quantum-mechanical transport on two-dimensional graphs by means of continuous-time quantum walks and analyse the effect of different boundary conditions (BCs). For periodic BCs in both directions, i.e., for tori, the problem…
We introduce a new way of quantifying the degrees of incompatibility of two ob- servables in a probabilistic physical theory and, based on this, a global measure of the degree of incompatibility inherent in such theories, across all…
We present a quantum theory of distances along a curve, based on a linear line element that is equal to the operator square root of the quadratic metric of Riemannian geometry. Since the linear line element is an operator, we treat it…
The paper considers the behaviour of the number of paths of length $N$ on graphs with two heavy roots. Such vertices can be entropic traps. Numerical analysis is carried out for graphs with different degrees of root vertices. In the…
Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…
Exploiting the geometric nature of statistical divergences, we devise a way to define associated induced uncertainty measures for discrete and finite probability distributions. We also report new uncertainty measures and discuss their…
The geometrical description of Quantum Mechanics is reviewed and proposed as an alternative picture to the standard ones. The basic notions of observables, states, evolution and composition of systems are analised from this perspective, the…
We investigate the integrability of the discrete non-linear equation governing the dependence on geodesic distance of planar graphs with inner vertices of even valences. This equation follows from a bijection between graphs and blossom…
The one-way measurement model is a framework for universal quantum computation, in which algorithms are partially described by a graph G of entanglement relations on a collection of qubits. A sufficient condition for an algorithm to perform…