Exact & formalOperatorsStateMagic state distillation1 q
Magic T state
The single-qubit magic state |T⟩ = T|+⟩, the standard resource state consumed by gate teleportation to implement a fault-tolerant non-Clifford T gate.
Every quantum algorithm worth knowing about, written down the same way: what it takes, what it returns, what it costs, and who proved it.
The Map draws our corpus as one connected structure: Open the Map
Every source behind both surfaces: See the papers
A speedup class on a record is quoted: See whose claim it is
Every record is classified by how it was verified. The badge shows the strongest tier of evidence; the chips list each method that applies.
The defining behavior was checked exactly: a mathematical identity, a full statevector or stabilizer simulation, or an exhaustive basis-state truth table.
The design was verified by construction plus measured evidence: statistical re-execution, small-instance analytic agreement, sub-block, echo, or invariant checks. Scale-specific bugs can still survive.
The record rests on external authority: peer-reviewed papers, standard textbooks, expert review, or evidence carried over from related verified entries. Nothing here was re-executed by this catalog.
Only automated (LLM-assisted) review or an unreviewed community submission backs this record so far. Treat it as a starting point, not evidence.
4 public entries
Atlas stars stay in this public list. Saving an entry to your workspace starts an unstarred private copy.
The single-qubit magic state |T⟩ = T|+⟩, the standard resource state consumed by gate teleportation to implement a fault-tolerant non-Clifford T gate.
The joint parity operator Z^{⊗n} and its standard non-destructive ancilla-based measurement circuit, the core primitive behind stabilizer syndrome extraction.
A foundational code record that compares quantum protection with the narrower classical repetition-code idea.
A fault-tolerance record for comparing physical error, syndrome extraction, decoder choice, and logical failure.