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.
Orthogonal-Projector Reflection and Access Contract
Definition
Let be a finite-dimensional complex-inner-product space and let be an orthogonal projection on . Fix the two signs
Thus acts as on and on ; reverses those signs. They are not interchangeable inside a controlled block. For a unit vector , the rank-one reflection is with the Dirac convention of Dirac Notation Conversion.
An access model counts a direct reflection as one primitive call only when that call is explicitly declared. Controlled reflection access is a separate declaration. If is a specified unit input in the same space , the state is prepared as for a declared unitary , and a reflection is implemented by conjugating , the construction is and its cost must include the calls to , , and . A state vector or matrix description alone implies neither an efficient reflection nor inverse access.
Remarks
The root theorem An endomorphism is an orthogonal projection exactly when it is idempotent and self-adjoint identifies an orthogonal projection as a self-adjoint idempotent. Projector Reflections Are Hermitian Unitary Involutions ↗ proves the algebraic identities for both signs; Rank-One Reflection Is Ray-Invariant and Its Signs Differ Under Control ↗ proves ray invariance and the controlled sign relation. Their actual proof inputs remain subject to cross-pair supplier reconciliation.
Depends on
Used by
- Amplitude amplification with a fixed integer iteration count Algorithm
- Amplitude amplification with independently chosen phase rotations Algorithm
- BBHT search when the marked count is unknown Algorithm
- Bounded-error evaluation from a dual adversary certificate Algorithm
- Controlled input-consistency reflection from a bit query Algorithm
- Exact success amplification by attenuating the good branch Algorithm
- Finite amplification from a supplied success lower bound Algorithm
- Finite capped quantum quantile minimum Algorithm
- Known-count Grover search by exact integer maximization Algorithm
- Known-count search by randomized Grover iteration Algorithm
- MNRS finite reversible-walk finding Algorithm
- One Grover iterate in the standard bit-query model Algorithm
- Quantum singular-value transformation circuit Algorithm
- Unknown-amplitude randomized search Algorithm
- A preserved unknown state cannot program its own reflection Counterexample
- Amplitude estimation and counting input/output contract Definition
- Finite row-preparation access model for a Szegedy walk Definition
- Oblivious ancilla reflection Definition
- Prepared unitary and success subspace for amplitude amplification Definition
- Qubitization access model Definition
- Szegedy reflection walk and its two-reflection square Definition
- Amplitude-amplification invariant plane Lemma
- Capped randomized amplitude amplification preserves a flagged output Lemma
- Effective spectral gap for a product of two reflections Lemma
- Szegedy reflections and walk operators are unitary Lemma
- The Grover iterate rotates the marked/unmarked plane Lemma
- Amplitude-amplification access and resource accounting Proposition
- Gate and reflection accounting for randomized known-count search Proposition
- Arbitrary-phase amplification query count Theorem
- Dual reflection evaluator has bounded-error correctness Theorem
- Exact-success amplitude amplification query cost Theorem
- Fixed-round amplitude amplification query count Theorem
- Known-amplitude amplification query cost Theorem
- Projector phase operations from controlled reflections Theorem
- Projector Reflections Are Hermitian Unitary Involutions Theorem
- Rank-One Reflection Is Ray-Invariant and Its Signs Differ Under Control Theorem
- The controlled input-consistency circuit realizes the exact reflection Theorem
- Variable-time amplitude-amplification theorem Theorem
Dependency tree · two levels
22 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
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 6: Quantum Algorithms (standard reference, not scraped)