Theorem 8: unassisted simultaneous bipartite entanglement generation
OpenQAlgorithms.Papers.Independent.Gap48.P39.two_epr_generationLet be a finite-dimensional CPTP channel, and let be a unit pure state on positive-dimensional systems. The systems are retained locally by Alice; their joint state need not factor. Put and compute both marginal coherent informations in bits. If both are strictly positive, then
Here is the closed unassisted two-EPR generation region. Its codes have one joint pure block preparation with locally retained references and separate receiver CPTP decoders, and are tested by a single squared-fidelity criterion against the product of independent Alice–Bob and Alice–Charlie EPR states. Ranks follow , errors vanish, and there is no initial shared entanglement or final side communication. This generates the two computed resources simultaneously, rather than a GHZ/EPR pair.
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 8, PDF p.13: both positive coherent informations achievable
simultaneously, with independent final EPRs. Alice's reference factors need not be independent. -/
theorem two_epr_generation [Nonempty A] [Nonempty B] [Nonempty C]
{AB AC : Type} [Fintype AB] [Fintype AC] [DecidableEq AB] [DecidableEq AC]
[Nonempty AB] [Nonempty AC] (N : Superop A (B × C)) (hN : IsChannel N)
(psi : EuclideanSpace ℂ ((AB × AC) × A)) (hp : IsState psi)
(hB : 0 < (twoEprInformation N psi).1) (hC : 0 < (twoEprInformation N psi).2) :
twoEprInformation N psi ∈ twoEprCapacity N := 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 finite nonempty types with decidable equality. Let be a map from complex matrices on to complex matrices on admitting a finite Kraus representation , , and let be a norm-one vector on . Apply to the -indexed blocks of , retaining , to obtain . Let be its marginal on , formed by summing matching indices, and let be its marginal on , formed by summing matching indices. Set
where , , using continuous functional calculus. If and , then belongs to the closure in of the following set of nonnegative pairs : for every , all sufficiently large positive integers admit a norm-one vector on , with , , and separate decoder maps from matrices on to dimensions , each having a finite normalized Kraus representation. Apply the linear word map
and then these decoders to the word blocks of , retaining the reference pair, to obtain . It must satisfy , where has entry exactly when reference and decoded labels match on both row and column, and zero otherwise, and . The conclusion is membership in this closure; the hypotheses require both displayed information quantities to be strictly positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.