Example IV.8: Uniform {PhiPlus,PhiMinus} EPR source: Rq,Fe⊆Rq,Fbar⊆{R1,R2≥1/2}.
OpenQAlgorithms.Papers.Independent.Renew46.P43.eprSourceRegionsConsider the source uniformly distributed on the two Bell states , with each party holding one qubit. Its average is . The following are necessary rate constraints, not an exact quadrant characterization.
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
/-- Example IV.8, PDF pp.51-52: uniform Bell plus/minus ensemble. These are
necessary individual bounds, with no claim that the entire quadrant is achievable. -/
theorem eprSourceRegions :
entanglementSourceRegion eprSource (by intros; rfl) ⊆ quantumSourceRegion eprSource ∧
quantumSourceRegion eprSource ⊆ halfRateRegion := 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 and . The source chooses either vector with probability and supplies its two qubits to two separate parties. For each positive length and word , let be the density matrix of , with factors regrouped by party, and let . A permitted code at length has positive compressed dimensions , separate quantum channels from each party’s qubits to its compressed register, and a joint decoding channel back to both parties’ -qubit registers; write . Each channel must admit a finite Kraus representation with . The source systems each have a single matrix block, so the decoder’s condition on entries between different blocks is automatic. Let be the set of real pairs admitting such codes for every positive , with and . Let instead require the same rate limits and , where and the canonical purification vector has coordinates in the computational basis. The theorem asserts and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.