Definitions for Rényi squashed entanglement, discord, and relative entropy differences
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P56The objects the formalized statements of Rényi squashed entanglement, discord, and relative entropy differences (arXiv:1410.1443) are stated in. Each was checked against the paper by a blind read-back and a moderator.
RenyiOrder: PDF p.6: positive orders other than one.DPOrder: PDF p.7: data-processing range, including two.embedAC: PDF p.7: AC embedded with identity on B.cmiOne: PDF pp.2,7: ordinary CMI in nats, conditioned on C.renyiCMI: PDF p.7, (3.18): OPTIMIZED Petz CMI with von Neumann endpoint at one. Valid normalized states give a strictly positive scalar logarithm argument. All spectral powers, including exponent zero, vanish on the kernel (p.5).renyiSquashed: PDF p.8, (4.1): half the extended infimum over ALL finite normalized extensions. The ancillary dimension e+1 is arbitrary, with no cardinality cap.LocalMonotonicityConjecture: PDF p.7, Conjecture 1: uniformly quantified FIRST-register monotonicity of actual (3.18), not a theorem or a hypothesis of squashed monotonicity itself.PetzParameterConjecture: PDF pp.7,11,19: optimized Petz CMI parameter conjecture, including one.flagLeft: PDF p.8, (4.4): label held by Alice.flagBoth: PDF p.8, (4.4): same classical label copied to both parties.flagRight: PDF p.8, (4.4): label held by Bob.renyiEntropySupportNats: PDF pp.5–6, (3.9): reuse the accepted natural-log entropy at positive orders; only its order-zero endpoint is replaced by log support rank, as required by Proposition 13 on p.13. The frozen ordinary zeroth power is the identity.renyiConditionalEntropy: PDF p.6, (3.14): optimized Petz conditional entropy H_alpha(A|B).FinitePureDecomposition: PDF p.12, (4.35): the accepted finite pure ensembles constrained to represent rho. This finite subtype differs from Next46.P42.PureDecomposition, which is countably indexed and has a trace-norm barycenter. Unit vectors are required even in zero-weight branches; the weights exclude an empty ensemble.ensembleAX: PDF p.12: AX marginal of the ensemble's actual classical extension.renyiFormation: PDF p.12, Definition 11: infimum of conditional entropy, independently of the formula and attainment asserted in Proposition 12.formationObjective: PDF p.12, (4.38): outer weight p_x, never p_x^alpha.maxEntangledKet: PDF p.5, (3.3): maximally entangled ket in arbitrary orthonormal Schmidt families, represented by columns of rectangular isometries.measurementOutput: PDF p.16, (5.2): measurement dilation A -> E X with E=(X,A). Off-diagonal outcome coherence is retained in the environment and output.renyiDiscord: PDF p.16, Definition 16: unrestricted POVM infimum. The identical formula is used beyond order two in Propositions 18–19; the alpha=1 branch is ordinary discord, through the ordinary CMI branch of renyiCMI.KetPOVM: PDF pp.17–20: arbitrary, unnormalized rank-one POVM kets. Null effects are allowed as removable entries, without changing either infimum.rankOneDiscord: PDF p.17: restricted infimum; zero kets may be deleted. Neither attainment nor optimality of every projective measurement is asserted.IsClassicalOnA: PDF p.16, (5.3): cq in any orthonormal basis of the measured register A.conditionalKet: PDF p.20, (5.28): unnormalized conditional ket on B.pureDiscordObjective: PDF p.20, (5.27): omit zero-probability branches; retain the sign-changing prefactor inside the infimum.sandwichedCMI: PDF p.21, (5.42): fixed-reference SANDWICHED CMI. The Schatten expression is equivalently log Tr(K^alpha)/(alpha-1) for this positive K.SandwichedParameterConjecture: PDF p.21, (5.41): separate sandwiched parameter conjecture, including one.measurementRecovery: PDF pp.22,29: one common measure-and-prepare map computed from the marginal. A zero-probability branch prepares the supplied fixed density; its contribution on the source joint state is zero, independently of completion.applyFirstSuperop: PDF p.22: a map acts on A, leaving B untouched, including off-diagonal blocks.relativeReal: PDF p.23, (6.1): real Umegaki formula on the full-rank domain.relativeEntropyDifference: PDF p.23, (6.1): computed relativeEntropyDifference, finite on its full-rank domain.StrictChannel: PDF p.5: strict CPTP with reference-stable positive definiteness.differencePetz: PDF p.25, (6.12): actual Petz relativeEntropyDifference, not a relativeEntropyDifference of Renyi divergences. The branch at one is the continuous Umegaki endpoint.differenceSandwiched: PDF p.25, (6.13), read using well-typed (6.18): remove printed Tr before a scalar Schatten norm. For positive K the intended value is log Tr(K^a)/(a-1).DifferenceParameterConjecture: PDF p.25, Conjecture 26: positive-order comparisons of BOTH computed functionals, including one. No zero-order expression is needed by the targets.RecoveryRemainder: PDF p.26, (6.24): UNIVERSAL recovery inequality with the original full-rank strict-channel domain. Singular applications remain conclusions.jointRecovered: PDF p.27, (6.28): branch recovered positive operator, not necessarily a state.JointRemainderAt: PDF p.27: joint-convexity remainder with square root INSIDE the sum.JointRemainder: PDF pp.27–29: universal joint-convexity remainder scheme.differenceVariance: PDF p.35, (B.14): FULL variance including the final Kadison–Schwarz correction.cmiReference: PDF p.25, (6.16): rho_B tensor rho_AC in ABC ordering.fixedPetzCMI: PDF p.25, (6.17): FIXED-reference Petz CMI with both rho_B^0 factors. It is deliberately not identified with optimized (3.18).fixedSandwichedCMI: PDF p.25, (6.18): fixed-reference sandwiched expression with support projectors.addAncillas: PDF p.32, (A.1): three independent arbitrary mixed ancillary states.conditionedFlag: PDF p.33, (A.11): append classical X to conditioning system C.SquashedLOCC: PDF p.10: complete-output monotonicity under every finite adaptive LOCC protocol, with arbitrary positive input/output dimensions and local memories.SquashedConvex: PDF p.10: convexity for all normalized finite ensembles.discordRecoveryCost: PDF p.22, (5.47): cost of the specified EB recovery map, completed on zero-probability branches with rho_A itself.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_BipartiteSeparability
import Definitions.Def_QAlgorithms_Defs_QuantumInformation
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P56
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P71
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P21
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P21
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P35
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P07
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P67
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P08
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P25
/-! arXiv:1410.1443v3. PDF page citations, natural logarithms, arbitrary finite bases.
All conjectures remain premises. All local definitions have complete bodies.
Imports of pinned accepted paper modules use the independent-paper workflow override.
Three source ambiguities are deferred in HARD.md. Compilation is pending batch handoff. -/
noncomputable section
open Filter Topology
open scoped Matrix ComplexConjugate ComplexOrder
namespace QAlgorithms.Papers.Independent.Intakenext100.P56
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms
open QAlgorithms.Papers.Independent.Information100.P56 (IsLaw entropy average holevo)
open QAlgorithms.Papers.Independent.Information100.P71 (supportPower)
open QAlgorithms.Papers.Independent.Dependency50.P21 (channelAdjoint petz extendedLog marginalAB)
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Dependency50.P35 (marginalAC)
open QAlgorithms.Papers.Independent.Dependency50.P07 (bipartiteProduct)
open QAlgorithms.Papers.Independent.Information100.P67 (squaredFidelity)
open QAlgorithms.Papers.Independent.Advance50.P25 (renyiEntropyNats)
variable {A B C D E X : Type}
variable [Fintype A] [Fintype B] [Fintype C] [Fintype D] [Fintype E] [Fintype X]
variable [Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D] [Nonempty E] [Nonempty X]
/-- Sanity helper for PDF pp.5,13: accept the singleton matrix and its
DecidableEq instance explicitly, so the frozen support power uses exactly the
same instance as the caller. Identify the matrix entrywise before evaluation. -/
private lemma supportPower_unit_zero [decEqUnit : DecidableEq Unit] (M : Op Unit)
(hM : ∀ i j, M i j = 1) :
Real.log (@supportPower Unit PUnit.fintype decEqUnit M 0).trace.re = 0 := by
have hIdentity : M = (1 : Op Unit) := by
ext i j
simpa [Matrix.one_apply, Subsingleton.elim i j] using hM i j
have hPower : @supportPower Unit PUnit.fintype decEqUnit (1 : Op Unit) 0 = 1 := by
unfold supportPower
rw [cfc_apply_one (R := ℝ) (A := Op Unit)
(f := fun x : ℝ => if x = 0 then 0 else Real.rpow x 0)]
norm_num
rw [hIdentity, hPower]
norm_num [Matrix.trace, Matrix.one_apply]
open scoped Matrix.Norms.L2Operator
/-- PDF p.6: positive orders other than one. -/
def RenyiOrder (a : ℝ) : Prop := 0 < a ∧ a ≠ 1
/-- PDF p.7: data-processing range, including two. -/
def DPOrder (a : ℝ) : Prop := RenyiOrder a ∧ a ≤ 2
/-- PDF p.7: AC embedded with identity on B. -/
def embedAC (M : Op (A × C)) : Op (A × (B × C)) :=
fun i j => if i.2.1 = j.2.1 then M (i.1,i.2.2) (j.1,j.2.2) else 0
/-- PDF pp.2,7: ordinary CMI in nats, conditioned on C. -/
def cmiOne (rho : Op (A × (B × C))) : ℝ :=
entropy (marginalAC rho) + entropy (traceLeft rho) -
entropy (traceLeft (traceLeft rho)) - entropy rho
/-- PDF p.7, (3.18): OPTIMIZED Petz CMI with von Neumann endpoint at one.
Valid normalized states give a strictly positive scalar logarithm argument.
All spectral powers, including exponent zero, vanish on the kernel (p.5). -/
def renyiCMI (a : ℝ) (rho : Op (A × (B × C))) : ℝ :=
if a = 1 then cmiOne rho else
let R := embedAC (B := B) (supportPower (marginalAC rho) ((1-a)/2))
let S := Matrix.kronecker (1 : Op B)
(supportPower (traceLeft (traceLeft rho)) ((a-1)/2))
a/(a-1) * Real.log (supportPower
(S * traceLeft (R * supportPower rho a * R) * S) (1/a)).trace.re
/-- PDF p.8, (4.1): half the extended infimum over ALL finite normalized
extensions. The ancillary dimension e+1 is arbitrary, with no cardinality cap. -/
def renyiSquashed (a : ℝ) (rho : Op (A × B)) : EReal :=
(1/2 : EReal) * sInf {v : EReal | ∃ e : ℕ,
∃ omega : Op (A × (B × Fin (e+1))), IsDensityMatrix omega ∧
marginalAB omega = rho ∧ v = (renyiCMI a omega : EReal)}
/-- PDF p.7, Conjecture 1: uniformly quantified FIRST-register monotonicity
of actual (3.18), not a theorem or a hypothesis of squashed monotonicity itself. -/
def LocalMonotonicityConjecture : Prop :=
∀ (A B C D : Type) [Fintype A] [Fintype B] [Fintype C] [Fintype D]
[Nonempty A] [Nonempty B] [Nonempty C] [Nonempty D]
(a : ℝ), DPOrder a → ∀ rho : Op (A × (B × C)), IsDensityMatrix rho →
∀ N : Superop A D, IsChannel N →
renyiCMI a (fun i j => N (fun k l => rho (k,i.2) (l,j.2)) i.1 j.1) ≤ renyiCMI a rho
/-- PDF pp.7,11,19: optimized Petz CMI parameter conjecture, including one. -/
def PetzParameterConjecture : Prop :=
∀ (A B C : Type) [Fintype A] [Fintype B] [Fintype C]
[Nonempty A] [Nonempty B] [Nonempty C] (rho : Op (A × (B × C))),
IsDensityMatrix rho → ∀ a b : ℝ, 0 < a → a ≤ b → renyiCMI a rho ≤ renyiCMI b rho
/-- PDF p.8, (4.4): label held by Alice. -/
def flagLeft (p : X → ℝ) (rho : X → Op (A × B)) : Op ((A × X) × B) :=
fun i j => if i.1.2 = j.1.2 then (p i.1.2 : ℂ) * rho i.1.2 (i.1.1,i.2) (j.1.1,j.2) else 0
/-- PDF p.8, (4.4): same classical label copied to both parties. -/
def flagBoth (p : X → ℝ) (rho : X → Op (A × B)) : Op ((A × X) × (B × X)) :=
fun i j => if i.1.2 = i.2.2 ∧ j.1.2 = j.2.2 ∧ i.1.2 = j.1.2 then
(p i.1.2 : ℂ) * rho i.1.2 (i.1.1,i.2.1) (j.1.1,j.2.1) else 0
/-- PDF p.8, (4.4): label held by Bob. -/
def flagRight (p : X → ℝ) (rho : X → Op (A × B)) : Op (A × (B × X)) :=
fun i j => if i.2.2 = j.2.2 then (p i.2.2 : ℂ) * rho i.2.2 (i.1,i.2.1) (j.1,j.2.1) else 0
/-- PDF pp.5–6, (3.9): reuse the accepted natural-log entropy at positive
orders; only its order-zero endpoint is replaced by log support rank, as required
by Proposition 13 on p.13. The frozen ordinary zeroth power is the identity. -/
def renyiEntropySupportNats (a : ℝ) (rho : Op A) : ℝ :=
if a = 0 then Real.log (supportPower rho 0).trace.re else renyiEntropyNats a rho
/-- PDF p.6, (3.14): optimized Petz conditional entropy H_alpha(A|B). -/
def renyiConditionalEntropy (a : ℝ) (rho : Op (A × B)) : ℝ :=
if a = 1 then entropy rho - entropy (traceLeft rho) else
a/(1-a) * Real.log (supportPower (traceLeft (supportPower rho a)) (1/a)).trace.re
/-- PDF p.12, (4.35): the accepted finite pure ensembles constrained to
represent rho. This finite subtype differs from Next46.P42.PureDecomposition,
which is countably indexed and has a trace-norm barycenter. Unit vectors are
required even in zero-weight branches; the weights exclude an empty ensemble. -/
def FinitePureDecomposition (rho : Op (A × B)) :=
{ens : QAlgorithms.Papers.Independent.Information100.P08.PureEnsemble (A × B) //
average (fun x => pureDensity (ens.vector x)) ens.prob = rho}
/-- PDF p.12: AX marginal of the ensemble's actual classical extension. -/
def ensembleAX {rho : Op (A × B)} (ens : FinitePureDecomposition rho) : Op (A × Fin ens.val.size) :=
fun i j => if i.2 = j.2 then
(ens.val.prob i.2 : ℂ) * traceRight (pureDensity (ens.val.vector i.2)) i.1 j.1 else 0
/-- PDF p.12, Definition 11: infimum of conditional entropy, independently
of the formula and attainment asserted in Proposition 12. -/
def renyiFormation (a : ℝ) (rho : Op (A × B)) : EReal :=
sInf {v : EReal | ∃ ens : FinitePureDecomposition rho,
v = (renyiConditionalEntropy a (ensembleAX ens) : EReal)}
/-- PDF p.12, (4.38): outer weight p_x, never p_x^alpha. -/
def formationObjective (a : ℝ) {rho : Op (A × B)} (ens : FinitePureDecomposition rho) : ℝ :=
a/(1-a) * Real.log (∑ x, ens.val.prob x *
((supportPower (traceRight (pureDensity (ens.val.vector x))) a).trace.re) ^ (1/a))
/-- PDF p.5, (3.3): maximally entangled ket in arbitrary orthonormal Schmidt
families, represented by columns of rectangular isometries. -/
def maxEntangledKet (d : ℕ) (U : Matrix A (Fin d) ℂ) (V : Matrix B (Fin d) ℂ) :
EuclideanSpace ℂ (A × B) :=
WithLp.toLp 2 fun i => ((Real.sqrt d)⁻¹ : ℂ) * ∑ k, U i.1 k * V i.2 k
/-- PDF p.16, (5.2): measurement dilation A -> E X with E=(X,A).
Off-diagonal outcome coherence is retained in the environment and output. -/
def measurementOutput {m : ℕ} (M : Fin m → Op A) (rho : Op (A × B)) :
Op ((Fin m × A) × (B × Fin m)) :=
fun i j => if i.1.1 = i.2.2 ∧ j.1.1 = j.2.2 then
∑ k, ∑ l, (cfc Real.sqrt (M i.1.1)) i.1.2 k *
rho (k,i.2.1) (l,j.2.1) * conj ((cfc Real.sqrt (M j.1.1)) j.1.2 l)
else 0
/-- PDF p.16, Definition 16: unrestricted POVM infimum. The identical
formula is used beyond order two in Propositions 18–19; the alpha=1 branch
is ordinary discord, through the ordinary CMI branch of renyiCMI. -/
def renyiDiscord (a : ℝ) (rho : Op (A × B)) : EReal :=
sInf {v : EReal | ∃ m : ℕ, 0 < m ∧ ∃ M : Fin m → Op A,
IsPOVM M ∧ v = (renyiCMI a (measurementOutput M rho) : EReal)}
/-- PDF pp.17–20: arbitrary, unnormalized rank-one POVM kets.
Null effects are allowed as removable entries, without changing either infimum. -/
def KetPOVM {m : ℕ} (phi : Fin m → EuclideanSpace ℂ A) : Prop :=
IsPOVM (fun x => pureDensity (phi x))
/-- PDF p.17: restricted infimum; zero kets may be deleted.
Neither attainment nor optimality of every projective measurement is asserted. -/
def rankOneDiscord (a : ℝ) (rho : Op (A × B)) : EReal :=
sInf {v : EReal | ∃ m : ℕ, 0 < m ∧ ∃ phi : Fin m → EuclideanSpace ℂ A,
KetPOVM phi ∧ v = (renyiCMI a (measurementOutput (fun x => pureDensity (phi x)) rho) : EReal)}
/-- PDF p.16, (5.3): cq in any orthonormal basis of the measured register A. -/
def IsClassicalOnA (rho : Op (A × B)) : Prop :=
∃ U : Matrix.unitaryGroup A ℂ, ∃ p : A → ℝ, ∃ states : A → Op B,
IsLaw p ∧ (∀ x, IsDensityMatrix (states x)) ∧
rho = fun i j => ∑ x, (p x : ℂ) * (U : Op A) i.1 x *
conj ((U : Op A) j.1 x) * states x i.2 j.2
/-- PDF p.20, (5.28): unnormalized conditional ket on B. -/
def conditionalKet (psi : EuclideanSpace ℂ (A × B)) (phi : EuclideanSpace ℂ A) :
EuclideanSpace ℂ B := WithLp.toLp 2 fun b => ∑ a, conj (phi a) * psi (a,b)
/-- PDF p.20, (5.27): omit zero-probability branches; retain the
sign-changing prefactor inside the infimum. -/
def pureDiscordObjective (a : ℝ) {m : ℕ} (psi : EuclideanSpace ℂ (A × B))
(phi : Fin m → EuclideanSpace ℂ A) : ℝ :=
a/(a-1) * Real.log (∑ x,
let z := conditionalKet psi (phi x)
let p := ‖z‖^2
if 0 < p then
let xi := ((Real.sqrt p)⁻¹ : ℂ) • z
p * ((inner ℂ xi (act (supportPower (traceLeft (pureDensity psi)) (1-a)) xi)).re) ^ (1/a)
else 0)
/-- PDF p.21, (5.42): fixed-reference SANDWICHED CMI.
The Schatten expression is equivalently log Tr(K^alpha)/(alpha-1) for this positive K. -/
def sandwichedCMI (a : ℝ) (rho : Op (A × (B × C))) : ℝ :=
if a = 1 then cmiOne rho else
let R := embedAC (B := B) (supportPower (marginalAC rho) ((1-a)/(2*a)))
let S := Matrix.kronecker (1 : Op B)
(supportPower (traceLeft (traceLeft rho)) ((a-1)/(2*a)))
let T := supportPower (traceLeft rho) ((1-a)/a)
let L := supportPower rho (1/2)
Real.log (supportPower
(L * R * Matrix.kronecker (1 : Op A) (S * T * S) * R * L) a).trace.re / (a-1)
/-- PDF p.21, (5.41): separate sandwiched parameter conjecture, including one. -/
def SandwichedParameterConjecture : Prop :=
∀ (A B C : Type) [Fintype A] [Fintype B] [Fintype C]
[Nonempty A] [Nonempty B] [Nonempty C] (rho : Op (A × (B × C))),
IsDensityMatrix rho → ∀ a b : ℝ, 0 < a → a ≤ b → sandwichedCMI a rho ≤ sandwichedCMI b rho
/-- PDF pp.22,29: one common measure-and-prepare map computed from the
marginal. A zero-probability branch prepares the supplied fixed density;
its contribution on the source joint state is zero, independently of completion. -/
def measurementRecovery {m : ℕ} (rho fallback : Op A)
(phi : Fin m → EuclideanSpace ℂ A) : Superop A A :=
fun Z => ∑ x,
let P := pureDensity (phi x)
let q := effectProb P rho
((P * Z).trace) •
(if 0 < q then ((q⁻¹ : ℝ) : ℂ) • (cfc Real.sqrt rho * P * cfc Real.sqrt rho) else fallback)
/-- PDF p.22: a map acts on A, leaving B untouched, including off-diagonal blocks. -/
def applyFirstSuperop (N : Superop A C) (rho : Op (A × B)) : Op (C × B) :=
fun i j => N (fun k l => rho (k,i.2) (l,j.2)) i.1 j.1
/-- PDF p.23, (6.1): real Umegaki formula on the full-rank domain. -/
def relativeReal (rho sigma : Op A) : ℝ :=
(rho * (cfc Real.log rho - cfc Real.log sigma)).trace.re
/-- PDF p.23, (6.1): computed relativeEntropyDifference, finite on its full-rank domain. -/
def relativeEntropyDifference (rho sigma : Op A) (N : Superop A B) : ℝ :=
relativeReal rho sigma - relativeReal (N rho) (N sigma)
/-- PDF p.5: strict CPTP with reference-stable positive definiteness. -/
def StrictChannel (N : Superop A B) : Prop :=
IsChannel N ∧ ∀ n : ℕ, ∀ Z : Op (Fin n × A), Z.PosDef → (idTensorSuperop N Z).PosDef
/-- PDF p.25, (6.12): actual Petz relativeEntropyDifference, not a relativeEntropyDifference of Renyi divergences.
The branch at one is the continuous Umegaki endpoint. -/
def differencePetz (a : ℝ) (rho sigma : Op A) (N : Superop A B) : ℝ :=
if a = 1 then relativeEntropyDifference rho sigma N else
let S := supportPower sigma ((1-a)/2)
let T := supportPower (N sigma) ((a-1)/2)
Real.log (supportPower rho a * S *
channelAdjoint N (T * supportPower (N rho) (1-a) * T) * S).trace.re / (a-1)
/-- PDF p.25, (6.13), read using well-typed (6.18): remove printed Tr
before a scalar Schatten norm. For positive K the intended value is log Tr(K^a)/(a-1). -/
def differenceSandwiched (a : ℝ) (rho sigma : Op A) (N : Superop A B) : ℝ :=
if a = 1 then relativeEntropyDifference rho sigma N else
let S := supportPower sigma ((1-a)/(2*a))
let T := supportPower (N sigma) ((a-1)/(2*a))
let R := supportPower rho (1/2)
let K := R * S * channelAdjoint N (T * supportPower (N rho) ((1-a)/a) * T) * S * R
Real.log (supportPower K a).trace.re / (a-1)
/-- PDF p.25, Conjecture 26: positive-order comparisons of BOTH computed
functionals, including one. No zero-order expression is needed by the targets. -/
def DifferenceParameterConjecture : Prop :=
∀ (A B : Type) [Fintype A] [Fintype B] [Nonempty A] [Nonempty B]
(rho sigma : Op A) (N : Superop A B),
IsDensityMatrix rho → rho.PosDef → IsDensityMatrix sigma → sigma.PosDef → StrictChannel N →
∀ a b : ℝ, 0 < a → a ≤ b →
differencePetz a rho sigma N ≤ differencePetz b rho sigma N ∧
differenceSandwiched a rho sigma N ≤ differenceSandwiched b rho sigma N
/-- PDF p.26, (6.24): UNIVERSAL recovery inequality with the original
full-rank strict-channel domain. Singular applications remain conclusions. -/
def RecoveryRemainder : Prop :=
∀ (A B : Type) [Fintype A] [Fintype B] [Nonempty A] [Nonempty B]
(rho sigma : Op A) (N : Superop A B),
IsDensityMatrix rho → rho.PosDef → IsDensityMatrix sigma → sigma.PosDef → StrictChannel N →
-extendedLog (squaredFidelity rho (petz sigma N (N rho))) ≤ (relativeEntropyDifference rho sigma N : EReal)
/-- PDF p.27, (6.28): branch recovered positive operator, not necessarily a state. -/
def jointRecovered (sigma barSigma barRho : Op A) : Op A :=
let S := supportPower sigma (1/2)
let T := supportPower barSigma (-1/2)
S * T * barRho * T * S
/-- PDF p.27: joint-convexity remainder with square root INSIDE the sum. -/
def JointRemainderAt (p : X → ℝ) (rho sigma : X → Op A) : Prop :=
-(2 * extendedLog (∑ x, p x * Real.sqrt
(squaredFidelity (rho x) (jointRecovered (sigma x) (average sigma p) (average rho p))))) ≤
(((∑ x, p x * relativeReal (rho x) (sigma x)) -
relativeReal (average rho p) (average sigma p) : ℝ) : EReal)
/-- PDF pp.27–29: universal joint-convexity remainder scheme. -/
def JointRemainder : Prop :=
∀ (A X : Type) [Fintype A] [Fintype X] [Nonempty A] [Nonempty X]
(p : X → ℝ) (rho sigma : X → Op A), IsLaw p →
(∀ x, IsDensityMatrix (rho x) ∧ (rho x).PosDef) →
(∀ x, IsDensityMatrix (sigma x) ∧ (sigma x).PosDef) → JointRemainderAt p rho sigma
/-- PDF p.35, (B.14): FULL variance including the final Kadison–Schwarz correction. -/
def differenceVariance (rho sigma : Op A) (N : Superop A B) : ℝ :=
let L := cfc Real.log (N rho) - cfc Real.log (N sigma)
let H := cfc Real.log rho - cfc Real.log sigma - channelAdjoint N L
let d := relativeEntropyDifference rho sigma N
(rho * (H - (d : ℂ) • (1 : Op A)) ^ 2).trace.re +
(N rho * L ^ 2).trace.re - (rho * (channelAdjoint N L) ^ 2).trace.re
/-- PDF p.25, (6.16): rho_B tensor rho_AC in ABC ordering. -/
def cmiReference (rho : Op (A × (B × C))) : Op (A × (B × C)) :=
fun i j => traceRight (traceLeft rho) i.2.1 j.2.1 *
marginalAC rho (i.1,i.2.2) (j.1,j.2.2)
/-- PDF p.25, (6.17): FIXED-reference Petz CMI with both rho_B^0 factors.
It is deliberately not identified with optimized (3.18). -/
def fixedPetzCMI (a : ℝ) (rho : Op (A × (B × C))) : ℝ :=
let P := Matrix.kronecker (1 : Op A)
(Matrix.kronecker (supportPower (traceRight (traceLeft rho)) 0) (1 : Op C))
let R := embedAC (B := B) (supportPower (marginalAC rho) ((1-a)/2))
let S := Matrix.kronecker (1 : Op B) (supportPower (traceLeft (traceLeft rho)) ((a-1)/2))
Real.log (supportPower rho a * P * R *
Matrix.kronecker (1 : Op A) (S * supportPower (traceLeft rho) (1-a) * S) * R * P).trace.re / (a-1)
/-- PDF p.25, (6.18): fixed-reference sandwiched expression with support projectors. -/
def fixedSandwichedCMI (a : ℝ) (rho : Op (A × (B × C))) : ℝ :=
let P := Matrix.kronecker (1 : Op A)
(Matrix.kronecker (supportPower (traceRight (traceLeft rho)) 0) (1 : Op C))
let R := embedAC (B := B) (supportPower (marginalAC rho) ((1-a)/(2*a)))
let S := Matrix.kronecker (1 : Op B) (supportPower (traceLeft (traceLeft rho)) ((a-1)/(2*a)))
let L := supportPower rho (1/2)
Real.log (supportPower (L * P * R *
Matrix.kronecker (1 : Op A) (S * supportPower (traceLeft rho) ((1-a)/a) * S) * R * P * L) a).trace.re / (a-1)
/-- PDF p.32, (A.1): three independent arbitrary mixed ancillary states. -/
def addAncillas {A1 B1 C1 : Type} (rho : Op (A × (B × C)))
(sigma : Op A1) (tau : Op B1) (gamma : Op C1) :
Op ((A × A1) × ((B × B1) × (C × C1))) :=
fun i j => rho (i.1.1,(i.2.1.1,i.2.2.1)) (j.1.1,(j.2.1.1,j.2.2.1)) *
sigma i.1.2 j.1.2 * tau i.2.1.2 j.2.1.2 * gamma i.2.2.2 j.2.2.2
/-- PDF p.33, (A.11): append classical X to conditioning system C. -/
def conditionedFlag (p : X → ℝ) (rho : X → Op (A × (B × C))) : Op (A × (B × (C × X))) :=
fun i j => if i.2.2.2 = j.2.2.2 then
(p i.2.2.2 : ℂ) * rho i.2.2.2 (i.1,(i.2.1,i.2.2.1)) (j.1,(j.2.1,j.2.2.1)) else 0
/-! Small sanity instances: no proofs of paper targets. -/
example : RenyiOrder 2 := by norm_num [RenyiOrder]
example : ¬ RenyiOrder 1 := by simp [RenyiOrder]
example {rho : Op (A × B)} (ens : FinitePureDecomposition rho) :
(∀ x, 0 ≤ ens.val.prob x) ∧ ∑ x, ens.val.prob x = 1 := ⟨ens.val.nonneg, ens.val.total⟩
example (rho : Op (A × (B × C))) : renyiCMI 1 rho = cmiOne rho := by simp [renyiCMI]
example (rho sigma : Op A) (N : Superop A B) :
differencePetz 1 rho sigma N = relativeEntropyDifference rho sigma N := by simp [differencePetz]
example (rho sigma : Op A) (N : Superop A B) :
differenceSandwiched 1 rho sigma N = relativeEntropyDifference rho sigma N := by simp [differenceSandwiched]
example : -extendedLog 0 = (⊤ : EReal) := by simp [extendedLog]
example {m : ℕ} (phi : Fin m → EuclideanSpace ℂ A) :
KetPOVM phi ↔ IsPOVM (fun x => pureDensity (phi x)) := Iff.rfl
/-- Sanity: the unit basis gives the one-dimensional normalized maximally entangled ket. -/
example : maxEntangledKet 1 (1 : Op (Fin 1)) (1 : Op (Fin 1)) = ket (0,0) := by
ext i
have hi : i = (0, 0) := Subsingleton.elim _ _
subst i
simp [maxEntangledKet, ket, Matrix.one_apply]
/-- Sanity: the copied flag cannot disagree between the two parties. -/
example (p : X → ℝ) (rho : X → Op (A × B))
(aa : A) (bb : B) (x y : X) (h : x ≠ y) :
flagBoth p rho ((aa,x),(bb,y)) ((aa,x),(bb,y)) = 0 := by
simp [flagBoth, h]
/-- Sanity: an ancillary matrix unit contributes its actual diagonal entry. -/
example (rho : Op (A × (B × C))) (sigma : Op D) (tau : Op E) (gamma : Op X)
(a : A) (b : B) (c : C) (d : D) (e : E) (x : X) :
addAncillas rho sigma tau gamma ((a,d),((b,e),(c,x))) ((a,d),((b,e),(c,x))) =
rho (a,(b,c)) (a,(b,c)) * sigma d d * tau e e * gamma x x := rfl
/-- Sanity: partial contraction on a product computational ket conjugates the bra. -/
example (a : A) (b : B) : conditionalKet (ket (a,b)) (ket a) = ket b := by
ext j
by_cases hj : j = b
· subst j
simp [conditionalKet, ket]
· simp [conditionalKet, ket, hj]
/-- Sanity: the final correction in B.14 cancels for identical inputs. -/
example (rho : Op A) (N : Superop A B) : differenceVariance rho rho N = 0 := by
simp [differenceVariance, relativeEntropyDifference, relativeReal, channelAdjoint]
/-- Sanity: no output-state normalization is hidden in fidelity. -/
example : squaredFidelity (1 : Op Unit) (1 : Op Unit) = 1 := by
have hs : cfc Real.sqrt (1 : Op Unit) = 1 := by
simpa using (cfc_apply_one (R := ℝ) (A := Op Unit) (f := Real.sqrt))
simp [squaredFidelity, rootFidelity, hs, Matrix.trace, Matrix.one_apply]
/-- Sanity: entropy at the identity has value zero in nats. -/
example : renyiEntropySupportNats 0 (1 : Op Unit) = 0 := by
simp only [renyiEntropySupportNats, if_pos rfl, ite_true]
apply supportPower_unit_zero (decEqUnit := Classical.decEq Unit)
intro i j
simp [Matrix.one_apply, Subsingleton.elim i j]
/-- Sanity: the ordinary endpoint is the imported von Neumann entropy. -/
example (rho : Op A) : renyiEntropySupportNats 1 rho = entropy rho := by
simp [renyiEntropySupportNats, renyiEntropyNats]
/-- Sanity: a zero-q branch uses the chosen density, with the complex
trace coefficient needed on off-diagonal blocks of an entangled input. -/
example (fallback Z : Op A) {m : ℕ} (phi : Fin m → EuclideanSpace ℂ A) :
measurementRecovery (0 : Op A) fallback phi Z =
∑ x, ((pureDensity (phi x) * Z).trace) • fallback := by
simp [measurementRecovery, effectProb]
/-- Sanity: the fixed-reference support-projector expressions have value zero
on the zero matrix. This helper default is excluded by every state hypothesis. -/
example (a : ℝ) : fixedPetzCMI a (0 : Op (A × (B × C))) = 0 := by
simp [fixedPetzCMI, supportPower, marginalAC, traceLeft, traceRight, embedAC, cfc_zero]
/-- PDF p.10: complete-output monotonicity under every finite adaptive LOCC
protocol, with arbitrary positive input/output dimensions and local memories. -/
def SquashedLOCC (a : ℝ) : Prop :=
∀ k l m n : ℕ, ∀ rho : Op (Fin (k+1) × Fin (l+1)), IsDensityMatrix rho →
∀ N : Superop (Fin (k+1) × Fin (l+1)) (Fin (m+1) × Fin (n+1)),
FiniteLOCC N → renyiSquashed a (N rho) ≤ renyiSquashed a rho
/-- PDF p.10: convexity for all normalized finite ensembles. -/
def SquashedConvex (a : ℝ) : Prop :=
∀ (A B X : Type) [Fintype A] [Fintype B] [Fintype X]
[Nonempty A] [Nonempty B] [Nonempty X] (p : X → ℝ) (rho : X → Op (A × B)),
IsLaw p → (∀ x, IsDensityMatrix (rho x)) →
renyiSquashed a (average rho p) ≤ ∑ x, (p x : EReal) * renyiSquashed a (rho x)
/-- PDF p.22, (5.47): cost of the specified EB recovery map, completed on
zero-probability branches with rho_A itself. -/
def discordRecoveryCost {m : ℕ} (rho : Op (A × B))
(phi : Fin m → EuclideanSpace ℂ A) : EReal :=
-extendedLog (squaredFidelity rho
(applyFirstSuperop (measurementRecovery (traceRight rho) (traceRight rho) phi) rho))
end QAlgorithms.Papers.Independent.Intakenext100.P56
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P56.DPOrder
For a real number , this predicate means , , and . Thus its allowed values are precisely .
QAlgorithms.Papers.Independent.Intakenext100.P56.DifferenceParameterConjecture
This proposition quantifies over all nonempty finite types , all positive definite density matrices on , and every function admitting a finite Kraus representation with , such that applying to each matrix block preserves positive definiteness on for every natural , including zero. It requires, for every pair of real orders , both and , where the two real functions are defined as follows. Write for functional calculus with scalar function zero at zero and otherwise, and . Both functions at order equal ; at , they are
Logarithms are natural, all functional calculus and scalar operations use their total definitions, and either order may equal ; no upper order bound is present.
QAlgorithms.Papers.Independent.Intakenext100.P56.FinitePureDecomposition
For finite index types and any complex matrix indexed by , this defines the type of finite ensembles consisting of a natural number , real weights for satisfying , and vectors satisfying , together with the requirement
Zero weights and repeated vectors are permitted. Although is a natural number without an explicit positivity field, its weights cannot sum to when . No condition on is imposed before forming this type; it is empty when no such ensemble exists.
QAlgorithms.Papers.Independent.Intakenext100.P56.IsClassicalOnA
For finite index types with decidable equality and any complex matrix on , this predicate asserts the existence of a unitary matrix on , real weights indexed by with , and matrices on that are positive semidefinite with complex trace , such that
A density matrix is required for every label, including labels of zero weight. No separate density assumption on appears in the predicate. If is empty, the weights cannot sum to ; if is empty, no required trace-one matrix exists once is nonempty.
QAlgorithms.Papers.Independent.Intakenext100.P56.JointRemainder
This is the proposition that, for every pair of finite nonempty types , every family of real weights satisfying and , and every two families of positive definite density matrices on —each positive semidefinite with trace , and additionally positive definite—the following inequality holds. Set , , , , and , where logarithms are natural and brackets denote real functional calculus; the powers assign zero to zero spectral values. With for and otherwise, the required extended-real inequality is
Zero weights are allowed, but positive definiteness is required for every member of both families, including those with zero weight.
QAlgorithms.Papers.Independent.Intakenext100.P56.JointRemainderAt
For finite index types , with decidable equality as required by the matrix operations, arbitrary real weights , and arbitrary complex matrices indexed by , put , , and , where uses real functional calculus with scalar value at zero and elsewhere. Write , with natural logarithms applied by real functional calculus, and
The declaration defines the proposition
interpreting the inequality in the extended real numbers. There are no probability, positivity, normalization, or support hypotheses; in particular, the right side uses the displayed real formula even when support inclusion fails. A nonpositive argument of makes the left side ; if either or is empty, the proposition is false.
QAlgorithms.Papers.Independent.Intakenext100.P56.KetPOVM
For a finite index type with decidable equality, any natural number , and any vectors , , this predicate requires that every matrix , with entries , be positive semidefinite and that
The vectors are not required to have unit norm or to be nonzero, so individual matrices can have rank zero. The case is included; its completeness condition is , which cannot hold when is nonempty but does hold when is empty.
QAlgorithms.Papers.Independent.Intakenext100.P56.LocalMonotonicityConjecture
This proposition asserts that for every four finite nonempty types , every real with and , every positive semidefinite complex matrix indexed by with , and every map from complex matrices on to complex matrices on admitting a finite representation with , one has , where
For a matrix on any first register together with , set , , and . The quantity in the asserted inequality is
where is embedded with identity on , and ; the first-register trace is over for . No restriction on register dimensions beyond finite nonemptiness is imposed.
QAlgorithms.Papers.Independent.Intakenext100.P56.PetzParameterConjecture
This proposition asserts that for every finite nonempty types , every positive semidefinite complex matrix indexed by with , and all real numbers satisfying , one has . To define these quantities, set , , , , and . Then , while for ,
where embeds with identity on , and . The quantifiers include , either parameter equal to one, parameters on opposite sides of one, and arbitrarily large positive parameters; no upper bound or exclusion of one is assumed.
QAlgorithms.Papers.Independent.Intakenext100.P56.RecoveryRemainder
This proposition quantifies over all nonempty finite types , positive definite density matrices on , and functions with a finite Kraus representation , , whose blockwise amplification preserves positive definiteness at every natural ancillary dimension, including zero. Define , , for , and , using real continuous functional calculus. Set
The required inequality, in the extended real numbers, is , where for and for , and the real number is embedded in the extended reals. Thus the left side is if , and otherwise is .
QAlgorithms.Papers.Independent.Intakenext100.P56.RenyiOrder
For a real number , this predicate means and . It places no upper bound on .
QAlgorithms.Papers.Independent.Intakenext100.P56.SandwichedParameterConjecture
This proposition says that for every three nonempty finite types , every positive semidefinite complex matrix on with , and all real numbers , one has , where is defined as follows. Let be obtained by summing diagonal entries over the omitted registers, let with scalar function interpreted by real continuous functional calculus, and let apply the scalar function , for . Then
where , acts as on and as the identity on , , and . Singular density matrices are included; either order may equal , and there is no upper bound on either order. All logarithms are natural logarithms with the total convention .
QAlgorithms.Papers.Independent.Intakenext100.P56.SquashedConvex
For any real , this is the proposition that for every finite nonempty , every family of weights with , and every family of positive semidefinite trace-one matrices on ,
in the extended real numbers. Here is one half the infimum of over all positive semidefinite trace-one extensions on , for every , with . For completeness, let denote real functional calculus with scalar value zero at zero and elsewhere, and . Then ; for , set , , and
where subscripts denote partial traces and . No restriction on is imposed; division by zero and are zero. Zero weights are permitted, and the weighted sum uses extended-real multiplication even when an is infinite.
QAlgorithms.Papers.Independent.Intakenext100.P56.SquashedLOCC
For any real , this is the proposition that for every , every positive semidefinite trace-one matrix on , and every map to matrices on obtainable by finitely nested local Kraus operations with outcome-dependent continuations, one has . Precisely, the allowed maps are generated by identities and by operations , or the corresponding operations on the second party, with and each recursively allowed. Here
is an extended-real infimum. To specify , write for real functional calculus of the function equal to zero at zero and elsewhere, let , and use partial-trace subscripts. Then ; for , putting and , one has
where . The parameter is unrestricted, including and ; divisions by zero and take value zero. All endpoint local dimensions are positive, including dimension one when the corresponding natural parameter is zero.
QAlgorithms.Papers.Independent.Intakenext100.P56.StrictChannel
For finite index types and a function from complex matrices on to complex matrices on , this proposition requires both a finite Kraus representation
for some natural number and matrices with rows indexed by and columns indexed by , and the following strict positivity property: for every natural number and every positive definite matrix on , the matrix with entries , indexed by , is positive definite. Thus the strict positivity requirement holds at every finite ancillary dimension, including , whose matrix index set is empty; neither nor is explicitly required to be nonempty.
QAlgorithms.Papers.Independent.Intakenext100.P56.addAncillas
For arbitrary index types , a complex matrix on , and complex matrices on , respectively, the declaration defines a matrix on by
No finiteness, nonemptiness, positivity, or normalization assumptions are required.
QAlgorithms.Papers.Independent.Intakenext100.P56.applyFirstSuperop
For arbitrary index types , any function from complex matrices on to complex matrices on , and any complex matrix on , this defines the complex matrix on whose entries are
Thus is applied separately to each block determined by . No finiteness, nonemptiness, linearity, positivity, or channel assumption is required.
QAlgorithms.Papers.Independent.Intakenext100.P56.cmiOne
For finite index types and any complex matrix indexed by , define its marginals by , , and . This definition returns
where denotes the real continuous functional calculus. No assumption says that is Hermitian, positive, or trace one, and empty index types are included.
QAlgorithms.Papers.Independent.Intakenext100.P56.cmiReference
For finite types and any complex matrix indexed by , define the partial traces by and . The declaration defines the matrix on the same index type by
No positivity or trace normalization is required, and any of the finite types may be empty.
QAlgorithms.Papers.Independent.Intakenext100.P56.conditionalKet
For a finite index type , an index type , and arbitrary vectors and , this defines the vector by
Neither input vector is assumed normalized, and the result is not normalized by the definition. If is empty, every entry is the empty sum, so the result is zero.
QAlgorithms.Papers.Independent.Intakenext100.P56.conditionedFlag
For arbitrary index types , with decidable equality on , arbitrary real weights , and arbitrary complex matrices on , the declaration defines a matrix on whose entries are
There are no finiteness, nonemptiness, probability, positivity, or trace-normalization hypotheses.
QAlgorithms.Papers.Independent.Intakenext100.P56.differencePetz
For finite index types , arbitrary matrices on , any function from matrices on to matrices on , and any real , define by real continuous functional calculus with scalar function and for , and define
where has entry at and zero elsewhere. At , the declared value is
For , with and , it is
There are no density, positivity, support, channel, or order assumptions. Matrix logarithms use real functional calculus; all scalar operations are total, including , and keeps zero eigenvalues zero.
QAlgorithms.Papers.Independent.Intakenext100.P56.differenceSandwiched
For finite index types , arbitrary matrices on , any function from matrices on to matrices on , and any real , let be real continuous functional calculus with scalar function zero at zero and elsewhere, and let , where is the matrix unit. At , the value is
Otherwise, put
The value is . No normalization, positivity, support, channel, or restriction on is imposed. Functional calculus and scalar powers, logarithms, and divisions are total; in particular is included, division by zero is zero, , and zero spectral values remain zero under .
QAlgorithms.Papers.Independent.Intakenext100.P56.differenceVariance
For finite types with decidable equality, arbitrary complex matrices on , and an arbitrary function from matrices on to matrices on , define by real functional calculus using the natural logarithm. Define here by its entries
where is the matrix with a single in position . Put , , and
The declaration defines the real number
These are matrix squares, without conjugate transposes. Neither density or positivity assumptions on the matrices nor linearity or channel assumptions on are imposed; the index types may be empty.
QAlgorithms.Papers.Independent.Intakenext100.P56.discordRecoveryCost
For finite types with decidable equality, any , any complex matrix on , and any vectors , , put , , and . Define the matrix-valued map
where the square root uses real functional calculus, and define entrywise by , with . The declaration defines the extended-real number
There is no density assumption on , no normalization or POVM assumption on the vectors, and no assertion that is a channel. Empty index types and are allowed; when , the recovered matrix is zero and the cost is .
QAlgorithms.Papers.Independent.Intakenext100.P56.embedAC
For types and any complex matrix indexed by , this defines a complex matrix indexed by through
There are no positivity, normalization, or nonemptiness hypotheses; the same entrywise definition applies when any index type is empty.
QAlgorithms.Papers.Independent.Intakenext100.P56.ensembleAX
For finite index types , any matrix on , and any finite pure decomposition of , consisting of unit vectors and nonnegative weights summing to with , this defines the matrix indexed by whose entries are
Thus each diagonal label block is the weight times the matrix obtained by summing the pure-state matrix over the coordinate; a zero weight gives a zero block.
QAlgorithms.Papers.Independent.Intakenext100.P56.fixedPetzCMI
For finite types with decidable equality, an arbitrary real parameter , and an arbitrary complex matrix on , let , , , and . For any matrix , write for real functional calculus with scalar function at zero and elsewhere, and let . Put
The declaration defines
There are no density, positivity, invertibility, or parameter-range assumptions. In particular, assigns at zero and at nonzero spectral values; real logarithms and division use their total conventions, including and division by zero equal to zero, so the value at is . Empty finite index types are allowed.
QAlgorithms.Papers.Independent.Intakenext100.P56.fixedSandwichedCMI
For finite types with decidable equality, an arbitrary real parameter , and an arbitrary complex matrix on , let , , , and . Write for real functional calculus with scalar value at zero and elsewhere, and define . Set
The declaration defines
No density, positivity, invertibility, or restriction on is assumed, and empty index types are included. The zero exponent still assigns zero at zero spectral values. All divisions, including those involving or , are total with division by zero equal to zero, and ; in particular, the value at is .
QAlgorithms.Papers.Independent.Intakenext100.P56.flagBoth
For types , any function , and any family of complex matrices indexed by , this defines the matrix on by
Thus an entry can be nonzero only when all four flag labels coincide. There are no positivity, normalization, or nonemptiness hypotheses.
QAlgorithms.Papers.Independent.Intakenext100.P56.flagLeft
For types , any real-valued function , and any family of complex matrices indexed by , this defines the matrix on whose entries are
No hypothesis requires nonnegative or normalized weights, density matrices, or nonempty index types.
QAlgorithms.Papers.Independent.Intakenext100.P56.flagRight
For types , any real-valued function , and any family of complex matrices indexed by , this defines the matrix on by
The definition does not require probability weights or density matrices and includes empty index types.
QAlgorithms.Papers.Independent.Intakenext100.P56.formationObjective
For finite index types with decidable equality, any real , any matrix on , and any finite pure decomposition with nonnegative weights summing to and unit vectors , this defines
Here is continuous functional calculus for the function equal to zero at zero and to the real power elsewhere, and the power outside the trace is also a real power. There is no separate branch at , so the displayed definition gives zero there because division by zero is zero. The definition also includes and negative ; real logarithms are total, with .
QAlgorithms.Papers.Independent.Intakenext100.P56.jointRecovered
For a finite index type with decidable equality and arbitrary complex matrices indexed by , define to be the real functional calculus of for the scalar function that equals at and elsewhere. The declaration defines
Thus the inverse square root assigns to zero spectral values. No positivity, normalization, invertibility, or relationship among the three matrices is assumed, and may be empty.
QAlgorithms.Papers.Independent.Intakenext100.P56.maxEntangledKet
For index types , any natural number , and arbitrary complex matrices with rows indexed by and columns and with rows indexed by and columns, this defines the vector by
Neither matrix is assumed to be an isometry or unitary, no conjugation occurs in the product, and no normalization of is required. The case is included and gives the zero vector, using the empty sum and the convention .
QAlgorithms.Papers.Independent.Intakenext100.P56.measurementOutput
For finite index types with decidable equality, any natural number , arbitrary matrices on for , and any matrix on , this defines a matrix indexed by . Writing for continuous functional calculus of with the real square-root function, its entries are
There is no requirement that , so entries connecting different matching label pairs are included. No positivity, completeness, or normalization assumptions are imposed on or ; is allowed and yields a matrix on an empty index type.
QAlgorithms.Papers.Independent.Intakenext100.P56.measurementRecovery
For a finite index type , any natural number , arbitrary complex matrices on , and arbitrary vectors for , this defines a function from matrices on to matrices on . Put , , and , where the square root means real continuous functional calculus. Its value on any complex matrix is
The multiplying trace is complex. Neither input matrix is assumed to be a density matrix, and the vectors need not be normalized or form a measurement. In particular, the fallback branch includes negative as well as zero , and gives the zero function.
QAlgorithms.Papers.Independent.Intakenext100.P56.pureDiscordObjective
For finite index types , a real number , a natural number , an arbitrary vector , and arbitrary vectors indexed by , define , , and by , , and . Write for the real continuous functional calculus of with scalar function when and otherwise; in particular, zero eigenvalues remain zero even when . The declared real-valued function is
There is no normalization assumption on or the , no measurement completeness assumption, and no restriction on . Powers, logarithms, and divisions use their total real definitions, including and ; the function equals zero when , when , or when .
QAlgorithms.Papers.Independent.Intakenext100.P56.rankOneDiscord
For finite index types with decidable equality, any real , and any matrix on , this defines the extended-real infimum of over all positive natural numbers and vectors whose positive semidefinite matrices satisfy ; the vectors may be zero and need not be unit vectors. Let by continuous functional calculus, , and , and form
Write , , and , where partial traces sum matching traced coordinates. Define
For , let act on as and identically on , and let ; then
Here , and is continuous functional calculus for the function equal to zero at zero and to elsewhere. No density assumption on or restriction on is imposed, and total real division and logarithms are used, including and . The empty infimum is , and an unbounded-below collection has infimum .
QAlgorithms.Papers.Independent.Intakenext100.P56.relativeEntropyDifference
For finite index types , arbitrary complex matrices on , and any function from matrices on to matrices on , this defines
All matrix logarithms use real continuous functional calculus with the total real logarithm, so zero eigenvalues contribute , and the logarithm of a non-Hermitian matrix is zero under this calculus. No density, positivity, support, linearity, or channel hypotheses are imposed; the result is always real-valued, including for empty index types.
QAlgorithms.Papers.Independent.Intakenext100.P56.relativeReal
For a finite index type and arbitrary complex matrices on , this defines the real number
where each matrix logarithm is the real continuous functional calculus of the total real logarithm, including . There are no density, positivity, nonzero, or support-inclusion assumptions and no infinite-value branch. In particular, singular matrices and an empty index type are allowed; on a non-Hermitian matrix this functional-calculus logarithm is zero.
QAlgorithms.Papers.Independent.Intakenext100.P56.renyiCMI
For finite index types , every real , and any complex matrix indexed by , write , , and , with each partial trace obtained by summing equal row and column indices of the discarded register. Put , so uses zero at a zero eigenvalue rather than one, and put . The defined value is
where equals when and zero otherwise, and . No order restriction, density assumption, or nonemptiness assumption is imposed. All operations are total: real division by zero and equal zero; in particular the definition includes , where its value is zero.
QAlgorithms.Papers.Independent.Intakenext100.P56.renyiConditionalEntropy
For finite index types with decidable equality, any real , and any complex matrix indexed by , this defines the real number
where , with , and means continuous functional calculus applied to the function that is at and the real power elsewhere. No positivity, trace, or restriction on is assumed. In particular, is included, division by zero is interpreted as zero, and the real logarithm is the total real logarithm, with .
QAlgorithms.Papers.Independent.Intakenext100.P56.renyiDiscord
For finite index types with decidable equality, any real , and any matrix on , this defines the extended-real infimum of over every positive natural number and family of positive semidefinite matrices on satisfying . Put , , and by continuous functional calculus; the matrix on has entries
Using partial traces to denote sums over the indicated coordinates, write , , and . Then
whereas, for , set , embedded so it acts on the coordinates, and ; the value is
Here , and applies by continuous functional calculus the function equal to zero at zero and to elsewhere. No density assumption on or restriction on is imposed; divisions and logarithms are total, including and . The infimum is if its defining collection is empty and may be if that collection is unbounded below.
QAlgorithms.Papers.Independent.Intakenext100.P56.renyiEntropySupportNats
For a finite index type , any complex matrix indexed by , and every real , this defines
Here is the real continuous functional calculus. No positivity, Hermiticity, normalization, positive-order, or nonemptiness hypothesis is imposed. In particular the zero-order branch uses zero on the zero spectrum, and a zero trace inside the logarithm is evaluated using .
QAlgorithms.Papers.Independent.Intakenext100.P56.renyiFormation
For finite index types with decidable equality, any real , and any matrix on , this defines an extended real number as the infimum over all finite families of unit vectors and weights satisfying and . For each such family form
The value included in the infimum is when , and otherwise is
Here , and applies by continuous functional calculus the function equal to at zero and to the real power elsewhere. Each real value is embedded into the extended reals before taking the infimum. An empty collection of decompositions gives ; an unbounded-below collection gives . No density-matrix assumption or restriction on is required, and real division and logarithms retain their total-function conventions, including and .
QAlgorithms.Papers.Independent.Intakenext100.P56.renyiSquashed
For finite index types , any real , and any complex matrix indexed by , this defines the extended-real value
where is indexed by . For any such three-register matrix , let , , , , and . Here ; for ,
with acting as on and the identity on , and . The auxiliary dimension includes one, since is allowed, but never zero. There is no hypothesis that is a density matrix; if no qualifying extension exists, the infimum and the defined value are . Real divisions and logarithms use their total conventions, including and .
QAlgorithms.Papers.Independent.Intakenext100.P56.sandwichedCMI
For finite index types , an arbitrary complex matrix indexed by , and any real , let , , and . Define , where is applied by real continuous functional calculus, and let apply the scalar function that is zero at zero and elsewhere. At , the declared value is . Otherwise, set
and the value is
No density, positivity, Hermiticity, nonempty-index, or order restriction is imposed. The functional calculus is total, returning zero for non-Hermitian matrices here; real powers, divisions, and logarithms are also total, so , singular matrices, and zero logarithm arguments remain included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.