Additivity of order-one-half relative entropy of recovery
OpenQAlgorithms.Papers.Independent.Intakenext100.P75.halfRecovery_additiveFor density operators define the sandwiched order-one-half divergence in bits by , where is squared fidelity; its value is exactly when fidelity is zero. For a tripartite density operator on finite-dimensional nonzero complex systems and any positive integer ,
Both domains contain every CPTP map of the indicated type, and both minima are attained. No support-containment guard is imposed for positive fidelity. This expresses multiplicativity as additivity of the relative entropy of recovery.
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.7, (49): additivity of order-one-half recovery divergence for
positive copy counts; the minimum values are attained by actual CPTP maps. -/
theorem halfRecovery_additive
[Nonempty A] [Nonempty B] [Nonempty C] (rho : Mat (B × (A × C))) (hrho : IsDensityMatrix rho)
(n : ℕ) (hn : 0 < n) :
halfRecovery (ordinaryCopies rho n) = (n : EReal) * halfRecovery rho ∧
(∃ f : Superop C (A × C), IsChannel f ∧
halfRenyi rho (recovered rho f) = halfRecovery rho) ∧
(∃ f : Superop (Fin n → C) ((Fin n → A) × (Fin n → C)), IsChannel f ∧
halfRenyi (ordinaryCopies rho n) (recovered (ordinaryCopies rho n) f) =
halfRecovery (ordinaryCopies rho n)) := 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, let be a positive semidefinite complex matrix on with , and let be a natural number with . Define the matrix on , where denotes functions from to , by
For either or , and a channel from its -register to its combined -registers, define the recovered matrix by
Here a channel means a map admitting a finite Kraus representation with ; for , the indices in this formula are entire register strings. For matrices on the same register, set
where the square roots are given by the real square-root functional calculus, and define the extended-real quantity
Then
with multiplication in the extended reals. Moreover, there exists a channel attaining the infimum for , and there exists a channel attaining the infimum for . These are existence assertions, without uniqueness; zero-fidelity comparisons contribute , and zero copies are excluded by .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.