Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOdd-periodic Grover walk
83
0
0.0
(
0
)
Authors
Yusuke Yoshie
Ask ChatGPT about the research
No Arabic abstract
The Grover walk is one of well-studied quantum walks on graphs and its periodicity is investigated to reveal the relation between the quantum walk and the underlying graph. Especially, characterization of graphs exhibiting a periodic Grover walk is intensively studied. Yoshie has already characterized such graphs having a periodic Grover walk with periods $2, 3, 4$ and $5$. In the work, it is expected that the graphs exhibiting a periodic Grover walk with odd period are the cycles with odd length. In this paper, we address that problem and obtained the perfect answer, that is, we perfectly characterize the class of graphs exhibiting an odd-periodic Grover walk by a combinatorial method. More precisely, we solve the problem by analyzing the characteristic polynomial of a weighted adjacency matrix of the graph.
rate research
Read More
This paper explains the periodicity of the Grover walk on finite graphs. We characterize the graphs to induce 2, 3, 4, 5-periodic Grover walk and obtain a necessary condition of the graphs to induce an odd-periodic Grover walk.
We present numerical study of a model of quantum walk in periodic potential on the line. We take the simple view that different potentials affect differently the way the coin state of the walker is changed. For simplicity and definiteness, we assume the walkers coin state is unaffected at sites without potential, and is rotated in an unbiased way according to Hadamard matrix at sites with potential. This is the simplest and most natural model of a quantum walk in a periodic potential with two coins. Six generic cases of such quantum walks were studied numerically. It is found that of the six cases, four cases display significant localization effect, where the walker is confined in the neighborhood of the origin for sufficiently long times. Associated with such localization effect is the recurrence of the probability of the walker returning to the neighborhood of the origin.
A sequential application of the Grover algorithm to solve the iterated search problem has been improved by Ozhigov by parallelizing the application of the oracle. In this work a representation of the parallel Grover as dynamic system of inversion about the mean and Grover operators is given. Within this representation the parallel Grover for $k = 2$ can be interpreted as rotation in three-dimensional space and it can be shown that the sole application of the parallel Grover operator does not lead to a solution for $k > 2$. We propose a solution for $k = 3$ with a number of approximately $1.51sqrt{N}$ iterations.
Two subjects are discussed in this work: localisation and recurrence in a model of quantum walk in a periodic potential, and a model of opinion dynamics with multiple choices of opinions.
Phase matching has been studied for the Grover algorithm as a way of enhancing the efficiency of the quantum search. Recently Li and Li found that a particular form of phase matching yields, with a single Grover operation, a success probability greater than 25/27 for finding the equal-amplitude superposition of marked states when the fraction of the marked states stored in a database state is greater than 1/3. Although this single operation eliminates the oscillations of the success probability that occur with multiple Grover operations, the latter oscillations reappear with multiple iterations of Li and Lis phase matching. In this paper we introduce a multi-phase matching subject to a certain matching rule by which we can obtain a multiple Grover operation that with only a few iterations yields a success probability that is almost constant and unity over a wide range of the fraction of marked items. As an example we show that a multi-phase operation with six iterations yields a success probability between 99.8% and 100% for a fraction of marked states of 1/10 or larger.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
