Theorem 2: approximate universal randomisation
OpenQAlgorithms.Papers.Independent.Intakenext100.P54.approximate_universal_randomisationLet and . There exist a positive integer and unitaries on , chosen independently of the input density operator, such that
for every positive semidefinite trace-one operator . The inequalities use the positive semidefinite operator order. This is the universal approximate randomisation needed for remote preparation.
Formalization Note The printed unrestricted positive-error domain is corrected to the small-error domain used by the proof; the discrepancy is recorded in HARD.md.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P54
noncomputable section
open scoped BigOperators Matrix ComplexConjugate ComplexOrder NNReal ENNReal
open MeasureTheory ProbabilityTheory
namespace QAlgorithms.Papers.Independent.Intakenext100.P54
open QAlgorithms.Papers.Independent.Information100.P03 (PureEnsemble)
open QAlgorithms.Papers.Independent.Information100.P53 (fidelity)
open QAlgorithms.Papers.Independent.Dependency50.P07 (wordProb)
open QAlgorithms.Papers.Independent.Claimed50.P08 (classicalEntropy)
open QAlgorithms.Papers.Independent.Claimed50.P38 (tensorSuperop)
/-- Theorem 2, PDF p.3. The printed domain eps > 0 is corrected to 0 < eps ≤ 1,
the regime used in the proof; eps = 20D contradicts the literal printed bound. -/
theorem approximate_universal_randomisation (D : ℕ) (hD : 0 < D)
(eps : ℝ) (heps : 0 < eps) (hepsOne : eps ≤ 1) :
∃ K : ℕ, 0 < K ∧ (K : ℝ) ≤ randomisingBound D eps ∧
∃ U : Fin K → Matrix.unitaryGroup (Fin D) ℂ, Randomising U eps := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P54
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number and every real , there exist a natural number and unitary complex matrices such that
and, for every positive semidefinite matrix with ,
Here is conjugate transpose and is the positive semidefinite order. The assertion includes and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.