Theorem 6: generalized-dephasing EPR–GHZ capacity
OpenQAlgorithms.Papers.Independent.Gap48.P39.generalized_dephasing_qqLet be nonempty finite basis sets and let be unit vectors, not necessarily orthogonal. For the isometric broadcast channel , the closed unassisted EPR–GHZ region, in coordinate order , equals
where the union ranges over distributions with and . Entropies are in bits. The operational code has one pure encoding, separate receiver CPTP decoders and a single vanishing joint squared-fidelity error to the product of independent GHZ and EPR states with the source's floor-exponential ranks. This is a single-letter equality; no extra environment is introduced into the entropy difference.
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]
/-- Theorem 6, PDF pp.11–12,14: isometric generalized-dephasing EPR–GHZ
capacity. The entropy is H(C|T), and coordinates are (GHZ,EPR_B). -/
theorem generalized_dephasing_qq [Nonempty X] [Nonempty C] (D : DephasingData X C) :
qqCapacity (conjSuperop D.isometry) = dephasingRegion D (fun rho => rho) := 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 nonempty finite register index types with decidable equality, and choose a unit vector for every . Set if , and otherwise, and let ; equivalently, . Define its EPR–GHZ capacity to be 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 , whose decoded state after , leaving the reference registers untouched, has squared fidelity at least 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. A channel means a map with finitely many Kraus matrices satisfying , and squared fidelity is . The assertion is that this capacity equals exactly the nonnegative pairs for which there exist and probabilities summing to , such that, with and ,
Here , with applied by continuous functional calculus. All closures use the usual topology on ; zero rates and zero probabilities are allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.