Definitions for Relative entropy and squashed entanglement
DefinitionQAlgorithms_Papers_Independent_Support50_P16The objects the formalized statements of Relative entropy and squashed entanglement (arXiv:1210.3181) are stated in. Each was checked against the paper by a blind read-back and a moderator.
povmOutcomeLaw: PDF p.2: the actual probability vector of a POVM.finiteKLBits: PDF pp.2,10: classical relative entropy in bits, infinite on support violation. The zero summands use 0 log 0 = 0. Only probability laws are used in results.restrictedEntropy: PDF p.3, Eq.(5): infimum over reference states, THEN supremum over measurements. The nonnegative extended lattice gives supremum 0 for an empty measurement class and infimum infinity for an empty reference set. If G is nonempty and M is empty, the optimized value is 0.measurementDistance: PDF pp.3,5: full classical l1 distinguishability, with no factor 1/2. For fixed finite input operators this supremum is bounded; on states it is <= 2. An empty measurement class has value 0.trivialMeasurement: PDF p.2: the unique one-outcome measurement.continuityModulus: PDF pp.5,10: continuous zero-error extension of the printed modulus.MeasurementKind: PDF pp.2--3: the five distinct operational measurement classes.IsLO: PDF pp.2--3: local product measurements followed by classical coarse graining. There is no shared entanglement or communication in the product POVM.IsAliceToBobPOVM: PDF pp.3,6: Alice measures first, sends her outcome to Bob, who measures conditionally. Coarse graining permits the binary hypothesis tests as well.IsLOCCMeasurement: PDF pp.2--3: arbitrary finite adaptive LOCC followed by a local classical readout. The accepted tree includes rectangular local maps, disposal, randomness and both communication directions. Optimization permits arbitrary round counts.measurementClass: PDF pp.2--3: SEP/PPT constrain EACH effect, with POVM normalization retained.separable: PDF pp.2--3: exact finite convex mixtures of normalized product states.ExtendedEntanglementFunctional: PDF p.3: a family on every positive finite bipartite dimension.measuredEntanglement: PDF p.3, Eq.(5): restricted relative entropy with G=SEP.copyDimension: PDF pp.2--3: dimension of n local copies; at n=0 it is one.regularizationSequence: PDF pp.2--3: normalized positive-copy sequence with copies grouped by owner.regularized: PDF pp.2--3: liminf adapter; theorems with regularized quantities also assert convergence where needed, so this is never substituted for a nonexistent limit.Regularizes: PDF pp.2--3: the actual regularization limit exists and equals the adapter.updated: PDF p.13: E_r,rightArrow optimizes over LOCC OPERATIONS with unrestricted positive finite quantum output dimensions, then applies one-way measured REE.classicalSquashed: PDF p.13: classical squashed entanglement is HALF the mixed convex roof of MI. The accepted ensembles allow arbitrary finite lengths and mixed components.conditionalEntanglement: PDF p.13: E_I is half the infimum of I(AA';BB')-I(A';B') over every normalized extension, without a dimension cap or assumed minimizer.key: PDF pp.13,15--16: operational key rate, with arbitrary finite private shields.StrictSeparation: PDF pp.15--16: separate existential strict witnesses, with dimensions allowed to vary. This predicate imposes no joint-witness requirement.cutBAE: PDF p.4: same state expressed on the bipartition B:AE.OneWayRetainedInstrument: PDF pp.6--7: one-way AB->XB instrument. Alice's POVM result is sent to Bob; Bob applies a complete conditional Kraus instrument with classical binary output. Alice is discarded and Bob's quantum register is retained. No E input is present.aliceCondition: PDF p.7, Eq.(19): unnormalized Bob block after Alice's effect. This equals tracing out Alice after sqrt(R) on both sides; the transposed indices on R are essential for coherent inputs.retainedBranch: PDF p.7, Eq.(19): the actual CP branch map with a retained B output.retainedCQOutput: PDF p.7, Eq.(19): classical-quantum output of the rectangular instrument.retainedClassical: PDF p.6: T^c traces out B; it is a binary probability law on states.retainedQuantum: PDF p.6: T^q forgets the classical result and retains the full B matrix.extensionCopies: PDF pp.6--8: grouped copies of the ACTUAL tripartite input, including all E off-diagonal blocks. Each laboratory uses the accepted fixed local copy basis.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P50
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P04
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P54
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P76
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P19
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P42
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P08
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P21
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P32
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P42
/-!
Li--Winter, arXiv:1210.3181v2. Finite, positive-dimensional registers;
normalized density matrices; all entropies and rates in bits; full trace norm.
Only the pinned accepted library is imported. Compilation awaits batch handoff.
-/
namespace QAlgorithms.Papers.Independent.Support50.P16
noncomputable section
open QAlgorithms Filter
open scoped Matrix ComplexConjugate ComplexOrder ENNReal
attribute [local instance] Classical.propDecidable Classical.decEq
local notation "tau" => QAlgorithms.Papers.Independent.Information100.P76.maximallyMixed
local notation "RE" => QAlgorithms.Papers.Independent.Information100.P54.relativeEntanglement
local notation "RER" => QAlgorithms.Papers.Independent.Information100.P54.regularizedEntanglement
local notation "SQ" => QAlgorithms.Papers.Independent.Dependency50.P19.squashed
local notation "CMI" => QAlgorithms.Papers.Independent.Dependency50.P19.conditionalMutual
local notation "MI" => QAlgorithms.Papers.Independent.Dependency50.P19.mutualInformation
local notation "LOCC" => QAlgorithms.Papers.Independent.Information100.P21.FiniteLOCC
local notation "power" => QAlgorithms.Papers.Independent.Dependency50.P42.dimensionedPower
local notation "index" => QAlgorithms.Papers.Independent.Dependency50.P42.copyIndex
-- Accepted matrix coordinates (not P50.Bipartite, which is a vector space).
local notation "Bipartite" => QAlgorithms.Papers.Independent.Dependency50.P50.BipartiteMat
-- Positive outcome counts follow already from a POVM on a nonzero register.
local notation "FiniteMeasurement" => QAlgorithms.Papers.Independent.Information100.P04.Measurement
/-- PDF p.2: the actual probability vector of a POVM. -/
def povmOutcomeLaw {I : Type} [Fintype I] [DecidableEq I]
(M : FiniteMeasurement I) (rho : Matrix I I ℂ) : Fin M.outcomes → ℝ :=
fun x => effectProb (M.effect x) rho
/-- PDF pp.2,10: classical relative entropy in bits, infinite on support violation.
The zero summands use 0 log 0 = 0. Only probability laws are used in results. -/
def finiteKLBits {m : ℕ} (p q : Fin m → ℝ) : ℝ≥0∞ :=
if ∀ x, 0 < p x → 0 < q x then
ENNReal.ofReal (∑ x, p x * (Real.logb 2 (p x) - Real.logb 2 (q x)))
else ⊤
/-- PDF p.3, Eq.(5): infimum over reference states, THEN supremum over measurements.
The nonnegative extended lattice gives supremum 0 for an empty measurement class
and infimum infinity for an empty reference set. If G is nonempty and M is empty,
the optimized value is 0. -/
def restrictedEntropy {I : Type} [Fintype I] [DecidableEq I]
(G : Set (Matrix I I ℂ)) (M : Set (FiniteMeasurement I)) (rho : Matrix I I ℂ) : ℝ≥0∞ :=
⨅ sigma : G, ⨆ test : M,
finiteKLBits (povmOutcomeLaw test.val rho) (povmOutcomeLaw test.val sigma.val)
/-- PDF pp.3,5: full classical l1 distinguishability, with no factor 1/2.
For fixed finite input operators this supremum is bounded; on states it is <= 2.
An empty measurement class has value 0. -/
def measurementDistance {I : Type} [Fintype I] [DecidableEq I]
(M : Set (FiniteMeasurement I)) (rho sigma : Matrix I I ℂ) : ℝ :=
(⨆ test : M, ENNReal.ofReal
(∑ x, |povmOutcomeLaw test.val rho x - povmOutcomeLaw test.val sigma x|)).toReal
/-- PDF p.2: the unique one-outcome measurement. -/
def trivialMeasurement (I : Type) [Fintype I] [DecidableEq I] : FiniteMeasurement I :=
⟨1, by decide, fun _ => 1, ⟨fun _ => Matrix.PosSemidef.one, by simp⟩⟩
/-- PDF pp.5,10: continuous zero-error extension of the printed modulus. -/
def continuityModulus (k : ℕ) (epsilon : ℝ) : ℝ :=
if epsilon = 0 then 0 else 2 * epsilon * Real.logb 2 (6 * (k : ℝ) / epsilon)
/-- PDF pp.2--3: the five distinct operational measurement classes. -/
inductive MeasurementKind where
| LO | oneWay | LOCC | SEP | PPT
deriving DecidableEq
/-- PDF pp.2--3: local product measurements followed by classical coarse graining.
There is no shared entanglement or communication in the product POVM. -/
def IsLO {a b : ℕ+} (M : FiniteMeasurement (Fin (a : ℕ) × Fin (b : ℕ))) : Prop :=
∃ r s : ℕ, ∃ A : Fin r → Matrix (Fin (a : ℕ)) (Fin (a : ℕ)) ℂ,
∃ B : Fin s → Matrix (Fin (b : ℕ)) (Fin (b : ℕ)) ℂ,
IsPOVM A ∧ IsPOVM B ∧ ∃ f : Fin r × Fin s → Fin M.outcomes,
∀ x, M.effect x = ∑ i, ∑ j,
if f (i,j) = x then Matrix.kronecker (A i) (B j) else 0
/-- PDF pp.3,6: Alice measures first, sends her outcome to Bob, who measures
conditionally. Coarse graining permits the binary hypothesis tests as well. -/
def IsAliceToBobPOVM {a b : ℕ+} (M : FiniteMeasurement (Fin (a : ℕ) × Fin (b : ℕ))) : Prop :=
∃ r s : ℕ, ∃ A : Fin r → Matrix (Fin (a : ℕ)) (Fin (a : ℕ)) ℂ,
∃ B : Fin r → Fin s → Matrix (Fin (b : ℕ)) (Fin (b : ℕ)) ℂ,
IsPOVM A ∧ (∀ i, IsPOVM (B i)) ∧ ∃ f : Fin r × Fin s → Fin M.outcomes,
∀ x, M.effect x = ∑ i, ∑ j,
if f (i,j) = x then Matrix.kronecker (A i) (B i j) else 0
/-- PDF pp.2--3: arbitrary finite adaptive LOCC followed by a local classical readout.
The accepted tree includes rectangular local maps, disposal, randomness and both
communication directions. Optimization permits arbitrary round counts. -/
def IsLOCCMeasurement {a b : ℕ+}
(M : FiniteMeasurement (Fin (a : ℕ) × Fin (b : ℕ))) : Prop :=
∃ L : Superop (Fin (a : ℕ) × Fin (b : ℕ)) (Fin 1 × Fin M.outcomes), LOCC L ∧
∀ X x, (L X) (0,x) (0,x) = ((M.effect x) * X).trace
/-- PDF pp.2--3: SEP/PPT constrain EACH effect, with POVM normalization retained. -/
def measurementClass (c : MeasurementKind) (a b : ℕ+) :
Set (FiniteMeasurement (Fin (a : ℕ) × Fin (b : ℕ))) :=
match c with
| .LO => {M | IsLO M}
| .oneWay => {M | IsAliceToBobPOVM M}
| .LOCC => {M | IsLOCCMeasurement M}
| .SEP => {M | ∀ x, QAlgorithms.Entanglement.IsSeparablePositive (M.effect x)}
| .PPT => {M | ∀ x, (QAlgorithms.Entanglement.partialTransposeFirst (M.effect x)).PosSemidef}
/-- PDF pp.2--3: exact finite convex mixtures of normalized product states. -/
def separable (a b : ℕ+) : Set (Bipartite a b) :=
{rho | QAlgorithms.Entanglement.IsSeparableDensity rho}
/-- PDF p.3: a family on every positive finite bipartite dimension. -/
abbrev ExtendedEntanglementFunctional := (a b : ℕ+) → Bipartite a b → ℝ≥0∞
/-- PDF p.3, Eq.(5): restricted relative entropy with G=SEP. -/
def measuredEntanglement (c : MeasurementKind) : ExtendedEntanglementFunctional :=
fun a b rho => restrictedEntropy (separable a b) (measurementClass c a b) rho
-- Reuse the accepted operational/variational quantity through a typed notation.
local notation "relative" =>
((fun _ _ rho => RE rho) : ExtendedEntanglementFunctional)
-- Reuse the accepted operational/variational quantity through a typed notation.
local notation "squashed" =>
((fun _ _ rho => ENNReal.ofReal (SQ rho)) : ExtendedEntanglementFunctional)
/-- PDF pp.2--3: dimension of n local copies; at n=0 it is one. -/
abbrev copyDimension (a : ℕ+) (n : ℕ) : ℕ+ := ⟨(a : ℕ)^n, pow_pos a.pos n⟩
/-- PDF pp.2--3: normalized positive-copy sequence with copies grouped by owner. -/
def regularizationSequence (F : ExtendedEntanglementFunctional) {a b : ℕ+}
(rho : Bipartite a b) (r : ℕ) : ℝ≥0∞ :=
F (copyDimension a (r+1)) (copyDimension b (r+1)) (power rho (r+1)) / (r+1 : ℝ≥0∞)
/-- PDF pp.2--3: liminf adapter; theorems with regularized quantities also assert
convergence where needed, so this is never substituted for a nonexistent limit. -/
def regularized (F : ExtendedEntanglementFunctional) {a b : ℕ+} (rho : Bipartite a b) : ℝ≥0∞ :=
Filter.liminf (regularizationSequence F rho) atTop
/-- PDF pp.2--3: the actual regularization limit exists and equals the adapter. -/
def Regularizes (F : ExtendedEntanglementFunctional) {a b : ℕ+} (rho : Bipartite a b) : Prop :=
Tendsto (regularizationSequence F rho) atTop (nhds (regularized F rho))
/-- PDF p.13: E_r,rightArrow optimizes over LOCC OPERATIONS with unrestricted
positive finite quantum output dimensions, then applies one-way measured REE. -/
def updated : ExtendedEntanglementFunctional :=
fun a b rho => ⨆ c : ℕ+, ⨆ d : ℕ+,
⨆ L : {L : Superop (Fin (a : ℕ) × Fin (b : ℕ))
(Fin (c : ℕ) × Fin (d : ℕ)) // LOCC L}, measuredEntanglement .oneWay c d (L.val rho)
/-- PDF p.13: classical squashed entanglement is HALF the mixed convex roof of MI.
The accepted ensembles allow arbitrary finite lengths and mixed components. -/
def classicalSquashed : ExtendedEntanglementFunctional := fun _ _ rho => ENNReal.ofReal
(QAlgorithms.Papers.Independent.Information100.P08.mixedRoof MI rho / 2)
-- Exact accepted partial trace of the same AA'BB' extension.
local notation "originalMarginal" => QAlgorithms.Papers.Independent.Information100.P04.principalMarginal
-- Exact accepted partial trace of the same AA'BB' extension.
local notation "ancillaryMarginal" => QAlgorithms.Papers.Independent.Information100.P04.ancillaryMarginal
/-- PDF p.13: E_I is half the infimum of I(AA';BB')-I(A';B') over every
normalized extension, without a dimension cap or assumed minimizer. -/
def conditionalEntanglement : ExtendedEntanglementFunctional := fun a b rho =>
⨅ e : ℕ+, ⨅ f : ℕ+, ⨅ omega : {omega :
Matrix ((Fin (a : ℕ) × Fin (e : ℕ)) × (Fin (b : ℕ) × Fin (f : ℕ)))
((Fin (a : ℕ) × Fin (e : ℕ)) × (Fin (b : ℕ) × Fin (f : ℕ))) ℂ //
IsDensityMatrix omega ∧ originalMarginal omega = rho},
ENNReal.ofReal ((MI omega.val - MI (ancillaryMarginal omega.val)) / 2)
-- Reuse the accepted operational/variational quantity through a typed notation.
local notation "distillable" =>
((fun _ _ rho => ENNReal.ofReal (QAlgorithms.Papers.Independent.Gap48.P32.twoWayDistillable rho)) : ExtendedEntanglementFunctional)
/-- PDF pp.13,15--16: operational key rate, with arbitrary finite private shields. -/
def key : ExtendedEntanglementFunctional := fun _ _ rho =>
QAlgorithms.Papers.Independent.Gap48.P42.distillableKey rho
-- Reuse the accepted operational/variational quantity through a typed notation.
local notation "cost" =>
((fun _ _ rho => ENNReal.ofReal (QAlgorithms.Papers.Independent.Dependency50.P42.alternativeCost
(fun _ _ X Y => traceNorm (X-Y)) rho)) : ExtendedEntanglementFunctional)
/-- PDF pp.15--16: separate existential strict witnesses, with dimensions allowed
to vary. This predicate imposes no joint-witness requirement. -/
def StrictSeparation (F G : ExtendedEntanglementFunctional) : Prop :=
∃ a b : ℕ+, ∃ rho : Bipartite a b, IsDensityMatrix rho ∧
Regularizes relative rho ∧ Regularizes classicalSquashed rho ∧
Regularizes updated rho ∧ Regularizes (measuredEntanglement .LOCC) rho ∧
G a b rho < F a b rho
/-- PDF p.4: same state expressed on the bipartition B:AE. -/
def cutBAE {A B E : Type} (rho : Matrix ((A × B) × E) ((A × B) × E) ℂ) :
Matrix (B × (A × E)) (B × (A × E)) ℂ :=
fun i j => rho ((i.2.1,i.1),i.2.2) ((j.2.1,j.1),j.2.2)
/-- PDF pp.6--7: one-way AB->XB instrument. Alice's POVM result is sent to Bob;
Bob applies a complete conditional Kraus instrument with classical binary output.
Alice is discarded and Bob's quantum register is retained. No E input is present. -/
structure OneWayRetainedInstrument (a b : ℕ+) where
messages : ℕ
alice : Fin messages → Matrix (Fin (a : ℕ)) (Fin (a : ℕ)) ℂ
aliceComplete : IsPOVM alice
krausCount : ℕ
bob : Fin messages → Fin 2 → Fin krausCount → Matrix (Fin (b : ℕ)) (Fin (b : ℕ)) ℂ
bobComplete : ∀ i, ∑ x, ∑ j, (bob i x j)ᴴ * bob i x j = 1
/-- PDF p.7, Eq.(19): unnormalized Bob block after Alice's effect.
This equals tracing out Alice after sqrt(R) on both sides; the transposed
indices on R are essential for coherent inputs. -/
def aliceCondition {a b : ℕ+} (R : Matrix (Fin (a : ℕ)) (Fin (a : ℕ)) ℂ)
(rho : Bipartite a b) : Matrix (Fin (b : ℕ)) (Fin (b : ℕ)) ℂ :=
fun u v => ∑ i, ∑ j, R j i * rho (i,u) (j,v)
/-- PDF p.7, Eq.(19): the actual CP branch map with a retained B output. -/
def retainedBranch {a b : ℕ+} (T : OneWayRetainedInstrument a b) (x : Fin 2) :
Superop (Fin (a : ℕ) × Fin (b : ℕ)) (Fin (b : ℕ)) :=
fun rho => ∑ i, ∑ j, T.bob i x j * aliceCondition (T.alice i) rho * (T.bob i x j)ᴴ
/-- PDF p.7, Eq.(19): classical-quantum output of the rectangular instrument. -/
def retainedCQOutput {a b : ℕ+} (T : OneWayRetainedInstrument a b) (rho : Bipartite a b) :
Matrix (Fin 2 × Fin (b : ℕ)) (Fin 2 × Fin (b : ℕ)) ℂ :=
fun i j => if i.1 = j.1 then retainedBranch T i.1 rho i.2 j.2 else 0
/-- PDF p.6: T^c traces out B; it is a binary probability law on states. -/
def retainedClassical {a b : ℕ+} (T : OneWayRetainedInstrument a b) (rho : Bipartite a b) :
Fin 2 → ℝ := fun x => (retainedBranch T x rho).trace.re
/-- PDF p.6: T^q forgets the classical result and retains the full B matrix. -/
def retainedQuantum {a b : ℕ+} (T : OneWayRetainedInstrument a b) :
Superop (Fin (a : ℕ) × Fin (b : ℕ)) (Fin (b : ℕ)) :=
fun rho => ∑ x, retainedBranch T x rho
/-- PDF pp.6--8: grouped copies of the ACTUAL tripartite input, including all
E off-diagonal blocks. Each laboratory uses the accepted fixed local copy basis. -/
def extensionCopies {a b e : ℕ+}
(rho : Matrix ((Fin (a : ℕ) × Fin (b : ℕ)) × Fin (e : ℕ))
((Fin (a : ℕ) × Fin (b : ℕ)) × Fin (e : ℕ)) ℂ) (n : ℕ) :
Matrix ((Fin ((a : ℕ)^n) × Fin ((b : ℕ)^n)) × Fin ((e : ℕ)^n))
((Fin ((a : ℕ)^n) × Fin ((b : ℕ)^n)) × Fin ((e : ℕ)^n)) ℂ :=
fun i j => ∏ t, rho (((index a n).symm i.1.1 t,(index b n).symm i.1.2 t),
(index e n).symm i.2 t) (((index a n).symm j.1.1 t,(index b n).symm j.1.2 t),
(index e n).symm j.2 t)
example : continuityModulus 3 0 = 0 := by simp [continuityModulus]
example {m : ℕ} (p : Fin m → ℝ) : finiteKLBits p p = 0 := by
simp [finiteKLBits]
example {I : Type} [Fintype I] [DecidableEq I] (G : Set (Matrix I I ℂ))
(hG : G.Nonempty) (rho : Matrix I I ℂ) : restrictedEntropy G ∅ rho = 0 := by
obtain ⟨sigma, hsigma⟩ := hG
letI : Nonempty G := ⟨⟨sigma, hsigma⟩⟩
simp [restrictedEntropy]
example {I : Type} [Fintype I] [DecidableEq I] (rho sigma : Matrix I I ℂ) :
measurementDistance ∅ rho sigma = 0 := by simp [measurementDistance]
example : tau 1 = (1 : Matrix (Fin 1) (Fin 1) ℂ) := by
simp [QAlgorithms.Papers.Independent.Information100.P76.maximallyMixed]
example (a : ℕ+) : (copyDimension a 0 : ℕ) = 1 := by simp [copyDimension]
example {a b : ℕ+} (T : OneWayRetainedInstrument a b) (rho : Bipartite a b)
(u v : Fin (b : ℕ)) : retainedCQOutput T rho (0,u) (1,v) = 0 := by
simp [retainedCQOutput]
example {a b : ℕ+} (rho : Bipartite a b) :
aliceCondition (1 : Matrix (Fin (a : ℕ)) (Fin (a : ℕ)) ℂ) rho = traceLeft rho := by
ext u v
simp [aliceCondition, Matrix.one_apply, traceLeft]
example {a b e : ℕ+}
(rho : Matrix ((Fin (a : ℕ) × Fin (b : ℕ)) × Fin (e : ℕ))
((Fin (a : ℕ) × Fin (b : ℕ)) × Fin (e : ℕ)) ℂ)
(i j : (Fin ((a : ℕ)^0) × Fin ((b : ℕ)^0)) × Fin ((e : ℕ)^0)) :
extensionCopies rho 0 i j = 1 := by simp [extensionCopies]
example {A B E : Type} (rho : Matrix ((A × B) × E) ((A × B) × E) ℂ)
(a a2 : A) (b b2 : B) (e e2 : E) :
cutBAE rho (b,(a,e)) (b2,(a2,e2)) = rho ((a,b),e) ((a2,b2),e2) := rfl
end
end QAlgorithms.Papers.Independent.Support50.P16
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P16.ExtendedEntanglementFunctional
An extended entanglement functional is any function assigning to every pair of positive integers and every input in the specified type a value in . This abbreviation imposes no additional conditions on the function. The supplied code does not define the type , so any restrictions built into that input type cannot be expanded.
QAlgorithms.Papers.Independent.Support50.P16.IsAliceToBobPOVM
For positive integers and , this predicate holds exactly when there exist natural numbers , complex matrices , complex matrices , and a function , such that all these matrices are positive semidefinite, , for every , and
A single common number is used for all . Although range over all natural numbers, the identity-sum conditions force both to be positive. The internal definition of is not supplied.
QAlgorithms.Papers.Independent.Support50.P16.IsLO
For positive integers and , this predicate holds exactly when there exist natural numbers , complex matrices for , complex matrices for , and a function , such that every is positive semidefinite, , , and
The quantified formally include , but the identity-sum requirements exclude those values because . The definition of the ambient type is not supplied.
QAlgorithms.Papers.Independent.Support50.P16.IsLOCCMeasurement
For positive integers and , this predicate holds exactly when there exists a function from complex matrices on the input pair of registers to complex matrices indexed by , satisfying the predicate , such that
for every complex input matrix and every outcome . This is an equality of complex numbers and is required for all matrices, without restricting to density matrices. The definitions of the unqualified predicate and the type are not supplied here.
QAlgorithms.Papers.Independent.Support50.P16.MeasurementKind
This introduces a type with exactly five distinct constructors, named , , , , and , and supplies decidable equality on this type. The constructors carry no additional data or hypotheses.
QAlgorithms.Papers.Independent.Support50.P16.OneWayRetainedInstrument
For positive integers , a one-way retained instrument consists of natural numbers and , matrices for , and matrices for , , and , satisfying
Here is the field messages and is krausCount. Although both fields are natural numbers without explicit positivity requirements, the displayed equations and exclude and .
QAlgorithms.Papers.Independent.Support50.P16.Regularizes
For every function assigning values in to bipartite inputs, positive integers , and , this predicate says that
to the lower limit of that same sequence, in the topology of . Convergence to is included. The predicate imposes no separate finiteness assumption and does not assert that the sequence is monotone. The supplied code does not define or the bipartite input type.
QAlgorithms.Papers.Independent.Support50.P16.StrictSeparation
For any two functions assigning values in to bipartite inputs of positive dimensions, this predicate says that there exist positive integers and a positive semidefinite trace-one bipartite matrix for which , and for each of the four specified functions , the sequence
converges in to its own lower limit as . Here is the nonnegative part of half the real infimum of over finite density-matrix ensembles with average ; is the infimum over finite convex combinations of product density matrices of the supremum of the specified finite classical relative entropy over measurements satisfying the -measurement condition; and is the supremum of the corresponding one-way measured quantity after maps satisfying , over all positive output dimensions. That finite relative entropy is if a positive first-array entry has a nonpositive second-array entry, and otherwise is , with outcome arrays . One-way effects group products of a POVM on the first factor and a conditional POVM on the second; the -measurement condition requires a map satisfying whose output diagonal equals for every . The supplied code does not define , , , the unqualified predicate , or the finite-measurement and bipartite input types. No convergence condition is imposed on or themselves, and their compared values need not both be finite.
QAlgorithms.Papers.Independent.Support50.P16.aliceCondition
For positive integers , an arbitrary complex matrix , and an arbitrary matrix indexed by pairs in , this definition returns the complex matrix with entries
No positivity, Hermiticity, or normalization assumption is imposed on either or .
QAlgorithms.Papers.Independent.Support50.P16.classicalSquashed
For every pair of positive dimensions and every bipartite input , this function is
The infimum inside this expression is a real infimum over finite ensembles of density matrices, and the outer operation converts its half to by replacing negative values with . An ensemble of size cannot satisfy the required total weight . No separate density hypothesis on appears; if there is no eligible ensemble, the real infimum of the empty set is . The supplied code does not define the unqualified function or the bipartite input type, so their meanings cannot be further expanded.
QAlgorithms.Papers.Independent.Support50.P16.conditionalEntanglement
For every positive integers and bipartite input , this function takes the infimum in , over all positive integers and all positive semidefinite trace-one matrices indexed by satisfying , of
Thus the ancillary marginal traces out the factors of dimensions . The dimensions may equal , and no upper bound or attainment condition is imposed. An empty family of admissible extensions gives value . The supplied code does not define , the unqualified function , or the bipartite input type; in particular, the constraint involving cannot be expanded further.
QAlgorithms.Papers.Independent.Support50.P16.continuityModulus
For every natural number , including , and every real number , this defines
There are no positivity assumptions on or . The real logarithm is total, with and for negative ; in particular, for every .
QAlgorithms.Papers.Independent.Support50.P16.copyDimension
For every positive integer and every natural number , this abbreviation returns the positive integer whose underlying natural number is , together with the fact that this power is positive. The case is included and returns .
QAlgorithms.Papers.Independent.Support50.P16.cutBAE
For arbitrary types and every complex matrix indexed by , this function produces a matrix indexed by whose entries are
It simply reorders the three coordinates. No finiteness, nonemptiness, positivity, Hermiticity, or normalization assumptions are required; empty index types are included.
QAlgorithms.Papers.Independent.Support50.P16.extensionCopies
For positive integers , any complex matrix indexed by with , , , and any natural number , this definition returns a matrix with local index dimensions . Write for the code’s map index d n, used as an equivalence from length- sequences of -valued indices to indices below ; its particular definition is not supplied. The returned matrix has entries
There is no density-matrix assumption. The case is included: the empty product is , and the output is the matrix with entry .
QAlgorithms.Papers.Independent.Support50.P16.finiteKLBits
For every natural number , including , and arbitrary real-valued functions on , this defines
The result lies in the extended nonnegative reals. Neither function is required to be nonnegative or normalized, and indices with impose no condition on . The real logarithms are total: , and for negative arguments they equal the logarithm of the absolute value. When , the condition is vacuous and the value is .
QAlgorithms.Papers.Independent.Support50.P16.key
For every pair of positive dimensions and bipartite input , this function is the supremum in of all nonnegative real rates with the following property: for every and , there is a natural number such that, for every natural number with , there exist positive integers , a positive semidefinite trace-one matrix on , unitary matrices on that space for , and a map from the -copy input space of local dimensions to local dimensions , such that belongs to the supplied finite local-operations-and-classical-communication construction,
Here has entries , relabelled by the specified equivalences between -tuples and indices below . After splitting each output index into a key index and a shield index using the specified equivalences, the target has entries
The finite communication construction starts with identity maps and recursively permits either party to apply a finite Kraus family satisfying , followed by a branch-dependent map already in the construction, with the branches summed. The norm is . The choice and rate are allowed; no additional density hypothesis on the input appears in this definition, and an empty set of achievable rates has supremum .
QAlgorithms.Papers.Independent.Support50.P16.measuredEntanglement
For every measurement kind , positive integers , and bipartite input , this function assigns
Here consists of matrices expressible as a finite sum , with , , and each positive semidefinite with trace . For real arrays indexed by the finitely many outcomes, is unless implies for every ; when that condition holds, it is
The real logarithm is total, including . The class consists of the specified finite measurements satisfying the following condition: for , their effects arise by grouping products of two finite POVMs; for , they arise by grouping , where and each are finite POVMs; for , there is a map satisfying the supplied predicate , with output indexed by , such that for every matrix and outcome ; for , every effect is a finite nonnegative sum of products of density matrices, without requiring the weights to sum to ; and for , every effect has positive semidefinite partial transpose on the first factor, whose entries are . A POVM means positive semidefinite effects summing to the identity. Empty infima and suprema in are respectively and . The definitions of the finite-measurement type, the unqualified predicate , and the bipartite input type are not supplied.
QAlgorithms.Papers.Independent.Support50.P16.measurementClass
For each of the five labels and positive integers , this defines a set of values as follows: for , membership means that for some finite families of positive semidefinite local matrices satisfying , , and some outcome-valued function ; for , membership means the same form with in place of , where for each ; for , membership means that some function satisfying the unqualified predicate has for every complex matrix and outcome ; for , each effect must admit a finite expansion
where and each is positive semidefinite with trace , with no requirement that the weights sum to and with allowed; and for , each matrix with entries must be positive semidefinite. The definitions of and the unqualified predicate are not supplied.
QAlgorithms.Papers.Independent.Support50.P16.measurementDistance
For any finite type with decidable equality, any set of values of , and arbitrary complex matrices indexed by , this defines
where , the supremum is taken in the extended nonnegative reals, and conversion to a real number sends to . The summands are nonnegative, so the positive-part operation does not change each finite sum. The definition of is not supplied, and no state assumptions are imposed on . An empty measurement set gives ; there is no factor of .
QAlgorithms.Papers.Independent.Support50.P16.povmOutcomeLaw
For any finite type with decidable equality, any , and any complex matrix indexed by , this defines the real-valued function on the outcomes of by
where . The definition of the type is not supplied here. No density, positivity, or trace normalization hypothesis is imposed on , so this function is not asserted to be a probability distribution.
QAlgorithms.Papers.Independent.Support50.P16.regularizationSequence
For every function assigning values in to bipartite inputs of each pair of positive dimensions, every positive integers , every , and every natural number , this sequence has value
Both powered dimensions are regarded as positive integers, and division takes place in . The sequence starts at , so its denominator is always positive and finite; an infinite numerator gives an infinite value. No additional hypothesis on or is imposed. The supplied code does not define or the bipartite input type.
QAlgorithms.Papers.Independent.Support50.P16.regularized
For every function assigning values in to bipartite inputs, every positive integers , and every , this function is
with the lower limit and division taken in . Its value may be , and the definition requires neither convergence of the sequence nor any additional property of or . The supplied code does not define or the bipartite input type.
QAlgorithms.Papers.Independent.Support50.P16.restrictedEntropy
For any finite type with decidable equality, any set of complex matrices indexed by , any set of values of , and any such matrix , this defines the extended nonnegative number
Here is if some has ; otherwise it is , using total real logarithms with and for . The internal definition of is not supplied. No density or normalization conditions are imposed on or . If is empty, the value is ; if is nonempty and is empty, it is .
QAlgorithms.Papers.Independent.Support50.P16.retainedBranch
For positive integers , an instrument with message count , Kraus count , matrices satisfying , and matrices satisfying for every , and for a chosen , this definition gives a function from complex matrices on the pair index to complex matrices:
The input is arbitrary; it is not required to be a density matrix.
QAlgorithms.Papers.Independent.Support50.P16.retainedCQOutput
For positive integers , an instrument specified by matrices , , and , for every message , and an arbitrary matrix on the pair index of dimensions , this definition returns a matrix indexed by , whose entries are
The sums over range over the instrument’s message and Kraus indices. No density-matrix hypothesis is imposed on .
QAlgorithms.Papers.Independent.Support50.P16.retainedClassical
For positive integers , an instrument with matrices , , and matrices satisfying for every , and an arbitrary matrix on the pair index of dimensions , this definition returns the real-valued function on given by
Here range over the instrument’s message and Kraus indices. The definition does not assume that is a density matrix and does not itself assert that is a probability distribution.
QAlgorithms.Papers.Independent.Support50.P16.retainedQuantum
For positive integers and an instrument with matrices , , and matrices satisfying for every message , this definition gives the function
Its input is any complex matrix on the pair index of dimensions , and its output is a complex matrix; the sums over use the instrument’s message and Kraus counts.
QAlgorithms.Papers.Independent.Support50.P16.separable
For every pair of positive integers , this defines the set of complex matrices on the pair of registers of dimensions for which there exist a natural number , real weights , complex matrices , and complex matrices , satisfying
The quantification permits zero weights and does not require distinct factors. Although is included among the candidate natural numbers, it cannot satisfy the weight-sum condition.
QAlgorithms.Papers.Independent.Support50.P16.trivialMeasurement
For every finite type with decidable equality, including the empty type, this constructs a value of with exactly one outcome and with the identity matrix as its sole effect. The construction supplies proofs that the outcome count is positive, that this effect is positive semidefinite, and that the effects sum to the identity. For empty , the identity is the unique empty matrix.
QAlgorithms.Papers.Independent.Support50.P16.updated
For every positive integers and bipartite input , this function takes the supremum, over all positive output dimensions and all maps from matrices on to matrices on satisfying the predicate , of
Here consists of finite convex combinations of products of positive semidefinite trace-one matrices, and consists of the specified finite measurements whose effects are obtained by grouping , with a POVM and a POVM for every . A POVM has positive semidefinite effects summing to the identity, and . The quantity is if some has , and otherwise equals , using the total real logarithm with . All infima and suprema take place in , with empty infimum and empty supremum . There is no bound on and no attainment requirement. The supplied code does not define the unqualified predicate , the finite-measurement type, or the bipartite input type.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.