AFTD Auto-Formalizing Theoretical Domains

commuting_quantum_efficiency

def

For integers K and N, the optimal zero-error conclusive efficiency η^{(K)}_{C_qc}(N) is the supremum over all zero-error commuting-operator quantum protocols with K messages of the worst-case conclusive probability for deciding equality of two labels in {1, ..., N}.

Statement

noncomputable def commuting_quantum_efficiency (K N : ℕ) : ℝ
Defined in
arXiv:2610.41448, An Unbounded Separation of Almost-Quantum and Commuting-Operator Correlations in Zero-Error Communication, Sec. 8
Verified
07 Nov 2026
Axioms
none listed
Built on 1
  • is_commuting_quantumA bipartite behaviour p : X → Y → A → B → ℝ belongs to the commuting-operator quantum set C_qc if there exist a real Hilbert space E, a…

Read back from the Lean

For natural numbers K and N, commuting_quantum_efficiency K N is defined as the real supremum (sSup) of the set of all real numbers c for which there exists a correlation function p : Fin N → (Fin N × Fin K) → Fin K → Option Bool → ℝ such that: 1. p is a commuting-operator quantum correlation (is_commuting_quantum p); 2. For all s, t : Fin N, if s = t then the sum over a : Fin K of p s (t, a) a (some false) equals 0, and if s ≠ t then the sum over a : Fin K of p s (t, a) a (some true) equals 0; 3. For all s, t : Fin N, c is less than or equal to the sum over a : Fin K of p s (t, a) a (some (decide (s = t))) (i.e., when s = t, the sum of p s (t, a) a (some true) is at least c; and when s ≠ t, the sum of p s (t, a) a (some false) is at least c).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- Optimal worst-case conclusive efficiency for certifying equality with K messages over commuting-operator quantum correlations. -/
noncomputable def commuting_quantum_efficiency (K N : ℕ) : ℝ :=
  sSup {c | ∃ (p : Fin N → Fin N × Fin K → Fin K → Option Bool → ℝ),
    is_commuting_quantum p ∧
    (∀ (s t : Fin N), if s = t then ∑ a, p s (t, a) a (some false) = 0 else ∑ a, p s (t, a) a (some true) = 0) ∧
    ∀ (s t : Fin N), c ≤ ∑ a, p s (t, a) a (some (decide (s = t)))}
See it in the graphDiscuss this resultChallenge it