liveBook · Manning

Hadamard gate

The Hadamard gate is a single-qubit quantum gate that transforms computational-basis states into equal superpositions with relative phase differences.

How 2 Manning books explain it

Building Quantum Software with Python

The Hadamard gate is a single-qubit quantum gate that transforms computational-basis states into equal-weight superpositions with relative phase differences.

How it is used
Prepares uniform amplitude distributions and converts phase-encoded information into measurement-visible magnitude differences.
How deep it goes
Derives the scaled sum-and-difference amplitude rule, visualizes pair recombination, and implements single- and multi-qubit circuits.
Examples
Demonstrates fair-coin sampling, an eight-outcome uniform state, phase encoding of 273.5, and recovery of binary 1101.
What you can do after
Apply it via a simulator circuit to create uniform states and expose phase-encoded angles through outcome probabilities.

Read how Building Quantum Software with Python explains Hadamard gate →

Quantum Programming in Depth

The Hadamard gate is a single-qubit quantum gate that creates equal superpositions from computational-basis states.

How it is used
Uses basis switching to turn a single-qubit unitary-identification problem into a measurement of distinguishable outcomes.
How deep it goes
Explains basis conversion through a concrete gate sequence and measurement, without developing implementation code or broader gate theory.
Examples
Demonstrates the sequence XXX versus HXH and identifies the unknown gate through final measurement results.
What you can do after
Apply the Hadamard gate within a sequence that distinguishes X and H using one qubit and measurement.

Read how Quantum Programming in Depth explains Hadamard gate →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.