Uniform fixed-d asymptotic fidelity upper bound
OpenQAlgorithms.Papers.Independent.Intakenext100.P53.monogamy_asymptotic_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.
Fix . There exist constants and such that for every and every normalized resource and deterministic POVM satisfying the section VI conditions , equal correct-port fidelities and equal other-port fidelities, the actual entanglement fidelity satisfies
The constants are independent of and the protocol. The bound has the sign and leading coefficient of Eq.(28). This is the symmetric-port consequence derived using cloning monogamy; the cited background inequalities are not hypotheses, and no general symmetrization theorem is asserted.
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, Eq.(28): fixed-d symmetric-port bound. Constants precede N and
all protocols; cited cloning/isotropic results are not assumed as hypotheses. -/
theorem monogamy_asymptotic_bound (d : ℕ) (hd : 2 ≤ d) :
∃ C : ℝ, 0 ≤ C ∧ ∃ N0 : ℕ, 2 ≤ N0 ∧
∀ N : ℕ, N0 ≤ N →
∀ (O : Op (Ports d N)) (E : Fin N → Op (AC d N)) (Fother : ℝ),
NormalizedResource O → DeterministicPOVM E → SymmetricPorts O E Fother →
pbtFidelity O E ≤ 1 - 1 / (4 * ((d : ℝ) - 1) * (N : ℝ) ^ 2) +
C / (N : ℝ) ^ 3 := 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 natural number , there exist a real constant and a natural number with the following property. For every natural number , put , , and
For every complex matrix on , every family of complex matrices on , and every real , define
Let trace out all ports except , explicitly
where is an assignment to the other ports. Set , , and , with division by zero interpreted as zero. If , all , , , , and for distinct , then
The constants are chosen before ; the statement gives no bound for .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.