Complex Hadamard matrix¶

A square complex matrix whose entries all have unit modulus and whose rows are mutually orthogonal.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3802
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Matrix Theory → Mathematics

Core Idea¶

Multiplication by reciprocal square-root order gives a unitary matrix, equivalence normally permits row and column permutations and phase multiplications and classifications can contain continuous families. Unit-modulus row vectors are arranged so all distinct inner products vanish, yielding H times its conjugate transpose equal to order times identity and a flat unitary after normalization. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

The Cancel-Out Arrow Grid

Picture a square grid where every box holds a little arrow, all exactly the same length but pointing in different directions. If you take any two different rows and combine their arrows in a special matching way, everything cancels out to nothing. A grid like that is a complex Hadamard matrix.

Same-Size Entries, Perpendicular Rows

A matrix is a square grid of numbers. In a complex Hadamard matrix, every entry is a complex number of size exactly 1, so each one is like an arrow of the same length pointing some direction on a circle. The rows are arranged so that any two different rows are perfectly 'unrelated': when you match them up in the right way and add, you get zero. The ordinary Hadamard matrices made of only +1 and -1 are a special case, and so is the matrix behind the Fourier transform. Shrinking every entry by the right amount turns it into a special kind of matrix called unitary.

Unit-Modulus Orthogonal Matrix

A complex Hadamard matrix of order N is an N by N matrix whose entries all have absolute value 1 and whose rows are mutually orthogonal. Written as an equation, H times its conjugate transpose equals N times the identity matrix. Dividing by the square root of N gives a unitary matrix whose entries all have the same size, sometimes called a flat unitary. Real Hadamard matrices with entries ±1 and Fourier matrices are standard examples. Two such matrices count as equivalent if one can be obtained from the other by permuting rows and columns and multiplying rows and columns by unit-modulus phases. Unlike the real case, classifications can include continuous families of inequivalent matrices.

A complex Hadamard matrix of order N is an N × N complex matrix H with unit-modulus entries satisfying H H† = N I, where H† is the Hermitian (conjugate) transpose; equivalently, its rows are unit-modulus vectors with all distinct inner products vanishing. Scaling by 1/√N yields a unitary matrix with all entries of equal modulus, a flat unitary. The standard equivalence relation permits row and column permutations and multiplication of rows and columns by phases, and each equivalence class has a dephased representative with first row and column equal to 1. Real Hadamard matrices (entries ±1) are the real special case, and the Fourier matrices supply examples in every order. Classification differs sharply from the real case: equivalence classes can form continuous families rather than finitely many isolated points. The identity requires the order, unit-modulus condition, orthogonality equation, normalized unitary form, and the equivalence convention to be explicit.

Scope of Application¶

Complex Hadamard matrix belongs to matrix theory and is useful where the analyst can specify the typed matrix theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, then evaluate the order N and complex matrix, unit-modulus entry condition, Hermitian transpose, orthogonality equation H H dagger equals N I, normalized unitary form, equivalence operations, dephased representative and real-Hadamard and Fourier examples are explicit. The scope is broad within that domain but bounded by the need for the order N and complex matrix, unit-modulus entry condition, Hermitian transpose, orthogonality equation H H dagger equals N I, normalized unitary form, equivalence operations, dephased representative and real-Hadamard and Fourier examples are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the order N and complex matrix, unit-modulus entry condition, Hermitian transpose, orthogonality equation H H dagger equals N I, normalized unitary form, equivalence operations, dephased representative and real-Hadamard and Fourier examples are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Complex Hadamard matrix. Complex Hadamard matrix compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed matrix theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the order N and complex matrix, unit-modulus entry condition, Hermitian transpose, orthogonality equation H H dagger equals N I, normalized unitary form, equivalence operations, dephased representative and real-Hadamard and Fourier examples are explicit independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of matrix theory because they reuse the typed matrix theory carrier, including objects, relations, parameters, conventions, evidence, boundaries, and comparison targets, Unit-modulus row vectors are arranged so all distinct inner products vanish, yielding H times its conjugate transpose equal to order times identity and a flat unitary after normalization., and type the carrier, state every parameter and convention in the definition, test that the order N and complex matrix, unit-modulus entry condition, Hermitian transpose, orthogonality equation H H dagger equals N I, normalized unitary form, equivalence operations, dephased representative and real-Hadamard and Fourier examples are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Complex Hadamard matrix Domain-specific

Parents (1) — outgoing typed relations

Complex Hadamard matrix is a kind of Relation Prime

It remains its own entry because its identity is fixed by the order N and complex matrix, unit-modulus entry condition, Hermitian transpose, orthogonality equation H H dagger equals N I, normalized unitary form, equivalence operations, dephased representative and real-Hadamard and Fourier examples.

Hierarchy path (1) — routes to 1 parentless root

Complex Hadamard matrix → is a kind of Relation

Neighborhood in Abstraction Space¶

Complex Hadamard matrix sits in a crowded region of the domain-specific corpus (7^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Structured Matrices & Linear Maps (43 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25