Theorem 5, Eq. (9): cost versus one-way distillation
OpenQAlgorithms.Papers.Independent.Gap48.P35.cost_distillation_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. Compute its , , and marginals from that state. The distillation term permits communication .
This retains unrestricted preparation cost and one-way distillation; the state need not be pure.
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.4, Theorem 5, Eq.(9): unrestricted formation cost and one-way distillation from the two marginals of the same arbitrary state. -/
theorem cost_distillation_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) :
finiteSystemPreparationCost (marginalRA rho) + distillLeft (marginalRB rho) ≤ vnEntropy (traceRight 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 sets , each equipped with decidable equality, and every positive semidefinite complex matrix on with , let , , and . Then
where , with applied by spectral functional calculus. Here is the infimum over all real such that, for every , there exist natural numbers with and a finite local-operations-and-classical-communication map satisfying and , where is the projector onto , , and the systems and their tensor powers are reindexed using the fixed finite-coordinate bijections in the definitions. Such a finite local map is obtained recursively from identity maps by finitely many local Kraus measurements, each satisfying , with a subsequent finite local map chosen separately for each outcome and the resulting branches summed. The number may be zero, and the witnessing block length may depend on both tolerances. The quantity is the supremum over all real for which there is a protocol for every natural block length , including zero: the sender applies a finite instrument with a positive number of classical outcomes and rectangular Kraus operators , satisfying , and, conditional on , the receiver applies a finite Kraus channel to , with . If is the sum of the resulting branches, the required limits are and , where . No communication bound is imposed in this definition of ; the quotient at is defined as zero and does not affect either limit.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.