No positive-probability entangled pure output from a product input
ProvedQAlgorithms.Papers.Independent.Support50.P42.zero_entanglementLet the shared input be a normalized pure state with entropy of entanglement zero. Consider any finite adaptive local protocol, allowing classical messages, local ancillas, disposal and postselection. Every pure final leaf of positive probability satisfies
Consequently an entangled pure target cannot be prepared with any positive success probability. This retains the source's exact postselection obstruction, rather than only a zero asymptotic rate; formal zero-probability leaves do not count as successful preparations.
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.16: exact postselection obstruction; every positive-probability pure
leaf from a product input has zero entanglement. Zero-downCount leaves do not
witness successful preparation. -/
theorem zero_entanglement (s : Shared) (hs : IsPureShared s) (hzero : ent s=0)
(out : List (ℝ × Shared)) (hlocal : LocalTree s out) :
∀ w∈out, 0<w.1 → IsPureShared w.2 → ent w.2=0 := 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 be a bipartite state with positive finite local dimensions and positive semidefinite trace-one matrix . Suppose for a unit vector , and , where , with zero eigenvalues contributing zero. Let be any finite list of pairs consisting of a real weight and another such bipartite state, obtainable from by the following recursive rules: stopping produces ; a local instrument chooses one party, uses finitely many outcome groups of Kraus matrices whose lifted completeness sum is , leaves the other party’s dimension unchanged, and produces states and nonnegative weights summing to one with equal to the corresponding Kraus output, after which recursive branch lists are concatenated with their weights multiplied by ; or an obtainable list may be replaced by when all its state dimensions equal those of and their weighted matrix sum is . Then every pair occurring in satisfies
The conclusion applies only to strictly positive-weight entries whose output states are pure; it imposes no entropy conclusion on other entries.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.