Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

Phase-estimation finite outcome law

Statement

Let m≥1, Q=2m, and let the input be an eigenvector with Uψ=exp⁡(2πiθ)ψ, where θ∈[0,1). For each y∈{0,…,Q−1}, the probability of measuring y in the algorithm of Quantum phase estimation is Pθ(y)=Q−2∣∑j=0Q−1exp⁡ ⁣(2πij(θ−y/Q))∣2. Thus the finite outcome kernel is defined at every phase, including Qθ∈Z; no quotient with a zero denominator is needed in this formula.

Facts & Assumptions

Given: The eigenphase input and access model of Eigenphase estimation access model, the algorithm of Quantum phase estimation, and m≥1.

[F1]

The phase convention is Uψ=exp⁡(2πiθ)ψ, and the phase-register basis is big-endian with the wire of weight 2j at position m−1−j (Eigenphase estimation access model, Big-endian encoding of ordered bit strings).

[F2]

The algorithm prepares Q−1/2∑x∣x⟩⊗ψ, applies controlled U2j on the wire of weight 2j, then applies the inverse of the positive-sign binary QFT and measures the phase register (Quantum phase estimation).

[F9]

The denotation of chronological layers L1,…,Ld is ULd⋯UL1, with each gate embedded on its declared wires (Denotational semantics of a finite layered circuit).

[F3]

The positive-sign cyclic QFT has matrix action ∣x⟩↦Q−1/2∑ye2πixy/Q∣y⟩; the exact binary circuit implements it in the declared order (Positive-sign cyclic quantum Fourier transform, Exact binary QFT circuit correctness).

[F4]

On the phase register, Py=∣y⟩⟨y∣⊗IH is one member of the finite orthogonal resolution of the identity; the outcome weight of a density operator ρ is tr⁡(ρPy) (Finite registers and their ordered computational bases, Ordered tensor registers, their inner product, and wire permutations, Tensor products of finitely many linear maps, Finite projective measurements, Projective measurement outcome weights are probabilities, Finite POVMs and their outcome law).

[F5]

The Dirac convention is linear in the first argument of the root inner product, so ∣v⟩⟨w∣ acts by z↦⟨z,w⟩rootv, has coordinate matrix [v][w]†, and has trace ⟨v,w⟩root (Dirac Notation Conversion, Dirac Notation Coordinate Identity, The basis-independent trace of an endomorphism of a finite-dimensional vector space, The trace tr⁡(A) as the sum of the diagonal entries). A normalized nonzero vector defines the density operator ∣v⟩⟨v∣ by Ray-to-projector is well-defined and bijective.

[F6]

The finite cyclic character sum is Q at frequency 0 mod Q and 0 otherwise (Orthogonality of the characters x↦e2πikx/N on Z/NZ).

[F8]

Trace is cyclic for compatible finite-dimensional maps: tr⁡(AB)=tr⁡(BA) (For A∈Mm×n(F) and B∈Mn×m(F), tr⁡(AB)=tr⁡(BA)).

Proof

1.1F1F2F9algebra

Before the controlled powers, the state is Q−1/2∑x=0Q−1∣x⟩⊗ψ by [F2]. Write x=∑jcj2j, where cj is the bit at wire qm−1−j by [F1]. The controlled operation on that wire applies U2j exactly when cj=1; multiplying the eigenvalues gives ∏jexp⁡(2πiθcj2j)=exp⁡(2πiθx). Hence the state after the controlled-power stage is Q−1/2∑xexp⁡(2πiθx)∣x⟩⊗ψ. Reading this gate sequence as an operator on the ordered register uses [F9].

2.1F2F3F9step 1.1algebra

The inverse QFT matrix coefficient from input x to output y is Q−1/2exp⁡(−2πixy/Q), by [F3] and the adjoint convention. Applying it to step 1.1 gives χ=∑y=0Q−1ay∣y⟩⊗ψ, where ay=Q−1∑x=0Q−1exp⁡(2πix(θ−y/Q)). The sign is positive in the eigenphase and negative in the inverse-QFT coefficient, yielding the displayed difference θ−y/Q. The operator ordering is the one in [F9].

3.1F6F7F10step 2.1algebra

The vector χ is normalized. Expand the finite squared moduli using [F7]. For every real t, [F10] gives exp⁡(it)‾=exp⁡(−it), and the exponential addition law combines each conjugate pair of phases; interchanging the finite sums then gives ∑y∣ay∣2=Q−2∑x,x′exp⁡(2πi(x−x′)θ)∑yexp⁡(−2πi(x−x′)y/Q). By [F6], the inner sum is Q when x=x′ and 0 otherwise, because 0≤x,x′<Q; therefore ∑y∣ay∣2=Q−2Q⋅Q=1. Since ∥ψ∥=1 and the ∣y⟩ are orthonormal, ∥χ∥=1.

3.2F4F5F8step 2.1

The ray-projector theorem [F5] makes ρ=∣χ⟩⟨χ∣ a density operator. The phase-register projective outcome has projector Py from [F4], so it extracts ay∣y⟩⊗ψ. By [F5] and [F8], tr⁡(ρPy)=tr⁡(Pyρ)=tr⁡(∣Pyχ⟩⟨χ∣)=⟨Pyχ,χ⟩root=∥Pyχ∥2=∣ay∣2, where the penultimate equality uses Py=Py∗=Py2. The outcome law in [F4] therefore gives this probability to the classical label y. Substituting the value of ay from step 2.1 gives exactly the displayed Pθ(y).

4.1F1F9step 2.1algebra∎

The finite sum in the displayed law is defined for every y,θ, including when Qθ is an integer. For its geometric-sum specialization, the denominator is zero exactly when z=exp⁡(2πi(θ−y/Q))=1, equivalently Qθ−y∈QZ; in every other case Finite geometric sum for phase-estimation amplitudes gives the nonzero-denominator quotient. Thus the stated squared-sum law handles all phases without an undefined quotient.

Depends on

Used by

Dependency tree · two levels

124 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