Related papers: A note on observables for counting trails and path…
We describe some metric properties of incomparability graphs. We consider the problem of the existence of infinite paths, either induced or isometric, in the incomparability graph of a poset. Among other things, we show that if the…
The amount $Q$ of particles that are transported via a path of motion is characterized by its expectation value $<Q>$ and by its variance $Var(Q)$. We analyze what happens if a particle has two optional paths available to get from one site…
The walk distances in graphs are defined as the result of appropriate transformations of the $\sum_{k=0}^\infty(tA)^k$ proximity measures, where $A$ is the weighted adjacency matrix of a graph and $t$ is a sufficiently small positive…
Quantum observables can be identified with vector fields on the sphere of normalized states. Consequently, the uncertainty relations for quantum observables become geometric statements. In the Letter the familiar uncertainty relation…
In the context of a random walk on an undirected graph, Kemeny's constant can measure the average travel time for a random walk between two randomly chosen vertices. We are interested in graphs that behave counter-intuitively in regard to…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then…
The familiar theories of physics have the feature that the application of the theory to make predictions in specific circumstances can be done by means of an algorithm. We propose a more precise formulation of this feature --- one based on…
A type of mechanics will be presented that possesses some distinctive properties. On the one hand, its physical description & rules of operation are readily comprehensible & intuitively clear. On the other, it fully satisfies all observable…
We initiate the study of a fundamental combinatorial problem: Given a capacitated graph $G=(V,E)$, find a shortest walk ("route") from a source $s\in V$ to a destination $t\in V$ that includes all vertices specified by a set…
In this paper, I consider the issue of how two mathematical models of modern physics, the variational principles and the quantum path integral formalism, relate to reality. I assume that the observed phenomena are consistent with the…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
This paper considers a generalization of the notion of quantum observables in ontological models of quantum mechanics. Within this framework it is possible to construct physical models where quantum noncommutativity can arise dynamically.…
It is well known that in a generally covariant gravitational theory the choice of spacetime scalars as coordinates yields phase-space observables (or "invariants"). However their relation to the symmetry group of diffeomorphism…
For a continuous-time quantum walk on a line the variance of the position observable grows quadratically in time, whereas, for its classical counterpart on the same graph, it exhibits a linear, diffusive, behaviour. A quantum walk, thus,…
We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
We approach the problem of counting the number of walks in a digraph from three different perspectives: enumerative combinatorics, linear algebra, and symbolic dynamics.
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…