Proposition 10, proof step — the PCT fidelity is at least the worst purification bound
ProvedMixedCloning.Optimal.pct_fidelity_ge_of_purificationsFix natural numbers . Let be a random purification channel, that is, a channel satisfying the specification of Section 2.3:
for every state of rank at most and every unit purification of . Let be any matrix on , let be Werner's cloner completed by , and let be the PCT map. Let be the squared fidelity.
Let be a state on of rank at most , and let . Suppose that every unit vector with satisfies
Then
This packages the first steps of the proof of Proposition 10. The PCT output is the expectation, over Haar-random purifications , of . Concavity of the square-root fidelity [Wat18, Corollary 3.26] then bounds the fidelity of the average from below by the average fidelity. As the source puts it, a bound that holds for all therefore transfers to the PCT output.
Formalization Note The specification of is the platform predicate IsRPC d r n R. The hypothesis quantifies over all unit purifications in , which contains every . The bound is stated for squared fidelity; for it is trivial, and for it follows from the square-root form.
Differences from the source:
- encoding: the expectation-form inequality for followed by 'since this holds for all ' → a single implication from a pointwise lower bound to the same bound on the PCT output; reason: this is exactly how the source combines the steps
- encoding: Werner's map on the symmetric subspace → the map completed by an arbitrary ; reason: the completion term vanishes on the random purifications
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
/-- Proof of Proposition 10 (PDF p.16), first displays: the PCT output is the average over random
purifications of the traced Werner output, so by concavity of the square-root fidelity
[Wat18, Corollary 3.26] a lower bound valid for every purification transfers to the PCT output. -/
theorem pct_fidelity_ge_of_purifications (d r n k : ℕ)
(R : QAlgorithms.Superop (Word (Fin d) n) (Word (Fin d × Fin r) n)) (hR : IsRPC d r n R)
(tau : Op (Word (Fin d × Fin r) (n+k)))
(rho : Op (Fin d)) (hrho : IsState rho) (hrank : rho.rank ≤ r) (c : ℝ)
(hc : ∀ u : EuclideanSpace ℂ (Fin d × Fin r), ‖u‖ = 1 →
(fun i j => ∑ z : Fin r, pure u (i,z) (j,z)) = rho →
c ≤ fidelity (partialTrace (n+k) (werner (Fin d × Fin r) n k tau (tensorPower n (pure u))))
(tensorPower (n+k) rho)) :
c ≤ fidelity (pct d r n k R tau (tensorPower n rho)) (tensorPower (n+k) rho) := by sorry
end MixedCloning.Optimal