Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 16: the phase-halving circuit applies R(θ)R(\theta)R(θ) to both inputs and returns the catalyst

Proved
ConstOverheadCompile.Main.proposition_16

by mikedeng1 · Nov 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

magic-statesp2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-computing

Let θ∈R\theta\in\mathbb Rθ∈R and let ψ,ϕ∈C2\psi,\phi\in\mathbb C^2ψ,ϕ∈C2. The phase-halving circuit of Figure 1 (right) satisfies

R(θ)∣+⟩⊗∣ψ⟩⊗∣ϕ⟩⊗∣0⟩ ⟼ R(θ)∣+⟩⊗R(θ)∣ψ⟩⊗R(θ)∣ϕ⟩⊗∣0⟩,R(\theta)|+\rangle\otimes|\psi\rangle\otimes|\phi\rangle\otimes|0\rangle\ \longmapsto\ R(\theta)|+\rangle\otimes R(\theta)|\psi\rangle\otimes R(\theta)|\phi\rangle\otimes|0\rangle ,R(θ)∣+⟩⊗∣ψ⟩⊗∣ϕ⟩⊗∣0⟩ ⟼ R(θ)∣+⟩⊗R(θ)∣ψ⟩⊗R(θ)∣ϕ⟩⊗∣0⟩,

as an exact equality of vectors, with no global phase.

The catalyst R(θ)∣+⟩R(\theta)|+\rangleR(θ)∣+⟩ is returned unchanged, so one R(2θ)R(2\theta)R(2θ) gate yields two applications of R(θ)R(\theta)R(θ); this is the conversion (13) used to replenish the bank in Algorithm 1.

Differences from the source:

  • generalization: single-qubit states ∣ψ⟩|\psi\rangle∣ψ⟩, ∣ϕ⟩|\phi\rangle∣ϕ⟩ → arbitrary vectors in C2\mathbb C^2C2; reason: the circuit is linear, and states are a special case.
Preamble
import Mathlib
import Definitions.Def_ConstOverheadCompile_Main_Gadgets
Formal statement
namespace ConstOverheadCompile.Main

open QAlgorithms

/-- Proposition 16, p.17 (Eq. (71)): the phase-halving circuit of Figure 1 (right) maps
`R(θ)|+⟩ ⊗ ψ ⊗ φ ⊗ |0⟩` to `R(θ)|+⟩ ⊗ R(θ)ψ ⊗ R(θ)φ ⊗ |0⟩`, exactly, for every real `θ` and
all single-qubit vectors `ψ, φ`. -/
theorem proposition_16 (θ : ℝ) (ψ φ : Bool → ℂ) :
    (phaseHalving θ).unitary.mulVec (vec4 (resourceVec θ) ψ φ (basisVec false)) =
      vec4 (resourceVec θ) ((rot θ).mulVec ψ) ((rot θ).mulVec φ) (basisVec false) := by sorry

end ConstOverheadCompile.Main
Source
Chenyi Zhang, Xinyu Tan, Robin Kothari, David Gosset, Craig Gidney, Quantum circuit compilation with constant overhead, STOC 2027 submission #397 (October 2026), source.pdf SHA-256 b848604016de1821f5f693c59f328e0b2a9e535bca0b37bb664e6f40dbe3681f, p.17, Appendix B, Proposition 16, Eq. (71); circuit: p.6, Figure 1 (right)
Human review
  • Endorsed by Shuze Chen · Nov 11, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Nov 11, 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