Discrete Quantum Walks on the Symmetric Group
Avah Banerjee

TL;DR
This paper explores discrete quantum walks on symmetric groups using non-commutative Fourier analysis, providing insights into their spectral properties and limiting behavior, which are relevant for quantum algorithm development.
Contribution
It introduces a path integral approach to analyze discrete quantum walks on Cayley graphs of the symmetric group, addressing non-commutativity challenges.
Findings
Characterization of quantum walks on symmetric groups
Analytical description of spectral properties
Insights into limiting behavior of quantum walks
Abstract
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 successfully applied in the development of quantum algorithms. In particular, to solve problems that can be mapped to searching or property testing on some specific graph. In this paper we investigate the discrete time coined quantum walk (DTCQW) model using tools from non-commutative Fourier analysis. Specifically, we are interested in characterizing the DTCQW on Cayley graphs generated by the symmetric group () with appropriate generating sets. The lack of commutativity makes it challenging to find an analytical description of the limiting behavior with respect to the spectrum of the walk-operator. We determine certain characteristics of these walks…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
