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.
Finite Taylor LCU polynomial
Definition
Let on a finite-dimensional complex-inner-product space, with , real and Hermitian unitaries , and put . For real and integer , define Its ordered product-term LCU list has one empty tuple for , with coefficient and unitary , and for each and ordered tuple has coefficient and unitary . Distinct tuples remain distinct entries even if their product unitaries coincide. The absolute coefficient sum of this listed representation is
Whenever , append two distinct identity entries with coefficients and , where . They leave the represented matrix unchanged and raise the listed absolute coefficient sum to exactly . If , the zero-weight entries may be retained with zero preparation amplitude or omitted. The polynomial, coefficient phases, ordered tuple index, and any numerical precision used to generate them are part of the finite input/access record; no term product, coefficient table, PREPARE circuit, or SELECT circuit is free.
Depends on
Used by
Dependency tree · two levels
11 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.1 (standard reference, not scraped)