Corollary IV.13: For c1h1 source, (H(X|Y),H(Y)) is quantum-Fbar achievable.
OpenQAlgorithms.Papers.Independent.Renew46.P43.classicalQuantumCornerConsider a finite pure-letter iid multiple source, allowing correlated classical laws and entangled source letters where the model permits them. Quantum rate regions use separate local CPTP encoders and a joint CPTP decoder, with rates converging and the named average half-trace, average-fidelity or entanglement-fidelity error tending to zero. Entanglement fidelity is used only when every sender system is a full matrix algebra. For classical/hybrid senders , conditional entropies are evaluated in the computed joint source average, the Y rate is exactly , and every sender subset, including empty/full, is tested.
This is the source result with its stated operational or information-theoretic domain.
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
noncomputable section
namespace QAlgorithms.Papers.Independent.Renew46.P43
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal Matrix.Norms.L2Operator
open Filter MeasureTheory
open QAlgorithms.Papers.Independent.Information100.P08 (IsPure)
open QAlgorithms.Papers.Independent.Information100.P06 (Below)
open QAlgorithms.Papers.Independent.Information100.P60 (copies relativeBits)
open QAlgorithms.Papers.Independent.Dependency50.P19 (count both)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation)
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Claimed50.P40 (InBlocks)
attribute [local instance] QAlgorithms.Papers.Independent.Renew46.P43.matrixMeasurableSpace
/-- Corollary IV.13, PDF p.54: correlated classical/hybrid source. -/
theorem classicalQuantumCorner (S : HybridSource 1) :
S.withYRate (fun _ => S.subsetEntropy Finset.univ) ∈ quantumSourceRegion S.multiple := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let specify a positive classical alphabet size , a finite quantum system of positive dimension with block labels , a positive integer , distinct matrices , and a probability mass function on . Each , including any never assigned positive probability, must equal for a unit vector , and must have zero entries between different quantum blocks. Define
where is applied by continuous functional calculus and . Then there is a compression code at every positive integer length , with separate encoding channels for the classical register and the quantum register, positive compressed dimensions , and a joint decoding channel, such that
Every encoding and decoding channel admits a finite Kraus representation with . On every positive semidefinite input, the decoder’s output has zero entries between different classical words, and between quantum words whose block labels differ at any position. More precisely, let be the joint decoder composed with the tensor product of the two encoders, and for a sequence let , regrouped into classical and quantum registers. The codes satisfy
Thus the asserted convergence uses this average overlap criterion; the statement imposes no strict positivity requirement on the probabilities.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.