Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Lemma 2: rotated maximally entangled contraction

Proved
QAlgorithms.Papers.Independent.Intakenext100.P52.rotated_entangled_contraction

by Gohan · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let III be a nonempty finite basis of cardinality ddd, let UUU be a unitary on this register, and let ∣α⟩|\alpha\rangle∣α⟩ have unit norm. Define ∣ϕ⟩=d−1/2∑i∣i,i⟩|\phi\rangle=d^{-1/2}\sum_i|i,i\rangle∣ϕ⟩=d−1/2∑i​∣i,i⟩ and ∣ϕ(U)⟩=(U†⊗I)∣ϕ⟩|\phi(U)\rangle=(U^\dagger\otimes I)|\phi\rangle∣ϕ(U)⟩=(U†⊗I)∣ϕ⟩. Then

(⟨ϕ(U)∣12⊗I3)(∣α⟩1⊗∣ϕ⟩23)=d−1U∣α⟩3.(\langle\phi(U)|_{12}\otimes I_3)(|\alpha\rangle_1\otimes|\phi\rangle_{23})=d^{-1}U|\alpha\rangle_3.(⟨ϕ(U)∣12​⊗I3​)(∣α⟩1​⊗∣ϕ⟩23​)=d−1U∣α⟩3​.

The resource on registers 2,32,32,3 is unrotated. This identity is the general gate-teleportation contraction, with its branch scale unchanged.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P52
Formal statement
noncomputable section

open scoped Matrix ComplexConjugate

namespace QAlgorithms.Papers.Independent.Intakenext100.P52

open QAlgorithms.Papers.Independent.Information100.P21 (Vec)

open QAlgorithms.Papers.Independent.Gap20.P01 (applyRect)

/-- Lemma 2, PDF p.3: unrotated resource on 23 and U† on measured ket 12;
the surviving gate is U, with no transpose. -/
theorem rotated_entangled_contraction {I : Type*} [Fintype I] [Nonempty I] [DecidableEq I]
    (U : Matrix I I ℂ) (hU : U ∈ Matrix.unitaryGroup I ℂ)
    (alpha : Vec I) (halpha : IsState alpha) :
    teleportContraction alpha (finiteMaxEntangled I) (rotatedEntangledKet U) =
      ((Fintype.card I : ℂ)⁻¹) • act U alpha := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P52

end
Source
An introduction to measurement based quantum computation, arXiv:quant-ph/0508124v2, PDF p. 3, Lemma 2: rotated maximally entangled contraction
Read-back

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

For every finite nonempty index type III with decidable equality, every unitary complex I×II\times II×I matrix UUU, and every vector α∈CI\alpha\in\mathbb C^Iα∈CI with Euclidean norm 111, let D=∣I∣D=|I|D=∣I∣, define ΩI(i,j)=D−1/2\Omega_I(i,j)=D^{-1/2}ΩI​(i,j)=D−1/2 when i=ji=ji=j and 000 otherwise, and put rU=(U†⊗ID)ΩIr_U=(U^\dagger\otimes I_D)\Omega_IrU​=(U†⊗ID​)ΩI​. Contracting against rUr_UrU​ gives D−1UαD^{-1}U\alphaD−1Uα; explicitly, for every ℓ∈I\ell\in Iℓ∈I,

∑i,j∈IrU(i,j)‾ αi ΩI(j,ℓ)=1D∑i∈IUℓiαi.\sum_{i,j\in I}\overline{r_U(i,j)}\,\alpha_i\,\Omega_I(j,\ell) =\frac1D\sum_{i\in I}U_{\ell i}\alpha_i.i,j∈I∑​rU​(i,j)​αi​ΩI​(j,ℓ)=D1​i∈I∑​Uℓi​αi​.

The statement includes D=1D=1D=1.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me