Asymptotically reversible conversion of pure states
OpenQAlgorithms.Papers.Independent.Support50.P42.pure_state_interconversionLet and be normalized shared pure states on positive finite local dimensions. Call achievable if, for every error and rate slack, all sufficiently large numbers of input copies admit finite local protocols producing target copies with vanishing global error and up to that slack. If , then
If , every nonnegative rate is achievable by local preparation. Thus equal positive entropies permit unit-rate interconversion, while a product input cannot achieve a positive rate to an entangled target. The source's printed reciprocal ratio is interpreted as input cost; the displayed ratio counts output copies per input copy.
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: full pure-state conversion rates. The printed reciprocal yield
is corrected to E(input)/E(output) for output dimensionedPower per input copy, as fixed
by concentration and dilution. Product targets require only local preparation. -/
theorem pure_state_interconversion (s t : Shared) (hs : IsPureShared s) (ht : IsPureShared t) :
(0<ent t → ∀ R : ℝ, ConversionRate s t R ↔ 0≤R ∧ R≤ent s/ent t) ∧
(ent t=0 → ∀ R : ℝ, 0≤R → ConversionRate s t R) := 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 bipartite states with positive finite local dimensions, positive semidefinite trace-one matrices , and unit vectors such that and . Put and , where , with zero eigenvalues contributing zero. For a real number , say that is a conversion rate here precisely when and, for every , there is a natural such that every natural admits a natural and a finite recursive LOCC map from the local dimensions of to those of , satisfying
The tensor powers are reindexed by the fixed equivalences between local strings and finite indices, and . The allowed 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. If , then, for every real , being such a conversion rate is equivalent to . If , every real is such a conversion rate. The output copy number may be zero, and no upper bound on is imposed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.