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.
Exact zero-label probability for counting
Statement
For a fresh Count run with and , the QPE label is zero exactly when the raw count estimate is zero. If , then For this probability is ; when and it is .
Facts & Assumptions
Given: A fresh Count preparation, a Boolean predicate with marked elements, and an even power-of-two phase-grid size .
For , the prepared state has equal squared overlap with Grover eigenphases and ; at it is a eigenvector (Grover eigenphases encode the good probability).
QPE on an eigenphase has the finite outcome kernel of Phase-estimation finite outcome law.
For an eigenphase superposition, measurement probabilities are the eigenphase-weighted mixture with no cross terms (Phase estimation on a superposition of eigenspaces).
The geometric sum, Euler formula, and integer periodicity give the label-zero sine quotient (Finite geometric sum for phase-estimation amplitudes, , , and , , and exactly when ).
Sine vanishes exactly at integer multiples of (The zero sets of sine and cosine and the least positive common period 2 pi).
The raw Count estimate for label is (Quantum counting by uniform-state amplitude estimation).
Sine changes sign under an integer shift by , and (Quarter-turn values and shifts by pi/2 and pi, Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions).
Proof
For a phase and label zero, the kernel in [F2] and geometric-sum fact [F4] give when , by Euler’s formula. At an integer phase all summands are , so the probability is one.
For , [F1]–[F3] average this expression over and with weights . For the second branch, [F8] gives and, by iterating the -shift, for the integer . Squaring these identities shows that both branches have the same squared numerator and denominator, so their mixture is the stated value. For , the phase is zero and label zero is certain.
When , [F5] gives , so the quotient in step 2.1 is . By [F6], for an integer label exactly when is a multiple of , hence exactly when . Fact [F7] identifies this with a zero raw count estimate.
Depends on
- Quantum counting by uniform-state amplitude estimation
- Grover eigenphases encode the good probability
- Phase-estimation finite outcome law
- Finite geometric sum for phase-estimation amplitudes
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- $\ker(\exp)=2\pi i\mathbb Z$, and $\exp z=\exp w$ exactly when $z-w\in2\pi i\mathbb Z$
- Parity and the Pythagorean identity for sine and cosine
- Double-angle and quadratic power-reduction identities
- The zero sets of sine and cosine and the least positive common period 2 pi
- Quarter-turn values and shifts by pi/2 and pi
- Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions
- Phase estimation on a superposition of eigenspaces
Used by
Dependency tree · two levels
80 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
- Brassard, Høyer, Mosca, and Tapp, Quantum Amplitude Amplification and Estimation, complete article, §§4–5, Theorems 11–18 (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, complete lecture notes, §§19.1–19.3 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, complete 239-page notes, §7.3 (standard reference, not scraped)