Standard graduate textbook covering the single- and two-qubit gate definitions, matrix identities, and circuit primitives this record states.
doi.org/10.1017/cbo9780511976667 ↗T phase gate
A non-Clifford phase gate that marks the boundary between a compact Clifford set and universal synthesis.
Atlas stars stay in the public catalog. Saving this entry to your workspace starts an unstarred private copy.
T is useful in resource discussions because its ideal matrix is simple while fault-tolerant cost can dominate.
Circuit & simulation
What this takes and returns
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 →
How it works
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.
Implementation
OPENQASM 3.0;
include "stdgates.inc";
qubit q;
t q;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.
Declared gaps
Nobody has reviewed this record for gaps yet.