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

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.


Author(s):  
Chul Ki Ko ◽  
Etsuo Segawa ◽  
Hyun Jae Yoo

We investigate one-dimensional three-state quantum walks. We find a formula for the moments of the weak limit distribution via a vacuum expectation of powers of a self-adjoint operator. We use this formula to fully characterize the localization of three-state quantum walks in one dimension. The localization is also characterized by investing the eigenvectors of the evolution operator for the quantum walk. As a byproduct we clarify the concepts of localization differently used in the literature. We also study the continuous part of the limit distribution. For typical examples we show that the continuous part is the same kind as that of two-state quantum walks. We provide with explicit expressions for the density of the weak limits of some three-state quantum walks.



2019 ◽  
Vol 19 (13&14) ◽  
pp. 1081-1088
Author(s):  
Takeshi Kajiwara ◽  
Norio Konno ◽  
Shohei Koyama ◽  
Kei Saito

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).



2019 ◽  
Vol 19 (1&2) ◽  
pp. 23-34
Author(s):  
Kei Saito

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.



Author(s):  
Yan Wang

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.



2006 ◽  
Vol 11 (3) ◽  
pp. 275-300 ◽  
Author(s):  
ROBERT D. CAIRNS ◽  
NGO VAN LONG

We solve directly a general maximin (sustainment, intergenerational-equity) problem. Because the shadow values of a maximin problem do not correspond to the shadow values from a general discounted-utility solution, they correspond to the prices of only a very special competitive economy. Virtual discount factors for the economy arise. They do not correspond to hyperbolic discount factors. Hartwick's rule is derived and generalized naturally to take into account non-autonomous and non-deterministic features of the economy. Under uncertainty, Hartwick's rule is the analytic expression of a form of precautionary principle. Hotelling's rule is a necessary condition, but may be more complex than has been appreciated in simple models. Some interpretations of strong sustainment are special cases of weak sustainment but, paradoxically, may be more difficult to solve.



2021 ◽  
pp. 2250001
Author(s):  
Ce Wang

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.



Entropy ◽  
2018 ◽  
Vol 20 (8) ◽  
pp. 586 ◽  
Author(s):  
Xin Wang ◽  
Yi Zhang ◽  
Kai Lu ◽  
Xiaoping Wang ◽  
Kai Liu

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.



2010 ◽  
Vol 20 (6) ◽  
pp. 1091-1098 ◽  
Author(s):  
NORIO KONNO

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.



2013 ◽  
Vol 13 (5&6) ◽  
pp. 430-438
Author(s):  
Takuya Machida

Since a limit distribution of a discrete-time quantum walk on the line was derived in 2002, a lot of limit theorems for quantum walks with a localized initial state have been reported. On the other hand, in quantum probability theory, there are four notions of independence (free, monotone, commuting, and boolean independence) and quantum central limit theorems associated to each independence have been investigated. The relation between quantum walks and quantum probability theory is still unknown. As random walks are fundamental models in the Kolmogorov probability theory, can the quantum walks play an important role in quantum probability theory? To discuss this problem, we focus on a discrete-time 2-state quantum walk with a non-localized initial state and present a limit theorem. By using our limit theorem, we generate probability laws in the quantum central limit theorems from the quantum walk.



2021 ◽  
pp. 35-48
Author(s):  
Julia Zamjatina ◽  
Alexey Kashin ◽  
Olesja Kondrat’eva ◽  
Il’shat Muhametshin

The article presents the concept of reconstruction of the Fertiki unit of the biogeoecological station of the Udmurt State University (hereinafter – the Fertiki campus), formed in the process of joint work of geographers and designers. The presence of a field campus is a necessary condition for the professional skills and abilities formation of students in a number of training areas in a classical university. However, the requirements for the campuses internal space formation are changing. If one and a half to two decades ago it was enough to have a minimally equipped site on the territory that meets the basic needs in terms of the field practices and scientific research content, now the need to expand the functionality and types of activities is becoming more and more obvious. At the same time, it is proposed to put natural, cultural and historical features of the area within which the campus is located as the basis for modern design solutions. In conditions of limited funding and a general unstable financial situation, there is a need for more efficient use of the property complex of the university, including field campuses. They should not only satisfy the needs of conducting educational practices and scientific research, but become complex out-of-town (field) divisions of universities aimed at various types of activities. The proposed concept provides the reconstruction of the biogeoecological station in the direction of forming a focus point of natural and cultural landscapes of a vast territory. On the one hand, the campus must organically fit into the surrounding space, and on the other hand, it must reflect its main natural, cultural and historical features in order to get rich content. Only complexity and polyfunctionality can be stimuli and conditions for its development.



Sign in / Sign up

Export Citation Format

Share Document