Definitions for Concentrating Partial Entanglement by Local Operations
DefinitionQAlgorithms_Papers_Independent_Support50_P42The objects the formalized statements of Concentrating Partial Entanglement by Local Operations (arXiv:quant-ph/9511030) are stated in. Each was checked against the paper by a blind read-back and a moderator.
Shared: PDF pp.3--4: reuse normalized shared states with two positive local dimensions.LocalTree: PDF pp.4--6: reuse finite adaptive selective LOCC, including local disposal.IsPureShared: PDF pp.3--4: normalized pure state; Shared also represents mixed states.ent: PDF p.4, Eq.(4): entropy of Bob's reduced density.RepresentsShared: PDF pp.3--4: exact state identification via zero-extension outside its basis.ExactYield: PDF pp.4--8: integer exact-singlet counts at actual selective LOCC leaves. No normalization is imposed at zero-probability leaves. Disposal is local.downCount: PDF pp.5--6: down-spin count in the common fixed Schmidt basis.schmidtBlock: PDF p.5, Eq.(5): n identical pairs, with p=sin squared theta.schmidtTypeProjector: PDF pp.5--6: local type projector, independent of the bias.schmidtOutcomeWeight: PDF p.6, Eq.(6): binomial Born probability, including the two endpoints.typeState: PDF pp.6--8: uniform correlated type ket, used as a state only for k<=n.projectedYield: PDF p.8, Eq.(8): entropy yield before standardization, not an integer count.outcomeEntropy: PDF pp.6,8: finite Shannon entropy; zero-weight terms are zero.aliceKetBranch: PDF p.6: refined local Kraus branch, with any local environment retained.uniformKet: PDF p.7: maximally entangled ket of positive local rank d. At d=0 this is zero and is never called a normalized state.trim: PDF p.7: success map onto the first 2^ell local coordinates.trimFailure: PDF p.7: complementary failure projector, without branch normalization.circlePosition: PDF p.8, Eq.(9): circular position after m steps, starting at zero.diagonalKet: PDF p.9: Schmidt-diagonal pure ket.leastAmplitude: PDF p.9: least amplitude. Theorems require a nonempty finite list.procrusteanSuccess: PDF p.9: retained amplitude ratio; zero amplitudes give zero success.filterFailure: PDF p.9: complementary failure Kraus operator.procrusteanYield: PDF pp.9,20: expected one-pair Procrustean singlet yield.sourceKet: PDF pp.11,14: Q-prime source ket with uniform binary labels.flaggedEncoder: PDF pp.13--14: flagged encoder, retaining no coherence between classical k values.bareEncoder: PDF p.13: bare transmission, forgetting k without further decoding.codingFidelity: PDF pp.12--14: source-average fidelity for a fixed label-independent decoder.OneWayBits: PDF pp.15--17: one-way local protocol with at most bits cbits. Alice's complete instrument has private Kraus index z; only i is communicated. Bob's CPTP continuation depends on i. No free numerical cost field is used.ConversionRate: PDF pp.15--16: eventual state-conversion rates with global vanishing error. Both tolerances precede n. Half trace distance has the same zero-error limit as squared pure-target fidelity; no single-copy convex roof is involved.FormationRate: PDF p.17: eventual operational formation rates; not existential-block rates.SingletDistillationRate: PDF p.17: eventual operational singlet yield with whole-target error.formationCost: PDF p.17: least operational cost. Nonempty bounded-below feasibility is concluded below.singletDistillable: PDF p.17: greatest operational yield. Zero feasibility and boundedness are concluded below.classicalPair: PDF pp.16--17: one classically correlated shared pair.twoPairs: PDF p.16: two shared pairs, regrouped as Alice's two spins versus Bob's.discardSecond: PDF p.16: discard the second spin locally at both sites.purificationScores: PDF p.17: purification entropies with variable positive finite C,D and AC:BD partition.purificationMinimum: PDF p.17: the rejected minimum prescription; feasibility is concluded below.wernerState: PDF p.17, Eq.(11): the fixed Werner density.wernerBranch: PDF p.17: product state conditional on n independent fair preparation choices.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Claimed50_P33
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P42
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P48
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P32
import Definitions.Def_QAlgorithms_Papers_Independent_Next46_P39
/-! Bennett--Bernstein--Popescu--Schumacher, arXiv:quant-ph/9511030v1.
PDF pages are cited below. Entropies are in bits. Compilation and independent
moderation are pending. Deferred full nodes are recorded in HARD.md. -/
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.3--4: reuse normalized shared states with two positive local dimensions. -/
abbrev Shared := Claimed50.P33.FiniteState 2
/-- PDF pp.4--6: reuse finite adaptive selective LOCC, including local disposal. -/
abbrev LocalTree := @Claimed50.P33.LOCC 2
/-- PDF pp.3--4: normalized pure state; Shared also represents mixed states. -/
def IsPureShared (s : Shared) : Prop :=
Information100.P08.IsPure (pairOfState s)
/-- PDF p.4, Eq.(4): entropy of Bob's reduced density. -/
def ent (s : Shared) : ℝ := vnEntropy (traceLeft (pairOfState s))
/-- PDF pp.3--4: exact state identification via zero-extension outside its basis. -/
def RepresentsShared {a b : ℕ} (rho : Op (Fin a × Fin b)) (s : Shared) : Prop :=
s.dims 0=a ∧ s.dims 1=b ∧ ∀ x y : Fin 2 → ℕ,
Claimed50.P33.stateEntry s x y =
if h : x 0<a ∧ x 1<b ∧ y 0<a ∧ y 1<b then
rho (⟨x 0,h.1⟩,⟨x 1,h.2.1⟩) (⟨y 0,h.2.2.1⟩,⟨y 1,h.2.2.2⟩) else 0
/-- PDF pp.4--8: integer exact-singlet counts at actual selective LOCC leaves.
No normalization is imposed at zero-probability leaves. Disposal is local. -/
def ExactYield (s : Shared) (n : ℕ) (y : ℝ) : Prop :=
∃ input : Shared, RepresentsShared (dimensionedPower (pairOfState s) n) input ∧
∃ out : List (ℝ × Shared), LocalTree input out ∧ ∃ count : Shared → ℕ,
(∀ w ∈ out, 0<w.1 → RepresentsShared (singlets (count w.2)) w.2) ∧
y=(out.map fun w => w.1*(count w.2 : ℝ)).sum
/-- PDF pp.5--6: down-spin count in the common fixed Schmidt basis. -/
def downCount {n : ℕ} (x : Fin n → Bool) : ℕ := (Finset.univ.filter fun i => x i).card
/-- PDF p.5, Eq.(5): n identical pairs, with p=sin squared theta. -/
def schmidtBlock (n : ℕ) (p : ℝ) : Vec ((Fin n → Bool) × (Fin n → Bool)) :=
WithLp.toLp 2 fun z => if z.1=z.2 then
∏ i, ((if z.1 i then Real.sqrt p else Real.sqrt (1-p)) : ℂ) else 0
/-- PDF pp.5--6: local type projector, independent of the bias. -/
def schmidtTypeProjector (n k : ℕ) : Op (Fin n → Bool) :=
Matrix.diagonal fun x => if downCount x=k then 1 else 0
/-- PDF p.6, Eq.(6): binomial Born probability, including the two endpoints. -/
def schmidtOutcomeWeight (n : ℕ) (p : ℝ) (k : ℕ) : ℝ :=
(n.choose k : ℝ)*(1-p)^(n-k)*p^k
/-- PDF pp.6--8: uniform correlated type ket, used as a state only for k<=n. -/
def typeState (n k : ℕ) : Vec ((Fin n → Bool) × (Fin n → Bool)) :=
WithLp.toLp 2 fun z => if z.1=z.2 ∧ downCount z.1=k then
((Real.sqrt (n.choose k : ℝ))⁻¹ : ℂ) else 0
/-- PDF p.8, Eq.(8): entropy yield before standardization, not an integer count. -/
def projectedYield (n : ℕ) (p : ℝ) : ℝ :=
∑ k ∈ Finset.range (n+1), schmidtOutcomeWeight n p k*Real.logb 2 (n.choose k : ℝ)
/-- PDF pp.6,8: finite Shannon entropy; zero-weight terms are zero. -/
def outcomeEntropy {J : Type*} [Fintype J] (p : J → ℝ) : ℝ :=
-∑ j, p j*Real.logb 2 (p j)
example {I J : Type*} [Fintype I] (A : Matrix J I ℂ) (v : Vec I) (j : J) :
rectAct A v j=∑ i, A j i*v i := rfl
/-- PDF p.6: refined local Kraus branch, with any local environment retained. -/
def aliceKetBranch {a b c : ℕ} (A : Matrix (Fin c) (Fin a) ℂ)
(psi : Vec (Fin a × Fin b)) : Vec (Fin c × Fin b) :=
rectAct (Matrix.kronecker A (1 : Op (Fin b))) psi
/-- PDF p.7: maximally entangled ket of positive local rank d.
At d=0 this is zero and is never called a normalized state. -/
def uniformKet (d : ℕ) : Vec (Fin d × Fin d) :=
WithLp.toLp 2 fun x => if x.1=x.2 then ((Real.sqrt (d : ℝ))⁻¹ : ℂ) else 0
/-- PDF p.7: success map onto the first 2^ell local coordinates. -/
def trim (D ell : ℕ) : Matrix (Fin (2^ell)) (Fin D) ℂ :=
fun i j => if i.val=j.val then 1 else 0
/-- PDF p.7: complementary failure projector, without branch normalization. -/
def trimFailure (D ell : ℕ) : Op (Fin D) :=
Matrix.diagonal fun j => if j.val<2^ell then 0 else 1
/-- PDF p.8, Eq.(9): circular position after m steps, starting at zero. -/
def circlePosition {Omega : Type*} (X : ℕ → Omega → ℝ) (m : ℕ) (w : Omega) : ℝ :=
Int.fract (∑ i ∈ Finset.range m, X i w)
/-- PDF p.9: Schmidt-diagonal pure ket. -/
def diagonalKet {d : ℕ} (c : Fin d → ℝ) : Vec (Fin d × Fin d) :=
WithLp.toLp 2 fun z => if z.1=z.2 then (c z.1 : ℂ) else 0
/-- PDF p.9: least amplitude. Theorems require a nonempty finite list. -/
def leastAmplitude {d : ℕ} (c : Fin d → ℝ) : ℝ := sInf (Set.range c)
/-- PDF p.9: retained amplitude ratio; zero amplitudes give zero success. -/
def procrusteanSuccess {d : ℕ} (c : Fin d → ℝ) : Op (Fin d) :=
Matrix.diagonal fun i => ((leastAmplitude c/c i : ℝ) : ℂ)
/-- PDF p.9: complementary failure Kraus operator. -/
def filterFailure {d : ℕ} (c : Fin d → ℝ) : Op (Fin d) :=
Matrix.diagonal fun i => ((Real.sqrt (1-(leastAmplitude c/c i)^2) : ℝ) : ℂ)
/-- PDF pp.9,20: expected one-pair Procrustean singlet yield. -/
def procrusteanYield (p : ℝ) : ℝ := 2*min p (1-p)
/-- PDF pp.11,14: Q-prime source ket with uniform binary labels. -/
def sourceKet {n : ℕ} (p : ℝ) (x : Fin n → Bool) : Vec (Fin n → Bool) :=
WithLp.toLp 2 fun z => ∏ i,
if z i then (if x i then -(Real.sqrt p : ℂ) else (Real.sqrt p : ℂ))
else (Real.sqrt (1-p) : ℂ)
/-- PDF pp.13--14: flagged encoder, retaining no coherence between classical k values. -/
def flaggedEncoder (n : ℕ) : Superop (Fin n → Bool) (Fin (n+1) × (Fin n → Bool)) :=
fun rho u v => if u.1=v.1 then
(schmidtTypeProjector n u.1.val*rho*schmidtTypeProjector n u.1.val) u.2 v.2 else 0
/-- PDF p.13: bare transmission, forgetting k without further decoding. -/
def bareEncoder (n : ℕ) : Superop (Fin n → Bool) (Fin n → Bool) :=
fun rho => ∑ k : Fin (n+1), schmidtTypeProjector n k.val*rho*schmidtTypeProjector n k.val
/-- PDF pp.12--14: source-average fidelity for a fixed label-independent decoder. -/
def codingFidelity (n : ℕ) (p : ℝ)
(D : Superop (Fin (n+1) × (Fin n → Bool)) (Fin n → Bool)) : ℝ :=
((2 : ℝ)^n)⁻¹*∑ x : Fin n → Bool,
pureFidelity (sourceKet p x) (D (flaggedEncoder n (pureDensity (sourceKet p x))))
/-- PDF pp.15--17: one-way local protocol with at most bits cbits. Alice's
complete instrument has private Kraus index z; only i is communicated.
Bob's CPTP continuation depends on i. No free numerical cost field is used. -/
def OneWayBits {a b c d : ℕ} (bits : ℕ)
(L : Superop (Fin a × Fin b) (Fin c × Fin d)) : Prop :=
∃ k r : ℕ, k≤2^bits ∧ ∃ A : Fin k → Fin r → Matrix (Fin c) (Fin a) ℂ,
(∑ i, ∑ z, (A i z)ᴴ*A i z)=1 ∧
∃ B : Fin k → Superop (Fin b) (Fin d), (∀ i, IsChannel (B i)) ∧ ∀ rho,
L rho=∑ i, idTensorSuperop (B i)
(∑ z, conjSuperop (Matrix.kronecker (A i z) (1 : Op (Fin b))) rho)
/-- PDF pp.15--16: eventual state-conversion rates with global vanishing error.
Both tolerances precede n. Half trace distance has the same zero-error limit
as squared pure-target fidelity; no single-copy convex roof is involved. -/
def ConversionRate (s t : Shared) (R : ℝ) : Prop :=
0≤R ∧ ∀ epsilon>(0 : ℝ), ∀ delta>(0 : ℝ), ∃ N : ℕ,
∀ n : ℕ, N<n → ∃ m : ℕ, (R-delta)*(n : ℝ) ≤ (m : ℝ) ∧
∃ L : Superop (Fin ((s.dims 0)^n) × Fin ((s.dims 1)^n))
(Fin ((t.dims 0)^m) × Fin ((t.dims 1)^m)),
FiniteLOCC L ∧ traceDistance (L (dimensionedPower (pairOfState s) n))
(dimensionedPower (pairOfState t) m)≤epsilon
/-- PDF p.17: eventual operational formation rates; not existential-block rates. -/
def FormationRate (s : Shared) (R : ℝ) : Prop :=
0≤R ∧ Dependency50.P42.EventuallyAchievableRate
Dependency50.P42.halfTraceDistance (pairOfState s) R
/-- PDF p.17: eventual operational singlet yield with whole-target error. -/
def SingletDistillationRate (s : Shared) (R : ℝ) : Prop :=
0≤R ∧ ∀ epsilon>(0 : ℝ), ∀ delta>(0 : ℝ), ∃ N : ℕ,
∀ n : ℕ, N<n → ∃ m : ℕ, (R-delta)*(n : ℝ) ≤ (m : ℝ) ∧
∃ L : Superop (Fin ((s.dims 0)^n) × Fin ((s.dims 1)^n))
(Fin (2^m) × Fin (2^m)),
FiniteLOCC L ∧ traceDistance (L (dimensionedPower (pairOfState s) n)) (singlets m)≤epsilon
/-- PDF p.17: least operational cost. Nonempty bounded-below feasibility is concluded below. -/
def formationCost (s : Shared) : ℝ := sInf {R | FormationRate s R}
/-- PDF p.17: greatest operational yield. Zero feasibility and boundedness are concluded below. -/
def singletDistillable (s : Shared) : ℝ := sSup {R | SingletDistillationRate s R}
/-- PDF pp.16--17: one classically correlated shared pair. -/
def classicalPair : Op (Fin 2 × Fin 2) :=
(1/2 : ℂ) • (pureDensity (ket (0,0))+pureDensity (ket (1,1)))
/-- PDF p.16: two shared pairs, regrouped as Alice's two spins versus Bob's. -/
def twoPairs (rho sigma : Op (Fin 2 × Fin 2)) :
Op ((Fin 2 × Fin 2) × (Fin 2 × Fin 2)) :=
fun x y => rho (x.1.1,x.2.1) (y.1.1,y.2.1)*sigma (x.1.2,x.2.2) (y.1.2,y.2.2)
/-- PDF p.16: discard the second spin locally at both sites. -/
def discardSecond : Superop ((Fin 2 × Fin 2) × (Fin 2 × Fin 2)) (Fin 2 × Fin 2) :=
fun rho x y => ∑ a : Fin 2, ∑ b : Fin 2, rho ((x.1,a),(x.2,b)) ((y.1,a),(y.2,b))
/-- PDF p.17: purification entropies with variable positive finite C,D and AC:BD partition. -/
def purificationScores (rho : Op (Fin 2 × Fin 2)) : Set ℝ :=
{e | ∃ c d : ℕ, 0<c ∧ 0<d ∧
∃ v : Vec ((Fin 2 × Fin c) × (Fin 2 × Fin d)), ‖v‖=1 ∧
(∀ x y : Fin 2 × Fin 2, rho x y=∑ u : Fin c, ∑ w : Fin d,
pureDensity v ((x.1,u),(x.2,w)) ((y.1,u),(y.2,w))) ∧
e=vnEntropy (traceLeft (pureDensity v))}
/-- PDF p.17: the rejected minimum prescription; feasibility is concluded below. -/
def purificationMinimum (rho : Op (Fin 2 × Fin 2)) : ℝ := sInf (purificationScores rho)
/-- PDF p.17, Eq.(11): the fixed Werner density. -/
def wernerState : Op (Fin 2 × Fin 2) :=
(1/8 : ℂ) • 1+(1/2 : ℂ) • Dependency50.P42.singletState
/-- PDF p.17: product state conditional on n independent fair preparation choices. -/
def wernerBranch (n : ℕ) (z : Fin n → Bool) : Op (Fin (2^n) × Fin (2^n)) :=
fun x y => ∏ i,
(if z i then Dependency50.P42.singletState else (1/4 : ℂ) • (1 : Op (Fin 2 × Fin 2)))
((Dependency50.P42.copyIndex 2 n).symm x.1 i,(Dependency50.P42.copyIndex 2 n).symm x.2 i)
((Dependency50.P42.copyIndex 2 n).symm y.1 i,(Dependency50.P42.copyIndex 2 n).symm y.2 i)
/-! Sanity examples pin definitions. No result proofs are supplied. -/
example (n : ℕ) (x : Fin n → Bool) : schmidtTypeProjector n (downCount x) x x=1 := by
simp [schmidtTypeProjector]
example (n : ℕ) : downCount (fun _ : Fin n => false)=0 := by simp [downCount]
example (p : ℝ) : projectedYield 0 p=0 := by simp [projectedYield]
example {J : Type*} [Fintype J] : outcomeEntropy (fun _ : J => (0 : ℝ))=0 := by
simp [outcomeEntropy]
example (D ell : ℕ) (i : Fin (2^ell)) (j : Fin D) (h : i.val=j.val) : trim D ell i j=1 := by
simp [trim,h]
example {Omega : Type*} (X : ℕ → Omega → ℝ) (w : Omega) : circlePosition X 0 w=0 := by
simp [circlePosition]
example : procrusteanYield 0=0 := by norm_num [procrusteanYield]
example {d : ℕ} (c : Fin d → ℝ) (i : Fin d) : diagonalKet c (i,i)=(c i : ℂ) := by
simp [diagonalKet]
example (n : ℕ) (rho : Op (Fin n → Bool)) (u v : Fin (n+1) × (Fin n → Bool))
(h : u.1≠v.1) : flaggedEncoder n rho u v=0 := by simp [flaggedEncoder,h]
example {I : Type*} [Fintype I] (v : Vec I) : pureFidelity v 0=0 := by
simp [Dependency50.P48.pureFidelity, effectProb]
example : classicalPair (0,0) (1,1)=0 := by simp [classicalPair,pureDensity,ket]
example (rho sigma : Op (Fin 2 × Fin 2)) (x y : (Fin 2 × Fin 2) × (Fin 2 × Fin 2)) :
twoPairs rho sigma x y=rho (x.1.1,x.2.1) (y.1.1,y.2.1)*sigma (x.1.2,x.2.2) (y.1.2,y.2.2) := rfl
example : wernerState=(1/2 : ℂ) • ((1/4 : ℂ) • (1 : Op (Fin 2 × Fin 2)))+
(1/2 : ℂ) • Dependency50.P42.singletState := by norm_num [wernerState,smul_smul]
/-- Sanity: no-copy source registers have their unique scalar amplitude one. -/
example (p : ℝ) : sourceKet p (fun i : Fin 0 => Fin.elim0 i) (fun i : Fin 0 => Fin.elim0 i)=1 := by
simp [sourceKet]
example (p : ℝ) (x : (Fin 0 → Bool) × (Fin 0 → Bool)) : schmidtBlock 0 p x=1 := by
have h : x.1=x.2 := Subsingleton.elim _ _
simp [schmidtBlock,h]
example (x : (Fin 0 → Bool) × (Fin 0 → Bool)) : typeState 0 0 x=1 := by
have h : x.1=x.2 := Subsingleton.elim _ _
simp [typeState,h,downCount]
example : uniformKet 1 (0,0)=1 := by simp [uniformKet]
example : leastAmplitude (fun _ : Fin 1 => (1 : ℝ))=1 := by
simp [leastAmplitude]
example (s : Shared) : ent s=vnEntropy (traceLeft (pairOfState s)) := rfl
example (s : Shared) (h : IsPureShared s) :
∃ v : Vec (Fin (s.dims 0) × Fin (s.dims 1)), ‖v‖=1 := by
obtain ⟨v,hv,_⟩ := h
exact ⟨v,hv⟩
example {a b : ℕ} (rho : Op (Fin a × Fin b)) (s : Shared) (h : RepresentsShared rho s) :
s.dims 0=a ∧ s.dims 1=b := ⟨h.1,h.2.1⟩
example (s t : Shared) (R : ℝ) (h : ConversionRate s t R) : 0≤R := h.1
example (s : Shared) (R : ℝ) (h : FormationRate s R) : 0≤R := h.1
example (s : Shared) (R : ℝ) (h : SingletDistillationRate s R) : 0≤R := h.1
example (s : Shared) : formationCost s=sInf {R | FormationRate s R} := rfl
example (s : Shared) : singletDistillable s=sSup {R | SingletDistillationRate s R} := rfl
example (rho : Op (Fin 2 × Fin 2)) : purificationMinimum rho=sInf (purificationScores rho) := rfl
example (rho : Op ((Fin 2 × Fin 2) × (Fin 2 × Fin 2))) (x y : Fin 2 × Fin 2) :
discardSecond rho x y=∑ a : Fin 2, ∑ b : Fin 2, rho ((x.1,a),(x.2,b)) ((y.1,a),(y.2,b)) := rfl
example (rho : Op (Fin 0 → Bool)) (x y : Fin 0 → Bool) : bareEncoder 0 rho x y=rho x y := by
have h : schmidtTypeProjector 0 0=(1 : Op (Fin 0 → Bool)) := by
ext a b
have hab : a=b := Subsingleton.elim _ _
subst b
simp [schmidtTypeProjector,downCount]
simp [bareEncoder,Fin.sum_univ_one,h]
example (z : Fin 0 → Bool) : wernerBranch 0 z=1 := by
letI : Subsingleton (Fin (2 ^ 0) × Fin (2 ^ 0)) := by
simp only [pow_zero]
infer_instance
ext x y
have h : x=y := Subsingleton.elim _ _
subst y
simp [wernerBranch]
/-- Sanity: every exact-yield witness contains an actual local protocol. -/
example (s : Shared) (n : ℕ) (y : ℝ) (h : ExactYield s n y) :
∃ input : Shared, ∃ out : List (ℝ × Shared), LocalTree input out := by
obtain ⟨input,_,out,hout,_⟩ := h
exact ⟨input,out,hout⟩
example {d : ℕ} (c : Fin d → ℝ) (i : Fin d) :
procrusteanSuccess c i i=(leastAmplitude c/c i : ℂ) := by simp [procrusteanSuccess]
example {d : ℕ} (c : Fin d → ℝ) (i : Fin d) :
filterFailure c i i=(Real.sqrt (1-(leastAmplitude c/c i)^2) : ℂ) := by simp [filterFailure]
/-- Sanity: a one-way budget witnesses a bounded public outcome alphabet. -/
example {a b c d : ℕ} (bits : ℕ) (L : Superop (Fin a × Fin b) (Fin c × Fin d))
(h : OneWayBits bits L) : ∃ k : ℕ, k≤2^bits := by
obtain ⟨k,r,hk,_⟩ := h
exact ⟨k,hk⟩
example (rho : Op (Fin 2 × Fin 2)) (e : ℝ) (h : e∈purificationScores rho) :
∃ c d : ℕ, 0<c ∧ 0<d := by
obtain ⟨c,d,hc,hd,_⟩ := h
exact ⟨c,d,hc,hd⟩
end QAlgorithms.Papers.Independent.Support50.P42
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P42.ConversionRate
Let each specify two positive integer dimensions and a positive semidefinite, trace-one complex matrix on the corresponding two-register space; write their dimensions as and , and their matrices as . For a real number , this predicate requires and says that for every and , there is a natural number such that for every natural number , there exist a natural number and a map satisfying
Here , and is the grouped -fold tensor product, indexed by through the chosen bijections between length- strings and those finite index sets: its entries are products of the corresponding entries of . The map , from dimensions to , must be generated recursively from identity maps by finitely many local Kraus steps: either party applies a finite family with , an allowed continuation is selected for each outcome, and the resulting branch maps are summed. The input length is necessarily positive, but is allowed, with the zeroth tensor power being the scalar matrix ; no upper bound on is imposed.
QAlgorithms.Papers.Independent.Support50.P42.ExactYield
For any shared state , any , including , and any , means that there exist an input shared state, a finite output list of real weights paired with shared states, and a function assigning a natural number to every shared state, such that the input represents copies of , the output list is obtained by the finite local-tree relation described below, every with represents exactly singlets, and , counting list entries with their repetitions. Explicitly, if is 's matrix on its product basis of dimensions , its -copy matrix has dimensions and entries , with tuples identified with single indices using the selected finite-set bijections. A singlet is the rank-one matrix , where , and singlets means its corresponding tensor power, with local dimensions . Representation requires equality of these dimensions and matrix entries, with all out-of-range entries extended by zero. The local-tree relation starts with , allows finite local instruments followed by outcome-dependent continuation, and allows replacing an output list of equal dimensions by its weighted mixture. An instrument has probabilities summing to , local Kraus matrices for one selected party, unchanged dimensions for the other party, and their global extensions , whose entries are those of when the other coordinate agrees and otherwise; it requires and , and continuation weights are multiplied by . Every shared state has positive local dimensions and a positive semidefinite matrix of trace . The singlet requirement applies only to positive-weight entries; is nevertheless defined on all shared states and assigns the same count to repeated occurrences of the same state. A zeroth tensor power, including zero singlets, is the one-dimensional matrix .
QAlgorithms.Papers.Independent.Support50.P42.FormationRate
Let specify positive dimensions and a positive semidefinite, trace-one complex matrix on . For a real number , this predicate requires and says that for every and , there is a natural number such that for every natural number , there exist a natural number and a finite local-operation map for which
Here is the grouped -fold tensor product of , where , and is the grouped -fold tensor product of . Grouped powers use the chosen bijections from length- strings over labels to , with entries given by products of the corresponding matrix entries. The trace norm is . The map , from local dimensions to , is built recursively from identity maps by finitely many local Kraus families satisfying , followed by outcome-dependent allowed continuations and summation over outcomes. The integer is positive; is permitted and .
QAlgorithms.Papers.Independent.Support50.P42.IsPureShared
For any shared state with positive local dimensions , let be its matrix written on the ordinary product basis, so , where each pair denotes the corresponding two-coordinate configuration. The predicate means that there exists a vector with Euclidean norm such that for every pair of indices. Either local dimension may equal .
QAlgorithms.Papers.Independent.Support50.P42.LocalTree
For a shared state , consisting of positive local dimensions and a positive semidefinite matrix of trace , and a finite list of real weights paired with shared states, is the relation generated by the following three rules: one may stop with ; one may perform a finite local instrument and then continue separately on every outcome; and one may replace the entire output list of an already constructed tree by its mixture, provided all output states have the same local dimensions. More precisely, a local instrument chooses a party , an outcome count , numbers with , shared states , and finitely many matrices from party 's input space to its space in ; every other party's dimension must remain equal to its input dimension. Define the global matrix by when all coordinates other than agree, and by otherwise. The instrument must satisfy and . If the continuation from produces a list , the resulting list concatenates the , multiplying their weights by . The mixture rule produces when all listed states have 's dimensions and, entrywise, ; entries outside a state's dimensions are interpreted as . Zero-weight outcomes are permitted, whereas cannot satisfy .
QAlgorithms.Papers.Independent.Support50.P42.OneWayBits
For arbitrary natural numbers , a natural number , and any function from complex matrices on to complex matrices on , this predicate means that there exist natural numbers with , matrices for , , and maps from to complex matrices such that
for every complex input matrix . Each must admit a finite Kraus representation with ; the displayed tensor action applies separately to every block. All dimensions, , and may be zero. Empty sums are zero, so if , the completeness equation cannot hold with or .
QAlgorithms.Papers.Independent.Support50.P42.RepresentsShared
For any natural numbers , any complex matrix indexed by , and any shared state , the predicate requires that 's two local dimensions are exactly , and that, for every , its matrix entry extended by zero outside its local dimensions equals if and , and equals otherwise. Here a shared state has positive local dimensions and a positive semidefinite matrix of trace . Consequently the predicate cannot hold if or , and when it holds the supplied matrix is itself positive semidefinite with trace .
QAlgorithms.Papers.Independent.Support50.P42.Shared
A shared state consists of two positive natural numbers and a complex matrix indexed by configurations with for , together with the requirements that is positive semidefinite and . Both local dimensions may equal , but neither may equal .
QAlgorithms.Papers.Independent.Support50.P42.SingletDistillationRate
Let specify positive dimensions and a positive semidefinite, trace-one complex matrix on . For a real number , this predicate requires and says that for every and , there is a natural number such that every natural number admits a natural number and a map with
Here is the grouped -fold tensor product of the projector onto ; is the grouped -fold tensor product of , with string indices converted to finite integer indices using the chosen bijections, and tensor-product entries are products of the component entries. The trace norm is . The map , from local dimensions to , is generated from identity maps by finitely many local Kraus steps, each having , outcome-dependent allowed continuations, and summation over outcomes. The input length is positive; is allowed with , and there is no upper bound on .
QAlgorithms.Papers.Independent.Support50.P42.aliceKetBranch
For any natural numbers , any complex matrix , and any vector with its Euclidean norm, this defines the vector in whose coordinates are
Thus it applies to the first coordinate and the identity to the second. Neither an isometry condition on nor normalization of is assumed. Zero dimensions are allowed; in particular, if , every output coordinate is an empty sum and hence zero.
QAlgorithms.Papers.Independent.Support50.P42.bareEncoder
For every natural number , this defines the map
on arbitrary complex matrices indexed by -bit strings, where is diagonal with entry on strings having exactly true bits and elsewhere. Thus the output entry at strings is if their numbers of true bits agree, and otherwise. No positivity or normalization is required. For , the map is the identity on the one-dimensional matrix space.
QAlgorithms.Papers.Independent.Support50.P42.circlePosition
For any type , any function , any natural number , and any , this defines
It is the fractional part in , including for negative sums. No probability space, measurability, independence, or distribution assumptions are imposed. When , its value is .
QAlgorithms.Papers.Independent.Support50.P42.classicalPair
This defines the complex matrix on the basis by
where each ket is the coordinate vector equal to at its indicated basis element and elsewhere. Thus its diagonal entries at and are , and all other entries are .
QAlgorithms.Papers.Independent.Support50.P42.codingFidelity
For every natural number , every real number , and every function from complex matrices indexed by to complex matrices indexed by , define vectors , one for each -bit string , by
Writing for the matrix with entries , and defining by
where counts true bits, the defined real number is
There is no channel, linearity, or positivity requirement on , and is unrestricted: real square roots of negative arguments are . When , the products are empty products equal to , and the sum has one term.
QAlgorithms.Papers.Independent.Support50.P42.diagonalKet
For any natural number and any real function , this defines the complex Euclidean vector
Equivalently, , where the kets are coordinate unit vectors. The coefficients may be negative and need not satisfy any normalization condition. When , this is the zero vector.
QAlgorithms.Papers.Independent.Support50.P42.discardSecond
This defines a map on arbitrary complex matrices indexed by , with output indexed by , through
Thus it sums over the second coordinate of each of the two paired input registers, using the same summed coordinates in the row and column. No positivity or normalization assumption is required.
QAlgorithms.Papers.Independent.Support50.P42.downCount
For every natural number and every Boolean string indexed by , is the number of indices for which . For , this number is .
QAlgorithms.Papers.Independent.Support50.P42.ent
For any shared state with positive local dimensions , write its density matrix on the product basis as , and define the matrix on the second local space by . Then is the real number , where is applied by continuous functional calculus, with the total logarithm convention . Thus this definition takes the entropy in bits of the second marginal for every shared state, without a purity hypothesis; dimensions equal to are included.
QAlgorithms.Papers.Independent.Support50.P42.filterFailure
For any natural number and any real function , let , taking when . This defines the diagonal complex matrix
with all off-diagonal entries zero. No assumptions ensure that the radicands are nonnegative: the real square root has value for negative arguments. Division by zero has value , so gives . For , the matrix is empty.
QAlgorithms.Papers.Independent.Support50.P42.flaggedEncoder
For every natural number , let , and let count the true bits of . This defines a map from arbitrary complex matrices indexed by to matrices indexed by , with entries
Equivalently, its -th diagonal flag block is , where is the diagonal projector onto strings with exactly true bits; off-diagonal flag blocks vanish. No positivity or normalization assumption is imposed on . The definition includes , when both the string register and the flag register have one basis element.
QAlgorithms.Papers.Independent.Support50.P42.formationCost
For a state consisting of positive local dimensions and a positive semidefinite, trace-one matrix , this defines the real infimum of all with the following property: for every , some natural number ensures that every natural number admits a natural number and a finite local-operation map such that
The matrices and are respectively grouped tensor powers of the projector onto and of , reindexed using the chosen string-to-integer bijections; their entries are products of the component entries. The trace norm is . The map is recursively built from identity maps by finitely many local Kraus families with , outcome-dependent continuations, and summation over outcomes. The source has local dimensions , the target has dimensions , and is allowed with . This definition asserts neither attainment of the infimum nor nonemptiness of its defining set; the real infimum of an empty set is .
QAlgorithms.Papers.Independent.Support50.P42.leastAmplitude
For any natural number and any real function , this defines
For , this is the minimum of the finitely many real coefficients, with no nonnegativity assumption. For , the range is empty and the real infimum used here has value .
QAlgorithms.Papers.Independent.Support50.P42.outcomeEntropy
For any finite type , equipped with a finite enumeration, and any function , this defines
There is no assumption that the are nonnegative or sum to . The real logarithm is total: , and for negative arguments it uses the logarithm of the absolute value. If is empty, the result is .
QAlgorithms.Papers.Independent.Support50.P42.procrusteanSuccess
For any natural number and any real function , let , taking when . This defines the diagonal complex matrix
with all off-diagonal entries zero. No positivity, nonzero-coefficient, or normalization assumptions are imposed. Division by zero has value , so gives ; when , the matrix is empty.
QAlgorithms.Papers.Independent.Support50.P42.procrusteanYield
For every real number , this defines
There is no restriction that ; the result is negative when or , is zero at , and equals at .
QAlgorithms.Papers.Independent.Support50.P42.projectedYield
For every and every real , is the real number . The summation includes both endpoints, and no restriction on is imposed. All binomial coefficients inside this sum are positive; natural powers use . For , the value is .
QAlgorithms.Papers.Independent.Support50.P42.purificationMinimum
For any complex matrix indexed by , this defines a real number as the infimum of all values obtained as follows: choose positive natural numbers and a unit vector on such that, for every ,
The partial trace in the entropy discards the first enlarged subsystem, and with applied by continuous functional calculus. The definition does not assert that the infimum is attained, and it assumes no positivity or normalization of . It uses the real-valued infimum convention: an empty set, or a set unbounded below, has assigned infimum .
QAlgorithms.Papers.Independent.Support50.P42.purificationScores
For any complex matrix indexed by , this defines the set of real numbers
Here has entries , the indicated partial trace discards the entire first factor and retains , and , where is applied by continuous functional calculus. Thus each member is the entropy of the second enlarged subsystem of a finite, normalized purification satisfying the displayed entrywise identity. No density-matrix hypothesis is imposed on the argument ; the defining conditions may have no witnesses, in which case the set is empty.
QAlgorithms.Papers.Independent.Support50.P42.schmidtBlock
For every and every real , is the complex Euclidean vector indexed by pairs of -bit strings , whose amplitude is when , and otherwise is , where if and otherwise, viewed as complex numbers. No restriction on or normalization requirement is imposed: the real square root is on negative arguments. For , the sole amplitude is the empty product , for every .
QAlgorithms.Papers.Independent.Support50.P42.schmidtOutcomeWeight
For every and every real , the real number is , where . No assumption is imposed. Natural powers use ; when , the binomial coefficient is , so the defined weight is , and when , it is for every .
QAlgorithms.Papers.Independent.Support50.P42.schmidtTypeProjector
For every , is the complex diagonal matrix indexed by -bit strings, with diagonal entry at if exactly coordinates of are true, and otherwise; all off-diagonal entries are . In particular, it is the zero matrix when ; when , it is the one-dimensional identity for and the zero matrix otherwise.
QAlgorithms.Papers.Independent.Support50.P42.singletDistillable
For a state consisting of positive local dimensions and a positive semidefinite, trace-one matrix , this defines the real supremum of all such that, for every , there is a natural number for which every natural number admits a natural number and a finite local-operation map satisfying
Here is the grouped tensor power of , and is the grouped tensor power of the projector onto , with string indices converted through the chosen bijections to finite integer indices. The trace norm is . The map , from local dimensions to , is generated recursively from identity maps by finitely many local Kraus families satisfying , with outcome-dependent continuations and summation over outcomes. The integer is positive, while is permitted and . No attainment or boundedness assertion accompanies this definition; the total real supremum is for an empty set or a set unbounded above.
QAlgorithms.Papers.Independent.Support50.P42.sourceKet
For any natural number , any real number , and any Boolean string of length , this defines the complex Euclidean vector indexed by Boolean strings of length , with coordinates
No restriction on or normalization hypothesis is imposed; real square roots of negative arguments have value . When , the unique coordinate is the empty product , for every and the unique empty string .
QAlgorithms.Papers.Independent.Support50.P42.trim
For any natural numbers , this defines a complex matrix with rows and columns by
No relation between and is required: multiplication by this matrix retains coordinates with index below both dimensions, discards any remaining input coordinates, and fills any remaining output coordinates with zero. For , the matrix has no columns.
QAlgorithms.Papers.Independent.Support50.P42.trimFailure
For any natural numbers , this defines the diagonal complex matrix with
and all off-diagonal entries zero. If , this is the zero matrix, including when .
QAlgorithms.Papers.Independent.Support50.P42.twoPairs
For any two complex matrices indexed by , this defines a complex matrix whose basis is grouped as , each coordinate taking values in , by
No positivity, trace, or normalization assumptions are imposed on either input matrix.
QAlgorithms.Papers.Independent.Support50.P42.typeState
For every , is the complex Euclidean vector indexed by pairs of -bit strings , with amplitude when and exactly coordinates of are true, and amplitude otherwise. Inversion is total, with . Thus for the vector is zero; for , its sole amplitude is .
QAlgorithms.Papers.Independent.Support50.P42.uniformKet
For every natural number , this defines a vector by
For , this is , where is the corresponding coordinate unit vector. The case is included and gives the zero vector on an empty coordinate set.
QAlgorithms.Papers.Independent.Support50.P42.wernerBranch
For every natural number and every Boolean function , this defines a matrix on . Let denote the fixed cardinality-based equivalence used in the definition, and put and for a matrix index . Its entries are
where . The equivalence is a chosen identification by cardinality; no particular binary ordering is specified here. The definition includes : the product is empty and equals , giving the one-dimensional identity matrix.
QAlgorithms.Papers.Independent.Support50.P42.wernerState
This defines the complex matrix on
where is the identity matrix and the rank-one matrix has entries .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.