arXiv:1508.07674 · Physical Review A

Generic quantum walks with memory on regular graphs

Dan Li, Michael Mc Gettrick, Fei Gao, Jie Xu, Qiaoyan Wen

Published Apr 15, 2016• 17 citations

Abstract

Quantum walks with memory (QWM) are a type of modified quantum walks that record the walker's latest path. As we know, only two kinds of QWM have been presented up to now. It is desired to design more QWM for research, so that we can explore the potential of QWM. In this work, by presenting the one-to-one correspondence between QWM on a regular graph and quantum walks without memory (QWoM) on a line digraph of the regular graph, we construct a generic model of QWM on regular graphs. This construction gives a general scheme for building all possible standard QWM on regular graphs and makes it possible to study properties of different kinds of QWM. Here, by taking the simplest example, which is QWM with one memory on the line, we analyze some properties of QWM, such as variance, occupancy rate, and localization.

DOI: 10.1103/physreva.93.042323

Related papers

The underlying digraph of a coined quantum random walk

Simone Severini B

We give a characterization of the line digraph of a regular digraph. We make use of the characterization, to show that the underlying digraph of a coined quantum random walk is a line digraph. We remark the connection between line digraphs and in-split graphs in symbolic dynamics.

arXiv:quant-ph/0210055Oct 8, 20023 citations

Publisher's Note: Generic quantum walks with memory on regular graphs [Phys. Rev. A93, 042323 (2016)]

Dan Li, Michael Mc Gettrick, Fei Gao +2 more

Received 19 April 2016DOI:https://doi.org/10.1103/PhysRevA.93.049905©2016 American Physical SocietyPhysics Subject Headings (PhySH)Research AreasQuantum computationQuantum simulationQuantum Information

Physical Review AApr 27, 20165 citations

Line digraphs and coined quantum random walks

Simone Severini B

Abstract. In this note, we give a characterization of the adjacency matrix of the line digraph of a regular digraph and we discuss a generalization.On the light of the characterization given, we remark that the underlying digraph of a coined quantum random walk is the line digraph of a regular digraph. 1. A characterization of the adjacency matrix of the line digraph of a regular digraph 1.1. Set-up. The notion of line digraph has been introduced by Harary and Norman [HN60] in 1960. A classic survey on line graphs and digraphs is [HB78]; a recent one is [P95]. Line digraphs are used in the design and analysis of interconnection networks (see e.g. [FYA84]). Line digraphs are also used in algorithms for DIRECTED MAX-CUT [CE90] and TRAVELLING SALESMAN [GKWS98]. Definition 1 (Line digraph). The line digraph − → LD of a digraph ( D = (V, A) is the

Oct 8, 20023 citations

Quantum walks on regular uniform hypergraphs

Ying Liu, Jiabin Yuan, Bojia Duan +1 more

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 stored inherently. Therefore, we can explore the potential of quantum walks on hypergraphs. In this paper, by presenting the one-to-one correspondence between regular uniform hypergraphs and bipartite graphs, we construct a model for quantum walks on bipartite graphs of regular uniform hypergraphs with Szegedy's quantum walks, which gives rise to a quadratic speed-up. Furthermore, we deliver spectral properties of the transition matrix, given that the cardinalities of the two disjoint sets are different in the bipartite graph. Our model provides the foundation for building quantum algorithms on the strength of quantum walks on hypergraphs, such as quantum walks search, quantized Google's PageRank, and quantum machine learning.

arXiv:1709.05015Scientific ReportsJun 18, 201818 citations

Quantum walks with tuneable self-avoidance in one dimension

Elizabeth Camilleri, Peter P. Rohde, Jason Twamley

Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Here the walker has memory of its previous locations and preferentially avoids stepping back to locations where it has previously resided. Classical self-avoiding random walks have found numerous algorithmic applications, most notably in the modelling of protein folding. We consider the analogous problem in the quantum setting - a quantum walk in one dimension with tunable levels of self-avoidance. We complement a quantum walk with a memory register that records where the walker has previously resided. The walker is then able to avoid returning back to previously visited sites or apply more general memory conditioned operations to control the walk. We characterise this walk by examining the variance of the walker's distribution against time, the standard metric for quantifying how quantum or classical a walk is. We parameterise the strength of the memory recording and the strength of the memory back-action on the walker, and investigate their effect on the dynamics of the walk. We find that by manipulating these parameters, which dictate the degree of self-avoidance, the walk can be made to reproduce ideal quantum or classical random walk statistics, or a plethora of more elaborate diffusive phenomena. In some parameter regimes we observe a close correspondence between classical self-avoiding random walks and the quantum self-avoiding walk.

Scientific ReportsApr 25, 201411 citations

Time-continuous open quantum walks (Conference Presentation)

Radhakrishnan Balu, Chaobin Liu

Continuous-time open quantum walks (CTOQW) are introduced as the formulation of quantum dynamical semigroups of trace-preserving and completely positive linear maps (or quantum Markov semigroups) on graphs. We show that a CTOQW always converges to a steady state regardless of the initial state when a graph is connected. When the graph is both connected and regular, it is shown that the steady state is the maximally mixed state. The difference of long-time behaviors between CTOQW and other two continuous-time processes on graphs is exemplified. The examples demonstrate that the structure of a graph can affect a quantum coherence effect on CTOQW through a long time run. Precisely, a quantum coherence effect persists throughout the evolution of the CTOQW when the underlying topology is certain irregular graphs (such as a path or a star as shown in the examples). In contrast, a quantum coherence effect will eventually vanish from the open quantum system when the underlying topology is a regular graph (such as a cycle).

Jun 7, 20170 citations