Entropy-efficient pure-state dilution
OpenQAlgorithms.Papers.Independent.Support50.P42.pure_state_dilutionLet be any normalized pure state on positive finite local dimensions, and let in bits. There are integer singlet budgets and local one-way preparation channels such that
Each protocol requires at most classical bits, corresponding to the direct compressed-teleportation method. If , every may be zero. Vanishing trace distance is equivalent to fidelity tending to one for these pure targets. This states entropy-efficient dilution without imposing a mixed-state entropy formula or a later classical-communication improvement.
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 pp.4,15--16: entropy-efficient pure-state dilution with global error
vanishing, and two cbits per compressed qubit in the direct method. No mixed
single-letter cost or later sublinear message refinement is claimed. -/
theorem pure_state_dilution (s : Shared) (hpure : IsPureShared s) :
∃ m : ℕ → ℕ, ∃ L : (n : ℕ) → Superop (Fin (2^(m n)) × Fin (2^(m n)))
(Fin ((s.dims 0)^n) × Fin ((s.dims 1)^n)),
(∀ n, FiniteLOCC (L n) ∧ OneWayBits (2*m n) (L n)) ∧
Filter.Tendsto (fun n : ℕ => (m n : ℝ)/(n : ℝ)) Filter.atTop (nhds (ent s)) ∧
Filter.Tendsto (fun n : ℕ => traceDistance (L n (singlets (m n)))
(dimensionedPower (pairOfState s) n)) Filter.atTop (nhds (0 : ℝ)) ∧
(ent s=0 → ∀ n, m n=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 a positive semidefinite trace-one matrix , obtained from its two-register representation by indexing the registers as an ordered pair. Suppose for some unit vector . Write , where , with zero eigenvalues contributing zero. There exist a sequence of natural numbers and maps
such that, for every natural , is finite recursive LOCC and admits a one-way implementation with at most classical outcomes; moreover,
Here is the tensor power reindexed using fixed equivalences between length- local strings and indices of sizes ; is the correspondingly reindexed -fold tensor power of the antisymmetric singlet projector, and . The trace norm is . Finite recursive LOCC maps are generated by identities and complete finite local Kraus measurements followed by outcome-dependent recursive continuations on either party. The one-way requirement means that , with , at most indices , and finite Kraus channels . All requirements on include ; the displayed rate sequence uses the totalized value there.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.