dephasing-time-sharing-gain
OpenQAlgorithms.Papers.Independent.Gap20.P04.dephasingTimeSharingGainFor every qubit dephasing channel with parameter , let and be the coordinate families in the corresponding explicit capacity formula, with . Define by time sharing between and and lowering both rates; define by time sharing between and , lowering and permitting extra consumption . Then
Both resource regions strictly improve on their own endpoint time-sharing strategy. Properness requires an interior improvement; no strict improvement is asserted at the endpoints. The noiseless case is excluded.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P04
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap20.P04
open QAlgorithms
open QAlgorithms.Papers.Independent.Claimed50.P24
(Dilation PhysicalDilation ChannelEB Hadamard EqualMax AdditiveMax
dephasingDilation dephasingGamma cloningDilation)
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel dilationPower)
open QAlgorithms.Papers.Independent.Information100.P32 (diagonal)
open QAlgorithms.Papers.Independent.Dependency50.P24 (ensembleHolevoBits)
open QAlgorithms.Papers.Independent.Gap48.P44 (cqTimeSharing ceTimeSharing)
open scoped BigOperators Matrix ComplexConjugate
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I B E J D F : Type}
variable [Fintype I] [Fintype B] [Fintype E]
variable [Fintype J] [Fintype D] [Fintype F]
variable [DecidableEq I] [DecidableEq B] [DecidableEq E]
variable [DecidableEq J] [DecidableEq D] [DecidableEq F]
variable [Nonempty I] [Nonempty B] [Nonempty E]
variable [Nonempty J] [Nonempty D] [Nonempty F]
/-- PDF p.12: strict improvement in BOTH two-resource scenarios, only for 0<p<1. -/
theorem dephasingTimeSharingGain (p : ℝ) (h0 : 0 < p) (h1 : p < 1) :
cqTimeSharing (dephasingCQ p 0).1 (dephasingCQ p (1/2)).2 ⊂
capacityCQ (dephasingDilation p) ∧
ceTimeSharing (dephasingCE p 0).1 (dephasingCE p (1/2)).1
(dephasingCE p (1/2)).2 ⊂
capacityCE (dephasingDilation p) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P04
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every real , define , let by continuous functional calculus, and put , with . For any dilation , a valid purified family has positive finite label and reference dimensions, probabilities summing to , and unit purifications with reduced inputs . Using its receiver and environment partial-trace maps , define
Let and , where nonnegativity is coordinatewise. Define and , with defined by products of entries. Then both inclusions below are proper, so each left-hand set is contained in its right-hand set and is unequal to it:
The parameter endpoints are excluded, while are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.