English

Mutually Unbiased Bush-type Hadamard Matrices and Association Schemes

Combinatorics 2014-12-18 v1

Abstract

It was shown by LeCompte, Martin, and Oweans in 2010 that the existence of mutually unbiased Hadamard matrices and the identity matrix, which coincide with mutually unbiased bases, is equivalent to that of a QQ-polynomial association scheme of class four which is both QQ-antipodal and QQ-bipartite. We prove that the existence of a set of mutually unbiased Bush-type Hadamard matrices is equivalent to that of an association scheme of class five. As an application of this equivalence, we obtain the upper bound of the number of mutually unbiased Bush-type Hadamard matrices of order 4n24n^2 to be 2n12n-1. This is in contrast to the fact that the upper bound of mutually unbiased Hadamard matrices of order 4n24n^2 is 2n22n^2. We also discuss a relation of our scheme to some fusion schemes which are QQ-antipodal and QQ-bipartite QQ-polynomial of class 44.

Keywords

Cite

@article{arxiv.1412.5297,
  title  = {Mutually Unbiased Bush-type Hadamard Matrices and Association Schemes},
  author = {Hadi Kharaghani and Sara Sasani and Sho Suda},
  journal= {arXiv preprint arXiv:1412.5297},
  year   = {2014}
}

Comments

12pages