Bennett’s local-discarding example increases clipped coherent information
ProvedQAlgorithms.Papers.Independent.Support50.P39.bennettDiscardingLet be nonzero finite dimensional registers, with Alice owning and and Bob owning . Let and be normalized density operators. Write , with entropies in bits. Suppose and . Regard as a state on . Then
Discarding a mixed local factor therefore strictly increases the paper's clipped coherent information, including when . The source attributes this example to Charles Bennett; its subsequent question about two-qubit states is not a theorem.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P39
namespace QAlgorithms.Papers.Independent.Support50.P39
noncomputable section
open QAlgorithms
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
/-- arXiv:quant-ph/0106080v3, PDF p.6, Bennett's example (attributed result).
For t=S(tau)>0 and b=I^B(sigma)>0 the initial clipped information is
max(b-t,0), and actually discarding Alice's T factor gives sigma and strictly
increases coherent information. No two-qubit conjecture is asserted. -/
theorem bennettDiscarding {T A B : Type*} [Fintype T] [Fintype A] [Fintype B]
[DecidableEq T] [DecidableEq A] [DecidableEq B]
[Nonempty T] [Nonempty A] [Nonempty B]
(tau : Matrix T T ℂ) (sigma : Matrix (A × B) (A × B) ℂ)
(htau : IsDensityMatrix tau) (hsigma : IsDensityMatrix sigma)
(ht : 0 < vnEntropy tau) (hb : 0 < clippedCoherentInformation sigma) :
discardFirstAlice (productFactor tau sigma) = sigma ∧
clippedCoherentInformation (productFactor tau sigma) =
max (clippedCoherentInformation sigma - vnEntropy tau) 0 ∧
clippedCoherentInformation (productFactor tau sigma) <
clippedCoherentInformation (discardFirstAlice (productFactor tau sigma)) := by sorry
end
end QAlgorithms.Papers.Independent.Support50.P39
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 trace , and let be a positive semidefinite complex matrix on with trace . For any matrix , write , where is applied by continuous functional calculus, and, for a bipartite matrix, write for the partial trace over its Alice subsystem and . Assume and . Define the matrix on by
and define the result of discarding the factor by
The declaration asserts all three conclusions
where the Alice subsystem for is , and that for is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.