One classical bit merges the coherent classical-correlation example
ProvedQAlgorithms.Papers.Independent.Gap20.P11.exampleCorrelatedConsider the normalized purification
Its conditional entropy is . Alice measures in the normalized basis and sends the outcome as one classical bit. Bob applies the conditional isometry , with a local ancilla. The measurement is complete, each decoder is a quantum channel, and the resulting density operator is exactly
with Alice's remaining register trivial. No quantum message or initial shared resource is used. This recovers the coherent purification against , rather than merely recovering the diagonal density .
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 p.4, example 2: S(A|B)=0 and the explicit plus/minus protocol recovers
all coherences with R, not merely the diagonal mixed marginal rho_AB. -/
theorem exampleCorrelated :
IsState correlatedPurification ∧
conditionalEntropy (traceLeft (pureDensity correlatedPurification)) = 0 ∧
IsKrausFamily plusMinusRow ∧
(∀ s, IsChannel (conjSuperop (correlatedDecoder s))) ∧
idTensorSuperop correlatedOperation (pureDensity correlatedPurification) =
pureDensity correlatedTarget := by sorry
end QAlgorithms.Papers.Independent.Gap20.P11
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let , with Boolean values identified with , and let , where is the unique element of . Then , and the matrix obtained from by tracing out its first Boolean register has conditional entropy , where the conditional entropy of a matrix on two registers is and , interpreted by continuous functional calculus. Define and . The rows satisfy , and, for each Boolean , the map is a channel, meaning that it admits a finite Kraus representation with the sum of Kraus adjoint-products equal to the identity. For , applying to the last two registers while leaving the first register unchanged gives .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.