§6.1.2 (6.9)–(6.11): entanglement interpretations of min-entropy
OpenQAlgorithms.Papers.Independent.Intakenext100.P07.min_entropy_recoveryAll quantum systems below are finite-dimensional complex Hilbert spaces of positive dimension, and logarithms are binary. A normalized state is positive semidefinite with trace one; a subnormalized state has trace at most one. Marginals are partial traces. Here is squared algebraic fidelity, is squared generalized fidelity, is purified distance, and . The symbols and denote conditional min- and max-entropy, with values and at zero. Smoothing optimizes over all subnormalized states in the purified-distance ball; every entropy radius satisfies .
exp(−Hmin)=d_A max_E Tr[E_B→Aprime(ρ_AB)ψ_AAprime]. On normalized centers this is squared-fidelity recovery with lower bound −log d_A; the dual dimension-swapped formula (6.11) gives lower bound −log d_B.
This result records the source’s operational or structural relation, with the stated endpoint and attainment clauses retained.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P07
noncomputable section
open Filter
open scoped BigOperators Matrix ComplexConjugate ComplexOrder Matrix.Norms.L2Operator Topology
namespace QAlgorithms.Papers.Independent.Intakenext100.P07
attribute [local instance] Classical.propDecidable Classical.decEq
variable {I J A B C D X Y Z : Type*}
variable [Fintype I] [DecidableEq I] [Fintype J] [DecidableEq J]
variable [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
variable [Fintype C] [DecidableEq C] [Fintype D] [DecidableEq D]
variable [Fintype X] [DecidableEq X] [Fintype Y] [DecidableEq Y]
variable [Fintype Z] [DecidableEq Z]
/-- NODE paper:1504.00233#6.operationalmin
§6.1.2 (6.9)–(6.11): entanglement interpretations of min-entropy, arXiv:1504.00233v5, PDF p.93,94. -/
theorem min_entropy_recovery [Nonempty A] [Nonempty B] (r : paperMat (A × B)) (hr : paperSubnormalized r) :
(∃ E : paperMat B →ₗ[ℂ] paperMat A, paperCPTP E ∧
ENNReal.ofReal ((Fintype.card A:ℝ)*(idTensorSuperop E r*paperEntangled A).trace.re) = expE (-paperHmin r) ∧
(∀ F : paperMat B →ₗ[ℂ] paperMat A, paperCPTP F →
(idTensorSuperop F r*paperEntangled A).trace.re ≤ (idTensorSuperop E r*paperEntangled A).trace.re) ∧
(IsDensityMatrix r → paperHmin r = -paperLogE ((Fintype.card A:ℝ)*paperFidelity (idTensorSuperop E r) (paperEntangled A)))) ∧
(∃ E : paperMat B →ₗ[ℂ] paperMat A, paperCPTP E ∧
ENNReal.ofReal ((Fintype.card B:ℝ)*(r*preparedEntangled E).trace.re) = expE (-paperHmin r) ∧
(∀ F : paperMat B →ₗ[ℂ] paperMat A, paperCPTP F → (r*preparedEntangled F).trace.re ≤ (r*preparedEntangled E).trace.re)) ∧
(IsDensityMatrix r → (-Real.logb 2 (Fintype.card A):EReal) ≤ paperHmin r ∧
(-Real.logb 2 (Fintype.card B):EReal) ≤ paperHmin r) := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P07
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let be nonempty finite types with decidable equality, and let on satisfy , including . Write when , and define
For a nonempty finite type , let be the matrix on with entries
For a complex-linear map from matrices on to matrices on , let denote blockwise application,
and define a matrix on by
There exists a completely positive complex-linear map preserving the complex trace of every matrix such that
and every other such map satisfies
For this same , if has complex trace , then
There also exists a completely positive trace-preserving complex-linear map , chosen independently of the preceding existential witness, such that
for every completely positive trace-preserving complex-linear . Finally, if has trace , then
in the extended reals. Complete positivity requires positivity of every finite amplification, including dimension ; and otherwise embeds the real base-two logarithm; truncates below at ; and sends to , to , and finite to .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.