Bridge to Lemma 7 — Werner's completed cloner on pure tensor powers
ProvedMixedCloning.Optimal.werner_pure_fidelityLet be a finite set with elements, let , and let be any matrix on . Write for the dimension of the symmetric subspace of , and for Werner's cloner from to copies, completed by off the symmetric input corner. Let be the squared fidelity. For every unit vector :
- is a quantum state;
- its fidelity with the ideal output is
This restates Lemma 7 of the source (Werner's cloner [Wer98]) for the completed map werner on which this mission's PCT map is built. The Lemma 7 milestone is linked to a theorem in a different encoding, which also requires ; this bridge covers every and is stated directly for the mission's map. In the proof of Proposition 10 it is applied with the index set of , so , and combined with Lemma 6.
Formalization Note Werner's map is the platform function werner a n k τ, and the squared fidelity is fidelity, the square of the published root fidelity. The completion term vanishes on , so no hypothesis on is needed. The platform's proved theorem QAlgorithms.Papers.Independent.Support21.P16.canonical_fidelity gives the same overlap value in a different encoding.
Differences from the source:
- encoding: Werner's map on the symmetric subspace → the map completed by an arbitrary ; reason: the completion term vanishes on pure tensor powers
- addition: the output is a quantum state; reason: implicit in the source, where is a channel, and needed to apply data processing of fidelity
import Definitions.Def_MixedCloning_Optimal_Model noncomputable section open Matrix MeasureTheory open scoped Matrix ComplexConjugate ComplexOrder Matrix.Norms.Elementwise
namespace MixedCloning.Optimal
attribute [local instance] Classical.propDecidable Classical.decEq
/-- Lemma 7 (PDF p.11), Werner [Wer98], in this mission's encoding: on `|v⟩⟨v|^{⊗n}` the completed
Werner map outputs a state whose fidelity with `|v⟩⟨v|^{⊗(n+k)}` is `D[n]/D[n+k]`, `D = card a`. -/
theorem werner_pure_fidelity {a : Type} [Fintype a] [DecidableEq a] (n k : ℕ) (tau : Op (Word a (n+k)))
(v : EuclideanSpace ℂ a) (hv : ‖v‖ = 1) :
IsState (werner a n k tau (tensorPower n (pure v))) ∧
fidelity (werner a n k tau (tensorPower n (pure v))) (tensorPower (n+k) (pure v)) =
(symDimension (Fintype.card a) n : ℝ) / symDimension (Fintype.card a) (n+k) := by sorry
end MixedCloning.Optimal