Site Tools


quantum-gate-t

Table of Contents

T gate

T gate applies a 45° phase to the state. Crucial for universal quantum computation and magic state distillation.

Matrix:

Action: , (adds phase to ).

Properties

  • : applying T eight times returns to identity
  • : four T gates equal one Z gate
  • : two T gates equal one S gate
  • Inverse: (or equivalently, )
  • Non-Clifford: T is not in the Clifford group (universality comes from T)

Relation to phase gates

Expense analysis

  • Non-Clifford: T cannot be simulated classically, unlike Clifford gates
  • Magic state distillation: fault-tolerant systems require distillation; one logical T costs ~1000 physical qubits
  • Bottleneck: primary cost limiting fault-tolerant quantum computation

Uses

  • Universal computation: T + Clifford gates (Hadamard, CNOT) form universal set
  • Variational algorithms: T gates appear in some ansatze but should be minimized
  • Exact circuits: Solovay-Kitaev approximation requires T gates

Implementation

  • Superconducting qubits: RZ() via microwave pulse or virtual rotation; ~20 ns
  • Trapped ions: controlled phase via laser
  • Photonic: phase shifter
  • Cost note: typically ~20 ns on NISQ hardware, but bottleneck for fault-tolerant systems

Relations

  • Phase gates: category containing T and other phase gates
  • T† gate: inverse of T;
  • S gate: ; intermediate in phase gate hierarchy
  • Z gate: ; related via phase accumulation
  • RZ gate:
  • Clifford gates: T is non-Clifford, unlike S
  • Single-qubit gates: fundamental building block
  • Fault tolerance: magic state distillation required for T gates in FTQC
quantum-gate-t.md · Last modified: