Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.4.4: state preparation with binary angle control

Open
QAlgorithms.Papers.Independent.Intakethird100.P03.binary_controlled_rotation

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let x1,…,xbx_1,\ldots,x_bx1​,…,xb​ be a finite binary angle code, and put

θ(x)=2π∑s=1bxs2−s.\theta(x)=2\pi\sum_{s=1}^b x_s2^{-s}.θ(x)=2πs=1∑b​xs​2−s.

There is an exact QQQ operation sequence, with clean work, which performs

∣x⟩∣0⟩⟼∣x⟩(cos⁡θ(x)∣0⟩+sin⁡θ(x)∣1⟩).|x\rangle|0\rangle\longmapsto|x\rangle\bigl(\cos\theta(x)|0\rangle+\sin\theta(x)|1\rangle\bigr).∣x⟩∣0⟩⟼∣x⟩(cosθ(x)∣0⟩+sinθ(x)∣1⟩).

Correctness on these basis codes extends linearly to coherent control superpositions. For b=0b=0b=0, the angle is zero.

This is the finite real-coefficient state preparation claimed in the paragraph, without claiming finite exact codes for arbitrary real numbers.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P03
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate Kronecker

namespace QAlgorithms.Papers.Independent.Intakethird100.P03

open QAlgorithms.Papers.Independent.Renew46.P01 (cleanVector)

attribute [local instance] Classical.propDecidable

/-- PDF p.14: finite binary-angle controlled state preparation, exactly and with
clean work. Correctness on these basis inputs extends linearly to coherent controls. -/
theorem binary_controlled_rotation (b : ℕ) :
    ∃ (w : ℕ) (c : Circuit kitaevGateBasis ((b + 1) + w)), ∀ x : Qubits b,
      act c.unitary (inputState (Fin.snoc x false) w) = cleanVector w (rotatedZero x) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P03

end
Source
Quantum measurements and the Abelian Stabilizer Problem, arXiv:quant-ph/9511026v1, PDF p. 14, §2.4.4: state preparation with binary angle control
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number bbb, there exist a natural number www and a finite circuit ccc on b+1+wb+1+wb+1+w qubits, built from arbitrary unitary one-qubit gates, the gate (a,t)↦(a,t⊕a)(a,t)\mapsto(a,t\mathbin{\oplus}a)(a,t)↦(a,t⊕a), and the gate (a,b,t)↦(a,b,t⊕(a∧b))(a,b,t)\mapsto(a,b,t\mathbin{\oplus}(a\land b))(a,b,t)↦(a,b,t⊕(a∧b)), each placed on injectively chosen ordered wires and acting identically on the other wires, such that the following holds for every Boolean string xxx of length bbb. Set

αx=2π∑i=0b−11{xi=true}2i+1.\alpha_x=2\pi\sum_{i=0}^{b-1}\frac{\mathbf 1_{\{x_i=\mathrm{true}\}}}{2^{i+1}}.αx​=2πi=0∑b−1​2i+11{xi​=true}​​.

Applying the circuit’s embedded gate matrices in list order to the standard basis vector with bits xxx, followed by one false bit and then www false bits, produces exactly

cos⁡αx ∣x,false,0w⟩+sin⁡αx ∣x,true,0w⟩.\cos\alpha_x\,|x,\mathrm{false},0^w\rangle+ \sin\alpha_x\,|x,\mathrm{true},0^w\rangle.cosαx​∣x,false,0w⟩+sinαx​∣x,true,0w⟩.

Here 0w0^w0w is the all-false string, and both b=0b=0b=0 and w=0w=0w=0 are allowed.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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