Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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 0<t<N, let θ=arcsin⁡t/N. After an integer k≥0 Grover iterates starting from ∣s⟩, the probability of measuring a marked address is pk=sin⁡2((2k+1)θ). For t=0 this probability is 0, and for t=N it is 1 for every integer k≥0; 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.

[F1]

Orthogonal marked and unmarked components of the uniform state: for 0<t<N, ∣s⟩ has coordinate column (cos⁡θ,sin⁡θ)T in the ordered basis (∣B⟩,∣G⟩).

[F2]

The Grover iterate rotates the marked/unmarked plane: G acts on that plane by the matrix (cos⁡2θ−sin⁡2θsin⁡2θcos⁡2θ).

[F3]

One Grover iterate in the standard bit-query model: each iteration applies G=RsOM to the address and leaves the phase-kickback response in ∣−⟩.

[F4]

One standard query implements one phase query: phase kickback applies the phase mark and returns the response qubit to ∣−⟩.

[F5]

The addition formulas for sine and cosine: sine and cosine of a sum obey their addition formulas.

[F6]

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.

[F7]
[F8]

A unit-vector outer product is a density operator: for a unit vector u, ∣u⟩⟨u∣ is a density operator.

[F9]

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.

[F10]

The computational basis is orthonormal: the full address/response computational basis is orthonormal.

[F11]

Dirac Notation Conversion: ∣u⟩⟨v∣z=⟨z,v⟩rootu.

[F12]

Finite registers and their ordered computational bases: the address and response registers form an ordered tensor-product register.

[F13]

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.

[F14]

One standard query implements one phase query: the response is prepared by X then H into ∣−⟩ and is returned unchanged by phase kickback.

[F15]

Exact one-qubit gates and rotations: X and H are the exact unitary one-qubit gates in the ordered computational basis.

Proof

1.1givenF1algebra

For k=0, the address coordinate column is (cos⁡θ,sin⁡θ)T by [F1], which is (cos⁡((2k+1)θ),sin⁡((2k+1)θ))T.

2.1step 1.1F2F5induction

If after k iterations the column is (cos⁡((2k+1)θ),sin⁡((2k+1)θ))T, multiplication by the matrix in [F2] and the addition formulas [F5] gives (cos⁡((2k+3)θ),sin⁡((2k+3)θ))T. Induction therefore gives the marked amplitude sin⁡((2k+1)θ) for every integer k≥0.

3.1step 2.1F1F3F4F7F8F10F12F13F14F15algebra

The address vector at step 2.1 is unit by [F1] and [F7]. The response starts in the unit basis vector ∣0⟩ and the gates X,H in [F15] are unitary, so the response state ∣−⟩ supplied by [F14] is unit. Their tensor product u is unit by the product pairing [F12]–[F13], and [F8] makes ρ=∣u⟩⟨u∣ a density operator.

4.1step 2.1step 3.1F1F6F9F10F11F13F14F15algebra

For each product-basis vector ex,b, [F9] and [F11] give the diagonal weight ⟨ρex,b,ex,b⟩=∣⟨ex,b,u⟩∣2. By step 2.1, the address coordinate along ∣G⟩ is sin⁡((2k+1)θ); the definition ∣G⟩=t−1/2∑x∈M∣x⟩ in [F1] therefore gives coefficient sin⁡((2k+1)θ)/t at each marked x. The squared response coordinates sum to 1 because ∣−⟩ is unit and the qubit computational basis is orthonormal by [F10], [F14]–[F15]. Summing over the t marked addresses and both response values gives t(sin⁡2((2k+1)θ)/t)⋅1=sin⁡2((2k+1)θ). The terminal output law [F6] sums precisely over the unmeasured response register, so this is the measured marked probability.

5.1givenF3algebra∎

If t=0, OM=I and Rs∣s⟩=∣s⟩, so all iterates remain in the unmarked subspace and the marked probability is 0. If t=N, OM=−I and each iterate maps ∣s⟩ to −∣s⟩; every address is marked, so the probability is 1.

Depends on

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