Related papers: Discrete-time quantum walk on complex networks for…
In this work the quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with arbitrary dimension. Monte Carlo simulations,…
We analyze the role of dimensionality in the time evolution of discrete time quantum walks through the example of the three-state walk on a two-dimensional, triangular lattice. We show that the three-state Grover walk does not lead to…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the nowadays widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in…
The three-state Grover walk on a line exhibits the localization effect characterized by a non-vanishing probability of the particle to stay at the origin. We present two continuous deformations of the Grover walk which preserve its…
We show that a quantum state transfer, previously studied as a continuous time process in networks of interacting spins, can be achieved within the model of discrete time quantum walks with position dependent coin. We argue that due to…
Constructing a discrete model like a cellular automaton is a powerful method for understanding various dynamical systems. However, the relationship between the discrete model and its continuous analogue is, in general, nontrivial. As a…
We study the dynamical localization of discrete time evolution of topological split-step quantum random walk (QRW) on a single-site defect starting from a uniform distribution. Using analytical and numerical calculations, we determine the…
We use simple deterministic dynamical systems as coins in studying quantum walks. These dynamical systems can be chosen to display, in the classical limit, a range of behaviors from the integrable to chaotic, or deterministically random. As…
Quantum walk (QW), which is considered as the quantum counterpart of the classical random walk (CRW), is actually the quantum extension of CRW from the single-coin interpretation. The sequential unitary evolution engenders correlation…
Quantum walk followed by some amplitude amplification technique has been successfully used to search for marked vertices on various graphs. Lackadaisical quantum walk can search for target vertices on graphs without the help of any…
We mainly study exceptional configuration for coined quantum walk search. For searching on a two-dimensional grid by AKR algorithm, we find some new classes of exceptional configurations that cannot be found by the AKR algorithm effectively…
The task of \emph{community detection} in a graph formalizes the intuitive task of grouping together subsets of vertices such that vertices within clusters are connected tighter than those in disparate clusters. This paper approaches…
Quantum walks are quantum counterparts of random walks and their probability distributions are different from each other. A quantum walker distributes on a Hilbert space and it is observed at a location with a probability. The finding…
In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in this internal state, we show that additionally measuring it…
We extend the idea of a discrete-time quantum walk on a graph by placing a qubit on each vertex, and allowing the walker to interact with the qubit at its current position. We show that allowing for a controlled-Z interaction at each time…
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing…
In this paper, we study discrete-time quantum walks on one-dimensional lattices. We find that the coherent dynamics depends on the initial states and coin parameters. For infinite size of lattice, we derive an explicit expression for the…
We study the discrete quantum walk on a regular graph $X$ that assigns negative identity coins to marked vertices $S$ and Grover coins to the unmarked ones. We find combinatorial bases for the eigenspaces of the transtion matrix, and derive…
The discrete-time quantum walk (QW) has been extensively and intensively investigated for the last decade, whose coin operator is defined by a unitary matrix. We extend the QW to a walk determined by a unitary matrix whose component is…