nLab controlled Z-gate

Redirected from "CCZ gate".

Context

Computation

Quantum systems

quantum logic


quantum physics


quantum probability theory – observables and states


quantum information


quantum technology


quantum computing

Contents

Idea

In quantum computing and quantum information theory, the controlled Z gates are controlled quantum gate versions of the Z gate.

Where the Z gate acts on a single qbit, being the unitary operator

ℂ ⟶Z ℂ |b⟩ ↦ (−1) b|b⟩, \begin{array}{ccc} \mathbb{C} &\overset{Z}{\longrightarrow}& \mathbb{C} \\ \vert b \rangle &\mapsto& (-1)^b \vert b \rangle \mathrlap{\,,} \end{array}

the (N−1)(N-1)-controlled Z gates for N∈ℕ ≥1N \in \mathbb{N}_{\geq 1} are the unitary operators on the tensor product of NN qbits given by

(1)ℂ N ⟶C N−1Z ℂ N |b 1,⋯,b N⟩ ↦ (−1) b 1⋯b N|b 1,⋯,b N⟩, \begin{array}{ccc} \mathbb{C}^N &\overset{C^{N-1} Z}{\longrightarrow}& \mathbb{C}^N \\ \vert b_1,\cdots, b_N \rangle &\mapsto& (-1)^{b_1 \cdots b_N} \vert b_1, \cdots, b_N \rangle \mathrlap{\,,} \end{array}

where b i∈{0,1}b_i \in \{0,1\}.

(cf. Beverland, Campbell, Howard & Kliuchnikov 2020).

Since the exponential expression in (1) is

(−1) b 1⋯b N={−1 if ∀ i:b i=1 +1 otherwise (-1)^{b_1 \cdots b_N} = \begin{cases} -1 & \text{ if }\; \forall_i \colon b_i\!=\!1 \\ +1 & \text{ otherwise } \end{cases}

we equivalently have:

C N−1Z=id−2|1,⋯,1⟩⟨1,⋯,1|. C^{N-1}Z \,=\, id - 2{\vert 1, \cdots, 1\rangle}{\langle 1, \cdots, 1 \vert} \mathrlap{\,.}

(cf. Gühne et al. 2014 (1)).

Examples

The CCZ quantum gate is the doubly-controlled form of the Pauli Z Z -gate, which plays a role as a non-Clifford gate alternative to the T-gate in the discussion of Takagi, Yoder & Chuang 2017.

References

Last revised on October 10, 2026 at 12:10:29. See the history of this page for a list of all contributions to it.