AFTD Auto-Formalizing Theoretical Domains

almost_quantum_efficiency

def

The optimal zero-error conclusive efficiency η_AQ(N) of one-bit communication deciding equality of two labels in {1, ..., N} using almost-quantum correlations, defined as the supremum over zero-error almost-quantum protocols of the worst-case conclusive probability.

Statement

noncomputable def almost_quantum_efficiency (N : ℕ) : ℝ
Defined in
arXiv:2610.41448 Definition 2
Verified
02 Nov 2026
Axioms
none listed
Built on 1
  • is_almost_quantumA bipartite behaviour p belongs to the almost-quantum set C_AQ if there exist a real Hilbert space E, a unit state vector ψ, and…

Read back from the Lean

almost_quantum_efficiency N is the supremum (sSup) of the set of all real numbers c such that there exists a correlation function p : Fin N → (Fin N × Fin 2) → Fin 2 → Option Bool → ℝ satisfying: 1. p is "almost quantum" (is_almost_quantum p). 2. For all s, t : Fin N: - if s = t, then ∑ a : Fin 2, p s (t, a) a (some false) = 0; - if s ≠ t, then ∑ a : Fin 2, p s (t, a) a (some true) = 0. 3. For all s, t : Fin N, c ≤ ∑ a : Fin 2, p s (t, a) a (some (decide (s = t))) (that is, c ≤ ∑ a, p s (s, a) a (some true) when s = t, and c ≤ ∑ a, p s (t, a) a (some false) when s ≠ t).

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

/-- The optimal zero-error conclusive efficiency of one-bit communication for equality over almost-quantum correlations. -/
noncomputable def almost_quantum_efficiency (N : ℕ) : ℝ := sSup { c : ℝ | ∃ (p : Fin N → (Fin N × Fin 2) → Fin 2 → Option Bool → ℝ),
    is_almost_quantum p ∧
    (∀ s t : Fin N, if s = t then (∑ a : Fin 2, p s (t, a) a (some false)) = 0
                    else (∑ a : Fin 2, p s (t, a) a (some true)) = 0) ∧
    ∀ s t : Fin N, c ≤ ∑ a : Fin 2, p s (t, a) a (some (s = t)) }
See it in the graphDiscuss this resultChallenge it