A complex matrix is unitary when . Its columns form an orthonormal basis, and it preserves inner products and norms.
Suppose a unitary matrix is symmetric under ordinary transpose, and write its entrywise real and imaginary parts as and . They are real symmetric matrices. Expanding gives , proving the displayed identities. Commuting real symmetric matrices admit simultaneous diagonalization: diagonalize , then diagonalize the restriction of to each invariant eigenspace of . A common real orthonormal eigenbasis givesIf has simple eigenvalues, every eigenvector of is already an eigenvector of , because its one-dimensional eigenspace is invariant. The eigenvalues of and are paired as the real and imaginary parts of the same eigenvalue of .
The displayed parts of a unitary matrix are skew-Hermitian matrices. Expanding gives and . They admit a common orthonormal eigenbasis. For a unitary eigenvalue , the corresponding part eigenvalues are and . If , then , so these are exactly its real and imaginary parts and both are real skew-symmetric matrices. Such an invertible antisymmetric matrix has even dimension, by its determinant. If one part has distinct eigenvalues, commutation alone shows its one-dimensional eigenspaces are preserved by the other part.
Every unitary matrix has a unique decomposition into Hermitian matrices. The formulas follow by adding and subtracting and its conjugate transpose. Expanding gives and . Therefore the parts commute and .
Articles by others on the same topic
A **unitary matrix** is a complex square matrix \( U \) that satisfies the condition: \[ U^\dagger U = U U^\dagger = I \] where \( U^\dagger \) is the conjugate transpose (also known as the Hermitian transpose) of \( U \), and \( I \) is the identity matrix of the same dimension as \( U \).
Complex analogue of orthogonal matrix.
Applications:
- in quantum computers programming basically comes down to creating one big unitary matrix as explained at: quantum computing is just matrix multiplication