Related papers: Quantum Pascal's Triangle and Sierpinski's carpet
Continuous-time quantum walk is one of the alternative approaches to quantum computation, where a universal set of quantum gates can be achieved by scattering a quantum walker on some specially-designed structures embedded in a sparse graph…
A review of discrete quantum walk with two particle is given. The use of different states encountered in identical particle, and the idea of entanglement and superposition is explored to explored the interesting dynamics of two particle…
Quantum walks in an elaborately designed graph, is a powerful tool simulating physical and topological phenomena, constructing analog quantum algorithms and realizing universal quantum computing. Integrated photonics technology has emerged…
We investigate time-independent disorder on several two-dimensional discrete-time quantum walks. We find numerically that, contrary to claims in the literature, random onsite phase disorder, spin-dependent or otherwise, cannot localise the…
Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…
We consider the Weyl quantum walk in 3+1 dimensions, that is a discrete-time walk describing a particle with two internal degrees of freedom moving on a Cayley graph of the group $\mathbb Z^3$, that in an appropriate regime evolves…
We analyze several families of two-dimensional quantum random walks. The feasible region (the region where probabilities do not decay exponentially with time) grows linearly with time, as is the case with one-dimensional QRW. The limiting…
We study Hamiltonian walks (HWs) on Sierpinski and $n$--simplex fractals. Via numerical analysis of exact recursion relations for the number of HWs we calculate the connectivity constant $\omega$ and find the asymptotic behaviour of the…
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…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
Discrete-time quantum walks are considered a counterpart of random walks and the study for them has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to…
A discrete-time staggered quantum walk was recently introduced as a generalization that allows to unify other versions, such as the coined and Szegedy's walk. However, it also produces new forms of quantum walks not covered by previous…
We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…
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…
The study of matter fields on an ensemble of random geometries is a difficult problem still in need of new methods and ideas. We will follow a point of view inspired by probability theory techniques that relies on an expansion of the two…
A quantum walk on a toral phase space involving translations in position and its conjugate momentum is studied in the simple context of a coined walker in discrete time. The resultant walk, with a family of coins parametrized by an angle is…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…