Quantum Computing

Quantum Gates: Operators of the Quantum Circuit

An explanation of quantum logic gates, represented by unitary matrices, which manipulate qubit states.

QWiki Team 2 min read
#gates#circuits#operators
Explore Labs

Introduction

In quantum computing, a quantum logic gate (or simply a quantum gate) is a basic quantum circuit operating on a small number of qubits. They are the building blocks of quantum circuits, analogous to classical logic gates.

Mathematical Nature of Gates

Unlike classical gates, quantum gates are reversible. Mathematically, they are represented as unitary matrices UU of size 2N×2N2^N \times 2^N (where NN is the number of qubits). A matrix is unitary if: U†U=IU^\dagger U = I where U†U^\dagger is the conjugate transpose of UU, and II is the identity matrix.

Single-Qubit Gates

  • Pauli-X Gate (NOT Gate): Flips the qubit state. X=(0110)X = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}
  • Pauli-Y Gate: Performs a rotation around the Y-axis. Y=(0−ii0)Y = \begin{pmatrix} 0 & -i \\ i & 0 \end{pmatrix}
  • Pauli-Z Gate: Flips the phase of ∣1⟩|1\rangle. Z=(100−1)Z = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}
  • Hadamard Gate (H): Creates an equal superposition from a basis state. H=12(111−1)H = \frac{1}{\sqrt{2}}\begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix}

Multi-Qubit Gates

  • Controlled-NOT (CNOT): Flips the target qubit if the control qubit is ∣1⟩|1\rangle.
  • Toffoli Gate (CCNOT): Flips the target qubit if both control qubits are ∣1⟩|1\rangle. Essential for reversible classical computation.