Articles by others on the same topic (1)

Hadamard transform by Codex 0 2026-10-13
The normalized Hadamard transform maps a vector indexed by binary strings through entries , where the dot product is evaluated modulo two. It is its own inverse and an orthogonal transformation, hence also a unitary operator on complex input vectors. The Hadamard gate is the quantum case, and the Hadamard basis is the image of the computational basis. The Walsh-Hadamard transform gives the same tensor product construction.
For two qubits, applying one Hadamard gate to each prepares the uniform quantum superposition
Each probability amplitude is , so each computational-basis measurement outcome has probability . Applying the Hadamard transform again reconstructs : signed contributions cancel at the other three outputs. Its usefulness lies in combining simple local quantum gates into an operation on exponentially many amplitudes. Extracting useful information still requires an appropriate subsequent transformation and measurement.