Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Random Walks

Swarnadeep Majumder, Austen Couvertier

Published Apr 27, 2018• 1 citation
OpenAlex

Abstract

The focus of this project is continuous time quantum walks (QW) on finite graphs. QW are important because they offer one route to universal quantum computation. We studied Perfect State Transfer in a variety of regular graphs, some of which have not been studied earlier. Our work has led to a method of achieving PST between any two nodes of d-dimensional hypercube graph.

Related papers

Quantum Walks on Graphs: Group State Transfer

Luke C. Brown

Graphs that exhibit perfect state transfer (PST), by which a quantum walk beginning at one vertex is guaranteed to end at another after a nonzero displacement in time, are of great interest to researchers in the field of quantum computing. The conditions imposed by PST are strong, and many of the graphs that are known to exhibit PST are highly symmetric, which provides motivation to relax the restrictions imposed by perfect state transfer. This project introduces the property of group state transfer (GST), by which quantum walks are guaranteed to transfer states between nontrivial vertex sets. We define GST, examine its implications for finite simple graphs, and provide examples of graphs that exhibit GST.

•Apr 24, 2019•0 citations

Perfect State Transfer in Quantum Walks on Graphs

Viv M. Kendon, Christino Tamon

We provide a brief survey of perfect state transfer in quantum walks on finite graphs. The ability to transfer a quantum state from one part of a quantum computer to another is a key ingredient of scalable architectures. Transfer through structures that do not require locally varying dynamic control simplifies the design and hence reduces the opportunities for errors to arise. Continuous time walks quantum walks on highly structured graphs exhibit perfect state transfer for the complete graph of size 2, the path of length 3, and the cycle of size 4. From these, larger graphs can be constructed, and the use of edge weights widens this set considerably. Discrete-time quantum walks have more flexibility through exploiting the coin degrees of freedom, but with the disadvantage that local control of the coin is required if the degree of the vertices varies. The closely related property of periodicity (exact return to the starting state) is also mentioned.

Journal of Computational and Theoretical Nanoscience•Mar 1, 2011•104 citations

Universal quantum computation using the discrete-time quantum walk

Neil B. Lovett, Sally Cooper, Matthew Everitt +2 more

A proof that continuous-time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by A. M. Childs [Phys. Rev. Lett. 102, 180501 (2009)]. We present a version based instead on the discrete-time quantum walk. We show that the discrete-time quantum walk is able to implement the same universal gate set and thus both discrete and continuous-time quantum walks are computational primitives. Additionally, we give a set of components on which the discrete-time quantum walk provides perfect state transfer.

arXiv:0910.1024•Physical Review A•Apr 30, 2010•525 citations

Quantum Walks

M. Štefaňák

Over the last two decades quantum walks have proven to be a very useful concept in quantum information processing, quantum communication and quantum simulations. The presented thesis reviews our contribution to this field of research. We provide a thorough introduction to methods used for the study of quantum walks and their potential applications. To keep the presentation intelligible we focus on specific examples. In particular, we analyze in detail the properties of homogeneous quantum walks on a one-dimensional lattice with two and three internal states. The application of the obtained results is illustrated on the examples persistence of unvisited sites and quantum transport to an absorbing sink. We also discuss quantum walks on finite graphs and their applications to quantum search and perfect state transfer. Extension of the presented results, which can be found in enclosed published papers, is discussed in detail.

•Jan 1, 2017•0 citations

Perfect quantum state transfer of hard-core bosons on weighted path graphs

Steven J. Large, Michael S. Underwood, David L. Feder

The ability to accurately transfer quantum information through networks is an important primitive in distributed quantum systems. While perfect quantum state transfer (PST) can be effected by a single particle undergoing continuous-time quantum walks on a variety of graphs, it is not known if PST persists for many particles in the presence of interactions. We show that if single-particle PST occurs on one-dimensional weighted path graphs, then systems of hard-core bosons undergoing quantum walks on these paths also undergo PST. The analysis extends the Tonks-Girardeau ansatz to weighted graphs using techniques in algebraic graph theory. The results suggest that hard-core bosons do not generically undergo PST, even on graphs which exhibit single-particle PST.

arXiv:1412.1022•Physical Review A•Mar 24, 2015•4 citations

Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory

S. Salimi

arXiv:0908.4546•Quantum Information Processing•Sep 3, 2009•26 citations
The focus of this project is continuous time quantum walks (QW) on finite graphs. QW are important because they offer one route to universal quantum computation. We studied Perfect State Transfer in a variety of regular graphs, some of which have not been studied earlier. Our work has led to a method of achieving PST between any two nodes of d-dimensional hypercube graph.
Graphs that exhibit perfect state transfer (PST), by which a quantum walk beginning at one vertex is guaranteed to end at another after a nonzero displacement in time, are of great interest to researchers in the field of quantum computing. The conditions imposed by PST are strong, and many of the graphs that are known to exhibit PST are highly symmetric, which provides motivation to relax the restrictions imposed by perfect state transfer. This project introduces the property of group state transfer (GST), by which quantum walks are guaranteed to transfer states between nontrivial vertex sets. We define GST, examine its implications for finite simple graphs, and provide examples of graphs that exhibit GST.
We provide a brief survey of perfect state transfer in quantum walks on finite graphs. The ability to transfer a quantum state from one part of a quantum computer to another is a key ingredient of scalable architectures. Transfer through structures that do not require locally varying dynamic control simplifies the design and hence reduces the opportunities for errors to arise. Continuous time walks quantum walks on highly structured graphs exhibit perfect state transfer for the complete graph of size 2, the path of length 3, and the cycle of size 4. From these, larger graphs can be constructed, and the use of edge weights widens this set considerably. Discrete-time quantum walks have more flexibility through exploiting the coin degrees of freedom, but with the disadvantage that local control of the coin is required if the degree of the vertices varies. The closely related property of periodicity (exact return to the starting state) is also mentioned.
A proof that continuous-time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by A. M. Childs [Phys. Rev. Lett. 102, 180501 (2009)]. We present a version based instead on the discrete-time quantum walk. We show that the discrete-time quantum walk is able to implement the same universal gate set and thus both discrete and continuous-time quantum walks are computational primitives. Additionally, we give a set of components on which the discrete-time quantum walk provides perfect state transfer.
Over the last two decades quantum walks have proven to be a very useful concept in quantum information processing, quantum communication and quantum simulations. The presented thesis reviews our contribution to this field of research. We provide a thorough introduction to methods used for the study of quantum walks and their potential applications. To keep the presentation intelligible we focus on specific examples. In particular, we analyze in detail the properties of homogeneous quantum walks on a one-dimensional lattice with two and three internal states. The application of the obtained results is illustrated on the examples persistence of unvisited sites and quantum transport to an absorbing sink. We also discuss quantum walks on finite graphs and their applications to quantum search and perfect state transfer. Extension of the presented results, which can be found in enclosed published papers, is discussed in detail.
The ability to accurately transfer quantum information through networks is an important primitive in distributed quantum systems. While perfect quantum state transfer (PST) can be effected by a single particle undergoing continuous-time quantum walks on a variety of graphs, it is not known if PST persists for many particles in the presence of interactions. We show that if single-particle PST occurs on one-dimensional weighted path graphs, then systems of hard-core bosons undergoing quantum walks on these paths also undergo PST. The analysis extends the Tonks-Girardeau ansatz to weighted graphs using techniques in algebraic graph theory. The results suggest that hard-core bosons do not generically undergo PST, even on graphs which exhibit single-particle PST.