Papers
Topics
Authors
Recent
Search
2000 character limit reached

Complex Hadamard Matrices, Instantaneous Uniform Mixing and Cubes

Published 24 May 2013 in math.CO | (1305.5811v1)

Abstract: 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 $(2{k+2}-8)$-cube that admit instantaneous uniform mixing at time $\pi/2k$ and graphs that have perfect state transfer at time $\pi/2k$. We characterize the folded $n$-cubes, the halved $n$-cubes and the folded halved $n$-cubes whose adjacency algebra contains a complex Hadamard matrix. We obtain the same conditions for the characterization of these graphs admitting instantaneous uniform mixing.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.