Related papers: Analysis of Coined Quantum Walks with Renormalizat…
The return-to-origin probability and the first passage time distribution are essential quantities for understanding transport phenomena in diverse systems. The behaviors of these quantities typically depend on the spectral dimension $d_s$.…
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…
We consider to what extent quantum walks can constitute models of thermalization, analogously to how classical random walks can be models for classical thermalization. In a quantum walk over a graph, a walker moves in a superposition of…
The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. We analytically prove that lackadaisical quantum walks can find a unique marked vertex on any regular…
Following an approach of Matarrese and Pietroni, we derive the functional renormalization group (RG) flow of the effective action of cosmological large-scale structures. Perturbative solutions of this RG flow equation are shown to be…
Using a leading algorithmic implementation of the functional renormalization group (fRG) for interacting fermions on two-dimensional lattices, we provide a detailed analysis of its quantitative reliability for the Hubbard model. In…
Quantum walks have been shown to be fruitful tools in analysing the dynamic properties of quantum systems. This article proposes to use quantum walks as an approach to Quantum Neural Networks (QNNs). QNNs replace binary McCulloch-Pitts…
The two major discrete time formulations for quantum walks, coined and scattering, are unitarily equivalent for arbitrary position dependent transition amplitudes and any topology (PRA {\bf 80}, 052301 (2009)). Although the proof explicit…
We present a discrete-time, one-dimensional quantum walk based on the entanglement between the momentum of ultracold rubidium atoms (the walk space) and two internal atomic states (the "coin" degree of freedom). Our scheme is highly…
We introduce the quantum stochastic walk (QSW), which determines the evolution of generalized quantum mechanical walk on a graph that obeys a quantum stochastic equation of motion. Using an axiomatic approach, we specify the rules for all…
We analyze renormalization group (RG) flows in two-dimensional quantum field theories in the presence of redundant directions. We use the operator picture in which redundant operators are total derivatives. Our analysis has three levels of…
We study inflation as a "cosmic" renormalization-group flow. The flow, which encodes the dependence on the background metric, is described by a running coupling $\alpha $, which parametrizes the slow roll, a de Sitter free, analytic beta…
We summarize our recent results on the large N renormalization group (RG) approach to matrix models for discretized two-dimensional quantum gravity. We derive exact RG equations by solving the reparametrization identities, which reduce…
We demonstrate a quantum walk with time-dependent coin bias. With this technique we realize an experimental single-photon one-dimensional quantum walk with a linearly-ramped time-dependent coin flip operation and thereby demonstrate two…
A number of recent studies have investigated the introduction of decoherence in quantum walks and the resulting transition to classical random walks. Interestingly, it has been shown that algorithmic properties of quantum walks with…
In papers\cite{js,jsa}, the amplitudes of continuous-time quantum walk on graphs possessing quantum decomposition (QD graphs) have been calculated by a new method based on spectral distribution associated to their adjacency matrix. Here in…
Several variants of the graph Laplacian have been introduced to model non-local diffusion processes, which allow a random walker to {\textquotedblleft jump\textquotedblright} to non-neighborhood nodes, most notably the transformed path…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
We study transport properties of quantum impurity systems using the functional renormalization group. The latter is an RG-based diagrammatic tool to treat Coulomb interactions in a fast and flexible way. Prior applications, which employed a…
We introduce a discrete-time quantum random walk (QRW) framework for spatial epidemic modelling on a two-dimensional square lattice and compare its dynamics to classical random-walk SIR models. In our model, each infected site spawns a…