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.
Circular-distance tail bound in phase estimation
Statement
Let , , , , and . With as in Circular phase distance modulo one,
Facts & Assumptions
Given: , , , and with .
The outcome law is (Phase-estimation finite outcome law).
Circular distance satisfies for (Circular phase distance modulo one).
The integer part satisfies , and the same floor property applies to (Integer part: for every real there is exactly one integer with ).
The geometric-sum identity gives for (Finite geometric sum for phase-estimation amplitudes).
For , (Sine chord and linear bounds).
For real , , and the exponential is periodic under integer shifts (, , and , , and the complex exponential extends the real exponential, , and exactly when ).
The complex modulus is subadditive (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
For an outcome , put and . If , then ; write with and . By [F4] and [F1], . By [F6], integer shifts do not change these exponentials. For , Euler's formula gives . Since and by [F5], the denominator modulus is at least ; if , Euler's formula and the evenness of cosine and oddness of sine in [F8] give , so [F7] gives the same modulus. The numerator is at most by [F6]–[F7]. Hence . If , this outcome is not in the tail event because .
For an outcome in the tail, let . If , then , a contradiction; hence . Also by [F2], since . If , there are no tail outcomes.
Suppose . For each label , choose if , if , and if , where . Then and . Distinct labels give distinct lifts: equality would make their difference a multiple of , while their label difference has magnitude less than . For an annulus , the lift lies in or . Each half-open interval of length contains at most one element of the integer translate , because distinct elements differ by a nonzero integer. Thus at most two labels lie in this annulus.
Every such label has , so step 1.1 bounds its probability by . The total tail probability is therefore at most . For , . The finite sum telescopes to at most , so the tail is at most . Together with the empty-tail case in step 1.2 this proves the claim.
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)