Lemma 1: maximally entangled contraction
ProvedQAlgorithms.Papers.Independent.Intakenext100.P52.maximally_entangled_contractionprove2quantum
Let be a nonempty finite computational basis of cardinality , and let be a unit vector on this register. Put . With registers ordered , destructive contraction of the first two registers gives
The factor is retained: this is the subnormalized branch vector, rather than its normalized conditional state.
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 1, PDF p.3: the displayed output is a destructive bra contraction,
not a normalized conditional state or a projector retaining registers 1 and 2. -/
theorem maximally_entangled_contraction {I : Type*} [Fintype I] [Nonempty I] [DecidableEq I]
(alpha : Vec I) (halpha : IsState alpha) :
teleportContraction alpha (finiteMaxEntangled I) (finiteMaxEntangled I) =
((Fintype.card I : ℂ)⁻¹) • 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 1: 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 and every vector with Euclidean norm , let and let if and otherwise. The vector obtained by contracting and one copy of against another copy of equals ; explicitly, for every ,
The statement includes .
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.