Discrete-time quantum walks on Cayley graphs of Dihedral groups using generalized Grover coins
September 26, 2023 Β· Declared Dead Β· π Quantum Information Processing
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Rohit Sarma Sarkar, Bibhas Adhikari
arXiv ID
2309.15194
Category
quant-ph: Quantum Computing
Cross-listed
cs.IT
Citations
4
Venue
Quantum Information Processing
Last Checked
5 months ago
Abstract
In this paper we study discrete-time quantum walks on Cayley graphs corresponding to Dihedral groups, which are graphs with both directed and undirected edges. We consider the walks with coins that are one-parameter continuous deformation of the Grover matrix and can be written as linear combinations of certain permutation matrices. We show that the walks are periodic only for coins that are permutation or negative of a permutation matrix. Finally, we investigate the localization property of the walks through numerical simulations and observe that the walks localize for a wide range of coins for different sizes of the graphs.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Quantum Computing
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Quantum machine learning: a classical perspective
R.I.P.
π»
Ghosted
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
R.I.P.
π»
Ghosted
ProjectQ: An Open Source Software Framework for Quantum Computing
R.I.P.
π»
Ghosted
Quantum Recommendation Systems
R.I.P.
π»
Ghosted
Traffic flow optimization using a quantum annealer
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted