Complex Hadamard matrix

A complex Hadamard matrix is any complex N×N matrix H satisfying two conditions:

where † denotes the Hermitian transpose of H and I is the identity matrix. The concept is a generalization of Hadamard matrices. Note that any complex Hadamard matrix H can be made into a unitary matrix by multiplying it by 1N; conversely, any unitary matrix whose entries all have modulus 1N becomes a complex Hadamard upon multiplication by N.

Complex Hadamard matrices arise in the study of operator algebras and the theory of quantum computation. Real Hadamard matrices and Butson-type Hadamard matrices form particular cases of complex Hadamard matrices.

Complex Hadamard matrices exist for any natural number N (compare with the real case, in which Hadamard matrices do not exist for every N and existence is not known for every permissible N). For instance the Fourier matrices (the complex conjugate of the DFT matrices without the normalizing factor),

[FN]jk:=exp⁡[2πi(j−1)(k−1)/N]forj,k=1,2,…,N

belong to this class.

Equivalency

Two complex Hadamard matrices are called equivalent, written H1≃H2, if there exist diagonal unitary matrices D1,D2 and permutation matrices P1,P2 such that

H1=D1P1H2P2D2.

Any complex Hadamard matrix is equivalent to a dephased Hadamard matrix, in which all elements in the first row and first column are equal to unity.

For N=2,3 and 5 all complex Hadamard matrices are equivalent to the Fourier matrix FN. For N=4 there exists a continuous, one-parameter family of inequivalent complex Hadamard matrices,

F4(1)(a):=[11111ieia−1−ieia1−11−11−ieia−1ieia]witha∈[0,π).

For N=6 the following families of complex Hadamard matrices are known:

It is not known, however, if this list is complete, but it is conjectured that K6(x,y,z),G6,S6 is an exhaustive (but not necessarily irredundant) list of all complex Hadamard matrices of order 6.