Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Unnumbered result: FQRS-derived redistribution inner bound

Open
QAlgorithms.Papers.Independent.Intakethird100.P42.fqrsInnerBound

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let ∣ψ⟩RA^B^B|\psi\rangle^{R\widehat A\widehat B B}∣ψ⟩RABB be a normalized pure state on finite nonzero registers, with Alice initially holding A^B^\widehat A\widehat BAB, Bob holding BBB, and inaccessible reference RRR. The goal is to transfer B^\widehat BB to Bob while retaining all other source systems with their original ownership.

The FQRS construction achieves

(Q2,E2)=(12I(B^;RB)ψ,12I(B^;A^)ψ).(Q_2,E_2)=\left(\tfrac12 I(\widehat B;RB)_\psi,\tfrac12 I(\widehat B;\widehat A)_\psi\right).(Q2​,E2​)=(21​I(B;RB)ψ​,21​I(B;A)ψ​).

Communication is one-way quantum communication with arbitrary local CPTP maps; EEE is input minus output Bell-pair consumption. The IID interpretation uses every positive error and rate slack, all sufficiently large positive blocklengths, and full joint source/reference and final Bell-pair trace-norm reconstruction. Entropies and rates are in bits.

This is the source's reverse-Shannon inner bound. The construction treats BBB as reference but retains Bob's BBB in the output error test.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P42
Formal statement
noncomputable section

namespace QAlgorithms.Papers.Independent.Intakethird100.P42

open scoped BigOperators ComplexConjugate ENNReal

open Filter

open QAlgorithms.Papers.Independent.Dependency50.P07

open QAlgorithms.Papers.Independent.Gap48.P20

open QAlgorithms.Papers.Independent.Information100.P27 (IsProbability shannon)

attribute [local instance] Classical.decEq Classical.propDecidable

/-- PDF p.18: FQRS-derived achievable pair, with B included in the joint output
and reference test. Both communication and consumed entanglement have factor 1/2. -/
theorem fqrsInnerBound {A C B R : Type}
    [Fintype A] [Fintype C] [Fintype B] [Fintype R]
    [Nonempty A] [Nonempty C] [Nonempty B] [Nonempty R]
    (psi : EuclideanSpace ℂ (RedistributionSource A C B R)) (hpsi : IsState psi) :
    RedistributionAchievable psi (fqrsQuantum psi) (senderMutual psi / 2) := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P42

end
Source
Channel simulation with quantum side information, arXiv:quant-ph/0611008v1, PDF p. 18, Unnumbered result: FQRS-derived redistribution inner bound
Read-back

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

Let A,C,B,RA,C,B,RA,C,B,R be nonempty finite types and let ψ∈CR×(A×(C×B))\psi\in\mathbb C^{R\times(A\times(C\times B))}ψ∈CR×(A×(C×B)) have norm 111. Define ρuv=ψuψv‾\rho_{uv}=\psi_u\overline{\psi_v}ρuv​=ψu​ψv​​, reduce to any register collection UUU by summing over equal complementary labels, and put S(U)=−Re⁡tr⁡(f(ρU))S(U)=-\operatorname{Re}\operatorname{tr}(f(\rho_U))S(U)=−Retr(f(ρU​)), where f(t)=tlog⁡2tf(t)=t\log_2tf(t)=tlog2​t is applied by continuous functional calculus and 0log⁡20=00\log_20=00log2​0=0. Set

Q0=S(C)+S(RB)−S(RCB)2,E0=S(C)+S(A)−S(AC)2.Q_0=\frac{S(C)+S(RB)-S(RCB)}2, \qquad E_0=\frac{S(C)+S(A)-S(AC)}2.Q0​=2S(C)+S(RB)−S(RCB)​,E0​=2S(C)+S(A)−S(AC)​.

The theorem asserts Q0≥0Q_0\ge0Q0​≥0 and the following quantified existence statement: for every ε,δ>0\varepsilon,\delta>0ε,δ>0, some natural NNN works for every n≥Nn\ge Nn≥N with n≥1n\ge1n≥1, so that there exist natural numbers q,k,lq,k,lq,k,l, an encoder channel AnCn⊗(C2)⊗k→An⊗(C2)⊗l⊗(C2)⊗qA^nC^n\otimes(\mathbb C^2)^{\otimes k}\to A^n\otimes(\mathbb C^2)^{\otimes l}\otimes(\mathbb C^2)^{\otimes q}AnCn⊗(C2)⊗k→An⊗(C2)⊗l⊗(C2)⊗q, and a decoder channel (C2)⊗q⊗Bn⊗(C2)⊗k→CnBn⊗(C2)⊗l(\mathbb C^2)^{\otimes q}\otimes B^n\otimes(\mathbb C^2)^{\otimes k}\to C^nB^n\otimes(\mathbb C^2)^{\otimes l}(C2)⊗q⊗Bn⊗(C2)⊗k→CnBn⊗(C2)⊗l. Here each channel acts on matrices by a finite sum ∑jKjXKj†\sum_jK_jXK_j^\dagger∑j​Kj​XKj†​ with ∑jKj†Kj=I\sum_jK_j^\dagger K_j=I∑j​Kj†​Kj​=I. On the initial vector ψ⊗n⊗Φk\psi^{\otimes n}\otimes\Phi_kψ⊗n⊗Φk​, where Φh=2−h/2∑z∈{0,1}h∣z,z⟩\Phi_h=2^{-h/2}\sum_{z\in\{0,1\}^h}|z,z\rangleΦh​=2−h/2∑z∈{0,1}h​∣z,z⟩, the encoder followed by the decoder, with RnR^nRn untouched, produces a matrix ωn\omega_nωn​ such that

∥ωn−∣ψ⊗n⊗Φl⟩⟨ψ⊗n⊗Φl∣∥1≤ε,q≤n(Q0+δ),k−l≤n(E0+δ).\left\|\omega_n-\bigl|\psi^{\otimes n}\otimes\Phi_l\bigr\rangle \bigl\langle\psi^{\otimes n}\otimes\Phi_l\bigr|\right\|_1\le\varepsilon, \qquad q\le n(Q_0+\delta),\qquad k-l\le n(E_0+\delta).​ωn​−​ψ⊗n⊗Φl​⟩⟨ψ⊗n⊗Φl​​​1​≤ε,q≤n(Q0​+δ),k−l≤n(E0​+δ).

The target retains AnA^nAn at the encoder and places CnBnC^nB^nCnBn at the decoder, and ∥M∥1=Re⁡tr⁡M†M\|M\|_1=\operatorname{Re}\operatorname{tr}\sqrt{M^\dagger M}∥M∥1​=RetrM†M​. The natural numbers q,k,lq,k,lq,k,l may be zero.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me