Related papers: Generator of an abstract quantum walk
In this expository note, we discuss spatially inhomogeneous quantum walks in one dimension and describe a genre of mathematical methods that enables one to translate information about the time-independent eigenvalue equation for the unitary…
We use the recently introduced U(N) framework for loop quantum gravity to study the dynamics of spin network states on the simplest class of graphs: two vertices linked with an arbitrary number N of edges. Such graphs represent two regions,…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…
A discrete-time Quantum Walk (QW) is essentially a unitary operator driving the evolution of a single particle on the lattice. Some QWs admit a continuum limit, leading to familiar PDEs (e.g. the Dirac equation). In this paper, we study the…
The adjacency matrix of a graph G is the Hamiltonian for a continuous-time quantum walk on the vertices of G. Although the entries of the adjacency matrix are integers, its eigenvalues are generally irrational and, because of this, the…
Open Quantum Walks (OQWs) are exclusively driven by dissipation and are formulated as completely positive trace preserving (CPTP) maps on underlying graphs. The microscopic derivation of discrete and continuous in time OQWs is presented. It…
We present a novel Adaptive Distribution Generator that leverages a quantum walks-based approach to generate high precision and efficiency of target probability distributions. Our method integrates variational quantum circuits with…
The time-evolution equation of a one-dimensional quantum walker is exactly mapped to the three-dimensional Weyl equation for a zero-mass particle with spin 1/2, in which each wave number k of walker's wave function is mapped to a point…
An important quantity in quantum field theory is the vacuum-to-vacuum transition amplitude in the presence of an external source. This quantity is often designated by Z[J] and is the generator for the n-point Greens functions. In textbooks…
Given a Hilbert space and the generator $A$ of a strongly continuous, exponentially stable, semigroup on this Hilbert space. For any $g(-s) \in {\mathcal H}_{\infty}$ we show that there exists an infinite-time admissible output operator…
We study discrete-time quantum walks on $d$-cycles with a position and coin-dependent phase-shift. Such a model simulates a dynamics of a quantum particle moving on a ring with an artificial gauge field. In our case the amplitude of the…
A new functional calculus, developed recently for a fully non-perturbative treatment of quantum gravity, is used to begin a systematic construction of a quantum theory of geometry. Regulated operators corresponding to areas of 2-surfaces…
We generalize the discrete quantum walk on the line using a time dependent unitary coin operator. We find an analytical relation between the long-time behaviors of the standard deviation and the coin operator. Selecting the coin time…
We consider a new model of quantum walk on a one-dimensional momentum space that includes both discrete jumps and continuous drift. Its time evolution has two stages; a Markov diffusion followed by localized dynamics. As in the well known…
We elucidate physical aspects of path signatures by formulating randomised path developments within the framework of matrix models in quantum field theory. Using tools from physics, we introduce a new family of randomised path developments…
Let $G$ be a strongly regular graph of prime order $p$ with connection degree $k \geq 6$. We prove that the \emph{quantum walk characteristic polynomial} $\chi_q(G,\lambda) \coloneqq \det(\lambda I - U_G)$, where $U_G$ is the coined quantum…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that…
We present the structure theorem for the positive support of the cube of the Grover transition matrix of the discrete-time quantum walk (the Grover walk) on a general graph $G$ under same condition. Thus, we introduce a zeta function on the…
In this paper, we consider an extended coined Szegedy model and discuss the existence of the point spectrum of induced quantum walks in terms of recurrence properties of the underlying birth and death process. We obtain that if the…