Example IV.9: Uniform cloned cross {|00>,|11>}: Rq,Fe⊆{R1,R2≥1/2}, but Rq,Fbar={R1,R2≥0,R1+R2≥1}. Hence Rq,Fbar differs from Rq,Fe in general an
OpenQAlgorithms.Papers.Independent.Renew46.P43.clonedCrossRegionsConsider the uniform cloned-cross ensemble . It has the same average state as the Bell plus/minus source. Its quantum average-fidelity region is exact below, whereas only an outer bound is asserted for entanglement fidelity. In particular the two fidelity regions differ, and the average-fidelity region differs from that of the EPR ensemble despite their identical averages.
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.9, PDF p.52: same average as the EPR source, different ensemble.
No claim that the Fe region contains the half/half corner is made. -/
theorem clonedCrossRegions :
entanglementSourceRegion clonedCross.multiple (by intros; rfl) ⊆ halfRateRegion ∧
quantumSourceRegion clonedCross.multiple = nonnegativeSumRegion 1 ∧
quantumSourceRegion clonedCross.multiple ≠
entanglementSourceRegion clonedCross.multiple (by intros; rfl) ∧
clonedCross.multiple.average = eprSource.average ∧
quantumSourceRegion clonedCross.multiple ≠ quantumSourceRegion eprSource := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Consider two parties, each with a two-dimensional quantum system, and the source that chooses a uniformly random bit and supplies the product state . Here are the coordinate basis vectors. Define its quantum source region as follows: for every block length , choose positive integer dimensions , a channel encoding each party’s systems into its respective dimension, and a joint decoding channel back to the original two blocks; the rates must converge to , and the average overlap , averaged over the source words with their product probabilities, must converge to , where is the original word state and its decoded state. Every channel here must admit a finite Kraus representation with ; the two encoders act by their tensor product, followed by the joint decoder. The required restriction that decoded positive matrices have zero entries between different blocks imposes no additional condition here, since every system’s block label is . Define the entanglement source region using the same codes and rate convergence, but require instead that the overlap of a purification of the average word state with its image under the identity on the reference and the encoding–decoding channel converge to : for an average state , the purification vector has coordinates , and this overlap is . The declaration asserts that the entanglement source region is contained in , that the quantum source region is exactly , and that these two regions differ. It also asserts that the source’s average state equals that of the source choosing uniformly between and —both averages are —while their quantum source regions, defined by the same average-overlap criterion, differ. All region definitions use positive block lengths tending to infinity.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.