![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/a/aa/1010_0110_Walsh_spectrum_%2528single_row%2529.svg/640px-1010_0110_Walsh_spectrum_%2528single_row%2529.svg.png&w=640&q=50)
Hadamard transform
Involutive change of basis in linear algebra / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Hadamard gate?
Summarize this article for a 10 year old
The Hadamard transform (also known as the Walsh–Hadamard transform, Hadamard–Rademacher–Walsh transform, Walsh transform, or Walsh–Fourier transform) is an example of a generalized class of Fourier transforms. It performs an orthogonal, symmetric, involutive, linear operation on 2m real numbers (or complex, or hypercomplex numbers, although the Hadamard matrices themselves are purely real).
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/a/aa/1010_0110_Walsh_spectrum_%28single_row%29.svg/320px-1010_0110_Walsh_spectrum_%28single_row%29.svg.png)
(1, 0, 1, 0, 0, 1, 1, 0) × H(8) = (4, 2, 0, −2, 0, 2, 0, 2)
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/5/58/1010_0110_Walsh_spectrum_%28fast_WHT%29.svg/640px-1010_0110_Walsh_spectrum_%28fast_WHT%29.svg.png)
![Thumb image](http://upload.wikimedia.org/wikipedia/commons/thumb/5/5d/1010_0110_Walsh_spectrum_%28polynomial%29.svg/640px-1010_0110_Walsh_spectrum_%28polynomial%29.svg.png)
The Hadamard transform can be regarded as being built out of size-2 discrete Fourier transforms (DFTs), and is in fact equivalent to a multidimensional DFT of size 2 × 2 × ⋯ × 2 × 2.[2] It decomposes an arbitrary input vector into a superposition of Walsh functions.
The transform is named for the French mathematician Jacques Hadamard (French: [adamaʁ]), the German-American mathematician Hans Rademacher, and the American mathematician Joseph L. Walsh.