State merging simultaneously uses I(A:R) classical bits per copy
OpenQAlgorithms.Papers.Independent.Gap20.P11.classicalMergingRateLet be a normalized pure state of finite, nonzero-dimensional complex registers, with source density . All entropies use base two. For independent source copies, Alice can perform a finite-outcome quantum instrument and send its outcome to Bob, who applies a conditional local channel. The code depends on the source density, and no operation acts on .
The source-only expression for the classical cost equals the actual Alice–reference mutual information:
For every , every sufficiently large positive admits such a code with full joint trace-norm error at most and an outcome alphabet of size satisfying
The same code has the separate Bell consumption and yield guarantees of optimal merging, and uses no initial Bell pairs when . The joint target includes the final Bell pairs. This is the communication cost of the stated LOCC construction; it is not a converse for protocols supplied with free quantum messages.
import Definitions.Def_QAlgorithms_Papers_Independent_Gap20_P11
noncomputable section
namespace QAlgorithms.Papers.Independent.Gap20.P11
open scoped Matrix ComplexConjugate
open QAlgorithms.Papers.Independent.Gap48.P20 (Copies)
open QAlgorithms.Papers.Independent.Information100.P67 (conditionalEntropy)
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.3–4: the stated merging construction has classical communication
I(A:R), simultaneously with its optimal EPR cost/yield. The equality relates the
computed source-only expression to the actual reference marginal; no decoupling
or entropy-duality conclusion has been assumed as a hypothesis. -/
theorem classicalMergingRate {A B R : Type} [Fintype A] [Fintype B] [Fintype R]
[Nonempty A] [Nonempty B] [Nonempty R]
(psi : EuclideanSpace ℂ (R × (A × B))) (hpsi : IsState psi) :
classicalCost (traceLeft (pureDensity psi)) = referenceInformation psi ∧
MergingConstruction (traceLeft (pureDensity psi))
(referenceInformation psi) (conditionalEntropy (traceLeft (pureDensity psi))) := by sorry
end QAlgorithms.Papers.Independent.Gap20.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For any nonempty finite types and any vector with , let , , and use subscripts to denote the other reduced matrices; explicitly, . With , where is applied by continuous functional calculus, the asserted equality is
Set and . For every , all sufficiently large positive integers admit natural numbers , a positive number of outcomes, matrices satisfying , and maps from matrices on to matrices on , each having a finite Kraus representation with completeness sum . The operation , with and tensor products extended linearly from matrix units, must reconstruct every unit-vector purification of with reference , preserving its source copies and reference, moving to Bob, and replacing the initial shared vector by , with trace norm error at most . Here . It must also satisfy
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.