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.
Nearest-grid probability in phase estimation
Statement
For every , , and , a nearest grid label , minimizing , exists. Every nearest label satisfies In particular, this holds at ties between adjacent labels and at the wrap-around between and .
Facts & Assumptions
Given: , , and .
For every real , there is an integer with (Integer part: for every real there is exactly one integer with ).
For , (Circular phase distance modulo one).
The phase-estimation probability is (Phase-estimation finite outcome law).
If , then (Finite geometric sum for phase-estimation amplitudes).
For , , and for , (Sine chord and linear bounds).
The complex exponential is additive in its exponent, exactly for , and with (, and the complex exponential extends the real exponential, , and exactly when , , , and ).
Complex conjugation preserves modulus and (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
Sine is odd and cosine is even (Parity and the Pythagorean identity for sine and cosine).
Proof
Put and , so and by [F1]. If , choose ; if and , choose ; if and , choose . The resulting circular distance is respectively or , at most .
Every integer has a lift representation with and : apply [F1] to and set , , so . Thus grid labels and their lifts range over all integers, and minimizing circular phase distance is the same as choosing an integer nearest to . If , every integer is at distance at least and every is at distance at least , so is nearest; when , is also nearest. If , every integer is at distance at least and every is at distance at least , so is nearest. If a nearest integer is , its label is : this is the wrap-around choice in step 1.1 when , and the tied wrap-around label when . Thus every nearest label has distance .
Fix a nearest label and set , . Since , the definition of gives an integer and sign with . By [F6], . If , Euler's formula and the evenness of cosine and oddness of sine in [F8] give , so [F7] shows its distance from has the same modulus as for . Euler's formula gives . Since and by [F5], . The same calculation with gives when , because .
When , [F4] and step 3.1 yield . If , then and [F3] gives .
If , step 2.1 gives . By [F5], and ; hence step 4.1 gives . If , step 4.1 gives . Thus every nearest label, including either label at a tie, has the claimed probability.
Depends on
- Phase-estimation finite outcome law
- Finite geometric sum for phase-estimation amplitudes
- Sine chord and linear bounds
- Circular phase distance modulo one
- Integer part: for every real $x$ there is exactly one integer $m$ with $m \le x < m + 1$
- The complex exponential by its power series
- $\exp(z+w)=\exp z\,\exp w$, and the complex exponential extends the real exponential
- $\ker(\exp)=2\pi i\mathbb Z$, and $\exp z=\exp w$ exactly when $z-w\in2\pi i\mathbb Z$
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
- Parity and the Pythagorean identity for sine and cosine
Used by
Dependency tree · two levels
85 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, §4.3 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, version 6, §4.6 (standard reference, not scraped)
- Lin Lin, Lecture Notes on Quantum Algorithms for Scientific Computation, §§16.1–16.3 (standard reference, not scraped)