Example IV.2: Uniform cloned wheel {|00>,|11>,|++>,|-->}: Rq,Fbar⊆{R1,R2≥1/2,R1+R2≥3/2}; Ra,Fbar={R1,R2≥0,R1+R2≥3/2}, so the regions can differ.
OpenQAlgorithms.Papers.Independent.Renew46.P43.clonedWheelRegionsConsider the uniform cloned-wheel source with letters , where . The two encoders receive the same randomly chosen local pure state. Quantum encoding means separate local CPTP maps; arbitrary encoding may prepare a new state from the known local pure letter.
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.2, PDF pp.47-48: explicit uniform cloned-wheel ensemble. Only an
outer bound for quantum encoding is claimed; the arbitrary region is exact. -/
theorem clonedWheelRegions :
quantumSourceRegion clonedWheel.multiple ⊆ wheelQuantumOuter ∧
arbitrarySourceRegion clonedWheel = nonnegativeSumRegion (3/2) ∧
arbitrarySourceRegion clonedWheel ≠ quantumSourceRegion clonedWheel.multiple := 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 , and write . The source chooses uniformly and supplies to each of two parties, using the same label for both. For a positive length and word , put ; the joint source state is , and every word has probability . Define to consist of real rate pairs for which there is a code for every positive , with positive integer compressed dimensions , separate quantum channels from each party’s qubits to its compressed register, and a joint quantum channel decoding both registers back to the two -qubit registers, such that for each party and . Here a quantum channel means a map admitting finitely many Kraus matrices , acting as , with . Define by the same requirements, except that each encoder is an arbitrary assignment of a positive semidefinite, trace-one matrix to each classical word , and the decoder receives in the displayed fidelity expression. These source systems have a single matrix block, so the decoder’s required vanishing of entries between different blocks imposes no further restriction. The theorem asserts , , and . Both regions here use convergence of average fidelity to one; their definitions impose no distortion criterion.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.