Related papers: Matrix valued Szego polynomials and quantum random…
We review various features of the statistics of random paths on graphs. The relationship between path statistics and Quantum Mechanics (QM) leads to two canonical ways of defining random walk on a graph, which have different statistics and…
The theory of random walks on finite graphs is well developed with numerous applications. In quantum walks, the propagation is governed by quantum mechanical rules; generalizing random walks to the quantum setting. They have been…
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…
We study Open Quantum Random Walks for which the underlying graph is a lattice, and the generators of the walk are translation-invariant. We consider the quantum trajectory associated with the OQRW, which is described by a position process…
Non Commutative Geometry (NCG) is considered in the context of a charged particle moving in a uniform magnetic field. The classical and quantum mechanical treatments are revisited and a new marker of NCG is introduced. This marker is then…
Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…
Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an…
In this paper, we consider a spectral analysis of the Correlated Random Walk (CRW) on the path. We apply an analytical method for the Quantum Walk to CRW. For the isospectral coin cases, we obtain all of the eigenvalues and the…
Quantum random walks have been shown to be powerful quantum algorithms for certain tasks on graphs like database searching, quantum simulations etc. In this work we focus on its applications for the graph isomorphism problem. In particular…
Continuous-time quantum walks (CTQWs) provide a valuable model for quantum transport, universal quantum computation and quantum spatial search, among others. Recently, the empowering role of new degrees of freedom in the Hamiltonian…
We investigate quantum walks which play an important role in the modelling of many phenomena. The detailed and thorough description is given to the discrete quantum walks on a line, where the total quantum state consists of quantum states…
Quantum walks are widely and successfully used to model diverse physical processes. This leads to computation of the models, to explore their properties. Quantum walks have also been shown to be universal for quantum computing. This is a…
We present an experimental implementation of the coined discrete time quantum walk on a square using a three qubit liquid state nuclear magnetic resonance (NMR) quantum information processor (QIP). Contrary to its classical counterpart, we…
The discrete-time quantum walk (QW) is determined by a unitary matrix whose component is complex number. Konno (2015) extended the QW to a walk whose component is quaternion.We call this model quaternionic quantum walk (QQW). The…
Quantum walks contribute significantly to developing quantum algorithms and quantum simulations. Here, we introduce a first of its kind one-dimensional quantum walk in the $d$-dimensional quantum domain, where $d>2$, and show its…
Various quantum-walk based algorithms have been proposed to analyse and rank the centrality of graph vertices. However, issues arise when working with directed graphs --- the resulting non-Hermitian Hamiltonian leads to non-unitary…
Classical random walk formalism shows a significant role across a wide range of applications. As its quantum counterpart, the quantum walk is proposed as an important theoretical model for quantum computing. By exploiting the quantum…
Quantum Rings have been simulated so far in many ways, but in this work a new aproximation is deemed. We use particles without angular momentum and several spectra, for different geometric settings, are gotten. These spectra depends on K,…
The coherent superposition of position states in a quantum walk (QW) can be precisely engineered towards the desired distributions to meet the need of quantum information applications. The coherent distribution can make full use of quantum…
We study time-inhomogeneous random walks on finite groups in the case where each random walk step need not be supported on a generating set of the group. When the supports of the random walk steps satisfy a natural condition involving…