2000 character limit reached
Complex Hadamard matrices with noncommutative entries
Published 29 May 2017 in math.QA and math.CO | (1705.10264v2)
Abstract: We axiomatize and study the matrices of type , having unitary entries, , and whose rows and columns are subject to orthogonality type conditions. Here can be any -algebra, for instance , where we obtain the usual complex Hadamard matrices, or , where we obtain the continuous families of complex Hadamard matrices. Our formalism allows the construction of a quantum permutation group , whose structure and computation is discussed here.
Paper Prompts
Sign up for free to create and run prompts on this paper.