cloned-wheel-side-information: For cloned wheel, A1 alone can be recovered exactly from free A2 at decoder with no message.
ProvedQAlgorithms.Papers.Independent.Renew46.P43.clonedWheelSideInformationFor the cloned-wheel ensemble, suppose the decoder receives the second copy as free quantum side information and must recover only the first local state. For every block length , there is a CPTP map from a one-dimensional message and the second word to the desired first word. The side information may be consumed.
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
/-- Unnumbered cloned-wheel side-information example, PDF p.57. The second copy
may be consumed. A one-dimensional message and the identity recovery suffice for
A1 alone; recovery of both copies is deliberately not the task in this model. -/
theorem clonedWheelSideInformation (n : ℕ) :
∃ T : Superop (Fin 1 × (Fin n → Fin 2)) (Fin n → Fin 2), IsChannel T ∧
∀ w : Fin n → Fin 4,
T (Matrix.kronecker (1 : Matrix (Fin 1) (Fin 1) ℂ)
(wordTensor (fun i => pureDensity (wheelVector (w i))))) =
wordTensor (fun i => pureDensity (wheelVector (w i))) := by sorry
end QAlgorithms.Papers.Independent.Renew46.P43
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , including , there exists a channel from matrices on to matrices on , meaning that for some finite family of rectangular matrices satisfying , such that for every word ,
where , , , and . Each tensor product has matrix entry . When , the word is empty, both matrix index sets are singletons, and the empty product is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.