Section VI.B: protocol Pi is approximately oblivious
OpenQAlgorithms.Papers.Independent.Intakenext100.P54.pi_approximately_obliviousLet and . Protocol can be chosen with good messages and modified by replacing its failure announcement uniformly with a good message. Denote its actual receiver output by and its full receiver record by , including message and pre-decoding quantum state. There is one fixed CPTP simulator
such that, for every normalized pure target,
The unitaries, code, and simulator precede the target. The simulator consumes the actual approximate output, and Alice's private failure flag is not part of the receiver record. This is approximate preparation and approximate obliviousness in Definition 20.
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)
/-- Section VI.B, PDF pp.12–13: Pi is approximate and approximately oblivious with
parameters (eps,eps). The simulator consumes the actual output, as Definition 20 requires. -/
theorem pi_approximately_oblivious (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 ∧ IsChannel (piSimulator U) ∧ ∀ psi : RSPVector (Fin D),
traceNorm (pureDensity psi.val - piApproxOutput U eps psi) / 2 ≤ eps ∧
traceNorm (piRecord U eps psi - piSimulator U (piApproxOutput U eps psi)) / 2 ≤ 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 positive natural number and real , there exist a positive natural number and unitary matrices such that
For every density matrix —meaning is positive semidefinite and —the matrix satisfies
Moreover, the map defined on all matrices by when , and otherwise, admits a finite Kraus representation with . For every unit vector , define
Then
where , with the square root evaluated by continuous functional calculus. The same and family work for every and ; the endpoint is included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.