Fixed-resource SRM fidelity and coding lower bounds
OpenQAlgorithms.Papers.Independent.Intakenext100.P53.srm_fidelity_lower_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.
Take and the completed SRM . These effects form a deterministic POVM. Its actual entanglement fidelity and every correct port-coding probability satisfy
The source independently rederives this fixed-resource measurement bound in Appendix C. It is not an inequality for arbitrary measurements. At , and .
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.5, Eqs.(29)-(30), p.7: fixed maximally entangled resource, completed
SRM, and every port's physical coding probability. -/
theorem srm_fidelity_lower_bound (d N : ℕ) (hd : 2 ≤ d) (hN : 1 ≤ N) :
DeterministicPOVM (completedSRM d N) ∧
pbtFidelity (1 : Op (Ports d N)) (completedSRM d N) ≥
(N : ℝ) / ((N : ℝ) + (d : ℝ) ^ 2 - 1) ∧
∀ k : Fin N,
codingProbability (1 : Op (Ports d N)) (completedSRM d N k) k =
(d : ℝ) ^ 2 * pbtFidelity (1 : Op (Ports d N)) (completedSRM d N) / N ∧
codingProbability (1 : Op (Ports d N)) (completedSRM d N k) k ≥
(d : ℝ) ^ 2 / ((N : ℝ) + (d : ℝ) ^ 2 - 1) := 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 pair of natural numbers with and , let , , and define
Here ranges over assignments to the ports other than . Let be the functional-calculus value of at , with , let be the orthogonal projection onto its range, and put . To specify the quantities in the conclusion, define the identity-resource coefficients and
where inserts the specified value at port . Set . The theorem asserts that every is positive semidefinite, , and
It also asserts, for every port , both
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.