The quantum two-parameter parity maximum is attained at one plus sqrt two
OpenQAlgorithms.Papers.Independent.Intakethird100.P48.quantum_maximumFor , let put probability on each equal-output pair and on each unequal-output pair, where at input and at the other inputs. Let be the maximum of the four absolute CHSH expressions, and let be the output of the parallel local-XOR protocol on independent identical copies. Consider all actual distilled values
Then has greatest element . It is attained by
where , the resource is quantum, and strict distillation holds. These exact parameters correspond to the source's roundings and . This is an attained maximum for this family and this protocol, not a bound on all quantum distillation protocols.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P48
namespace QAlgorithms.Papers.Independent.Intakethird100.P48
open scoped BigOperators TensorProduct
noncomputable section
/-- PDF p.4, attained maximum: 1+sqrt(2) for this quantum two-parameter family
and NDP, with n=2 at the displayed optimizer. The CHSH maximum is used throughout
the full positivity square; 3(1-2delta)^n-(1-2epsilon)^n is not used outside its sector.
The cosine coordinates identify exactly the source's rounded parameter values.
Printed/changed/why: the source's signed scalar formula is sector-specific;
Definition 1's actual absolute maximum replaces it on the full positivity square
(epsilon=delta=1 has actual NL=2, whereas the printed signed expression is -2).
Independent moderation of this transcription choice remains pending. -/
theorem quantum_maximum :
IsGreatest quantumDistilledValues (1 + Real.sqrt 2) ∧
0 < optimalDelta ∧ optimalDelta < optimalEpsilon ∧ optimalEpsilon < 1 / 2 ∧
IsQuantum (parameterBox optimalEpsilon optimalDelta) ∧
StrictlyDistills (parityProtocol 2) (parameterBox optimalEpsilon optimalDelta) ∧
nonlocality (parallelOutputLaw (parityProtocol 2) (parameterBox optimalEpsilon optimalDelta)) =
1 + Real.sqrt 2 := by sorry
end
end QAlgorithms.Papers.Independent.Intakethird100.P48
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Identify Boolean values with . For real parameters , let when , and otherwise, where and at the other input pairs. For any real Boolean-indexed array , define
where is addition modulo two, and define . Say that is quantum when there exist complete complex inner-product spaces , a unit vector , and positive continuous complex-linear operators , summing to the respective identity over each output index for every input, with for every Boolean quadruple; the hat denotes the induced map on the completion. Say that satisfies the probability and marginal conditions when its entries are nonnegative, for every input pair, is independent of for each , and is independent of for each . The set of values obtained from and natural numbers , subject to being quantum, both and satisfying those probability and marginal conditions, and , has greatest element : this value belongs to the set and every element is at most it. In addition, the specific real numbers
satisfy ; the array is quantum; both it and satisfy the probability and marginal conditions; and
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.