Ordinary recovery fidelity and an optimal product recovery
OpenQAlgorithms.Papers.Independent.Intakenext100.P75.ordinaryRecovery_product_optimumFor density operators and on arbitrary finite-dimensional nonzero complex systems, define , where is CPTP and is squared fidelity. Then
There exist optimal individual CPTP maps and whose product is an optimal joint recovery for . The joint optimization still ranges over every joint CPTP map. This gives an attained product optimum without asserting that every optimizer has product form.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P75
namespace QAlgorithms.Papers.Independent.Intakenext100.P75
open scoped Matrix ComplexOrder
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Dependency50.P18 (bipartiteTensor)
variable {A B C D Ap Bp Cp R I J K L : Type}
variable [Fintype A] [DecidableEq A] [Nonempty A]
variable [Fintype B] [DecidableEq B] [Nonempty B]
variable [Fintype C] [DecidableEq C] [Nonempty C]
variable [Fintype D] [DecidableEq D] [Nonempty D]
variable [Fintype Ap] [DecidableEq Ap] [Nonempty Ap]
variable [Fintype Bp] [DecidableEq Bp] [Nonempty Bp]
variable [Fintype Cp] [DecidableEq Cp] [Nonempty Cp]
variable [Fintype R] [DecidableEq R] [Nonempty R]
/-- PDF p.2, (7) and following sentence: ordinary FoR is multiplicative
and SOME optimal joint recovery is a product of optimal individual maps. -/
theorem ordinaryRecovery_product_optimum
[Nonempty A] [Nonempty B] [Nonempty C] [Nonempty Ap] [Nonempty Bp] [Nonempty Cp] (rho : Mat (B × (A × C)))
(tau : Mat (Bp × (Ap × Cp))) (hrho : IsDensityMatrix rho) (htau : IsDensityMatrix tau) :
ordinaryRecovery (ordinaryTensor rho tau) = ordinaryRecovery rho * ordinaryRecovery tau ∧
∃ f : Superop C (A × C), ∃ g : Superop Cp (Ap × Cp),
IsChannel f ∧ IsChannel g ∧ IsChannel (productRecovery f g) ∧
fidelity rho (recovered rho f) = ordinaryRecovery rho ∧
fidelity tau (recovered tau g) = ordinaryRecovery tau ∧
fidelity (ordinaryTensor rho tau)
(recovered (ordinaryTensor rho tau) (productRecovery f g)) =
ordinaryRecovery (ordinaryTensor rho tau) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P75
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be finite nonempty types with decidable equality, and let be positive semidefinite trace-one matrices on and . Define , , and
where ranges over finite Kraus channels, meaning maps with ; define similarly. Let be their tensor product reordered onto , so each entry is the product of the corresponding entries of . Then , and there exist channels and attaining the two individual suprema. Their product map, obtained by tensoring on matrix units and regrouping the output as , is also a channel and attains .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.