Proposition 1: biased mixture of two private bits
OpenQAlgorithms.Papers.Independent.Intakenext100.P37.biasedPrivateBits_key_lower_boundLet be key qubits and be shields of arbitrary positive finite dimensions. Let be private bits on these same registers in the same computational key basis, with arbitrary mixed shield states. Suppose , , and . Define , where flips only Alice's key qubit. Then
More specifically, computational measurement of followed by forward authenticated public discussion achieves this rate on independent copies, with one protocol sequence valid for every purifying Eve and with its transcript included in Eve's output. No extra orthogonality hypothesis on the two unflipped private bits is imposed; the flip creates the even/odd key supports. The endpoint is permitted. This gives an achievable rate, not an equality with the optimal key rate.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P37
noncomputable section
open scoped Matrix BigOperators ComplexConjugate ComplexOrder ENNReal
namespace QAlgorithms.Papers.Independent.Intakenext100.P37
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P21 (Op)
open QAlgorithms.Papers.Independent.Dependency50.P24
(Key IsPrivate xForm twist twistingMatrix associatedCCQ transposeSecond transposeBob partyCut)
/-- PDF pp.1--2, Proposition 1 and its final one-way-protocol paragraph.
The second private bit is flipped on Alice's key, yielding the required odd support.
The endpoints p2=0 and p1=1 are allowed. -/
theorem biasedPrivateBits_key_lower_bound {a b : ℕ} (ha : 0 < a) (hb : 0 < b)
(gamma1 gamma2 : Op (Key 2 × (Fin a × Fin b))) (hgamma1 : IsPrivate gamma1)
(hgamma2 : IsPrivate gamma2) (p1 p2 : ℝ) (hp1 : 0 ≤ p1) (hp2 : 0 ≤ p2)
(hsum : p1 + p2 = 1) (hbias : p2 < p1) :
HasMeasuredOneWayRate (privateMixture p1 p2 gamma1 gamma2) (1-binEntropy2 p1) ∧
ENNReal.ofReal (1-binEntropy2 p1) ≤
Gap48.P42.distillableKey (physicalFin (privateMixture p1 p2 gamma1 gamma2)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P37
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For positive natural numbers , let be complex matrices on two binary key registers and a shield of local dimensions . Assume each is a density matrix and has the following form for some shield density matrix and shield unitaries : all key blocks vanish except blocks between and , which equal . For any real satisfying , , and , put
where flips Alice’s key bit and preserves the other indices, and , with zero logarithmic terms interpreted as zero. The declaration asserts and , where is the same matrix across the split of Alice’s key and shield from Bob’s key and shield, reindexed onto using the fixed chosen local bijections. Here , and means that there is a single sequence of protocols working for every positive integer and every unit purification of with purifying register . For each such purification, define
At every block length , the common protocol has positive transcript and key sizes , nonnegative encoder probabilities summing to one for each binary string of length , and, for each transcript , positive semidefinite decoding matrices on Bob’s binary registers summing over to the identity. Set , , , and
For each purification there must exist tending to zero and a finite real such that, for every ,
and there are density matrices and a common density matrix on transcript and Eve satisfying and for every , including zero-weight keys; moreover . The quantity is the extended nonnegative supremum of all rates for which, for every , every sufficiently large positive admits positive integers , a shield density matrix of local dimensions , shield unitaries for , and a finite LOCC map whose output on is within trace norm of the private matrix with blocks between matched keys and zero other blocks, such that . These finite LOCC maps are generated recursively by identities and complete finite local Kraus instruments, with outcome-dependent continuations and summed final branches. Density matrices throughout mean positive semidefinite matrices of trace one. The hypotheses allow the endpoint ; no strict positivity of either mixing weight is required.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.