Universal probabilistic-PBT success bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P53.probabilistic_success_boundLet and be integers. Alice and Bob have ordered -dimensional ports, and the input register has dimension . Write and . Put , , and . A resource filter gives and obeys . Alice measures ; Bob selects the reported port and discards the others. Entanglement fidelities are tested against a normalized reference-input singlet, with no correction on the selected port.
Let be an arbitrary POVM, with indicating failure, which teleports the input exactly in every successful branch. Let be the probability of branch in the reference-singlet experiment, and . Then
In the associated coding experiment Bob sends to Alice and she uses this same measurement. Equality in the bound requires for every , where is the actual failure probability in that experiment. There is no symmetry or maximally entangled-resource restriction, and no general attainability claim. This is the paper's alternative derivation of the known numerical bound.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P53
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P53
open scoped Classical ComplexConjugate ComplexOrder Matrix Matrix.Norms.L2Operator
-- Accepted generic matrix and positive-operator interfaces. The support is the
-- orthogonal range projection; all uses below are on positive physical rho.
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Information100.P07 (support)
open QAlgorithms.Papers.Independent.Next46.P39 (inverseSqrt)
/-- PDF p.4, Eqs.(19)-(22): universal bound and necessary coding saturation. -/
theorem probabilistic_success_bound (d N : ℕ) (hd : 2 ≤ d) (hN : 1 ≤ N)
(O : Op (Ports d N)) (E : Option (Fin N) → Op (AC d N))
(hexact : ExactProbabilistic O E) :
pbtSuccessProbability O E ≤ (N : ℝ) / ((N : ℝ) + (d : ℝ) ^ 2 - 1) ∧
(pbtSuccessProbability O E = (N : ℝ) / ((N : ℝ) + (d : ℝ) ^ 2 - 1) →
∀ k, codingProbability O (E none) k = 0) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P53
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every with and , let , , and let be a complex matrix on . Let and , , be complex matrices on , with denoting the “none” outcome. Define
Let insert at port , and define
where ranges over assignments to the ports other than . Suppose that , all are positive semidefinite, , and, writing , one has for every . Then, with , the theorem asserts
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.