Consequence 23
OpenQAlgorithms.Papers.Independent.Intakenext100.P56.discord_recovery_minimumAll systems are finite-dimensional complex Hilbert spaces with nonempty finite bases. States are positive semidefinite operators of trace one; pure kets have norm one. All marginal states below are partial traces of the stated joint state. Logarithms are natural, and spectral powers vanish on the kernel, including at exponent zero.
Assume the sandwiched conditional-information parameter conjecture (5.41), including its value at one. For any state ,
Here is squared Uhlmann fidelity. With , the map prepares after outcome when , and prepares otherwise. It is a single entanglement-breaking map. The minimum is attained; , and full rank is not required.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P56
noncomputable section
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P56
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw entropy average holevo)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz extendedLog marginalAB)
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)
open QAlgorithms.Papers.Independent.Dependency50.P07 (bipartiteProduct)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity)
open QAlgorithms.Papers.Independent.Advance50.P25 (renyiEntropyNats)
variable {A B C D E X : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype E] [Fintype X]
variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty E] [Nonempty X]
open scoped Matrix.Norms.L2Operator
/-- arXiv:1410.1443v3, PDF pp.22–23, Consequence 23, (5.47).
The minimum is attained; rho_A need not be invertible. -/
theorem discord_recovery_minimum (hconjecture : SandwichedParameterConjecture)
(rho : Op (A × B)) (hrho : IsDensityMatrix rho) :
∃ m : ℕ, 0 < m ∧ ∃ phi : Fin m → EuclideanSpace ℂ A,
KetPOVM phi ∧ discordRecoveryCost rho phi ≤ renyiDiscord 1 rho ∧
∀ n : ℕ, 0 < n → ∀ other : Fin n → EuclideanSpace ℂ A,
KetPOVM other → discordRecoveryCost rho phi ≤ discordRecoveryCost rho other := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P56
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Assume the following global parameter-monotonicity statement: for every triple of finite nonempty register types , every positive semidefinite trace-one matrix on , and all real , one has . Here is spectral functional calculus with scalar value at and otherwise; writing , the value at is , while for ,
with acting on . For every positive semidefinite trace-one matrix on finite registers , there then exist a positive integer and vectors , , satisfying , for which the cost is at most and is no larger than for every positive integer and every other family , , satisfying the same completeness equation. To define this cost, set , , , and
where , and for , otherwise in the extended reals. The quantity is the extended-real infimum, over all positive finite POVMs on , of , where , , , and equals when , and otherwise. The minimizing vectors may be zero or unnormalized, and a zero fidelity gives recovery cost .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.