Hadamard Matrix — Definition, Formula & Examples
A Hadamard matrix is a square matrix whose every entry is either or and whose rows are all mutually orthogonal. When you multiply it by its own transpose, you get times the identity matrix, where is the matrix size.
An matrix with entries is a Hadamard matrix if it satisfies , where is the identity matrix and denotes the transpose of .
Key Formula
Where:
- = An n × n matrix with all entries +1 or −1
- = The transpose of H
- = The order (size) of the matrix
- = The n × n identity matrix
How It Works
To verify that a matrix is Hadamard, check two things: every entry must be or , and the dot product of any two distinct rows must equal zero. The dot product of any row with itself equals , so the product yields . Hadamard matrices exist only for , , or a multiple of . The famous Hadamard conjecture asserts that a Hadamard matrix exists for every positive multiple of , but this remains unproven.
Worked Example
Problem: Verify that the following 2×2 matrix is a Hadamard matrix: .
Check entries: Every entry of H is either +1 or −1, so the entry condition is satisfied.
Compute H times H transpose: Since H is symmetric here, . Compute the product:
Compare with nI: Here , and . The result matches, confirming the orthogonality condition.
Answer: H is a Hadamard matrix of order 2 because all entries are ±1 and .
Why It Matters
Hadamard matrices appear in error-correcting codes (like Reed–Muller codes), signal processing, and experimental design in statistics. In quantum computing, the Hadamard matrix (scaled by ) is one of the most fundamental quantum gates, creating superposition states from basis states.
Common Mistakes
Mistake: Assuming a Hadamard matrix can exist for any size n.
Correction: Hadamard matrices can only exist when n = 1, n = 2, or n is a multiple of 4. There is no 3×3 or 5×5 Hadamard matrix.
