§4.3, equation (11): entanglement fidelity bounds input-output fidelity
ProvedQAlgorithms.Papers.Independent.Support50.P41.stateFidelityBoundprove2quantum
For every density matrix , CPTP map on its nonzero finite-dimensional system, and normalized purification of ,
Here is squared mixed-state fidelity. This compares entanglement preservation with state preservation.
Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P41
Formal statement
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P41
open QAlgorithms
open QAlgorithms.Entanglement (IsCompletelyPositive)
open QAlgorithms.Papers.Independent.Dependency50.P40 (IsPurification purificationFidelity)
open QAlgorithms.Papers.Independent.Dependency50.P45 (entropyExchange)
open QAlgorithms.Papers.Independent.Information100.P08 (canonicalPurification)
open QAlgorithms.Papers.Independent.Information100.P34 (choi dephasing)
open QAlgorithms.Papers.Independent.Dependency50.P38 (vectorizeInputFirst)
open QAlgorithms.Papers.Independent.Gap20.P06 (dilationChannel environmentOutput dilatedVector)
open QAlgorithms.Papers.Independent.Information100.P50 (complementaryMap)
open QAlgorithms.Papers.Independent.Renew46.P43 (IsCountablePOVM classicalKLTerm countableEntropy)
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
attribute [local instance] Classical.propDecidable Classical.decEq
-- The accepted generic dilation functions fix classical equality on each factor.
-- Match that instance for Fin before forming their product unitary groups.
local instance (priority := 2000) (n : ℕ) : DecidableEq (Fin n) := Classical.decEq _
/-- PDF p.16, (11): squared input-output fidelity bounds entanglement fidelity. -/
theorem stateFidelityBound {d a : ℕ} [NeZero d]
(Phi : Superop (Fin d) (Fin d)) (hPhi : IsChannel Phi)
(rho : Matrix (Fin d) (Fin d) ℂ) (hrho : IsDensityMatrix rho)
(psi : EuclideanSpace ℂ (Fin a × Fin d)) (hpsi : IsPurification rho psi) :
purificationFidelity psi Phi ≤ rootFidelity rho (Phi rho)^2 := by sorry
end QAlgorithms.Papers.Independent.Support50.P41
end
Source
Sending quantum entanglement through noisy channels, arXiv:quant-ph/9604023v1, PDF p. 16, §4.3, equation (11): entanglement fidelity bounds input-output fidelity
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let and be integers, and let admit a finite representation for every , with . Let be positive semidefinite with trace one, and let satisfy and , where the partial trace sums over equal reference indices. Then
The square roots are spectral matrix square roots, and the amplification applies to each system block. The quantified case cannot satisfy the unit-vector hypothesis.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.