Lemma 2: rotated maximally entangled contraction
ProvedQAlgorithms.Papers.Independent.Intakenext100.P52.rotated_entangled_contractionprove2quantum
Let be a nonempty finite basis of cardinality , let be a unitary on this register, and let have unit norm. Define and . Then
The resource on registers 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 with decidable equality, every unitary complex matrix , and every vector with Euclidean norm , let , define when and otherwise, and put . Contracting against gives ; explicitly, for every ,
The statement includes .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.