Unnumbered result: pinching-channel EPR–GHZ boundary
OpenQAlgorithms.Papers.Independent.Gap48.P39.pinching_qq_boundaryLet be any full-environment isometric extension of qutrit rank- pinching: Bob's marginal retains the upper-left two-by-two block and the final diagonal entry and deletes all coherences between those blocks. Its closed unassisted EPR–GHZ region, in coordinate order , is the nonnegative downward closure of
Here is binary entropy in bits; a block code is tested jointly against the product of GHZ and EPR targets using squared fidelity, with no initial shared resources or side communication. In particular and are allowed. This follows the explicit equation (25) and Theorem 6, recording the paper's incompatible Figure 1 rather than swapping 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]
/-- Unnumbered specialization after Theorem 6, PDF p.11 and (25) p.8.
Coordinates are (GHZ,EPR_B); follow (25) rather than the erroneous Figure 1. -/
theorem pinching_qq_boundary [Nonempty C]
(U : Matrix (Fin 3 × C) (Fin 3) ℂ) (hU : Uᴴ * U = 1)
(hP : ∀ rho, traceRight (conjSuperop U rho) = qutritPinching rho) :
qqCapacity (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 , the partial trace over of retains exactly the entries whose row and column indices both belong to or both equal , and sets the other entries to zero. Set . Its EPR–GHZ capacity is the closure of all nonnegative pairs such that for every , for every sufficiently large integer , with and , there exist a unit vector on , a channel from Bob’s output to , and a channel from Charlie’s output to , such that after and these decoders, leaving the reference registers untouched, the squared fidelity with an EPR state between the first reference and Bob’s first output, tensored with the pure GHZ state on the other reference and outputs, is at least . Channels have finite Kraus representations with , and squared fidelity is . The asserted capacity is exactly
The closure uses the usual topology on , , and zero rates are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.