Related papers: Continuous-Time Quantum Walk on Penrose Lattice
Quantum search on the two-dimensional lattice with one marked vertex and cyclic boundary conditions is an important problem in the context of quantum algorithms with an interesting unfolding. It avails to test the ability of quantum walk…
We advance the previous studies of quantum walks on the line with two coins. Such four-state quantum walks driven by a three-direction shift operator may have nonzero stationary distributions (localization), thus distinguishing themselves…
We study time-dependent discrete-time quantum walks on the one-dimensional lattice. We compute the limit distribution of a two-period quantum walk defined by two orthogonal matrices. For the symmetric case, the distribution is determined by…
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…
Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the…
Quantum walks are at present an active field of study in mathematics, with important applications in quantum information and statistical physics. In this paper, we determine the influence of basic chaotic features on the walker behavior.…
We study the efficiency of a two-channel reaction between two walkers on a finite one-dimensional periodic lattice. The walkers perform a combination of synchronous and asynchronous jumps on the lattice and react instantaneously when they…
Coherent dynamics of interacting quantum particles plays a central role in the study of strongly correlated quantum matter and the pursuit of quantum information processors. Here, we present the state-space of interacting Rydberg atoms as a…
We address the dynamics of continuous-time quantum walk (CTQW) on planar 2D lattice graphs, i.e. those forming a regular tessellation of the Euclidean plane (triangular, square, and honeycomb lattice graphs). We first consider the free…
We establish the theory for pretty good state transfer in discrete-time quantum walks. For a class of walks, we show that pretty good state transfer is characterized by the spectrum of certain Hermitian adjacency matrix of the graph; more…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…
Recently, quantum simulation of low-dimensional lattice gauge theories (LGTs) has attracted many interests, which may improve our understanding of strongly correlated quantum many-body systems. Here, we propose an implementation to…
We have recently proposed a two-dimensional quantum walk where the requirement of a higher dimensionality of the coin space is substituted with the alternance of the directions in which the walker can move [C. Di Franco, M. Mc Gettrick, and…
Quantum walk acts obviously different from its classical counterpart, but decoherence will lessen and close the gap between them. To understand this process, it is necessary to investigate the evolution of quantum walk under different…
In the typical spatial search problems solved by continuous-time quantum walk, changing the location of the marked vertices does not alter the search problem. In this paper, we consider search when this is no longer true. In particular, we…
In the worldline formalism, scalar Quantum Electrodynamics on a 2-dimensional lattice is related to the areas of closed loops on this lattice. We exploit this relationship in order to determine the general structure of the moments of the…
The evolution of a many-particle system on a one-dimensional lattice, subjected to a quantum walk can cause spatial entanglement in the lattice position, which can be exploited for quantum information/communication purposes. We demonstrate…
Quantum walks, the quantum analogue of the classical random walk, have been shown to underpin quantum algorithms for fluid dynamics. We propose the quantum half-adder gate method for quantum walks as a good benchmark algorithm, specifically…
We investigate the effect of disorder on the transfer of quantum states across a one-dimensional lattice with varying levels of control resources. We find that the application of properly designed control signals, even when applied only to…
We discuss an efficient physical realization of topological quantum walks on a finite lattice. The $N$-point lattice is realized with $\log_2 N$ qubits, and the quantum circuit utilizes a number of quantum gates which is polynomial in the…