Equality in (1) (pp. 3–4) — equality forces ρ^ij_A′ to depend only on i and ρ^ij_B′ only on j on the support of p
ProvedNoLocalBroadcast.Broadcast.display_1_equalitymutual-informationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1strict-concavityvon-neumann-entropy
In the setting of display (1) — finite sets , , a probability distribution on , states of and — suppose that
Then
- whenever and ;
- whenever and .
That is, on the support of the reduction depends only on and only on , which is the paper's " and ". It is the step of Theorem 3's proof that shows to be classical-classical.
Formalization Note The conventions are those of display (1); is traceRight (ρij (i,j)) and is traceLeft (ρij (i,j)).
Differences from the source:
- generalization: the specific σ̃ of the proof of Theorem 3, with equality I(σ̃) = I_CC(ρ) + Σ p_ij I(ρ^ij) → every σ̃ of the form Σ_ij p_ij |i⟩⟨i| ⊗ |j⟩⟨j| ⊗ ρ^ij, with equality I(σ̃) = I({p_ij}) + Σ p_ij I(ρ^ij); reason: in the proof I({p_ij}) = I_CC(ρ), so the proof's equality is an instance
- reading: ρ^ij_A′ = ρ^i_A′ and ρ^ij_B′ = ρ^j_B′ (ρ^i_A′, ρ^j_B′ not defined) → on the support of p, ρ^ij_A′ does not depend on j and ρ^ij_B′ does not depend on i; reason: the only meaning of the notation; off the support ρ^ij does not enter σ̃
- encoding: ρ^ij defined where p_ij > 0 → ρ^ij a state for every (i, j); reason: the conclusion only concerns pairs with p_ij > 0
- encoding: log of unspecified base in S(ρ) = −Tr ρ log ρ → QAlgorithms.vnEntropy, base 2; reason: every statement here is invariant under the base of the logarithm
- encoding: σ̃ = Σ_ij p_ij |i_A j_B⟩⟨i_A j_B| ⊗ ρ^ij_{A′B′} on registers A, B with orthonormal states and quantum systems A′, B′, cut AA′ : BB′ → flaggedState p ρij on (ι × a′) × (κ × b′) for finite register types ι, κ and nonempty finite a′, b′, registers the computational bases of ι, κ; ρ^ij_{A′} = traceRight (ρij ij), ρ^ij_{B′} = traceLeft (ρij ij); reason: any orthonormal register gives a unitarily equivalent state with the same entropies; empty ι or κ is excluded by Σ p = 1; same instances
Preamble
import Mathlib import Definitions.Def_NoLocalBroadcast_Broadcast_Model
Formal statement
namespace NoLocalBroadcast.Broadcast
open Matrix
open scoped Kronecker
/-- Equality in (1), pp. 3–4: if `I(σ̃) = I({p_ij}) + Σ_{ij} p_{ij} I(ρ^{ij})`, then on the support
of `p` the reduction `ρ^{ij}_{A′}` does not depend on `j` and `ρ^{ij}_{B′}` does not depend on `i`. -/
theorem display_1_equality {ι κ a' b' : Type} [Fintype ι] [DecidableEq ι] [Fintype κ]
[DecidableEq κ] [Fintype a'] [DecidableEq a'] [Nonempty a'] [Fintype b'] [DecidableEq b']
[Nonempty b']
(p : ι × κ → ℝ) (hp0 : ∀ ij, 0 ≤ p ij) (hp1 : ∑ ij, p ij = 1)
(ρij : ι × κ → Matrix (a' × b') (a' × b') ℂ)
(hρij : ∀ ij, QAlgorithms.IsDensityMatrix (ρij ij))
(heq : mutualInfo (flaggedState p ρij) =
mutualInfo (Matrix.diagonal fun ij => (p ij : ℂ)) + ∑ ij, p ij * mutualInfo (ρij ij)) :
(∀ i j j', 0 < p (i, j) → 0 < p (i, j') →
QAlgorithms.traceRight (ρij (i, j)) = QAlgorithms.traceRight (ρij (i, j'))) ∧
(∀ i i' j, 0 < p (i, j) → 0 < p (i', j) →
QAlgorithms.traceLeft (ρij (i, j)) = QAlgorithms.traceLeft (ρij (i', j))) := by sorry
end NoLocalBroadcast.Broadcast
Source
Piani, Horodecki & Horodecki, No-local-broadcasting theorem for quantum correlations, arXiv:0707.0848v2, pp. 3–4, equality in (1), proof of Theorem 3
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.