Complex Hadamard Matrices, Instantaneous Uniform Mixing and Cubes

preprint2013arXivOpen access

Abstract

We study the continuous-time quantum walks on graphs in the adjacency algebra of the nn-cube and its related distance regular graphs. For k≥2k\geq 2, we find graphs in the adjacency algebra of (2k+2−8)(2^{k+2}-8)-cube that admit instantaneous uniform mixing at time π/2kπ/2^k and graphs that have perfect state transfer at time π/2kπ/2^k. We characterize the folded nn-cubes, the halved nn-cubes and the folded halved nn-cubes whose adjacency algebra contains a complex Hadamard matrix. We obtain the same conditions for the characterization of these graphs admitting instantaneous uniform mixing.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.