Probabilistic teleportation and port-coding probability identity
OpenQAlgorithms.Papers.Independent.Intakenext100.P53.teleportation_coding_identityLet 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.
Use any exact probabilistic protocol with failure outcome . Let be its reference-singlet branch probability. In the coding experiment Bob sends to Alice, identifying it as , and Alice uses exactly the same resource and POVM; denote its actual outcome probabilities by . Then for every successful label ,
No equiprobability or permutation assumption is made. Exactness is expressed by the unnormalized branch equation, so a branch with is included. This is the operational interface used for the success upper 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.(20)-(22): probabilities in the same resource and measurement,
including zero-probability successful branches. -/
theorem teleportation_coding_identity (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) :
(∀ i k, codingProbability O (E (some i)) k =
if i = k then (d : ℝ) ^ 2 * pbtBranchProbability O (E (some i))
else pbtBranchProbability O (E (some i))) ∧
(∑ k : Fin N, ∑ i : Fin N, codingProbability O (E (some i)) k) =
((N : ℝ) + (d : ℝ) ^ 2 - 1) * pbtSuccessProbability O E := 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 natural numbers and , let , , be a complex matrix on , and for be complex matrices on . Set
For each port , insertion of into a complementary assignment is denoted by ; define
Suppose , every outcome matrix is positive semidefinite, , and for every , where . The theorem asserts both
and
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.