Generalized fidelity of recovery is multiplicative
OpenQAlgorithms.Papers.Independent.Intakenext100.P75.generalizedRecovery_multiplicativeLet be finite-dimensional nonzero complex quantum systems, and let be density operators. Define the squared fidelity and generalized recovery fidelity by , where ranges over every CPTP map. Then
The two marginals may differ, and the two marginals may differ. The joint optimization permits arbitrary joint channels. This identity is the paper's main technical multiplicativity result.
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]
/-- Proposition 2, PDF p.4, (26): generalized recovery is multiplicative.
The A marginals may differ; the joint optimization allows all joint channels. -/
theorem generalizedRecovery_multiplicative
[Nonempty A] [Nonempty B] [Nonempty C] [Nonempty Ap] [Nonempty Bp] [Nonempty Cp]
(rho : Mat (A × B)) (tau : Mat (Ap × Bp))
(sigma : Mat (A × C)) (omega : Mat (Ap × Cp))
(hrho : IsDensityMatrix rho) (htau : IsDensityMatrix tau)
(hsigma : IsDensityMatrix sigma) (homega : IsDensityMatrix omega) :
generalizedRecoveryFidelity (bipartiteTensor rho tau) (bipartiteTensor sigma omega) =
generalizedRecoveryFidelity rho sigma * generalizedRecoveryFidelity tau omega := 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 , respectively. Write
where each map in the supremum admits a finite Kraus representation with Kraus operators satisfying , and square roots are defined by spectral functional calculus. For matrices on two bipartite systems, define the grouped tensor product by . Then
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.