scholarly journals Periodicity for the Fourier quantum walk on regular graphs

2019 ◽  
Vol 19 (1&2) ◽  
pp. 23-34
Author(s):  
Kei Saito
Keyword(s):  
Quantum Walk ◽  
Quantum Walks ◽  
Necessary Condition ◽  
Complete Graphs ◽  
Regular Graphs ◽  
Finite Period

Quantum walks determined by the coin operator on graphs have been intensively studied. The typical examples of coin operator are the Grover and Fourier matrices. The periodicity of the Grover walk is well investigated. However, the corresponding result on the Fourier walk is not known. In this paper, we present a necessary condition for the Fourier walk on regular graphs to have the finite period. As an application of our result, we show that the Fourier walks do not have any finite period for some classes of regular graphs such as complete graphs, cycle graphs with selfloops, and hypercubes.

scholarly journals Periodicity for the 3-state quantum walk on cycles

2019 ◽  
Vol 19 (13&14) ◽  
pp. 1081-1088
Author(s):  
Takeshi Kajiwara ◽  
Norio Konno ◽  
Shohei Koyama ◽  
Kei Saito
Keyword(s):  
Hadamard Matrix ◽  
Cyclotomic Field ◽  
Quantum Walk ◽  
Quantum Walks ◽  
New Method ◽  
Necessary Condition ◽  
Finite Period ◽  
Cycle Graph

Dukes (2014) and Konno, Shimizu, and Takei (2017) studied the periodicity for 2-state quantum walks whose coin operator is the Hadamard matrix on cycle graph C_N with N vertices. The present paper treats the periodicity for 3-state quantum walks on C_N. Our results follow from a new method based on the cyclotomic field. This method gives a necessary condition for the coin operator for quantum walks to be periodic. Moreover, we reveal the period T_N of typical two kinds of quantum walks, the Grover and Fourier walks. We prove that both walks do not have any finite period except for N=3, in which case T_3=6 (Grover), =12 (Fourier).

Exploring scalar quantum walks on Cayley graphs

2008 ◽  
Vol 8 (1&2) ◽  
pp. 68-81
Author(s):  
O.L. Acevedo ◽  
J. Roland ◽  
N.J. Cerf
Keyword(s):  
Evolution Operator ◽  
Cayley Graphs ◽  
Quantum Walk ◽  
Quantum Walks ◽  
Constructive Method ◽  
Quantum Evolution ◽  
Necessary Condition ◽  
Internal Space ◽  
Special Cases ◽  
Scalar Quantum

A quantum walk, \emph{i.e.}, the quantum evolution of a particle on a graph, is termed \emph{scalar} if the internal space of the moving particle (often called the coin) has dimension one. Here, we study the existence of scalar quantum walks on Cayley graphs, which are built from the generators of a group. After deriving a necessary condition on these generators for the existence of a scalar quantum walk, we present a general method to express the evolution operator of the walk, assuming homogeneity of the evolution. We use this necessary condition and the subsequent constructive method to investigate the existence of scalar quantum walks on Cayley graphs of groups presented with two or three generators. In this restricted framework, we classify all groups -- in terms of relations between their generators -- that admit scalar quantum walks, and we also derive the form of the most general evolution operator. Finally, we point out some interesting special cases, and extend our study to a few examples of Cayley graphs built with more than three generators.

scholarly journals Marking Vertices to Find Graph Isomorphism Mapping Based on Continuous-Time Quantum Walk

Entropy ◽  
2018 ◽  
Vol 20 (8) ◽  
pp. 586 ◽  
Author(s):  
Xin Wang ◽  
Yi Zhang ◽  
Kai Lu ◽  
Xiaoping Wang ◽  
Kai Liu
Keyword(s):  
Polynomial Time ◽  
Continuous Time ◽  
Graph Isomorphism ◽  
Quantum Walk ◽  
Isomorphism Problem ◽  
Quantum Walks ◽  
Regular Graphs ◽  
Structure Preserving ◽  
Topological Structures ◽  
Time Quantum

The isomorphism problem involves judging whether two graphs are topologically the same and producing structure-preserving isomorphism mapping. It is widely used in various areas. Diverse algorithms have been proposed to solve this problem in polynomial time, with the help of quantum walks. Some of these algorithms, however, fail to find the isomorphism mapping. Moreover, most algorithms have very limited performance on regular graphs which are generally difficult to deal with due to their symmetry. We propose IsoMarking to discover an isomorphism mapping effectively, based on the quantum walk which is sensitive to topological structures. Firstly, IsoMarking marks vertices so that it can reduce the harmful influence of symmetry. Secondly, IsoMarking can ascertain whether the current candidate bijection is consistent with existing bijections and eventually obtains qualified mapping. Thirdly, our experiments on 1585 pairs of graphs demonstrate that our algorithm performs significantly better on both ordinary graphs and regular graphs.

scholarly journals Quantum Walks on Generalized Quadrangles

10.37236/5982 ◽  
2017 ◽  
Vol 24 (4) ◽  
Author(s):  
Chris Godsil ◽  
Krystal Guo ◽  
Tor G. J. Myklebust
Keyword(s):  
Transition Matrix ◽  
Quantum Walk ◽  
Quantum Walks ◽  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Generalized Quadrangles ◽  
Intersection Graphs ◽  
Strongly Regular

We study the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of $S^+(U^3)$, a matrix based on the amplitudes of walks in the quantum walk, distinguishes strongly regular graphs. We probabilistically compute the spectrum of the line intersection graphs of two non-isomorphic generalized quadrangles of order $(5^2,5)$ under this matrix and thus provide strongly regular counter-examples to the conjecture.

On mixing in continuous-time quantum walks on some circulant graphs

2003 ◽  
Vol 3 (6) ◽  
pp. 611-618
Author(s):  
A. Ahmadi ◽  
R. Belk ◽  
C. Tamon ◽  
C. Wendler
Keyword(s):  
Continuous Time ◽  
Quantum Walk ◽  
Quantum Walks ◽  
Complete Graphs ◽  
Circulant Graphs ◽  
Multipartite Graphs ◽  
Time Quantum ◽  
Complete Multipartite ◽  
Cycle Graph ◽  
Mixing Property

Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that the continuous-time quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs that have the instantaneous exactly uniform mixing property are the complete graphs on two, three and four vertices, and the cycle graph on four vertices. Our proof exploits the circulant structure of these graphs. Furthermore, we conjecture that most complete cycles and Cayley graphs of the symmetric group lack this mixing property as well.

scholarly journals Quantum Walks on Regular Graphs and Eigenvalues

10.37236/652 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Chris Godsil ◽  
Krystal Guo
Keyword(s):  
Transition Matrix ◽  
Quantum Walk ◽  
Quantum Walks ◽  
Strongly Regular Graphs ◽  
Regular Graphs ◽  
Strongly Regular

We study the transition matrix of a quantum walk on strongly regular graphs. It is proposed by Emms, Hancock, Severini and Wilson in 2006, that the spectrum of $S^+(U^3)$, a matrix based on the amplitudes of walks in the quantum walk, distinguishes strongly regular graphs. We find the eigenvalues of $S^+(U)$ and $S^+(U^2)$ for regular graphs and show that $S^+(U^2) = S^+(U)^2 + I$.

Global Optimization With Quantum Walk Enhanced Grover Search

2014 ◽  
Author(s):  
Yan Wang
Keyword(s):  
Global Optimization ◽  
Optimization Problems ◽  
Early Stage ◽  
Hybrid Approach ◽  
Quantum Walk ◽  
Quantum Walks ◽  
Tunneling Effect ◽  
Grover’S Algorithm ◽  
Grover's Algorithm ◽  
Grover Search

One of the significant breakthroughs in quantum computation is Grover’s algorithm for unsorted database search. Recently, the applications of Grover’s algorithm to solve global optimization problems have been demonstrated, where unknown optimum solutions are found by iteratively improving the threshold value for the selective phase shift operator in Grover rotation. In this paper, a hybrid approach that combines continuous-time quantum walks with Grover search is proposed. By taking advantage of quantum tunneling effect, local barriers are overcome and better threshold values can be found at the early stage of search process. The new algorithm based on the formalism is demonstrated with benchmark examples of global optimization. The results between the new algorithm and the Grover search method are also compared.

Higher-dimensional open quantum walk in environment of quantum Bernoulli noises

2021 ◽  
pp. 2250001
Author(s):  
Ce Wang
Keyword(s):  
Quantum Walk ◽  
Quantum Walks ◽  
Initial State ◽  
Quantum Random Walks ◽  
Open Quantum ◽  
Higher Dimensional ◽  
Gauss Type ◽  
Open Quantum Random Walks ◽  
Limit Probability ◽  
Creation Operators

Open quantum walks (OQWs) (also known as open quantum random walks) are quantum analogs of classical Markov chains in probability theory, and have potential application in quantum information and quantum computation. Quantum Bernoulli noises (QBNs) are annihilation and creation operators acting on Bernoulli functionals, and can be used as the environment of an open quantum system. In this paper, by using QBNs as the environment, we introduce an OQW on a general higher-dimensional integer lattice. We obtain a quantum channel representation of the walk, which shows that the walk is indeed an OQW. We prove that all the states of the walk are separable provided its initial state is separable. We also prove that, for some initial states, the walk has a limit probability distribution of higher-dimensional Gauss type. Finally, we show links between the walk and a unitary quantum walk recently introduced in terms of QBNs.

scholarly journals Quantum walks and elliptic integrals

2010 ◽  
Vol 20 (6) ◽  
pp. 1091-1098 ◽  
Author(s):  
NORIO KONNO
Keyword(s):  
Random Walk ◽  
Generating Function ◽  
Elliptic Integral ◽  
Quantum Walk ◽  
Quantum Walks ◽  
Elliptic Integrals ◽  
Two Dimensional ◽  
One Dimensional ◽  
Similar Expression ◽  
Return Probability

Pólya showed in his 1921 paper that the generating function of the return probability for a two-dimensional random walk can be written in terms of an elliptic integral. In this paper we present a similar expression for a one-dimensional quantum walk.

scholarly journals Can Colour-Blind Distinguish Colour Palettes?

10.37236/2319 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Rafał Kalinowski ◽  
Monika Pilśniak ◽  
Jakub Przybyło ◽  
Mariusz Woźniak
Keyword(s):  
Large Degree ◽  
Bipartite Graphs ◽  
Complete Graphs ◽  
Regular Graphs ◽  
Lovász Local Lemma ◽  
Local Lemma ◽  
Comprehensive Information ◽  
Lovasz Local Lemma ◽  
Delta G ◽  
Irregular Graphs

Let $c:E(G)\rightarrow [k]$ be  a colouring, not necessarily proper, of edges of a graph $G$. For a vertex $v\in V$, let $\overline{c}(v)=(a_1,\ldots,a_k)$, where $ a_i =|\{u:uv\in E(G),\;c(uv)=i\}|$, for $i\in [k].$ If we re-order the sequence $\overline{c}(v)$ non-decreasingly, we obtain a sequence $c^*(v)=(d_1,\ldots,d_k)$, called a palette of a vertex $v$. This can be viewed as the most comprehensive information about colours incident with $v$ which can be delivered by a person who is unable to name colours but distinguishes one from another. The smallest $k$ such that $c^*$ is a proper colouring of vertices of $G$ is called the colour-blind index of a graph $G$, and is denoted by dal$(G)$. We conjecture that there is a constant $K$ such that dal$(G)\leq K$ for every graph $G$ for which the parameter is well defined. As our main result we prove that $K\leq 6$ for regular graphs of sufficiently large degree, and for irregular graphs with $\delta (G)$ and $\Delta(G)$ satisfying certain conditions. The proofs are based on the Lopsided Lovász Local Lemma. We also show that $K=3$ for all regular bipartite graphs, and for complete graphs of order $n\geq 8$.

Sign in / Sign up

Export Citation Format

Share Document