Related papers: On the relation between quantum walks and absolute…
Quantum walks are promising tools based on classical random walks, with plenty of applications such as many variants of optimization. Here we introduce the semiclassical walks in discrete time, which are algorithms that combines classical…
In our previous work, we investigated the relation between zeta functions and discrete-time models including random and quantum walks. In this paper, we introduce a zeta function for the continuous-time model (CTM) and consider CTMs…
The Mahler measure was introduced by Mahler in the study of number theory. It is known that the Mahler measure appears in different areas of mathematics and physics. On the other hand, we have been investigated a new class of zeta functions…
Quantum and random walks have been shown to be equivalent in the following sense: a time-dependent random walk can be constructed such that its vertex distribution at all time instants is identical to the vertex distribution of any…
We consider the connection between this zeta function and quantum search via quantum walk. First, we give an explicit expression of the zeta function on the one-dimensional torus in the general case of the number and position of marked…
Quantum walks on graphs have shown prioritized benefits and applications in wide areas. In some scenarios, however, it may be more natural and accurate to mandate high-order relationships for hypergraphs, due to the density of information…
We define a new weighted zeta function for a finite graph and obtain its determinant expression. This result gives the characteristic polynomial of the transition matrix of the Szegedy walk on a graph.
We set the ground for a theory of quantum walks on graphs- the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible.…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain…
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit…
We analyze the equivalence between discrete-time coined quantum walks and Szegedy's quantum walks. We characterize a class of flip-flop coined models with generalized Grover coin on a graph $\Gamma$ that can be directly converted into…
Based on studies on four specific networks, we conjecture a general relation between the walk dimensions $d_{w}$ of discrete-time random walks and quantum walks with the (self-inverse) Grover coin. In each case, we find that $d_{w}$ of the…
We introduce the quantum stochastic walk (QSW), which determines the evolution of generalized quantum mechanical walk on a graph that obeys a quantum stochastic equation of motion. Using an axiomatic approach, we specify the rules for all…
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum…
We consider the time-independent scattering theory for time evolution operators of one-dimensional two-state quantum walks. The scattering matrix associated with the position-dependent quantum walk naturally appears in the asymptotic…
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…
Chinta, Jorgenson and Karlsson introduced a generalized version of the determinant formula for the Ihara zeta function associated to finite or infinite regular graphs. On the other hand, Konno and Sato obtained a formula of the…
We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…
We define a quaternionic extension of the Szegedy walk on a graph and study its right spectral properties. The condition for the transition matrix of the quaternionic Szegedy walk on a graph to be quaternionic unitary is given. In order to…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…