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.
Oblivious ancilla reflection
Definition
Let be the full coefficient and PREPARE-work ancilla register in LCU decomposition and access model, let be the system, and let be the clean injection of Clean-ancilla zero-branch postselection. Set ; An isometric quantum encoding gives an orthogonal code projector makes this the orthogonal projection onto the image of . Its basis formula is , where is unit by The computational basis is orthonormal and the tensor action is that of Tensor products of finitely many linear maps. Define Thus acts as on the clean-ancilla subspace and as on its orthogonal complement; it acts identically on the unknown system state. In the convention of Orthogonal-Projector Reflection and Access Contract, , while that item writes . These signs are distinct inside controlled blocks: if only the controlled is supplied, implement controlled with the exact control- correction of Projector Reflections Are Hermitian Unitary Involutions and charge that gate. A projector-reflection call and its controlled form are explicit access operations, not free consequences of a state vector.
Depends on
- LCU decomposition and access model
- Finite registers and their ordered computational bases
- The computational basis is orthonormal
- Tensor products of finitely many linear maps
- Clean-ancilla zero-branch postselection
- An isometric quantum encoding gives an orthogonal code projector
- Orthogonal-Projector Reflection and Access Contract
- Projector Reflections Are Hermitian Unitary Involutions
Used by
Dependency tree · two levels
42 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
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, Chapter 28 §28.3 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, §9.3 (standard reference, not scraped)