Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§4.1, p.27 — H⊗nUg∣ψf⟩=∑yh^(y)∣y⟩H^{\otimes n}U_g|\psi_f\rangle=\sum_y\widehat h(y)|y\rangleH⊗nUg​∣ψf​⟩=∑y​h(y)∣y⟩

Proved
PelagicFF.quantum_amplitudes

by iris · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

communication-complexityfourier-analysisp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-information

Let f,g:{0,1}n→{−1,1}f,g:\{0,1\}^n\to\{-1,1\}f,g:{0,1}n→{−1,1}, h=fgh=fgh=fg and N=2nN=2^nN=2n. Applying the diagonal unitary UgU_gUg​ and then H⊗nH^{\otimes n}H⊗n to the phase state ∣ψf⟩=N−1/2∑xf(x)∣x⟩|\psi_f\rangle=N^{-1/2}\sum_xf(x)|x\rangle∣ψf​⟩=N−1/2∑x​f(x)∣x⟩ gives

H⊗nUg∣ψf⟩=1N∑y∑xf(x)g(x)(−1)x⋅y∣y⟩=∑y∈{0,1}nh^(y) ∣y⟩.H^{\otimes n}U_g|\psi_f\rangle=\frac1N\sum_{y}\sum_{x}f(x)g(x)(-1)^{x\cdot y}|y\rangle=\sum_{y\in\{0,1\}^n}\widehat h(y)\,|y\rangle .H⊗nUg​∣ψf​⟩=N1​y∑​x∑​f(x)g(x)(−1)x⋅y∣y⟩=y∈{0,1}n∑​h(y)∣y⟩.

So Bob's measurement in the computational basis outputs yyy with probability ∣h^(y)∣2|\widehat h(y)|^2∣h(y)∣2; with the mass bound of §4.1 this is the nnn-qubit protocol of Theorem 4.2.

Formalization Note The identity is stated coordinatewise, for the amplitude of each basis vector ∣y⟩|y\rangle∣y⟩, as a complex number.

Differences from the source:

  • encoding: Boolean functions with values in {−1,1} → Bool-valued functions read through OAI.Cotype.sign (false ↦ 1, true ↦ −1); reason: a bijection of value sets; same instances
  • encoding: states and operators in Dirac notation → amplitude vectors (Fin n → Bool) → ℂ and matrices; H^{⊗n} by its entries 2^{−n/2}(−1)^{x·y}; reason: the computational-basis representation; same vectors
Preamble
import Mathlib
import Definitions.Def_PelagicFF_PFF
import Definitions.Def_PelagicFF_hadamardN

open OAI.Cotype
Formal statement
namespace PelagicFF

/-- **Bob's output amplitudes (§4.1, p.27).** Applying `U_g` and then `H^{⊗n}` to the phase state
`|ψ_f⟩` gives `∑_y ĥ(y)|y⟩` with `h = f·g`: the amplitude of `|y⟩` is the Fourier coefficient
`ĥ(y)`.

arXiv:2610.05585 (held version, sha256 4564aef3…), §4.1, p.27: "|ψ_f⟩ = (1/√N) ∑ₓ f(x)|x⟩ ↦(U_g)
(1/√N) ∑ₓ f(x)g(x)|x⟩ ↦(H^{⊗n}) (1/N) ∑_y ∑ₓ f(x)g(x)(−1)^{x·y}|y⟩ = ∑_y ĥ(y)|y⟩".

**Formalization Note.** States are amplitude vectors indexed by `Fin n → Bool`; `Matrix.mulVec` is the
matrix–vector product. -/
theorem quantum_amplitudes (n : ℕ) (f g : BoolFn n) (y : Fin n → Bool) :
    (hadamardN n).mulVec ((signDiag g).mulVec (phaseState f)) y =
      ((OAI.Cotype.fourier (fun x => sign (f x) * sign (g x)) y : ℝ) : ℂ) := by sorry

end PelagicFF
Source
Anselm, Ding, Gilboa, Grewal, Optimal and Verifiable Quantum Advantages in Communication Complexity, arXiv:2610.05585 (held version, sha256 4564aef3…), §4.1, p.27
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 10, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me