Unnumbered experimentally estimable lower bound, Eq.18
OpenQAlgorithms.Papers.Independent.Intakenext100.P37.twirledEntropy_key_lower_boundLet be a unit vector before measurement, where are qubits and is any positive finite-dimensional register. Let be its reduced density matrix, let be its computational measurement on , and let be pinching in the four standard Bell projectors. Write for the mutual information of the computational outcomes of the untwirled . Then
For any physical density matrix with positive finite shields, and any computational-key-controlled joint-shield unitary , put and . Measuring the original key qubits and using one forward protocol sequence, chosen before every purifying Eve, achieves , and . This transfer uses a pessimistic Eve extension in the analysis. No nonlocal twisting is performed by the honest parties, and the original computational law is not equated to that of the Bell-pinched state.
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.3--4, Eq.(18): measured, untwirled mutual information minus the
Bell-pinched entropy. Purity is required BEFORE measurement. The second clause
transfers the estimate to the physical premeasurement resource via privacy
squeezing; the controlled joint-shield unitary is never implemented as LOCC. -/
theorem twirledEntropy_key_lower_bound :
(∀ e : ℕ, 0 < e → ∀ psi : EuclideanSpace ℂ (Fin 2 × (Fin 2 × Fin e)),
‖psi‖ = 1 →
twirledExpression (Dependency50.P21.marginalAB (pureDensity psi)) ≤
Frontier30.P12.quantumKeyCapacity (dephaseAB (pureDensity psi))) ∧
(∀ a b : ℕ, 0 < a → 0 < b → ∀ rho : Op (Key 2 × (Fin a × Fin b)), IsDensityMatrix rho →
∀ U : Key 2 → Matrix.unitaryGroup (Fin a × Fin b) ℂ,
HasMeasuredOneWayRate rho (max 0 (twirledExpression (traceRight (twist U rho)))) ∧
ENNReal.ofReal (twirledExpression (traceRight (twist U rho))) ≤
Gap48.P42.distillableKey (physicalFin rho)) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P37
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Write , , , and define
Here ; logarithms and division are total, with and division by zero equal to zero. First, for every positive integer and every unit vector , , where retains precisely the entries with both classical indices equal between row and column and sets all other entries to zero. Second, for every positive , every density matrix on a two-bit key and shield , and every family of shield unitaries indexed by the four key values , put , , and . There exists one classical-source protocol sequence attaining rate for every positive-dimensional unit-vector purification of , and in , where regroups Alice's key and shield and Bob's key and shield into dimensions using the fixed finite-type bijections. The operational meanings are the following: is the real supremum of rates attained by quantum-source protocols which, at every natural copy number , including zero, use a POVM on Alice's registers and transcript-dependent POVMs on Bob's registers, with positive transcript and key sizes ; their unnormalized branches are , their joint probabilities are , and their key-conditioned transcript–Eve blocks have diagonal transcript blocks . Attainment requires nonnegative errors , one finite , , , , density matrices with and , and . For the classical-source assertion, the source associated with is obtained by deleting off-diagonal key blocks of and tracing out the shield: let its Alice- block on Bob and Eve be , set , and use if , or the maximally mixed Bob–Eve matrix if . A classical-source protocol replaces by a stochastic encoder for words ; then
and all the same attainment conditions apply; the protocol sequence must be independent of the purification, though its error sequence and may depend on that purification. Finally, is the supremum in of nonnegative rates such that, for every , every sufficiently large positive allows a finite local-operations-and-classical-communication map from to within trace norm of a private matrix with positive key size , positive shield dimensions, density shield , and key blocks at , zero elsewhere, satisfying . These finite communication maps are generated recursively by identities and finite complete local Kraus measurements followed by outcome-dependent maps and summed branches; all POVMs consist of positive semidefinite effects summing to identity, and all density matrices are positive semidefinite with trace one.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.