Walsh-Hadamard Transformation gate
Arguably the most important gate in quantum computation is the Walsh-Hadamard transformation gate (or Hadamard gate for short). Its function as a one-bit gate is to put the un-superpositioned qubit into a superposition of the |1> and |0> states. As the quantum computer derives much of itŐs power from superposition-based activities, this gate is crucial.
The Hadamard gate generalizes to an arbitrary number of input qubits according to the following recursive definition (called the Walsh transformation Wn):
W1 = H
Wn+1 = H x Wn
Return to Introduction
Created by Brian Patterson
Last Modified 11/22/00