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 success probability after an integer number of Grover iterates
Statement
For , let . After an integer Grover iterates starting from , the probability of measuring a marked address is For this probability is , and for it is for every integer ; these endpoint cases are direct one-dimensional branches and do not normalize a nonexistent marked or unmarked state.
Facts & Assumptions
Given: The finite marked-search instance and the Grover iterate.
Orthogonal marked and unmarked components of the uniform state: for , has coordinate column in the ordered basis .
The Grover iterate rotates the marked/unmarked plane: acts on that plane by the matrix .
One Grover iterate in the standard bit-query model: each iteration applies to the address and leaves the phase-kickback response in .
One standard query implements one phase query: phase kickback applies the phase mark and returns the response qubit to .
The addition formulas for sine and cosine: sine and cosine of a sum obey their addition formulas.
Normalized output law for finite quantum query branches: a terminal address outcome has weight equal to the sum of the diagonal state weights over all unmeasured register values.
A unit-vector outer product is a density operator: for a unit vector , is a density operator.
Real and complex inner product spaces, with the inner product linear in the first argument: the root inner product is conjugate-symmetric and linear in its first argument.
The computational basis is orthonormal: the full address/response computational basis is orthonormal.
Finite registers and their ordered computational bases: the address and response registers form an ordered tensor-product register.
The product basis is orthonormal and tensor dimensions multiply: the product basis is orthonormal and the tensor-product pairing is the product of factor pairings.
One standard query implements one phase query: the response is prepared by then into and is returned unchanged by phase kickback.
Exact one-qubit gates and rotations: and are the exact unitary one-qubit gates in the ordered computational basis.
Proof
For , the address coordinate column is by [F1], which is .
If after iterations the column is , multiplication by the matrix in [F2] and the addition formulas [F5] gives . Induction therefore gives the marked amplitude for every integer .
The address vector at step 2.1 is unit by [F1] and [F7]. The response starts in the unit basis vector and the gates in [F15] are unitary, so the response state supplied by [F14] is unit. Their tensor product is unit by the product pairing [F12]–[F13], and [F8] makes a density operator.
For each product-basis vector , [F9] and [F11] give the diagonal weight . By step 2.1, the address coordinate along is ; the definition in [F1] therefore gives coefficient at each marked . The squared response coordinates sum to because is unit and the qubit computational basis is orthonormal by [F10], [F14]–[F15]. Summing over the marked addresses and both response values gives . The terminal output law [F6] sums precisely over the unmeasured response register, so this is the measured marked probability.
If , and , so all iterates remain in the unmarked subspace and the marked probability is . If , and each iterate maps to ; every address is marked, so the probability is .
Depends on
- One Grover iterate in the standard bit-query model
- Parity and the Pythagorean identity for sine and cosine
- Real and complex inner product spaces, with the inner product linear in the first argument
- Normalized output law for finite quantum query branches
- Dirac Notation Conversion
- Exact one-qubit gates and rotations
- Finite registers and their ordered computational bases
- Orthogonal marked and unmarked components of the uniform state
- The Grover iterate rotates the marked/unmarked plane
- The product basis is orthonormal and tensor dimensions multiply
- One standard query implements one phase query
- The computational basis is orthonormal
- A unit-vector outer product is a density operator
- The addition formulas for sine and cosine
Used by
- A real-valued optimum is not a fractional Grover iteration Counterexample
- Exact Grover rotation for four addresses and one marked item Example
- Average Grover success for a uniform integer iteration count Lemma
- Constant BBHT stage success beyond the threshold scale Lemma
- The rational Grover recurrence equals the success probability Lemma
- Integer rounding gives a high-success Grover iterate Theorem
- Success guarantee and boundary behavior of known-count Grover search Theorem
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
- Ronald de Wolf, Quantum Computing: Lecture Notes, §7.2 (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, §19.1 (standard reference, not scraped)
- Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp, Quantum Amplitude Amplification and Estimation, §2 (standard reference, not scraped)