Related papers: Coassociative grammar, periodic orbits and quantum…

We study continuous time quantum walk on a random comb graph with infinite teeth. Due to localization effects along the spine, the walk cannot go to infinity in the spine direction, while it can escape to infinity along the teeth of the…

We consider a network model, embedded on the Manhattan lattice, of a quantum localisation problem belonging to symmetry class C. This arises in the context of quasiparticle dynamics in disordered spin-singlet superconductors which are…

We look at two possible routes to classical behavior for the discrete quantum random walk on the line: decoherence in the quantum ``coin'' which drives the walk, or the use of higher-dimensional coins to dilute the effects of interference.…

Establishing the existence of periodic orbits is one of the crucial and most intricate topics in the study of dynamical systems, and over the years, many methods have been developed to this end. On the other hand, finding closed orbits in…

This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.

We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a…

In this paper we study continuous-time quantum walks on Cayley graphs of the symmetric group, and prove various facts concerning such walks that demonstrate significant differences from their classical analogues. In particular, we show that…

We present a comprehensive classification of one-dimensional coined quantum walks on the infinite line, focusing on the spatial probability distributions they induce. Building on prior results, we identify all initial coin states that lead…

The subject of this paper is quantum walks, which are expected to simulate several kinds of quantum dynamical systems. In this paper, we define analyticity for quantum walks on Z. Almost all the quantum walks on $\mathbb{Z}$ which have been…

The two-point correlation function of chaotic systems with spin 1/2 is evaluated using periodic orbits. The spectral form factor for all times thus becomes accessible. Equivalence with the predictions of random matrix theory for the…

In this paper, we study the possible bifurcations of periodic orbits by reducing them to graphs. The aforementioned allows to study the genericity of routes to chaos, as well as to analyze their possible complexity. In particular, our…

We prove asymptotic equivalents for finite-level representations of symmetric groups, that is, for Young diagrams having all but finitely many boxes on their first row. We deduce that random walks on symmetric groups generated by conjugacy…

Quantum-classical correspondence in chaotic systems is a long-standing problem. We describe a method to quantify Bohr's correspondence principle and calculate the size of quantum numbers for which we can expect to observe quantum-classical…

The classical random walk isomorphism theorems relate the local times of a continuous-time random walk to the square of a Gaussian free field. A Gaussian free field is a spin system that takes values in Euclidean space, and this article…

The lackadaisical quantum walk is a lazy version of a discrete-time, coined quantum walk, where each vertex has a weighted self-loop that permits the walker to stay put. They have been used to speed up spatial search on a variety of graphs,…

The existing periodic orbit theory of spectral correlations for classically chaotic systems relies on the Riemann-Siegel-like representation of the spectral determinants which is still largely hypothetical. We suggest a simpler derivation…

The main goal of the present paper is to convince that it is feasible to construct a `periodic orbit theory' of localization by extending the idea of classical action correlations. This possibility had been questioned by many researchers in…

In this paper, I propose a realistic interpretation (RI) of quantum mechanics, that is, an interpretation according to which a particle follows a definite path in spacetime. The path is not deterministic but it is rather a random walk.…

We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…

In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…