English

Complex Hadamard Matrices, Instantaneous Uniform Mixing and Cubes

Combinatorics 2013-05-27 v1

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 k2k\geq 2, we find graphs in the adjacency algebra of (2k+28)(2^{k+2}-8)-cube that admit instantaneous uniform mixing at time π/2k\pi/2^k and graphs that have perfect state transfer at time π/2k\pi/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.

Keywords

Cite

@article{arxiv.1305.5811,
  title  = {Complex Hadamard Matrices, Instantaneous Uniform Mixing and Cubes},
  author = {Ada Chan},
  journal= {arXiv preprint arXiv:1305.5811},
  year   = {2013}
}

Comments

24 pages

R2 v1 2026-06-22T00:22:13.641Z