Hadamard Gate (State Change)
Transformation of basis states into superpositions.
This public page keeps the free explanation visible and leaves premium worked solving, advanced walkthroughs, and saved study tools inside the app.
Core idea
Overview
The Hadamard gate is a fundamental single-qubit operation that transforms a definite computational basis state into a uniform superposition. It serves as a basis change, effectively rotating the qubit state 180 degrees around the X+Z axis of the Bloch sphere.
When to use: Apply the Hadamard gate when you need to initialize a qubit into a balanced superposition of |0⟩ and |1⟩. It is the essential first step in most quantum algorithms to enable quantum parallelism and interference.
Why it matters: This gate creates the 'superposition' state that distinguishes quantum computing from classical computing. It allows a qubit to represent multiple possibilities simultaneously, which is the basis for the exponential speedup in algorithms like Grover's search or Shor's factoring.
Symbols
Variables
\alpha = Amplitude
Walkthrough
Derivation
Transformation: Hadamard Gate
Maps basis states to an even superposition of bases.
- Unitary transformation.
- Initial state is a basis state (|0⟩ or |1⟩).
Apply transformation:
The Hadamard gate creates an equal probability amplitude for both zero and one, allowing for quantum parallelism.
Result
Source: University Quantum Computing — Gates
Free formulas
Rearrangements
Solve for
Make alpha the subject
Start from the definition of the Hadamard gate acting on the |0⟩ state. Distribute the denominator to express the state as a superposition of |0⟩ and |1⟩ states, then identify as the amplitude of the |0⟩ state.
Difficulty: 2/5
The static page shows the finished rearrangements. The app keeps the full worked algebra walkthrough.
Visual intuition
Graph
Graph unavailable for this formula.
The graph is a discrete plot showing two distinct points at the same amplitude level of approximately 0.707. Because the Hadamard gate maps the input state to an equal superposition of basis states, the output consists of two equal, constant values rather than a continuous function.
Graph type: constant
Why it behaves this way
Intuition
The Hadamard gate geometrically rotates the qubit state on the Bloch sphere by 180 degrees around the axis defined by the X and Z axes, transforming a definite basis state into an equal superposition.
Signs and relationships
- + (between basis states): This additive combination signifies a linear superposition, meaning the qubit simultaneously embodies contributions from both the |0⟩ and |1⟩ states.
- √(2) (denominator): This is a normalization factor required by quantum mechanics to ensure that the sum of probabilities for all possible measurement outcomes (in this case, |0⟩ or |1⟩) equals 1.
Free study cues
Insight
Canonical usage
This equation describes the transformation of a quantum state, which is inherently dimensionless, from a computational basis state to a superposition.
Common confusion
Students might mistakenly try to assign physical units to quantum states or gate operations, overlooking their dimensionless, probabilistic nature.
Dimension note
Quantum states, represented by kets like |0⟩ and |1⟩, are mathematical abstractions in a Hilbert space. The coefficients in a superposition (e.g., 1/√2) are probability amplitudes, which are dimensionless.
One free problem
Practice Problem
The Hadamard gate transforms the state |0⟩ into a superposition where the probability of measuring |1⟩ is exactly 50% (0.5). Calculate the positive probability amplitude 'amp' associated with this state.
Solve for:
Hint: The probability (P) of a state is equal to the square of its amplitude (amp²).
The full worked solution stays in the interactive walkthrough.
Where it shows up
Real-World Context
A qubit in state |0> passed through a Hadamard gate becomes an equal superposition.
Study smarter
Tips
- The Hadamard gate is its own inverse; applying it twice (H²) returns the qubit to its original state.
- The probability of measuring either state after applying H to a basis state is exactly 0.5.
- In the Bloch sphere, the H gate represents a rotation that swaps the Z-axis and the X-axis.
Avoid these traps
Common Mistakes
- Assuming it produces a random bit; it's a deterministic unitary transformation.
Common questions
Frequently Asked Questions
Maps basis states to an even superposition of bases.
Apply the Hadamard gate when you need to initialize a qubit into a balanced superposition of |0⟩ and |1⟩. It is the essential first step in most quantum algorithms to enable quantum parallelism and interference.
This gate creates the 'superposition' state that distinguishes quantum computing from classical computing. It allows a qubit to represent multiple possibilities simultaneously, which is the basis for the exponential speedup in algorithms like Grover's search or Shor's factoring.
Assuming it produces a random bit; it's a deterministic unitary transformation.
A qubit in state |0> passed through a Hadamard gate becomes an equal superposition.
The Hadamard gate is its own inverse; applying it twice (H²) returns the qubit to its original state. The probability of measuring either state after applying H to a basis state is exactly 0.5. In the Bloch sphere, the H gate represents a rotation that swaps the Z-axis and the X-axis.
References
Sources
- Wikipedia: Hadamard gate
- Wikipedia: Bloch sphere
- Wikipedia: Quantum superposition
- Nielsen & Chuang, Quantum Computation and Quantum Information
- Nielsen and Chuang Quantum Computation and Quantum Information
- University Quantum Computing — Gates