相关论文: Exceptional configurations of quantum walks with G…

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…

There exist two types of configurations of marked vertices on a two-dimensional grid, known as the {\it exceptional configurations}, which are hard to find by the discrete-time quantum walk algorithms. In this article, we provide a…

There exist several types of configurations of marked vertices, referred to as the exceptional configurations, on one- and two-dimensional periodic lattices with additional long-range edges of the Hanoi network of degree four (HN4), which…

The running time of a quantum walk search algorithm depends on both the structure of the search space (graph) and the configuration of marked locations. While the first dependence have been studied in a number of papers, the second…

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…

Localization phenomena of quantum walks makes the propagation dynamics of a walker strikingly different from that corresponding to classical random walks. In this paper, we study the localization phenomena of four-state discrete-time…

Multi-dimensional quantum walks usually require large coin spaces. Here we show that the non-localized case of the spatial density probability of the two-dimensional Grover walk can be obtained using only a two-dimensional coin space and a…

The nature of discrete-time quantum walk in the presence of multiple marked states has been studied by Nahimovs and Rivosh. They introduced an exceptional configuration of clustered marked states $i.e.,$ if the marked states are arranged in…

While completely self-avoiding quantum walks have the distinct property of leading to a trivial unidirectional transport of a quantum state, an interesting and non-trivial dynamics can be constructed by restricting the self-avoidance to a…

We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., non-random) case, we allow any…

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…

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…

One of the unique features of discrete-time quantum walks is called trapping, meaning the inability of the quantum walker to completely escape from its initial position, albeit the system is translationally invariant. The effect is…

The lazy random walk, where the walker has some probability of staying put, is a useful tool in classical algorithms. We propose a quantum analogue, the lackadaisical quantum walk, where each vertex is given $l$ self-loops, and we…

In this paper we study discrete-time quantum walks on Cayley graphs corresponding to Dihedral groups, which are graphs with both directed and undirected edges. We consider the walks with coins that are one-parameter continuous deformation…

We present a new scheme for a discrete-time quantum walk on two- and three-dimensional lattices using a two-state particle. We use different Pauli basis as translational eigestates for different axis and show that the coin operation, which…

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…

This paper examines the performance of spatial search where the Grover diffusion operator is replaced by continuous-time quantum walks on a class of interdependent networks. We prove that for a set of optimal quantum walk times and marked…

Discrete-time quantum walks are well-known for exhibiting localization, a quantum phenomenon where the walker remains at its initial location with high probability. In companion with a joint Letter, we introduce oscillatory localization,…

Quantum walks exhibit properties without classical analogues. One of those is the phenomenon of asymptotic trapping -- there can be non-zero probability of the quantum walker being localised in a finite part of the underlying graph…