two_qubit_candidate_fidelity_bound
def
For ε ≥ 0, two_qubit_candidate_fidelity_bound ε is the infimum over 0 ≤ p, q ≤ 1 of max{ p(1 + 2 sqrt(q(1 - q)))/2, (1 - p)/2 } subject to ln 2 + h(p) - h(pq) ≤ ε, where h is binary entropy in nats.
Statement
noncomputable def two_qubit_candidate_fidelity_bound (ε : ℝ) : ℝ
- Defined in
- OP-1552; arXiv:2409.01966
- Verified
- 12 Nov 2026
- Axioms
- none listed
- Built on 1
- binary_entropy_natsThe binary entropy function in natural units (nats) is -x ln x - (1 - x) ln (1 - x) with the convention 0 ln 0 = 0.
- Used by 1
- two_qubit_candidate_fidelity_bound_at_zeroAt adjusted entropy deficit ε = 0, the candidate fidelity bound equals 1.
Read back from the Lean
A function that maps a real number ε to the infimum (sInf) of the set of real numbers F for which there exist real numbers p and q such that: 1. 0 ≤ p ≤ 1, 2. 0 ≤ q ≤ 1, 3. Real.log 2 + binary_entropy_nats p - binary_entropy_nats (p * q) ≤ ε, and 4. F = max (p * (1 + 2 * Real.sqrt (q * (1 - q))) / 2) ((1 - p) / 2).
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
/-- Candidate minimum fully entangled fraction over the two-parameter family subject to adjusted entropy deficit at most epsilon. -/ noncomputable def two_qubit_candidate_fidelity_bound (ε : ℝ) : ℝ := sInf { F : ℝ | ∃ p q : ℝ, 0 ≤ p ∧ p ≤ 1 ∧ 0 ≤ q ∧ q ≤ 1 ∧ Real.log 2 + binary_entropy_nats p - binary_entropy_nats (p * q) ≤ ε ∧ F = max (p * (1 + 2 * Real.sqrt (q * (1 - q))) / 2) ((1 - p) / 2) }