Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

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.

Open
QAlgorithms.Papers.Independent.Renew46.P43.clonedWheelRegions

by Goku · Oct 22, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Consider the uniform cloned-wheel source with letters ∣00⟩,∣11⟩,∣++⟩,∣−−⟩|00\rangle,|11\rangle,|++\rangle,|--\rangle∣00⟩,∣11⟩,∣++⟩,∣−−⟩, where ∣±⟩=(∣0⟩±∣1⟩)/2|\pm\rangle=(|0\rangle\pm|1\rangle)/\sqrt2∣±⟩=(∣0⟩±∣1⟩)/2​. 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.

Rq,Fˉ⊆{R1,R2≥12, R1+R2≥32},Ra,Fˉ={R1,R2≥0, R1+R2≥32},Ra,Fˉ≠Rq,Fˉ.\mathcal R_{q,\bar F}\subseteq\{R_1,R_2\ge\tfrac12,\ R_1+R_2\ge\tfrac32\},\quad\mathcal R_{a,\bar F}=\{R_1,R_2\ge0,\ R_1+R_2\ge\tfrac32\},\quad\mathcal R_{a,\bar F}\ne\mathcal R_{q,\bar F}.Rq,Fˉ​⊆{R1​,R2​≥21​, R1​+R2​≥23​},Ra,Fˉ​={R1​,R2​≥0, R1​+R2​≥23​},Ra,Fˉ​=Rq,Fˉ​.

This is the source result with its stated operational or information-theoretic domain.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Renew46_P43
Formal statement
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
Source
Coding Theorems of Quantum Information Theory, arXiv:quant-ph/9907077v1, PDF p. 47, Example IV.2
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let v0=∣0⟩v_0=|0\ranglev0​=∣0⟩, v1=∣1⟩v_1=|1\ranglev1​=∣1⟩, v2=(∣0⟩+∣1⟩)/2v_2=(|0\rangle+|1\rangle)/\sqrt2v2​=(∣0⟩+∣1⟩)/2​, and v3=(∣0⟩−∣1⟩)/2v_3=(|0\rangle-|1\rangle)/\sqrt2v3​=(∣0⟩−∣1⟩)/2​, and write ρx=vxvx†\rho_x=v_xv_x^\daggerρx​=vx​vx†​. The source chooses x∈{0,1,2,3}x\in\{0,1,2,3\}x∈{0,1,2,3} uniformly and supplies ρx\rho_xρx​ to each of two parties, using the same label for both. For a positive length ℓ\ellℓ and word w∈{0,1,2,3}ℓw\in\{0,1,2,3\}^{\ell}w∈{0,1,2,3}ℓ, put ρw=⨂t=0ℓ−1ρwt\rho_w=\bigotimes_{t=0}^{\ell-1}\rho_{w_t}ρw​=⨂t=0ℓ−1​ρwt​​; the joint source state is ρw⊗ρw\rho_w\otimes\rho_wρw​⊗ρw​, and every word has probability 4−ℓ4^{-\ell}4−ℓ. Define Q\mathcal QQ to consist of real rate pairs RRR for which there is a code for every positive ℓ\ellℓ, with positive integer compressed dimensions d0,ℓ,d1,ℓd_{0,\ell},d_{1,\ell}d0,ℓ​,d1,ℓ​, separate quantum channels Ei,ℓE_{i,\ell}Ei,ℓ​ from each party’s ℓ\ellℓ qubits to its compressed register, and a joint quantum channel DℓD_\ellDℓ​ decoding both registers back to the two ℓ\ellℓ-qubit registers, such that log⁡2(di,ℓ)/ℓ→Ri\log_2(d_{i,\ell})/\ell\to R_ilog2​(di,ℓ​)/ℓ→Ri​ for each party and 4−ℓ∑wRe⁡Tr⁡ ⁣[Dℓ ⁣(E0,ℓ(ρw)⊗E1,ℓ(ρw))(ρw⊗ρw)]→14^{-\ell}\sum_w\operatorname{Re}\operatorname{Tr}\!\left[D_\ell\!\left(E_{0,\ell}(\rho_w)\otimes E_{1,\ell}(\rho_w)\right)(\rho_w\otimes\rho_w)\right]\to14−ℓ∑w​ReTr[Dℓ​(E0,ℓ​(ρw​)⊗E1,ℓ​(ρw​))(ρw​⊗ρw​)]→1. Here a quantum channel means a map admitting finitely many Kraus matrices KjK_jKj​, acting as X↦∑jKjXKj†X\mapsto\sum_jK_jXK_j^\daggerX↦∑j​Kj​XKj†​, with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. Define A\mathcal AA by the same requirements, except that each encoder is an arbitrary assignment of a positive semidefinite, trace-one matrix σi,ℓ(w)\sigma_{i,\ell}(w)σi,ℓ​(w) to each classical word www, and the decoder receives σ0,ℓ(w)⊗σ1,ℓ(w)\sigma_{0,\ell}(w)\otimes\sigma_{1,\ell}(w)σ0,ℓ​(w)⊗σ1,ℓ​(w) 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 Q⊆{R:R0≥12, R1≥12, R0+R1≥32}\mathcal Q\subseteq\{R:R_0\ge\frac12,\ R_1\ge\frac12,\ R_0+R_1\ge\frac32\}Q⊆{R:R0​≥21​, R1​≥21​, R0​+R1​≥23​}, A={R:R0≥0, R1≥0, R0+R1≥32}\mathcal A=\{R:R_0\ge0,\ R_1\ge0,\ R_0+R_1\ge\frac32\}A={R:R0​≥0, R1​≥0, R0​+R1​≥23​}, and A≠Q\mathcal A\ne\mathcal QA=Q. Both regions here use convergence of average fidelity to one; their definitions impose no distortion criterion.

Human review
  • Endorsed by Shuze Chen · Oct 22, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 22, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me