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

arXiv:2103.08837 · Discrete Applied Mathematics

Continuous time quantum walks on graphs: Group state transfer

Luke C. Brown, William J. Martin, Duncan Wright

Published May 8, 2023• 8 citations
arXivHTMLPDF
DOI
10.1016/j.dam.2023.04.015

Related papers

Discrete-time quantum walks and graph structures

Chris D. Godsil, Hanmeng Zhan

arXiv:1701.04474•Journal of Combinatorial Theory Series A•May 16, 2019•29 citations

Continuous-time Quantum Walks on Cayley Graphs of Extraspecial Groups

Peter Sin, Julien Sorci

We study continuous-time quantum walks on normal Cayley graphs of certain non-abelian groups called extraspecial groups. By applying general results for graphs in association schemes we determine the precise conditions for perfect state transfer and fractional revival. Using partial spreads, we construct Cayley graphs on extraspecial 2 -groups that admit these phenomena. We also show that there is no normal Cayley graph of an extraspecial group that admits instantaneous uniform mixing.

arXiv:2011.07566•Algebraic Combinatorics•Sep 8, 2022•8 citations

Simplifying continuous-time quantum walks on dynamic graphs

Rebekah Herrman, Thomas G. Wong

arXiv:2106.06015•Quantum Information Processing•Jan 19, 2022•9 citations

Perfect state transfer in graphs related to linear groups in two dimensions

Venkata Raghu Tej Pantangi, Peter Sin

We construct families of graphs from linear groups SL ( 2 , q ) , GL ( 2 , q ) and GU ( 2 , q ) , where q is an odd prime power, with the property that the continuous-time quantum walks on the associated networks of qubits admit perfect state transfer.

arXiv:2408.14807•Algebraic Combinatorics•Mar 3, 2026•0 citations

Continuous-time quantum walks on star graphs

S. Salimi

arXiv:0904.2054•Annals of Physics•Mar 26, 2009•33 citations

Continuous-time quantum walks on dynamic graphs

Rebekah Herrman, Travis S. Humble

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 ordered sequence of graphs governs free evolution of the quantum walk. We then consider how perfect state transfer during the quantum walk can be used to design dynamic graphs that implement a universal set of quantum logic gates. We give explicit examples for a complete logical basis, and we validate implementations using numerical simulations for quantum teleportation and addition circuits. Finally, we discuss the potential for realizing CTQWs on dynamic graphs using actively controlled quantum optical waveguides.

arXiv:1902.01346•Physical Review A•Jul 8, 2019•20 citations
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 ordered sequence of graphs governs free evolution of the quantum walk. We then consider how perfect state transfer during the quantum walk can be used to design dynamic graphs that implement a universal set of quantum logic gates. We give explicit examples for a complete logical basis, and we validate implementations using numerical simulations for quantum teleportation and addition circuits. Finally, we discuss the potential for realizing CTQWs on dynamic graphs using actively controlled quantum optical waveguides.