Hadamard gate puts a qubit into equal superposition of |0⟩ and |1⟩
Quantum logic gate
Hadamard gate puts a qubit into equal superposition of |0⟩ and |1⟩
The Hadamard gate is a fundamental quantum logic gate that transforms a qubit into a superposition of states. This transformation is essential for quantum computing as it allows qubits to exist in multiple states simultaneously, enabling parallel computation.
Example
Applying the Hadamard gate to the |0⟩ state results in the superposition (|0⟩ + |1⟩)/√2. This means the qubit is now equally likely to be measured as |0⟩ or |1⟩.
Remember this
Understanding the Hadamard gate's function is crucial for grasping how quantum superposition enables the power of quantum computing.
Text adapted from Wikipedia, licensed under CC BY-SA 4.0.
Related concepts
Quantum superposition
A qubit exists in superposition of |0⟩ and |1⟩
Shor's algorithm
Shor's algorithm factors integers in polynomial time on a quantum computer
quantum entanglement means: measuring one qubit instantly determines the other's state
Quantum entanglement instantly links particles' states
Quantum computing
Quantum computers can solve certain problems exponentially faster than classical computers
Entropy (information theory)
Entropy of a fair coin is 1 bit
Quantum key distribution
Can secret messages be intercepted without anyone noticing?
Swipe through 100 ML concepts daily
Open Pocket Polymath