Classical correlation defeats the purification-minimum prescription
ProvedQAlgorithms.Papers.Independent.Support50.P42.purification_measure_counterexampleLet . Consider all normalized pure states on with arbitrary positive finite ancillary dimensions for whose partial trace over the ancillas is the displayed classically correlated two-qubit density. The set of their entropies across is nonempty and bounded below, but
Nevertheless the two-qubit state is separable and an actual finite local protocol prepares it from a one-dimensional product input, without any singlets. This is the source's objection to this proposed measure, distinct from its operational formation definition.
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P42
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P42
open scoped BigOperators Matrix ComplexConjugate
open MeasureTheory ProbabilityTheory
attribute [local instance] Classical.propDecidable Classical.decEq
-- Reuse the exact accepted objects, without introducing same-name aliases.
open Information100.P21 (Op Vec FiniteLOCC)
open Dependency50.P42 (dimensionedPower singlets)
open Dependency50.P48 (pureFidelity)
open Gap48.P32 (pairOfState)
open Next46.P39 (rectAct)
/-- PDF p.17: the purification-minimum prescription assigns positive value
to a classically correlated density obtainable by actual local preparation
from no shared entanglement. Both ancillary dimensions vary in the infimum. -/
theorem purification_measure_counterexample :
(purificationScores classicalPair).Nonempty ∧ BddBelow (purificationScores classicalPair) ∧
0<purificationMinimum classicalPair ∧ Entanglement.IsSeparablePositive classicalPair ∧
∃ L : Superop (Fin 1 × Fin 1) (Fin 2 × Fin 2),
FiniteLOCC L ∧ L (1 : Op (Fin 1 × Fin 1))=classicalPair := by sorry
end QAlgorithms.Papers.Independent.Support50.P42
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let . Form the set of all real numbers obtained by choosing arbitrary positive natural dimensions and a unit vector on satisfying
Here , with zero eigenvalues contributing zero. This set is nonempty and bounded below, and its real infimum is strictly positive. Also, is a finite sum of tensor products of local positive semidefinite trace-one matrices with nonnegative coefficients, with no separate coefficient-sum condition in that definition, and there exists a finite recursive LOCC map from matrices on to matrices on such that . Such LOCC maps are generated by identities and complete finite local Kraus measurements on either party, followed by outcome-dependent recursive continuations and summation over outcomes. The statement asserts positivity of the infimum, without asserting that a purification attains it.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.