• Corpus ID: 248299692

On state transfer in Cayley graphs for abelian groups

@inproceedings{Arnadottir2022OnST,
  title={On state transfer in Cayley graphs for abelian groups},
  author={Arnbjorg Soff'ia 'Arnad'ottir and Chris D. Godsil},
  year={2022}
}
. In this paper, we characterize perfect state transfer in Cayley graphs for abelian groups that have a cyclic Sylow-2-subgroup. This generalizes a result of Baˇsi´c from 2013 where he provides a similar characterization for Cayley graphs of cyclic groups. 

Figures from this paper

References

SHOWING 1-10 OF 21 REFERENCES
Rational G-Matrices with Rational Eigenvalues
Quantum Networks on Cubelike Graphs
Cubelike graphs are the Cayley graphs of the elementary Abelian group ${\mathbb{Z}}_{2}^{n}$ (e.g., the hypercube is a cubelike graph). We study perfect state transfer between two particles in
State transfer on graphs
Quantum State Transfer in Graphs
Let X be a graph, A its adjacency matrix, and t ∈ R≥0. The matrix exp(itA) determines the evolution in time of a certain quantum system defined on the graph. It represents a continuous-time quantum
Perfect state transfer in products and covers of graphs
A continuous-time quantum walk on a graph is represented by the complex matrix , where is the adjacency matrix of and is a non-negative time. If the graph models a network of interacting qubits,
Complex Hadamard matrices, instantaneous uniform mixing and cubes
We study the continuous-time quantum walks on graphs in the adjacency algebra of the $n$-cube and its related distance regular graphs. For $k\geq 2$, we find graphs in the adjacency algebra of
Erdős-Ko-Rado Theorems: Algebraic Approaches
Preface 1. The Erdos-Ko-Rado Theorem 2. Bounds on cocliques 3. Association schemes 4. Distance-regular graphs 5. Strongly regular graphs 6. The Johnson scheme 7. Polytopes 8. The exact bound 9. The
Characterization of quantum circulant networks having perfect state transfer
TLDR
This paper answers the question of when circulant quantum spin networks with nearest-neighbor couplings can give perfect state transfer and calculates perfect quantum communication distance (distance between vertices where PST occurs) and describes the spectra of integralcirculant graphs having PST.
...
...