Gates · Single-qubit gate
T phase gate
A non-Clifford phase gate that marks the boundary between a compact Clifford set and universal synthesis.
Exact & formalUpdated
A small worked example, computed in your browser. It is not a result from this record's papers.
T, an eighth turn of phase
One qubit, put into |+⟩ = (|0⟩ + |1⟩)/√2 first, because on |0⟩ or |1⟩ alone this gate changes nothing a measurement or another gate can ever detect.
Step 1 of 2 · H
Probability of each outcome after this step
- 050%
- 150%
Puts the qubit into an equal superposition. Without this there is no second amplitude for the gate's phase to be measured against, and a phase on the whole state is not observable.
Probability spreads from 1 outcome to 2. All 2 are equally likely.
Multiplies the |1⟩ half of the state by a phase of π/4, and leaves |0⟩ alone. That is half of S again. T is also the gate that takes a Clifford circuit out of classical reach, which is why fault-tolerant cost is counted in T gates. The two outcomes stay equally likely — the difference is carried entirely in the phase between them, which is what the panel beside the bars shows.
The outcome probabilities do not move at all. What this step changes is phase — 2 distinct relative phases across the state now — which no measurement can see until a later step turns it back into probability.
Readout Measuring gives 0 or 1, each half the time — exactly as it did before the gate. A single measurement of this qubit cannot detect this gate at all. Its effect becomes visible only when the phase is turned back into probability by a later interference step, which is what every algorithm that uses it does.
Open in Studio- Steps1
- Wires1
- Qubits1
- Depth1 gate
- Phaseπ/4
- Papers1
T is useful in resource discussions because its ideal matrix is simple while fault-tolerant cost can dominate.
Takes1 qubitWhat joins here
Takes a 1-qubit register and states no assumption about what is on it. That is the whole condition: anything returning 1 qubits can feed it.
15 entries meet this end. Named below.
Returns1 qubitWhat joins here
Returns a 1-qubit register a next stage can take. This is the end that joins.
13 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 →
The gate is , applying a phase: , . Since , direct matrix multiplication gives and , exactly the power relations this record checks. Unlike , , , , , is not a Clifford gate: conjugating by does not map it to another Pauli operator, which is precisely why is universal for quantum computation while Clifford-only circuits are efficiently classically simulable (Gottesman–Knill). This makes the standard "expensive" non-Clifford resource in fault-tolerant compilation: magic-state distillation exists specifically to produce high-fidelity gates from many noisy ones, since — as this record's own caveat notes — the ideal unitary identity above says nothing about a given device's hardware fidelity or noise.
Takes1 qubitWhat joins here
Takes a 1-qubit register and states no assumption about what is on it. That is the whole condition: anything returning 1 qubits can feed it.
15 entries meet this end. Named below.
Returns1 qubitWhat joins here
Returns a 1-qubit register a next stage can take. This is the end that joins.
13 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
- 1
- Depth
- 1 gate
- Phase
- π/4
- Matrix
- [[1, 0], [0, e^(iπ/4)]]
- Power
- T² = S
- Family
- Non-Clifford
Ton q[0]
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 q;
t q;Related entries
- S phase gate
Gates
- QFT resource screen
Algorithms
References
- Quantum Computation and Quantum Information: 10th Anniversary Edition
Michael A. Nielsen and Isaac L. Chuang · 2010
Standard graduate textbook covering the single- and two-qubit gate definitions, matrix identities, and circuit primitives this record states.