How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Logical block error and leakage amplitude
Definition
Let be a fixed-charge encoding, its code projector, a logical target, and an ambient unitary. Its zero-on-the-complement target extension is . Define the logical block error and leakage amplitude by Both are finite operator norms. The first measures the compressed block against the target; the second measures transfer from the code into its orthogonal complement. They diagnose different errors.
Facts & Assumptions
Given: A finite-dimensional encoding , its projector , a logical unitary , and an ambient unitary .
is the orthogonal projection onto . Fixed-charge encoding and code projector
The operator norm is finite for every linear map between finite-dimensional inner-product spaces. The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
Proof
The maps and are endomorphisms of . Because is finite dimensional, [F2] assigns a finite operator norm to each map; the two quantities are therefore well defined.
For a zero-leakage but logically incorrect boundary case, take , , , and . Then and . This proves the two quantities are not interchangeable.
Depends on
Used by
Dependency tree · two levels
8 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Chetan Nayak, Steven H. Simon, Ady Stern, Michael Freedman, and Sankar Das Sarma, Non-Abelian Anyons and Topological Quantum Computation (standard reference, not scraped)
- John Preskill, Lecture Notes for Physics 219: Quantum Computation, Chapter 9: Topological Quantum Computation (standard reference, not scraped)