Unnumbered result (25): pinching-channel CQ boundary
OpenQAlgorithms.Papers.Independent.Gap48.P39.pinching_cq_boundaryLet be qutrit pinching into the span of and its orthogonal one-dimensional complement: it retains matrix entries and deletes the other off-block entries. Let be any rectangular isometry with , so Charlie holds the entire environment. Its unassisted common-classical/Alice–Bob-EPR region is the nonnegative downward closure of
where is binary entropy in bits. The operational region uses vanishing maximum joint squared-fidelity error and is closed. Equation (25) gives the intended boundary, including , and the segment , . The incompatible Figure 1 is recorded as a source discrepancy rather than used to swap the resources.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P39
noncomputable section
open scoped BigOperators Matrix ComplexConjugate
namespace QAlgorithms.Papers.Independent.Gap48.P39
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Claimed50.P08 (cqBlocks holevoInfo)
open QAlgorithms.Papers.Independent.Dependency50.P19 (both epr mutualInformation marginalRA marginalRB)
open QAlgorithms.Papers.Independent.Information100.P58 (Distribution)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity conditionalEntropy groupedChannelPower)
attribute [local instance] Classical.propDecidable Classical.decEq
variable {A B C X T E : Type}
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype X] [DecidableEq X]
variable [Fintype T] [DecidableEq T] [Fintype E] [DecidableEq E]
/-- Equation (25), PDF p.8: ANY full-environment isometric extension of P.
Source correction: follow (25), not the incompatible Figure 1. -/
theorem pinching_cq_boundary [Nonempty C]
(U : Matrix (Fin 3 × C) (Fin 3) ℂ) (hU : Uᴴ * U = 1)
(hP : ∀ rho, traceRight (conjSuperop U rho) = qutritPinching rho) :
cqGenerationCapacity (conjSuperop U) = pinchingRegion := by sorry
end QAlgorithms.Papers.Independent.Gap48.P39
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be a nonempty finite index type with decidable equality, and let satisfy . Assume that for every complex matrix , including matrices that are not density matrices, the partial trace over of is obtained from by setting entries between and to zero and leaving every other entry unchanged. Set . Its classical–quantum generation capacity is defined as the closure of all nonnegative pairs with this property: for every , for every sufficiently large integer , putting and , there exist unit vectors for every , a Bob instrument from to with outcome , and a Charlie POVM on with outcome , such that for every the decoded state after has squared fidelity at least with the state whose labels satisfy and whose untouched reference and Bob’s quantum output form the EPR state . An instrument has finitely many Kraus matrices satisfying ; a POVM consists of positive semidefinite matrices summing to ; squared fidelity is . The theorem asserts that this capacity is exactly
The closure is in the usual topology, the entropy uses , and zero rates are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.