Related papers: Analysis of Coined Quantum Walks with Renormalizat…
The connection between coined and continuous-time quantum walk models has been addressed in a number of papers. In most of those studies, the continuous-time model is derived from coined quantum walks by employing dimensional reduction and…
Based on the Dirac representation of Maxwell equations we present an explicit, discrete space-time, quantum walk-inspired algorithm suitable for simulating the electromagnetic wave propagation and scattering from inhomogeneities within…
Szegedy's quantum walk is a quantization of a classical random walk or Markov chain, where the walk occurs on the edges of the bipartite double cover of the original graph. To search, one can simply quantize a Markov chain with absorbing…
The recurrence time is the time a process first returns to its initial state. Using quantum walks on a graph, the recurrence time is defined through stroboscopic monitoring of the arrival of the particle to a node of the system. When the…
We study electric quantum walks in two dimensions considering Grover, Alternate, Hadamard, and DFT quantum walks. In the Grover walk the behaviour under an electric field is easy to summarize: when the field direction coincides with the x…
We propose a class of continuous-time quantum walk models on graphs induced by a certain class of discrete-time quantum walk models with the parameter $\epsilon\in [0,1]$. Here the graph treated in this paper can be applied both finite and…
We study the problem of a random walk on a lattice in which bonds connecting nearest neighbor sites open and close randomly in time, a situation often encountered in fluctuating media. We present a simple renormalization group technique to…
We introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric…
Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing the structure of a problem contains certain symmetries that…
Quantum walks are known to have nontrivial interactions with absorbing boundaries. In particular it has been shown that an absorbing boundary in the one dimensional quantum walk partially reflects information, as observed by absorption…
In this article, we present new random walk methods to solve flow and transport problems in unsaturated/saturated porous media, including coupled flow and transport processes in soils, heterogeneous systems modeled through random hydraulic…
This work introduces a graph-phased Szegedy's quantum walk, which incorporates link phases and local arbitrary phase rotations (APR), unlocking new possibilities for quantum algorithm efficiency. We demonstrate how to adapt quantum circuits…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…
Quantum walks are promising tools based on classical random walks, with plenty of applications such as many variants of optimization. Here we introduce the semiclassical walks in discrete time, which are algorithms that combines classical…
Rank-d Tensorial Group Field Theories are quantum field theories defined on a group manifold $G^{\times d}$, which represent a non-local generalization of standard QFT, and a candidate formalism for quantum gravity, since, when endowed with…
Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms and quantum simulation of condensed matter systems. The key property of quantum…
We extend the real-space renormalization group (RG) approach to the study of the energy level statistics at the integer quantum Hall (QH) transition. Previously it was demonstrated that the RG approach reproduces the critical distribution…
We investigate the RG-time integration of the effective potential in the functional renormalization group in the presence of spontaneous symmetry breaking and its subsequent convexity restoration on the example of a scalar theory in $d=3$.…
We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently resets to previously visited nodes in a preferential way,…