Corollary 9, Eq. (14): two-way distillation versus joint entanglement cost
OpenQAlgorithms.Papers.Independent.Gap48.P35.two_way_distillation_cost_tradeoffAll systems are finite nonzero-dimensional complex quantum systems. Density states are positive semidefinite with trace one, and is von Neumann entropy in bits. Write for formation, for maximal Holevo correlation measured on the second party, for asymptotic singlet preparation cost, for EPR distillation rate, for net common randomness, and for secret-key rate. A left arrow means communication from the second legitimate party to the first. Key secrecy includes all public transcripts. Asymptotic tasks use independent copies, vanishing error and no extra initially shared resource.
Let be any density state. Both distillation terms permit unrestricted two-way classical communication. The right side is singlet preparation cost across the grouped cut .
This compares two-way yields to joint formation cost, without a purity restriction.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P35
namespace QAlgorithms.Papers.Independent.Gap48.P35
open scoped Matrix ComplexConjugate ComplexOrder
open Filter Topology
open Information100.P21 (Op)
open Information100.P08 (IsPure formation measuredCorrelation)
open Dependency50.P19 (marginalRA marginalRB)
noncomputable section
/-- PDF p.6, Corollary 9, Eq.(14): TWO-WAY distillation on the left and joint formation cost on the right, for arbitrary mixed states. -/
theorem two_way_distillation_cost_tradeoff {A : Type} {B : Type} {C : Type}
[Fintype A] [DecidableEq A] [Nonempty A] [Fintype B] [DecidableEq B] [Nonempty B] [Fintype C] [DecidableEq C] [Nonempty C]
(rho : Op (A × (B × C))) (hrho : IsDensityMatrix rho) :
distillTwoWay (marginalRA rho) + distillTwoWay (marginalRB rho) ≤ finiteSystemPreparationCost rho := by sorry
end
end QAlgorithms.Papers.Independent.Gap48.P35
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For all finite, nonempty , each with decidable equality, and every positive semidefinite trace-one matrix on , writing and , one has
All systems are first reindexed by the fixed bijections with finite index sets used in the definitions. For a bipartite state , is the supremum over real for which there exist positive integers and finite local-operations-and-classical-communication maps , for every natural , such that
The quantity is the infimum over real such that, for every , there exist natural numbers , with , and a finite local map satisfying and , where projects onto and . In both definitions a finite local map is built recursively from identities by finite local Kraus measurements on either party, satisfying , followed by outcome-dependent finite local maps and summation of the branches; no communication bound is imposed. Formation permits and chooses a block length separately for each pair of tolerances, whereas the distillation definition requires a sequence valid also at , with its rate quotient defined as zero.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.