Unnumbered construction, Eqs.9–12: PPT-invariant key-bearing states rho_U
OpenQAlgorithms.Papers.Independent.Intakenext100.P37.unitaryConstruction_ppt_positiveKeyLet and let be any unitary on . Define , let transpose only, and put , , and . Construct by Eq. (9) with and , retaining its two distinct positive square roots. Then is a density matrix, invariant under transposition of the physical Bob registers , and
If has more than nonzero entries, then , , and measuring followed by one sequence of forward public-discussion protocols achieves for every purifying Eve. In this case is nonseparable across and its LOCC Bell-pair yield is zero. This constructs the state from rather than assuming witnesses for the blocks or the weights. Equivalently, when implementing this Eq. (9) matrix through the Alice-key flip of Eq. (1), the second unflipped private bit is the X-form of , because that flip reverses the two odd corner blocks.
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 p.2, Eqs.(9)--(12): construction from U itself, PPT invariance on BB',
and strictly positive one-way key whenever there are more than d nonzero entries.
Printed root slips after Eq.(11) are corrected: the roots of WW-adjoint and
W-adjoint-W have diagonals |u_ij| and |u_ji|, respectively; observation (ii)
concerns the shield partial transpose of W. These actual roots are computed
by xForm, since direct multiplication determines them uniquely. The odd upper
block is X2 as in Eq.(9), using xForm (X2 adjoint) before the Alice-key flip. -/
theorem unitaryConstruction_ppt_positiveKey {d : ℕ} (hd : 0 < d)
(U : Matrix.unitaryGroup (Fin d) ℂ) :
letI : Nonempty (Fin d) := ⟨⟨0,hd⟩⟩
let V : Op (Fin d) := U
IsDensityMatrix (rhoUnitary V) ∧ transposeBob (rhoUnitary V) = rhoUnitary V ∧
traceNorm (weightedSwap V) = entrySum V ∧
traceNorm (transposeSecond (weightedSwap V)) = d ∧
0 < weightOne V ∧ 0 < weightTwo V ∧ weightOne V + weightTwo V = 1 ∧
weightOne V / weightTwo V = entrySum V / d ∧
(d < nonzeroEntries V →
0 < 1-binEntropy2 (weightOne V) ∧
HasMeasuredOneWayRate (rhoUnitary V) (1-binEntropy2 (weightOne V)) ∧
ENNReal.ofReal (1-binEntropy2 (weightOne V)) ≤
Gap48.P42.distillableKey (physicalFin (rhoUnitary V)) ∧
¬ Entanglement.IsSeparableDensity (partyCut (rhoUnitary V)) ∧
Gap48.P42.bipartiteDistillable (physicalFin (rhoUnitary V)) = 0) := 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 every positive natural number and every unitary complex matrix , write , let
and write . For any shield matrix , define, in key order ,
where flips Alice’s key bit. The declaration asserts that is positive semidefinite with trace one and is invariant under transposition of Bob’s key and shield indices; explicitly, its entries satisfy
It also asserts
where . If the number of nonzero entries of is strictly greater than , it further asserts, with ,
Here , with zero logarithmic terms zero; is across the split , reindexed onto by the fixed chosen local bijections; and separability means a finite convex combination of tensor products of local positive semidefinite trace-one matrices. The condition requires one protocol sequence chosen before any purification and working for every positive integer and every unit purification of with purifying register . For each purification, measuring the key indices and tracing out the shield gives
put , and if , otherwise . At every length , the protocol has positive transcript and key sizes , a stochastic encoder on binary strings of length , and a decoding POVM on Bob’s binary registers for each transcript . Put , , , and
For each purification there must exist tending to zero and a finite such that, for every , , , and ; there must also be density matrices and a common density matrix with and for every key, including zero-weight keys, and . The quantity is the extended nonnegative supremum of rates 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, shield density matrix , and shield unitaries , whose only nonzero key blocks are between and , with . Its finite LOCC maps are generated by identities and complete finite local Kraus instruments, with outcome-dependent continuations and summed branches. The quantity is the extended nonnegative supremum of rates such that, for every , all sufficiently large positive admit deterministic finite local Kraus protocols, allowing outcome-dependent continuation and forgetting outcomes by mixing branches of common dimensions, whose output is within trace norm of copies of , with . The case is included in the unconditional assertions; the further assertions are required only when the strict nonzero-entry-count hypothesis holds.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.