Corrected fixed-pair and optimized multipartite GHZ bounds
OpenQAlgorithms.Papers.Independent.Gap48.P42.multipartite_private_rateLet there be parties, a key dimension , and positive finite local shield dimensions . Let be any positive semidefinite trace-one operator on the joint shield, and let be arbitrary unitaries on that whole shield. Party owns its key and shield registers. The exact private state is
For every ordered pair , let be the maximum of over product vectors whose every local factor has norm one. All these maxima are attained. For any choice of maximizing vectors for every pair, compute
They satisfy and . The balanced local success operators are contractions and yield exactly the unnormalized mixture , of trace , where project onto . Set
Then , , and both the fixed-pair and optimized bounds hold:
Here is binary entropy in bits, and is the unconditional asymptotic vanishing-error GHZ rate per input copy under adaptive trace-preserving LOCC. The finite maximum retains the optimization over key pairs.
Source corrections. The printed rate uses and omits a factor two in the entropy argument. The two equal unnormalized diagonal entries are , fixing both corrections. The mixture formula (2.6) itself already contains the correct outer .
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P42
namespace QAlgorithms.Papers.Independent.Gap48.P42
open scoped BigOperators Matrix ComplexConjugate ComplexOrder ENNReal
noncomputable section
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.3, Eq.(2.6) and fixed-pair/optimized bounds, note [11] p.5.
Source correction: printed a_max is replaced by 2 min(a_1,a_2)/d, and
printed 1/2+eta/sqrt(a_1*a_2) by 1/2+eta/(2 sqrt(a_1*a_2)). The computed
success output has both diagonal entries min(a_1,a_2)/d, forcing these changes.
The complete fixed-pair conclusions and finite maximum are retained. -/
theorem multipartite_private_rate {N d : ℕ} (hN : 2 ≤ N) (hd : 2 ≤ d)
(S : Fin N → ℕ) (hS : ∀ k, 0 < S k)
(rho : Matrix (PartyBasis S) (PartyBasis S) ℂ) (hrho : IsDensityMatrix rho)
(U : Fin d → Matrix.unitaryGroup (PartyBasis S) ℂ) :
(∀ p : KeyPair d, ∃ f g : ProductVectors S,
Maximizes (shieldBlock rho U p.val.1 p.val.2) f g) ∧
∀ v : KeyPair d → ProductVectors S × ProductVectors S,
(∀ p, Maximizes (shieldBlock rho U p.val.1 p.val.2) (v p).1 (v p).2) →
(∀ p, PairConclusion rho U p.val.1 p.val.2 (v p).1 (v p).2) ∧
0 < bestPairYield rho U v ∧
ENNReal.ofReal (bestPairYield rho U v) ≤
distillableGHZ (fun k => d * S k) (indexedPrivateDit rho U) := by sorry
end
end QAlgorithms.Papers.Independent.Gap48.P42
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every pair of natural numbers with and , every family of positive integers indexed by , every positive semidefinite trace-one matrix on , and every family of unitaries on , indexed by , put and , where the supremum ranges over all families with . For each ordered index pair , unit factor families attaining exist. Moreover, for every simultaneous choice of such maximizing families for every , the following conclusions hold for every pair. Set , , , , , and , where . Then , , , and . Using the fixed bijections , define the matrix whose block between the constant key strings and is , with all blocks involving nonconstant key strings zero. For the chosen pair, define for , and . Every is positive semidefinite, and satisfies , with trace , where . Each is at most ; additionally is strictly positive and . Here is the supremum of , with , over nonnegative rates for which every admits a threshold after which every positive integer has an integer and a deterministically obtainable density matrix satisfying and , where and copies are grouped by party using fixed cardinality bijections. The trace norm is . Deterministic obtainability means that a finite adaptive tree ends in the list : a node applies one party’s finite Kraus instrument, with nonnegative probabilities summing to , normalized output states obeying , and global completeness , followed by branch-dependent trees; output ensembles of identical local dimensions may also be replaced by their weighted sum. Every state in such a tree has positive local dimensions. The index-pair set is nonempty because ; shield dimensions equal to and zero extracted copies are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.