Jump to content

Complex Hadamard matrix

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Robinh (talk | contribs) at 09:16, 15 January 2009. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A complex Hadamard matrix is any complex matrix satisfying two conditions:

  • unimodularity:
  • orthogonality: ,

where denotes the Hermitian transpose of H and is the identity matrix. 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 exists for any natural N. For instance the Fourier matrices

belong to this class.

Equivalency

Two complex Hadamard matrices are called equivalent, written , if there exist diagonal unitary matrices and permutation matrices such that

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 and all complex Hadamard matrices are equivalent to the Fourier matrix . For there exists a continuous, one-parameter family of inequivalent complex Hadamard matrices,

For the following non-equivalent complex Hadamard matrices are known:

  • a single two-parameter family which includes ,
  • a single one-parameter family
  • a one-parameter orbit including the circulant Hadamard matrix ,
  • a single point - one of the Butson-type Hadamard matrices, .

It is not known, however, if this list is complete.

References

  • U. Haagerup, Orthogonal maximal abelian *-subalgebras of the n×n matrices and cyclic n-roots, Operator Algebras and Quantum Field Theory (Rome), 1996 (Cambridge, MA: International Press) pp 296-322.
  • P. Dita, Some results on the parametrization of complex Hadamard matrices, J. Phys. A: Math. Gen. 37, 5355-5374 (2004).
  • W. Tadej and K. Zyczkowski, A concise guide to complex Hadamard matrices Open Systems & Infor. Dyn. 13 133-177 (2006)