ERROR CORRECTION / 30 MIN
Magic states & fault-tolerant resources
|T⟩ = (|0⟩ + exp(iπ/4)|1⟩)/√2
DERIVATION 1
Beyond stabilizer operations
Clifford gates and stabilizer preparation/measurement admit efficient classical simulation under the Gottesman–Knill assumptions. Universal computation needs a non-Clifford resource; T is a common choice. Adding T resources changes both simulation difficulty and hardware cost.
DERIVATION 2
Inject and distill
Magic-state injection consumes a prepared non-stabilizer state with measurement and feed-forward to implement a non-Clifford operation. Distillation protocols consume multiple noisy resource states to produce fewer cleaner ones, under specific noise assumptions and input thresholds.
DERIVATION 3
A resource ledger
Estimate algorithmic logical qubits, T count, T depth, code distance, physical error rate, cycle time and magic-state factories. T depth and factory throughput constrain runtime; an attractive logical-qubit count alone omits most of the machine.
Assessment
0 / 2 answered · 0 saved attempts
