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.
Denominator-bounded rational phase reconstruction
Definition
Let be integers with and . A measured phase label is represented by the unique integer with as in For , every class in has one representative with , so ; while is in bijection with . Write the normalized finite regular continued fraction of as and denote its convergents by . Every convergent is reduced by Determinant identity for consecutive convergents. A candidate is a convergent whose numerator and denominator are reduced, whose denominator satisfies , and which passes the exact integer test
The reconstruction result is the unique candidate if the candidate set is nonempty, and is FAIL otherwise. The candidate set includes the terminal convergent whenever it meets the same conditions. Uniqueness, and hence well-definedness of this value, follows from Uniqueness of denominator-bounded phase candidates under .
Depends on
- Finite and infinite regular continued fractions
- Convergents of a regular continued fraction
- Determinant identity for consecutive convergents
- Normalized finite regular continued fractions are unique
- For $n\ge 1$, every class in $\mathbb{Z}/n$ has one representative $r$ with $0\le r<n$, so $\lvert\mathbb{Z}/n\rvert=n$; while $\mathbb{Z}/0$ is in bijection with $\mathbb{Z}$
- Uniqueness of denominator-bounded phase candidates
Used by
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
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, §9 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (standard reference, not scraped)