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.
Two-dimensional Hermitian block-encoding signal
Example
Fix , , , and take one-dimensional system with . On a one-qubit ancilla define This is an exact Hermitian block encoding of . Its signal complement has amplitude ; at the signal matrix is , while at the clean line is invariant and the normalized complement is not defined or needed.
Facts & Assumptions
Given: , , and the standard orthonormal ancilla basis .
Hermitian block-encoding signal subspaces: for a normalized Hermitian block eigenvalue , the non-endpoint signal matrix has entries , and the endpoint complement is absent without division by zero.
Proof
Given: As in Facts & Assumptions.
Since , direct multiplication gives and . Also , so is unitary and has the claimed block encoding. Its clean and complementary components are .
If , then , so the normalized complement defined in [F1] is ; both input and output paired bases are , and the matrix is exactly . At , , hence , confirming that zero is a regular two-dimensional signal plane.
If or , then and . No complement vector is normalized in these cases; this verifies the endpoint convention and the encoded eigenvalue .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
6 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 29 §29.1 (standard reference, not scraped)