Corollary 3: symmetry of classical-correlation deficits
OpenQAlgorithms.Papers.Independent.Gap48.P35.classical_deficit_symmetryAll systems are finite nonzero-dimensional complex quantum systems. Density states are positive semidefinite with trace one, and is von Neumann entropy in bits. Write for formation, for maximal Holevo correlation measured on the second party, for asymptotic singlet preparation cost, for EPR distillation rate, for net common randomness, and for secret-key rate. A left arrow means communication from the second legitimate party to the first. Key secrecy includes all public transcripts. Asymptotic tasks use independent copies, vanishing error and no extra initially shared resource.
Let complement the density state . Here both right arrows mean communication from to the second party, or .
The deficits concern the entropies of the two second parties, not the entropy of .
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P35
namespace QAlgorithms.Papers.Independent.Gap48.P35
open scoped Matrix ComplexConjugate ComplexOrder
open Filter Topology
open Information100.P21 (Op)
open Information100.P08 (IsPure formation measuredCorrelation)
open Dependency50.P19 (marginalRA marginalRB)
noncomputable section
/-- PDF p.3, Corollary 3: BOTH source arrows point RIGHT; each commonLeft is therefore applied to the swapped state. -/
theorem classical_deficit_symmetry {A : Type} {B : Type} {C : Type}
[Fintype A] [DecidableEq A] [Nonempty A] [Fintype B] [DecidableEq B] [Nonempty B] [Fintype C] [DecidableEq C] [Nonempty C]
(rho : Op (A × B)) (sigma : Op (A × C))
(hrho : IsDensityMatrix rho) (hsigma : IsDensityMatrix sigma)
(hcomp : BComplement rho sigma) :
vnEntropy (traceLeft rho) - commonLeft (Dependency50.P19.flip rho) =
vnEntropy (traceLeft sigma) - commonLeft (Dependency50.P19.flip sigma) := by sorry
end
end QAlgorithms.Papers.Independent.Gap48.P35
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 on and on be positive semidefinite complex matrices of trace . Assume there exists a unit vector on whose pure density matrix has -marginal and -marginal . Write , , and , with spectral functional calculus. For a bipartite density matrix , define , where is the supremum of real such that some works for every and all sufficiently large positive : there is a finite POVM on , maps from its outcomes to positive finite message and key alphabets, and a key-indexed POVM on , with , key alphabet size at most , disagreement at most , and first-party key entropy at least . Explicitly, , disagreement is , and the key law is , with Shannon entropy ; each POVM consists of positive semidefinite matrices summing to the identity. Then
The directions here result from swapping the two systems before applying the definition that measures the second system and sends its message to the first.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.