Gates · Controlled gate
Controlled-Hadamard gate
A controlled version of the Hadamard gate that puts the target into superposition only when the control qubit is |1⟩, a canonical example of promoting a single-qubit gate to a controlled operation.
Exact & formalUpdated
1 step across 2 wires. Hover a step, or press play to go through them in order.
Expected outcomes
- Control 0 → target unchanged100%
- Control 1 → P(target 0)50%
- Control 1 → P(target 1)50%
- Steps1
- Wires2
- Qubits2
- Depth1 native / 2 CNOT decomposition
- Outcomesconditional superposition
- Papers2
CH is a useful teaching record because H is not diagonal and not a Pauli, so building its controlled version requires the general controlled-U machinery rather than a one-line native gate.
Takes2 qubitsWhat joins here
Takes a 2-qubit register and states no assumption about what is on it. That is the whole condition: anything returning 2 qubits can feed it.
16 entries meet this end. Named below.
Returns2 qubitsWhat joins here
Returns a 2-qubit register a next stage can take. This is the end that joins.
11 entries meet this end. Named below.
A unitary. The same register goes in and comes out, and this entry states no assumption about what is on it — which is what lets anything of the same width feed it. See all 29 →
Definition
with the control as the first (leftmost) qubit. Unlike or , this matrix is not diagonal, and unlike , the applied operation is not a Pauli matrix.
Action on basis states
When the control is the target is left completely untouched; when the control is the target is put into superposition exactly as a bare would.
Decomposition
Because is neither diagonal nor Pauli, is not directly native on most hardware and is built with the general controlled- recipe of Barenco et al. (1995): find single-qubit gates with
and implement controlled- as –CNOT––CNOT– on the target, conditioned on the control via two CNOTs. A common concrete choice uses , , and a compensating phase gate for , giving a 2-CNOT circuit.
Key identities
- : applying the same controlled-Hadamard twice restores the input, since .
- conditioned on on the control produces genuine entanglement between control and target, unlike / acting on product states, because mixes the target's basis rather than only phasing it.
Takes2 qubitsWhat joins here
Takes a 2-qubit register and states no assumption about what is on it. That is the whole condition: anything returning 2 qubits can feed it.
16 entries meet this end. Named below.
Returns2 qubitsWhat joins here
Returns a 2-qubit register a next stage can take. This is the end that joins.
11 entries meet this end. Named below.
A unitary. The same register goes in and comes out, and this entry states no assumption about what is on it — which is what lets anything of the same width feed it. See all 29 →
- Qubits
- 2
- Depth
- 1 native / 2 CNOT decomposition
- Outcomes
- conditional superposition
- Matrix
- block-diag(I₂, H)
- Decomposition
- 2 CNOTs + single-qubit A,B,C (Barenco et al. 1995)
- Control 0 block
- Identity
- Control 1 block
- H
CHon q[0], q[1]
Quantum vs classical
Classical baseline
Use a classical state-vector or matrix simulation at the same width, precision, and measurement objective.
Quantum claim
The quantum record demonstrates a state or operator behavior; it does not make classical simulation or communication costs disappear.
How to compare
Compare fidelity, samples, gate depth, noise, memory, and the cost of preparing and reading the state.
Nobody has reviewed this record for gaps yet.
OPENQASM 3.0;
include "stdgates.inc";
qubit[2] q;
ch q[0], q[1];Related entries
- Controlled-X gate
Gates
- Controlled-Z gate
Gates
- Hadamard gate
Gates
- U3 universal single-qubit gate
Gates
References
- Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, Harald Weinfurter · 1995
Shows that single-qubit U(2) gates plus CNOT are universal and gives explicit decompositions for controlled-U, Toffoli, and Fredkin gates.
- Quantum Computation and Quantum Information: 10th Anniversary Edition
Michael A. Nielsen and Isaac L. Chuang · 2010
Standard reference for single- and multi-qubit gate matrices, Euler-angle decomposition, and universal gate sets.