Main result: explicit 4 ⊗ 4 PPT bound entanglement with positive one-way key rate (Eq.16)
OpenQAlgorithms.Papers.Independent.Intakenext100.P37.hadamard_boundEntangled_positiveKeyLet , and let be the state computed from by Eqs. (9)–(11). The key registers and shields are qubits; Alice owns and Bob owns . Then is a density matrix, is invariant under transposition of , is nonseparable across , and has zero asymptotic LOCC Bell-pair yield. Moreover, with binary entropy in bits,
Measuring in the computational basis and applying one sequence of forward public-discussion protocols achieves bits per independent input copy. This sequence is selected before any finite-dimensional purifying Eve; its evaluated public transcript is included in the secrecy criterion. Shields remain private and unused. The result supplies the explicit resource, without claiming a universal lower bound on dimension or equating the rounded printed decimal to the exact 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--3, abstract and Eq.(16): explicit 4 tensor 4 PPT bound
entanglement and its exact positive one-way yield. No universal minimal-dimension
claim is made, and the rounded printed decimal is not used as an exact equality. -/
theorem hadamard_boundEntangled_positiveKey :
IsDensityMatrix rhoHadamard ∧ transposeBob rhoHadamard = rhoHadamard ∧
¬ Entanglement.IsSeparableDensity (partyCut rhoHadamard) ∧
Gap48.P42.bipartiteDistillable (physicalFin rhoHadamard) = 0 ∧
0 < hadamardRate ∧ HasMeasuredOneWayRate rhoHadamard hadamardRate ∧
ENNReal.ofReal hadamardRate ≤ Gap48.P42.distillableKey (physicalFin rhoHadamard) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P37
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , let if and , and let this entry be zero otherwise. Write , and, in key order , set
where flips Alice’s key bit. Put , where , with zero logarithmic terms interpreted as zero. The declaration asserts that is positive semidefinite with trace one; it is unchanged by transposing Bob’s key and shield indices, namely
its matrix across the party split cannot be expressed as a finite convex combination with , , and all positive semidefinite of trace one; its bipartite distillable quantity described below is zero; and
Here is the party-split matrix reindexed onto using the fixed chosen bijections , and . The condition means that there is one sequence of protocols, chosen before any purification, with the following property for every positive integer and every unit vector on key, shield, and whose pure-state matrix has shield-and-key marginal . Measuring both key indices and tracing out the shield gives blocks
set , and set if , otherwise . At each block length , the protocol has positive transcript and key alphabet sizes , a stochastic encoder for binary strings of length , and a POVM on Bob’s binary registers for every transcript ; a POVM consists of positive semidefinite matrices summing to the identity. With , , and , define
For this purification there must exist numbers tending to zero and a finite real such that, for every , ,
and there are density matrices and a single density matrix on transcript and Eve such that
including keys of zero weight, and . The quantity is the extended nonnegative supremum of all such that, for every , all sufficiently large positive admit a finite LOCC map taking within trace norm of a private matrix with positive key dimension , positive local shield dimensions, a shield density matrix , and shield unitaries , whose key blocks vanish except between and , where they equal , with . Such a map is built recursively from identities and complete finite local Kraus instruments, with the continuation allowed to depend on the instrument outcome and the final branches summed. The bipartite distillable quantity asserted to vanish is the extended nonnegative supremum of satisfying the analogous “every accuracy, every rate tolerance, every sufficiently large positive block length” condition for deterministic finite LOCC conversion to a density matrix within trace norm of , with ; its finite LOCC protocols allow local Kraus instruments, outcome-dependent continuation, and forgetting outcomes by mixing branches of common dimensions.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.