Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Observation 1: optimal mixing bias

Open
QAlgorithms.Papers.Independent.Intakenext100.P37.mixingBias_optimal

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Fix an integer d≥1d\ge1d≥1. For every unitary U=(uij)U=(u_{ij})U=(uij​) on Cd\mathbb C^dCd, take p1,p2p_1,p_2p1​,p2​ to be exactly the weights in Eq. (11). Then

p1p2≤d.\frac{p_1}{p_2}\le\sqrt d.p2​p1​​≤d​.

Every unitary with ∣uij∣=1/d|u_{ij}|=1/\sqrt d∣uij​∣=1/d​ for all i,ji,ji,j attains equality, and such a unitary exists in every positive dimension. Thus the upper bound is attained, not merely approached. At d=1d=1d=1 the ratio is one and the construction has zero key yield.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P37
Formal statement
noncomputable section

open scoped Matrix BigOperators ComplexConjugate ComplexOrder ENNReal

namespace QAlgorithms.Papers.Independent.Intakenext100.P37

attribute [local instance] Classical.propDecidable Classical.decEq

open QAlgorithms.Papers.Independent.Information100.P21 (Op)

open QAlgorithms.Papers.Independent.Dependency50.P24
  (Key IsPrivate xForm twist twistingMatrix associatedCCQ transposeSecond transposeBob partyCut)

/-- PDF pp.2--3, Observation 1: global upper bound and attainment at flat
unitaries. d=1 is included; its optimal ratio is one and its key yield is zero. -/
theorem mixingBias_optimal (d : ℕ) (hd : 0 < d) :
    (∀ U : Matrix.unitaryGroup (Fin d) ℂ,
      weightOne (U : Op (Fin d)) / weightTwo (U : Op (Fin d)) ≤ Real.sqrt d) ∧
    (∀ U : Matrix.unitaryGroup (Fin d) ℂ, IsFlatUnitary (U : Op (Fin d)) →
      weightOne (U : Op (Fin d)) / weightTwo (U : Op (Fin d)) = Real.sqrt d) ∧
    (∃ U : Matrix.unitaryGroup (Fin d) ℂ, IsFlatUnitary (U : Op (Fin d)) ∧
      weightOne (U : Op (Fin d)) / weightTwo (U : Op (Fin d)) = Real.sqrt d) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P37

end
Source
Low dimensional bound entanglement with one-way distillable cryptographic key, arXiv:quant-ph/0506203v1, PDF p. 2, Observation 1: optimal mixing bias
Read-back

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

For every positive integer ddd, and every complex unitary d×dd\times dd×d matrix UUU, put s(U)=∑i,j=0d−1∣Uij∣s(U)=\sum_{i,j=0}^{d-1}|U_{ij}|s(U)=∑i,j=0d−1​∣Uij​∣, w1(U)=s(U)/(s(U)+d)w_1(U)=s(U)/(s(U)+d)w1​(U)=s(U)/(s(U)+d), and w2(U)=d/(s(U)+d)w_2(U)=d/(s(U)+d)w2​(U)=d/(s(U)+d). Then w1(U)/w2(U)≤dw_1(U)/w_2(U)\le\sqrt dw1​(U)/w2​(U)≤d​. Moreover, every such unitary satisfying ∣Uij∣=1/d|U_{ij}|=1/\sqrt d∣Uij​∣=1/d​ for all i,ji,ji,j satisfies w1(U)/w2(U)=dw_1(U)/w_2(U)=\sqrt dw1​(U)/w2​(U)=d​, and there exists a unitary with these entry magnitudes attaining this equality. The quantification includes d=1d=1d=1; d=0d=0d=0 is excluded.

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

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 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