Definitions for Weak locking capacity of quantum channels can be much larger than private capacity
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P63The objects the formalized statements of Weak locking capacity of quantum channels can be much larger than private capacity (arXiv:1403.6361) are stated in. Each was checked against the paper by a blind read-back and a moderator.
jointConditionalBits: PDF p.5: H(I|J); zero-probability columns contribute zero.measuredEnsembleJoint: PDF p.5: the joint law p_i Tr(rho_i Q_j).ensembleConditionalBits: PDF p.8: conditional Shannon entropy of an ensemble measured with Q.accessibleEquivocation: PDF p.5: optimization over every finite POVM, including joint measurements. For normalized data the set is nonempty and contained in [0,log |I|].optimizedEquivocation: PDF pp.5,7: optimization over all priors, including zero weights.measurementWorstPrior: PDF p.8: opposite optimization order in the minimax formula.taggedEffects: PDF p.8: random measurement mixing RETAINS the branch label.averageState: PDF pp.7,9: ensemble average state.supportInvSqrt: PDF pp.7,9: support inverse square root, with zero eigenvalues mapped to zero.associatedEffects: PDF pp.7,9: associated effects, summing to the average state's support projector.povmMinimumShannon: PDF p.8: minimum output entropy of an ordinary normalized POVM.associatedMinimum: PDF pp.7,9–10: associated POVM minimum on supp(rho-bar), excluding the kernel. No invertibility hypothesis or arbitrary kernel completion is introduced.stateMinBits: PDF p.9, Definition 7: min-entropy of a normalized density.traceSmoothStateMinBits: PDF p.9: smoothing over NORMALIZED states at HALF trace norm distance.conditionalMinBits: PDF p.9: conditional min-entropy, optimizing a normalized conditioning density. The accepted extended exponent optimization is finite on normalized states; toReal keeps its value. Zero/subnormalized off-domain values are not asserted here.marginalMinEntropy: PDF p.9: the actual marginal reference, with its support inverse.traceSmoothConditionalMinBits: PDF p.9: normalized bipartite smoothing, without fixing the marginal.qcBranchDensity: PDF p.9: qc-state with the classical register SECOND.classicalJoint: PDF p.9: a classical joint law represented by its diagonal density.tensorEffects: PDF p.8: product measurement on arbitrary, possibly entangled, input states.measuredState: PDF p.8: classical output density of a product measurement.iidJoint: PDF p.9: IID labels, with an unrestricted collective measurement on E^n.environment: PDF p.2: environment's partial trace of the SAME dilation.KeyedBlockCode: PDF pp.2–3: keyed code, normalized mixed encodings and a POVM for each key. Both message and independent key are uniform. The key count is positive, and each accepted branch enforces positive message count, density signals and a POVM.keyedAverageError: PDF p.2, (1): decoding error averaged over messages and independent secret key.averagedSignal: PDF p.3: Eve sees key-averaged signal states.WeakSecure: PDF p.2, (3): full l1 norm; EVERY POVM has ONE message-independent law.PrivateSecure: PDF p.2, (2): full trace norm, with NO one-half factor.messageRateBits: PDF p.3: rate per channel use, indexing positive lengths by n+1.keyRate: PDF p.3: secret bits per channel use.KeyedRateAtLeast: PDF p.3: limiting inferior rate at least R, allowing arbitrary rate slack.ReliableKeyedSequence: PDF p.3: reliability and a sublinear preshared uniform secret.KeyedAchievable: PDF p.3: operational nonnegative achievable rates for the selected security criterion.keyedCapacity: PDF p.3: supremum of achievable nonnegative rates. For valid finite channels it is a nonempty bounded set; no feedback or free discussion is present in these codes.CqComplement: PDF p.5, (5): cq complement in the specified computational input basis.twoBasisVector: PDF p.11: computational and discrete Fourier basis vectors.twoBasisDilation: PDF p.11, Example 12: 2d-dimensional input and receiver, d-dimensional environment.upperInformation: PDF pp.5,14, (8): L_W^(u), over arbitrary finite mixed input ensembles. I_acc = H(p) - S_acc; this uses the same measurement optimization as above.activatedReceiver: PDF p.15: N tensor id_k, retaining off-diagonal auxiliary blocks.activatedEnvironment: PDF p.15: the noiseless factor leaks nothing; Eve receives only N^c.activatedCapacity: PDF p.15: amortized capacity, with positive noiseless dimension and log k charge.regularizedUpper: PDF p.15: regularized upper information, over positive block lengths.arimotoOutput: PDF p.14: Arimoto conditional alpha entropy of measured ensemble branches.constrainedRenyi: PDF p.14: constrained minimum over all finite decompositions with average sigma.ConstrainedRenyiAdditivity: PDF p.14, (16): the GLOBAL conjecture, not an asserted fact or scalar placeholder. Fin enumerations cover every finite-dimensional system and outcome space.IIDUncertainty: PDF p.14, (17): global uniform eventual IID uncertainty, with arbitrary rate slack. The threshold precedes Eve's collective POVM. Arbitrarily small fixed epsilon permits vanishing errors by diagonal choice. This predicate is a conjectural premise.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Channel
import Definitions.Def_QAlgorithms_Defs_MatrixDistances
import Definitions.Def_QAlgorithms_Defs_Ensemble
import Definitions.Def_QAlgorithms_Defs_Learning
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P04
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P27
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P63
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P67
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P71
import Definitions.Def_QAlgorithms_Papers_Independent_Bridge50_P47
/-! Winter, arXiv:1403.6361v3. Imported accepted primitives and paper-local operational
and entropy interfaces. Names distinguish Winter's keyed and normalized-trace conventions.
All logarithms are binary. Compilation is pending the batch mechanical handoff.
The three plan deferrals are documented in HARD.md. -/
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P63
open QAlgorithms Filter
open QAlgorithms.Papers.Independent.Information100.P63 (Mat)
open QAlgorithms.Papers.Independent.Information100.P04 (Measurement)
open QAlgorithms.Papers.Independent.Information100.P27 (shannon labelInformation)
open QAlgorithms.Papers.Independent.Information100.P71 (channelPower dilationMap SupportIncluded)
open QAlgorithms.Papers.Independent.Bridge50.P47 (SymmetricIndex universalSymmetricDilation)
open QAlgorithms.Learning (IsDistribution)
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.5: H(I|J); zero-probability columns contribute zero. -/
def jointConditionalBits {I J : Type} [Fintype I] [Fintype J] (P : I → J → ℝ) : ℝ :=
-∑ j, ∑ i, P i j * Real.logb 2 (P i j / ∑ k, P k j)
/-- PDF p.5: the joint law p_i Tr(rho_i Q_j). -/
def measuredEnsembleJoint {I E J : Type} [Fintype E] (p : I → ℝ) (rho : I → Mat E)
(Q : J → Mat E) : I → J → ℝ :=
fun i j => p i * effectProb (Q j) (rho i)
/-- PDF p.8: conditional Shannon entropy of an ensemble measured with Q. -/
def ensembleConditionalBits {I E J : Type} [Fintype I] [Fintype E] [Fintype J]
(p : I → ℝ) (rho : I → Mat E) (Q : J → Mat E) : ℝ :=
jointConditionalBits (measuredEnsembleJoint p rho Q)
/-- PDF p.5: optimization over every finite POVM, including joint measurements.
For normalized data the set is nonempty and contained in [0,log |I|]. -/
def accessibleEquivocation {I E : Type} [Fintype I] [Fintype E] [DecidableEq E]
(p : I → ℝ) (rho : I → Mat E) : ℝ :=
sInf {h | ∃ Q : Measurement E, h = ensembleConditionalBits p rho Q.effect}
/-- PDF pp.5,7: optimization over all priors, including zero weights. -/
def optimizedEquivocation {I E : Type} [Fintype I] [Fintype E] [DecidableEq E]
(rho : I → Mat E) : ℝ :=
sSup {h | ∃ p : I → ℝ, IsDistribution p ∧ h = accessibleEquivocation p rho}
/-- PDF p.8: opposite optimization order in the minimax formula. -/
def measurementWorstPrior {I E : Type} [Fintype I] [Fintype E] [DecidableEq E]
(rho : I → Mat E) (Q : Measurement E) : ℝ :=
sSup {h | ∃ p : I → ℝ, IsDistribution p ∧ h = ensembleConditionalBits p rho Q.effect}
/-- PDF p.8: random measurement mixing RETAINS the branch label. -/
def taggedEffects {E J K : Type} (lambda : ℝ) (Q : J → Mat E) (R : K → Mat E) :
J ⊕ K → Mat E :=
Sum.elim (fun j => (lambda : ℂ) • Q j) (fun k => ((1 - lambda : ℝ) : ℂ) • R k)
/-- PDF pp.7,9: ensemble average state. -/
def averageState {I E : Type} [Fintype I] (p : I → ℝ) (rho : I → Mat E) : Mat E :=
∑ i, (p i : ℂ) • rho i
/-- PDF pp.7,9: support inverse square root, with zero eigenvalues mapped to zero. -/
def supportInvSqrt {E : Type} [Fintype E] [DecidableEq E] (rho : Mat E) : Mat E :=
cfc (fun x : ℝ => (Real.sqrt x)⁻¹) rho
/-- PDF pp.7,9: associated effects, summing to the average state's support projector. -/
def associatedEffects {I E : Type} [Fintype I] [Fintype E] [DecidableEq E]
(p : I → ℝ) (rho : I → Mat E) (i : I) : Mat E :=
supportInvSqrt (averageState p rho) * ((p i : ℂ) • rho i) *
supportInvSqrt (averageState p rho)
/-- PDF p.8: minimum output entropy of an ordinary normalized POVM. -/
def povmMinimumShannon {E I : Type} [Fintype E] [Fintype I] (M : I → Mat E) : ℝ :=
sInf {h | ∃ psi : Mat E, IsDensityMatrix psi ∧
h = shannon (fun i => effectProb (M i) psi)}
/-- PDF pp.7,9–10: associated POVM minimum on supp(rho-bar), excluding the kernel.
No invertibility hypothesis or arbitrary kernel completion is introduced. -/
def associatedMinimum {I E : Type} [Fintype I] [Fintype E] [DecidableEq E]
(p : I → ℝ) (rho : I → Mat E) : ℝ :=
sInf {h | ∃ psi : Mat E, IsDensityMatrix psi ∧ SupportIncluded psi (averageState p rho) ∧
h = shannon (fun i => effectProb (associatedEffects p rho i) psi)}
/-- PDF p.9, Definition 7: min-entropy of a normalized density. -/
def stateMinBits {A : Type} [Fintype A] [DecidableEq A] (rho : Mat A) : ℝ :=
-Real.logb 2 (specNorm rho)
/-- PDF p.9: smoothing over NORMALIZED states at HALF trace norm distance. -/
def traceSmoothStateMinBits {A : Type} [Fintype A] [DecidableEq A]
(eps : ℝ) (rho : Mat A) : ℝ :=
sSup {h | ∃ r : Mat A, IsDensityMatrix r ∧ traceNorm (rho - r) / 2 ≤ eps ∧
h = stateMinBits r}
/-- PDF p.9: conditional min-entropy, optimizing a normalized conditioning density.
The accepted extended exponent optimization is finite on normalized states; toReal
keeps its value. Zero/subnormalized off-domain values are not asserted here. -/
def conditionalMinBits {A B : Type} [Fintype A] [DecidableEq A]
[Fintype B] [DecidableEq B] (rho : Mat (A × B)) : ℝ :=
(QAlgorithms.Papers.Independent.Information100.P67.conditionalMinEntropy rho).toReal
/-- PDF p.9: the actual marginal reference, with its support inverse. -/
def marginalMinEntropy {A B : Type} [Fintype A] [DecidableEq A]
[Fintype B] [DecidableEq B] (rho : Mat (A × B)) : ℝ :=
let S := Matrix.kronecker (1 : Mat A) (supportInvSqrt (traceLeft rho));
-Real.logb 2 (specNorm (S * rho * S))
/-- PDF p.9: normalized bipartite smoothing, without fixing the marginal. -/
def traceSmoothConditionalMinBits {A B : Type} [Fintype A] [DecidableEq A]
[Fintype B] [DecidableEq B] (eps : ℝ) (rho : Mat (A × B)) : ℝ :=
sSup {h | ∃ r : Mat (A × B), IsDensityMatrix r ∧ traceNorm (rho - r) / 2 ≤ eps ∧
h = conditionalMinBits r}
/-- PDF p.9: qc-state with the classical register SECOND. -/
def qcBranchDensity {A J : Type} [DecidableEq J] (q : J → ℝ) (rho : J → Mat A) : Mat (A × J) :=
fun x y => if x.2 = y.2 then (q x.2 : ℂ) * rho x.2 x.1 y.1 else 0
/-- PDF p.9: a classical joint law represented by its diagonal density. -/
def classicalJoint {I J : Type} [DecidableEq I] [DecidableEq J]
(P : I → J → ℝ) : Mat (I × J) :=
Matrix.diagonal (fun x => (P x.1 x.2 : ℂ))
/-- PDF p.8: product measurement on arbitrary, possibly entangled, input states. -/
def tensorEffects {E I : Type} (M : I → Mat E) (n : ℕ) :
(Fin n → I) → Mat (Fin n → E) :=
fun i x y => ∏ t, M (i t) (x t) (y t)
/-- PDF p.8: classical output density of a product measurement. -/
def measuredState {E I : Type} [Fintype E] [DecidableEq I]
(M : I → Mat E) (n : ℕ) (psi : Mat (Fin n → E)) : Mat (Fin n → I) :=
Matrix.diagonal (fun i => (effectProb (tensorEffects M n i) psi : ℂ))
/-- PDF p.9: IID labels, with an unrestricted collective measurement on E^n. -/
def iidJoint {I E : Type} [Fintype E] [DecidableEq E]
(p : I → ℝ) (rho : I → Mat E) (n : ℕ) (Q : Measurement (Fin n → E)) :
(Fin n → I) → Fin Q.outcomes → ℝ :=
fun i j => (∏ t, p (i t)) * effectProb (Q.effect j) (fun x y => ∏ t, rho (i t) (x t) (y t))
/-- PDF p.2: environment's partial trace of the SAME dilation. -/
def environment {A B E : Type} [Fintype A] [Fintype B]
(V : Matrix (B × E) A ℂ) : Superop A E :=
fun rho => traceLeft (V * rho * Vᴴ)
/-- PDF pp.2–3: keyed code, normalized mixed encodings and a POVM for each key.
Both message and independent key are uniform. The key count is positive, and
each accepted branch enforces positive message count, density signals and a POVM. -/
structure KeyedBlockCode (A B : Type) [Fintype A] [Fintype B] [DecidableEq B] (n : ℕ) where
messages : ℕ
keys : ℕ
keys_pos : 0 < keys
branch : Fin keys →
QAlgorithms.Papers.Independent.Information100.P63.Code (Fin n → A) (Fin n → B) messages
/-- PDF p.2, (1): decoding error averaged over messages and independent secret key. -/
def keyedAverageError {A B : Type} [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
(N : Superop A B) {n : ℕ} (C : KeyedBlockCode A B n) : ℝ :=
((C.keys : ℝ) * C.messages)⁻¹ *
∑ k, ∑ m, (1 - effectProb ((C.branch k).measurement m) (channelPower N n ((C.branch k).word m)))
/-- PDF p.3: Eve sees key-averaged signal states. -/
def averagedSignal {A B : Type} [Fintype A] [Fintype B] [DecidableEq B]
{n : ℕ} (C : KeyedBlockCode A B n) (m : Fin C.messages) : Mat (Fin n → A) :=
((C.keys : ℂ)⁻¹) • ∑ k, (C.branch k).word m
/-- PDF p.2, (3): full l1 norm; EVERY POVM has ONE message-independent law. -/
def WeakSecure {A B E : Type} [Fintype A] [DecidableEq A] [Fintype B]
[DecidableEq B] [Fintype E] [DecidableEq E]
(Nc : Superop A E) {n : ℕ} (C : KeyedBlockCode A B n) (delta : ℝ) : Prop :=
∀ Q : Measurement (Fin n → E), ∃ omega : Fin Q.outcomes → ℝ, IsDistribution omega ∧
(C.messages : ℝ)⁻¹ * ∑ m, ∑ j,
|effectProb (Q.effect j) (channelPower Nc n (averagedSignal C m)) - omega j| ≤ delta
/-- PDF p.2, (2): full trace norm, with NO one-half factor. -/
def PrivateSecure {A B E : Type} [Fintype A] [DecidableEq A] [Fintype B]
[DecidableEq B] [Fintype E] [DecidableEq E]
(Nc : Superop A E) {n : ℕ} (C : KeyedBlockCode A B n) (delta : ℝ) : Prop :=
∃ omega : Mat (Fin n → E), IsDensityMatrix omega ∧
(C.messages : ℝ)⁻¹ * ∑ m,
traceNorm (channelPower Nc n (averagedSignal C m) - omega) ≤ delta
/-- PDF p.3: rate per channel use, indexing positive lengths by n+1. -/
def messageRateBits {A B : Type} [Fintype A] [Fintype B] [DecidableEq B]
{n : ℕ} (C : KeyedBlockCode A B (n + 1)) : ℝ :=
Real.logb 2 C.messages / (n + 1)
/-- PDF p.3: secret bits per channel use. -/
def keyRate {A B : Type} [Fintype A] [Fintype B] [DecidableEq B]
{n : ℕ} (C : KeyedBlockCode A B (n + 1)) : ℝ :=
Real.logb 2 C.keys / (n + 1)
/-- PDF p.3: limiting inferior rate at least R, allowing arbitrary rate slack. -/
def KeyedRateAtLeast {A B : Type} [Fintype A] [Fintype B] [DecidableEq B]
(C : (n : ℕ) → KeyedBlockCode A B (n + 1)) (R : ℝ) : Prop :=
∀ slack > (0 : ℝ), ∀ᶠ n in atTop, R - slack ≤ messageRateBits (C n)
/-- PDF p.3: reliability and a sublinear preshared uniform secret. -/
def ReliableKeyedSequence {A B : Type} [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
(N : Superop A B) (C : (n : ℕ) → KeyedBlockCode A B (n + 1)) : Prop :=
Tendsto (fun n => keyRate (C n)) atTop (nhds 0) ∧
Tendsto (fun n => keyedAverageError N (C n)) atTop (nhds 0)
/-- PDF p.3: operational nonnegative achievable rates for the selected security criterion. -/
def KeyedAchievable {A B E : Type} [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
[Fintype E] [DecidableEq E] (N : Superop A B) (Nc : Superop A E)
(weak : Bool) (R : ℝ) : Prop :=
0 ≤ R ∧ ∃ C : (n : ℕ) → KeyedBlockCode A B (n + 1), ReliableKeyedSequence N C ∧ KeyedRateAtLeast C R ∧
∀ eps > (0 : ℝ), ∀ᶠ n in atTop,
if weak then WeakSecure Nc (C n) eps else PrivateSecure Nc (C n) eps
/-- PDF p.3: supremum of achievable nonnegative rates. For valid finite channels it
is a nonempty bounded set; no feedback or free discussion is present in these codes. -/
def keyedCapacity {A B E : Type} [Fintype A] [DecidableEq A] [Fintype B] [DecidableEq B]
[Fintype E] [DecidableEq E] (N : Superop A B) (Nc : Superop A E) (weak : Bool) : ℝ :=
sSup {R | KeyedAchievable N Nc weak R}
/-- PDF p.5, (5): cq complement in the specified computational input basis. -/
def CqComplement {A E : Type} [Fintype A] [DecidableEq A] [Fintype E]
(Nc : Superop A E) (rho : A → Mat E) : Prop :=
(∀ i, IsDensityMatrix (rho i)) ∧
∀ i j, Nc (Matrix.single i j 1) = if i = j then rho i else 0
/-- PDF p.11: computational and discrete Fourier basis vectors. -/
def twoBasisVector (d : ℕ) (b : Bool) (i x : Fin d) : ℂ :=
if b then (Real.sqrt d : ℂ)⁻¹ *
Complex.exp (2 * (Real.pi : ℂ) * Complex.I * (i.val : ℂ) * (x.val : ℂ) / (d : ℂ))
else if x = i then 1 else 0
/-- PDF p.11, Example 12: 2d-dimensional input and receiver, d-dimensional environment. -/
def twoBasisDilation (d : ℕ) : Matrix ((Bool × Fin d) × Fin d) (Bool × Fin d) ℂ :=
fun out inp => if out.1 = inp then twoBasisVector d inp.1 inp.2 out.2 else 0
/-- PDF pp.5,14, (8): L_W^(u), over arbitrary finite mixed input ensembles.
I_acc = H(p) - S_acc; this uses the same measurement optimization as above. -/
def upperInformation {A B E : Type} [Fintype A] [Fintype B] [DecidableEq B]
[Fintype E] [DecidableEq E] (N : Superop A B) (Nc : Superop A E) : ℝ :=
sSup {h | ∃ m : ℕ, ∃ p : Fin m → ℝ, ∃ rho : Fin m → Mat A,
IsDistribution p ∧ (∀ i, IsDensityMatrix (rho i)) ∧
h = labelInformation p (fun i => N (rho i)) - shannon p +
accessibleEquivocation p (fun i => Nc (rho i))}
/-- PDF p.15: N tensor id_k, retaining off-diagonal auxiliary blocks. -/
def activatedReceiver {A B : Type} (N : Superop A B) (k : ℕ) :
Superop (A × Fin k) (B × Fin k) :=
fun rho x y => N (fun a a' => rho (a, x.2) (a', y.2)) x.1 y.1
/-- PDF p.15: the noiseless factor leaks nothing; Eve receives only N^c. -/
def activatedEnvironment {A E : Type} (Nc : Superop A E) (k : ℕ) :
Superop (A × Fin k) E :=
fun rho => Nc (traceRight rho)
/-- PDF p.15: amortized capacity, with positive noiseless dimension and log k charge. -/
def activatedCapacity {A B E : Type} [Fintype A] [DecidableEq A]
[Fintype B] [DecidableEq B] [Fintype E] [DecidableEq E]
(N : Superop A B) (Nc : Superop A E) : ℝ :=
sSup {h | ∃ k : ℕ, 0 < k ∧ h =
keyedCapacity (activatedReceiver N k) (activatedEnvironment Nc k) true - Real.logb 2 k}
/-- PDF p.15: regularized upper information, over positive block lengths. -/
def regularizedUpper {A B E : Type} [Fintype A] [DecidableEq A]
[Fintype B] [DecidableEq B] [Fintype E] [DecidableEq E]
(N : Superop A B) (Nc : Superop A E) : ℝ :=
sSup {h | ∃ n : ℕ, 0 < n ∧ h = upperInformation (channelPower N n) (channelPower Nc n) / n}
/-- PDF p.14: Arimoto conditional alpha entropy of measured ensemble branches. -/
def arimotoOutput {E I J : Type} [Fintype E] [Fintype I] [Fintype J]
(alpha : ℝ) (M : I → Mat E) (q : J → ℝ) (psi : J → Mat E) : ℝ :=
-alpha / (alpha - 1) * Real.logb 2
(∑ j, q j * (∑ i, (effectProb (M i) (psi j)) ^ alpha) ^ (1 / alpha))
/-- PDF p.14: constrained minimum over all finite decompositions with average sigma. -/
def constrainedRenyi {E I : Type} [Fintype E] [Fintype I]
(alpha : ℝ) (M : I → Mat E) (sigma : Mat E) : ℝ :=
sInf {h | ∃ r : ℕ, ∃ q : Fin r → ℝ, ∃ psi : Fin r → Mat E,
IsDistribution q ∧ (∀ j, IsDensityMatrix (psi j)) ∧ averageState q psi = sigma ∧
h = arimotoOutput alpha M q psi}
/-- PDF p.14, (16): the GLOBAL conjecture, not an asserted fact or scalar placeholder.
Fin enumerations cover every finite-dimensional system and outcome space. -/
def ConstrainedRenyiAdditivity : Prop :=
∀ a b i j : ℕ, 0 < a → 0 < b →
∀ M : Fin i → Mat (Fin a), IsPOVM M →
∀ R : Fin j → Mat (Fin b), IsPOVM R →
∀ sigma : Mat (Fin a), IsDensityMatrix sigma →
∀ tau : Mat (Fin b), IsDensityMatrix tau → ∀ alpha : ℝ, 1 < alpha →
constrainedRenyi alpha (fun x : Fin i × Fin j => Matrix.kronecker (M x.1) (R x.2))
(Matrix.kronecker sigma tau) =
constrainedRenyi alpha M sigma + constrainedRenyi alpha R tau
/-- PDF p.14, (17): global uniform eventual IID uncertainty, with arbitrary rate slack.
The threshold precedes Eve's collective POVM. Arbitrarily small fixed epsilon permits
vanishing errors by diagonal choice. This predicate is a conjectural premise. -/
def IIDUncertainty : Prop :=
∀ a e : ℕ, 0 < a → 0 < e → ∀ p : Fin a → ℝ, IsDistribution p →
∀ rho : Fin a → Mat (Fin e), (∀ i, IsDensityMatrix (rho i)) →
∀ eps : ℝ, 0 < eps → eps < 1 → ∀ slack : ℝ, 0 < slack →
∃ n0 : ℕ, ∀ n ≥ n0, ∀ Q : Measurement (Fin n → Fin e),
(n : ℝ) * (accessibleEquivocation p rho - slack) ≤
traceSmoothConditionalMinBits eps (classicalJoint (iidJoint p rho n Q))
/-! Sanity examples pin deterministic entropy, a discarded tagged branch,
the empty tensor unit, and the diagonal symmetric normalization. -/
example : IsDistribution (fun _ : Fin 1 => (1 : ℝ)) := by
constructor
· intro i; norm_num
· simp
example : shannon (fun _ : Fin 1 => (1 : ℝ)) = 0 := by
simp [shannon]
example {E J K : Type} (Q : J → Mat E) (R : K → Mat E) (k : K) :
taggedEffects 1 Q R (Sum.inr k) = 0 := by
simp [taggedEffects]
example {E I : Type} (M : I → Mat E) (i : Fin 0 → I) (x y : Fin 0 → E) :
tensorEffects M 0 i x y = 1 := by
simp [tensorEffects]
example (d : ℕ) (i : Fin d) : universalSymmetricDilation d (i, i) ⟨(i, i), le_refl i⟩ = 1 := by
simp [universalSymmetricDilation]
example {A B : Type} [Fintype A] [Fintype B] [DecidableEq B]
(n : ℕ) (C : KeyedBlockCode A B (n + 1)) (hm : C.messages = 1) : messageRateBits C = 0 := by
simp [messageRateBits, hm]
/-- Reusing accepted code branches retains positive message count for every key. -/
example {A B : Type} [Fintype A] [Fintype B] [DecidableEq B]
(n : ℕ) (C : KeyedBlockCode A B n) : 0 < C.messages := by
exact (C.branch ⟨0, C.keys_pos⟩).positive
example {E : Type} [Fintype E] [DecidableEq E] :
IsPOVM (fun _ : Fin 1 => (1 : Mat E)) := by
exact ⟨fun _ => Matrix.PosSemidef.one, by simp⟩
example {E : Type} [Fintype E] [DecidableEq E] : supportInvSqrt (0 : Mat E) = 0 := by
simp [supportInvSqrt, cfc_zero]
example {I E : Type} [Fintype I] [Fintype E] [DecidableEq E]
(p : I → ℝ) (rho : I → Mat E) (i : I) (hi : p i = 0) :
associatedEffects p rho i = 0 := by
simp [associatedEffects, hi]
example {A J : Type} [DecidableEq J] (q : J → ℝ) (rho : J → Mat A)
(a b : A) (j k : J) (hjk : j ≠ k) : qcBranchDensity q rho (a, j) (b, k) = 0 := by
simp [qcBranchDensity, hjk]
example {A : Type} (k : ℕ) (rho : Mat (A × Fin k)) :
activatedReceiver (fun X : Mat A => X) k rho = rho := by
ext x y
simp [activatedReceiver]
example (alpha : ℝ) :
arimotoOutput alpha (fun _ : Fin 1 => (1 : Mat (Fin 1)))
(fun _ : Fin 1 => (1 : ℝ)) (fun _ : Fin 1 => (1 : Mat (Fin 1))) = 0 := by
simp [arimotoOutput, effectProb, Matrix.trace]
end QAlgorithms.Papers.Independent.Intakenext100.P63
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P63.ConstrainedRenyiAdditivity
This proposition asserts that for every pair of positive natural numbers , every pair of natural numbers , every family of positive semidefinite complex matrices summing to , every family of positive semidefinite complex matrices summing to , every positive semidefinite trace-one matrices on and on , and every real ,
For any finite family of matrices and matrix , the symbol here means the real infimum, over all natural numbers , probability weights summing to , and positive semidefinite trace-one matrices satisfying , of
The tensor product has entries . The outcome counts include zero, although a zero-outcome family cannot sum to identity in either positive dimension, so those hypotheses are then impossible. Zero component weights are allowed, and all powers and logarithms use their total real definitions.
QAlgorithms.Papers.Independent.Intakenext100.P63.CqComplement
For finite types , with decidable equality on , an arbitrary map from complex matrices indexed by to complex matrices indexed by , and a family of complex matrices on , this property means that every is positive semidefinite with trace , and
where has its sole nonzero entry, equal to , at . No channel or linearity assumption is imposed on , so the condition directly specifies its values only on these matrix units. Empty types are permitted: if is empty, both universally quantified conditions are vacuous.
QAlgorithms.Papers.Independent.Intakenext100.P63.IIDUncertainty
This proposition asserts that for every positive natural numbers , every probability vector , every family of positive semidefinite trace-one matrices on , every , and every , there exists a natural number such that for every and every measurement on with a finite, strictly positive number of positive semidefinite effects summing to identity,
Here , and is the diagonal matrix with diagonal , indexed by . The matrix has that same indexing set, is on the outcome register, and , with the square root taken by continuous functional calculus. The inner supremum is taken in the extended real numbers, and sends either infinite value to zero; the outer supremum is a total real supremum. Finally,
where ranges over all measurements on with a finite, strictly positive number of outcomes. No strict positivity of the entries of is assumed. The threshold is not required to be positive; if it is zero, the assertion also includes , with empty tensor products and products equal to their units. Logarithms and division are total, including at zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.KeyedAchievable
For finite types , all with decidable equality, arbitrary matrix maps and , a Boolean flag , and a real number , this property means that and there exists a sequence of keyed block codes of lengths satisfying the following conditions. Each code has , density matrices on , and effects on which are positive semidefinite and sum over to the identity for each key. Writing , the required limits and rate condition are
Moreover, for every , all sufficiently large satisfy the security condition selected by : if is true, every finite measurement on , with , positive semidefinite effects, and , admits a probability distribution such that
if is false, there exists a positive semidefinite trace-one matrix on such that
Here a probability distribution has nonnegative real entries summing to , , and for either map its length- action is defined by
with a matrix unit. Neither map is assumed to be a channel or linear, and no relation between the two maps is required.
QAlgorithms.Papers.Independent.Intakenext100.P63.KeyedBlockCode
For finite types , with decidable equality on , and any natural number , this structure consists of a natural number of messages, a natural number of keys, a proof that , and one branch code for each . Each branch contains a proof that , matrices on for every message , each positive semidefinite with trace one, and matrices on , each positive semidefinite and satisfying . No decoding-error, security, or relation between different branches is included. The types may be empty and may be zero; at , the sequence spaces are singletons even when the underlying types are empty.
QAlgorithms.Papers.Independent.Intakenext100.P63.KeyedRateAtLeast
For finite types , with decidable equality on , a sequence of keyed block codes of lengths , and any real number , this property means
Here each has keys and messages, density matrices on for each key and message, and, for each key, positive semidefinite measurement effects on summing to the identity. The threshold may depend on , and is not required to be nonnegative.
QAlgorithms.Papers.Independent.Intakenext100.P63.PrivateSecure
For finite types , all with decidable equality, an arbitrary matrix map , a natural number , a keyed block code , and a real number , this property means that there exists a positive semidefinite matrix of trace on such that
Here the code has keys and messages, density matrices on , and, for each key, positive semidefinite measurement effects on summing to the identity; . The map appearing here is defined by
with a matrix unit, and the norm means , with the square root given by continuous functional calculus. The same is used for all messages. No channel or linearity assumption on , nonnegativity assumption on , or factor is present. The definition includes , using singleton register index sets and empty products equal to .
QAlgorithms.Papers.Independent.Intakenext100.P63.ReliableKeyedSequence
For finite types , both with decidable equality, an arbitrary matrix map , and a sequence of keyed block codes of lengths , this property means that both real sequences
converge to as , where the symbol here denotes the branch message matrix itself. More explicitly, , those branch matrices are positive semidefinite of trace on , and, for each , the effects on are positive semidefinite and sum over to the identity. For any length ,
where is a matrix unit. No channel or linearity assumption is made on , and no condition on the limiting message rate is part of this property.
QAlgorithms.Papers.Independent.Intakenext100.P63.WeakSecure
For finite types , all with decidable equality, an arbitrary matrix map , a natural number , a keyed block code , and a real number , this property means that every measurement on , with , positive semidefinite, and , admits real numbers with such that
Here the code has keys and messages, density matrices on , and a measurement with positive semidefinite effects summing to the identity on for each key; . For any matrix , the map in the inequality is
where is a matrix unit. The distribution may depend on the measurement but is shared by all messages. There is no channel or linearity assumption on , no restriction on the sign of , and no factor in the displayed discrepancy. The case uses singleton register index sets and empty products equal to .
QAlgorithms.Papers.Independent.Intakenext100.P63.accessibleEquivocation
For arbitrary finite types , with decidable equality on , real weights , and complex square matrices indexed by , this defines the real infimum over all positive integers and all families of positive semidefinite matrices satisfying , of
Neither normalization nor nonnegativity of , nor any density-matrix condition on , is required. Zero denominators give zero quotients; the real logarithm is zero at zero and uses the absolute value at negative arguments. The infimum is real-valued, with value zero for an empty set or a set unbounded below. Empty or is allowed and gives value zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.activatedCapacity
For arbitrary finite types , all with decidable equality, and arbitrary matrix-valued functions and in the sense of maps between their complex square-matrix spaces, this defines
where and . For any finite-register maps , means the real supremum of nonnegative rates for which there is a sequence of codes of lengths : each code has positive integers , and for every key , density matrices for and positive semidefinite decoding effects summing to the output identity. A density matrix means a positive semidefinite matrix of trace . The requirements are
and, for every , eventually . Writing , security requires that for every , eventually every finite measurement with a strictly positive number of outcomes admits weights , , such that
Here a measurement has positive semidefinite effects summing to identity, and the power of any map is defined on all matrices by
with the matrix unit. No channel assumption is imposed on , and the finite types may be empty. All suprema are total real suprema, equal to zero on empty or unbounded-above sets.
QAlgorithms.Papers.Independent.Intakenext100.P63.activatedEnvironment
For arbitrary types , an arbitrary function , and every natural number , this defines a function on matrices indexed by by
The sum traces out the auxiliary index before applying . No finiteness assumption on , or linearity, positivity, or channel assumption on , is required. In particular, for the summed matrix is zero and the result is , which is not required to be zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.activatedReceiver
For arbitrary types , an arbitrary function , and every natural number , this defines a function from matrices on to matrices on by
Thus is applied separately to each block determined by the two auxiliary indices . No finiteness, linearity, positivity, or channel assumption is imposed on . The definition includes , when the input and output matrices have empty indexing sets.
QAlgorithms.Papers.Independent.Intakenext100.P63.arimotoOutput
For arbitrary finite types , a real number , arbitrary complex square matrices on indexed by , arbitrary real weights indexed by , and arbitrary complex square matrices on , this defines the real number
There is no assumption that is a measurement, that is a probability distribution, that the are density matrices, or that lies in any particular range. All three finite types may be empty, and the powers, divisions, and logarithm use total real operations even at zero or outside their usual positive-argument domains. In particular, the definition includes and , and gives zero at either value because the displayed prefactor is zero under total division.
QAlgorithms.Papers.Independent.Intakenext100.P63.associatedEffects
For arbitrary finite types , with decidable equality on , real weights , a family of complex square matrices indexed by , and an index , this defines
using real continuous functional calculus. If is Hermitian, has eigenvalue on each positive-eigenvalue subspace and zero on each nonpositive-eigenvalue subspace; if is non-Hermitian, . No distribution, density-matrix, or measurement assumptions are imposed. Empty is allowed; empty supplies no index .
QAlgorithms.Papers.Independent.Intakenext100.P63.associatedMinimum
For arbitrary finite types , with decidable equality on , real weights , and complex square matrices indexed by , set , for under real continuous functional calculus, and . This defines
Here the kernels are those of matrix multiplication on vectors. For Hermitian , replaces positive eigenvalues by their inverse square roots and nonpositive eigenvalues by zero; for non-Hermitian , . No distribution or density-matrix assumptions are imposed on . The total real logarithm is zero at zero and uses absolute values otherwise. The real infimum is zero for an empty or unbounded-below defining set; in particular, if is empty or , no admissible trace-one exists and the value is zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.averageState
For any finite type , arbitrary type , real weights , and family of complex square matrices indexed by , this defines the matrix
where the weights act as complex scalars. No probability-distribution or density-matrix hypotheses are imposed. If is empty, this is the zero matrix; may also be empty.
QAlgorithms.Papers.Independent.Intakenext100.P63.averagedSignal
For finite types , with decidable equality on , a natural number , a keyed block code , and any message index , this defines the complex matrix on
Here , , and is the message matrix in branch ; every such matrix is positive semidefinite with trace . Each branch also supplies positive semidefinite measurement matrices on whose sum is the identity. The scalar is taken in . The case is included, with a singleton; no decidable equality assumption on is required.
QAlgorithms.Papers.Independent.Intakenext100.P63.classicalJoint
For arbitrary types , both with decidable equality, and any function , this defines the complex diagonal matrix on with diagonal entry at and all off-diagonal entries zero. The types need not be finite or nonempty, and is not required to be nonnegative or normalized.
QAlgorithms.Papers.Independent.Intakenext100.P63.conditionalMinBits
For any finite types with decidable equality and any complex matrix indexed by , this defines the real conversion of the extended-real supremum
The supremum is formed in the extended real numbers; its conversion to preserves finite values and sends both and to zero. No positivity or normalization condition is imposed on , and neither index type is required to be nonempty. If is empty there is no admissible , so the extended supremum is and the defined real value is zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.constrainedRenyi
For arbitrary finite types , a real number , arbitrary complex square matrices on , and an arbitrary complex square matrix on , this defines the real infimum
Thus the optimization ranges over finite probability-weighted decompositions of into density matrices; the component matrices are not required to be pure. No measurement condition on , density-matrix hypothesis on , or restriction on is imposed. The index types may be empty, and is allowed syntactically but cannot satisfy . If no decomposition exists, the real infimum is zero; it is also zero if the set of values is unbounded below. Powers, logarithms, and division are total, including at .
QAlgorithms.Papers.Independent.Intakenext100.P63.ensembleConditionalBits
For arbitrary finite types , real weights , and families and of complex square matrices indexed by , set . This defines
There are no probability, density-matrix, or measurement assumptions. Division by zero is zero, and the total real logarithm is zero at zero and equals otherwise. Empty index types are permitted; if any of is empty, the value is zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.environment
For finite types , an arbitrary type , and any complex rectangular matrix with rows indexed by and columns indexed by , this defines the function sending a complex matrix on to the matrix on given by
No isometry condition is imposed on , no density condition is imposed on , and need not be finite. Empty or empty makes the resulting matrix zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.iidJoint
For any type , finite type with decidable equality, function , family of complex matrices on , natural number , and measurement on the sequence space , this defines
Here , and ranges over the measurement’s outcomes, where is a positive natural number, each is positive semidefinite, and . No probability-distribution assumption is imposed on , no density-matrix assumption is imposed on the , and need not be finite or nonempty. When , both products equal one, so for the unique empty sequence .
QAlgorithms.Papers.Independent.Intakenext100.P63.jointConditionalBits
For arbitrary finite types and any real array , this defines
No nonnegativity or normalization of is assumed. Division by zero is defined to be zero; the total real logarithm is zero at zero and equals at nonzero . Either index type may be empty, in which case the expression is zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.keyRate
For finite types , with decidable equality on , any natural number , and a keyed block code of block length , this defines
The code also has a positive number of messages; for each key it supplies density matrices on for those messages and positive semidefinite measurement effects on summing to the identity. The denominator is positive, and gives block length .
QAlgorithms.Papers.Independent.Intakenext100.P63.keyedAverageError
For finite types , both with decidable equality, an arbitrary map from complex matrices indexed by to complex matrices indexed by , a natural number , and a keyed block code , this defines the real number
Here , , each is a positive semidefinite matrix of trace on , and, for each key , the matrices on are positive semidefinite and sum over to the identity. Positivity of follows from the branch code supplied for every key. The map used in the formula is defined entrywise by
where has its sole nonzero entry, equal to , at . No channel or linearity assumption is imposed on . The definition includes , when the register index sets are singletons and the empty product is .
QAlgorithms.Papers.Independent.Intakenext100.P63.keyedCapacity
For finite types , all with decidable equality, arbitrary matrix maps and , and a Boolean flag , this defines the real supremum of all for which there exists a sequence of keyed block codes of lengths with the following properties: each code has , positive semidefinite trace-one message matrices on , and, for each key, positive semidefinite effects on summing over messages to the identity; the quantities
converge to ; and for every , eventually . In addition, for every , eventually the following selected condition holds, with : if is true, every measurement on with , positive semidefinite effects, and sum , admits nonnegative real summing to such that
if is false, some positive semidefinite trace-one matrix on satisfies
Here , and
for either map , with a matrix unit. No channel, linearity, or complementary-channel relationship is assumed. This is a supremum in , whose total supremum operation returns for an empty or unbounded-above set, rather than an extended-real supremum.
QAlgorithms.Papers.Independent.Intakenext100.P63.marginalMinEntropy
For any finite types with decidable equality and any complex matrix on , let be the matrix with entries , let , and set , with defined by continuous functional calculus. This defines
No density-matrix or Hermitian assumption is imposed on , and may be empty. The real square root and inverse are total, with ; for a positive semidefinite , zero eigenvalues therefore receive value zero. The logarithm is also total and gives zero when its argument is zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.measuredEnsembleJoint
For arbitrary types , with finite, any real weights , any family of complex square matrices indexed by , and any family of such matrices, this defines the real array
The weights need not form a probability distribution, the matrices need not be density matrices, and the need not form a measurement. The types may be empty; if is empty, every value of this array is zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.measuredState
For a finite type , a type with decidable equality, any family of complex matrices on , any natural number , and any complex matrix indexed by sequences of length in , this defines a diagonal matrix indexed by sequences of length in . Its diagonal entry at is the real number, embedded in ,
and every off-diagonal entry is zero. There are no positivity, normalization, or completeness assumptions on or , and need not be finite. For , both sequence index sets are singletons and the unique output entry is .
QAlgorithms.Papers.Independent.Intakenext100.P63.measurementWorstPrior
For arbitrary finite types , with decidable equality on , any family of complex square matrices indexed by , and a measurement consisting of a positive number of positive semidefinite matrices with , this defines
The need not be density matrices. Division by zero is zero; the total real logarithm is zero at zero and uses absolute values at negative arguments. This is a real supremum, equal to zero if its defining set is empty or unbounded above; in particular, it is zero when is empty.
QAlgorithms.Papers.Independent.Intakenext100.P63.messageRateBits
For finite types , with decidable equality on , any natural number , and a keyed block code of block length , this defines
Such a code has a positive number of keys, and each key supplies a branch code with a positive number of messages, density matrices on , and positive semidefinite measurement effects on summing to the identity. Thus and the denominator is positive. The case is the rate for block length .
QAlgorithms.Papers.Independent.Intakenext100.P63.optimizedEquivocation
For arbitrary finite types , with decidable equality on , and any family of complex square matrices indexed by , this defines
No density-matrix assumption is imposed on the . All extrema are taken in : an empty or unbounded-below inner set has infimum zero, and an empty or unbounded-above outer set has supremum zero. Division by zero is zero; the real logarithm is zero at zero and uses absolute values for negative arguments. In particular, if is empty, there is no admissible , and the value is zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.povmMinimumShannon
For arbitrary finite types and any family of complex square matrices indexed by , this defines
No positivity or completeness condition is imposed on the , so the need not be probabilities. The real logarithm is zero at zero and equals otherwise. The infimum is taken in , giving zero if the defining set is empty or unbounded below. Empty admits no trace-one matrix and therefore gives zero; empty also gives zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.qcBranchDensity
For arbitrary types , with decidable equality on , any function , and any family of complex matrices indexed by , this defines the matrix on whose entries are
Neither type is required to be finite or nonempty. There are no assumptions that the weights are nonnegative or sum to one, or that the matrices are positive semidefinite or normalized.
QAlgorithms.Papers.Independent.Intakenext100.P63.regularizedUpper
For arbitrary finite types , each with decidable equality, and arbitrary maps and , this defines . For any map , its power is defined by
where are -tuples of input indices, are -tuples of output indices, and is a matrix unit. For finite-register maps , is the real supremum over all finite ensembles , with , , , and each positive semidefinite of trace , of
The infimum ranges over measurements with a finite, strictly positive number of positive semidefinite effects summing to identity. Here , with applied by continuous functional calculus. No channel assumptions are imposed; the finite types may be empty, whereas is excluded and cannot satisfy normalization. Logarithms, divisions, and real suprema and infima are total; in particular, the relevant supremum or infimum is zero for an empty set or for a set unbounded in the corresponding direction.
QAlgorithms.Papers.Independent.Intakenext100.P63.stateMinBits
For any finite type with decidable equality and any complex matrix indexed by , this defines the real number
where is the operator norm for the Euclidean norm. No positivity or trace condition is imposed on , and may be empty. The logarithm is total: its value at zero is zero, so this definition gives zero when , including on an empty index type.
QAlgorithms.Papers.Independent.Intakenext100.P63.supportInvSqrt
For any finite type with decidable equality and any complex square matrix indexed by , this defines by the real continuous functional calculus, where . For Hermitian , this replaces every positive eigenvalue by and every nonpositive eigenvalue by zero, since the real square root of a negative number and the inverse of zero are both defined to be zero. For non-Hermitian , this functional-calculus expression is the zero matrix. No positivity, invertibility, or trace condition is assumed; empty is permitted.
QAlgorithms.Papers.Independent.Intakenext100.P63.taggedEffects
For arbitrary types , any real number , and families and of complex square matrices indexed by , this defines a matrix family indexed by the disjoint union : its value on a left-tagged is , and its value on a right-tagged is , with real scalars embedded in . No finiteness, positivity, measurement condition, or restriction is assumed. Empty types are permitted; at the left branch is zero, and at the right branch is zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.tensorEffects
For arbitrary types , any family , and any natural number , this defines a family of matrices indexed by label sequences , with entries
No finiteness, nonemptiness, positivity, or measurement-completeness assumptions are imposed on . When , the product is empty and equals one, so the matrix for the unique empty label sequence is the matrix with entry one.
QAlgorithms.Papers.Independent.Intakenext100.P63.traceSmoothConditionalMinBits
For any finite types with decidable equality, real number , and complex matrix on , this defines the real supremum of the numbers over all matrices with and
where is the real conversion of the extended-real supremum of all real for which there exists a positive semidefinite matrix on , of trace one, satisfying . Matrix square roots use continuous functional calculus, and the real conversion sends either extended infinity to zero. No density condition is imposed on , and need not be nonnegative. The outer supremum is in , with value zero for an empty set or a set unbounded above; the feasible set is empty if either index type is empty or .
QAlgorithms.Papers.Independent.Intakenext100.P63.traceSmoothStateMinBits
For any finite type with decidable equality, real number , and complex matrix indexed by , this defines
where the matrix square root is given by continuous functional calculus and the norm is the Euclidean operator norm. There is no density-matrix assumption on and no nonnegativity assumption on . The supremum is taken in , whose specified supremum is zero for an empty set or a set unbounded above; in particular, the feasible set is empty if is empty or . The total logarithm assigns zero at zero.
QAlgorithms.Papers.Independent.Intakenext100.P63.twoBasisDilation
For every natural number , this defines a complex matrix whose columns are indexed by pairs and whose rows are indexed by with the same kind of pair and . Its entries are
Here in the exponential denote the natural-number values of the indices. The definition includes , when both indexing sets are empty; it does not itself assert any normalization or isometry property.
QAlgorithms.Papers.Independent.Intakenext100.P63.twoBasisVector
For a natural number , a Boolean , and indices , this defines the complex number
where is the imaginary unit and the index values , the square root, and are coerced into in the formula. The parameter is allowed, but then there are no possible indices , so there are no entries to evaluate.
QAlgorithms.Papers.Independent.Intakenext100.P63.upperInformation
For arbitrary finite types , with decidable equality on , and arbitrary functions and , this defines the real supremum, over natural numbers , weights summing to , and positive semidefinite matrices of trace on , of
The infimum ranges over all measurements on with a finite, strictly positive number of outcomes, positive semidefinite effects , and . Here , and , where is applied using the continuous functional calculus. Neither map is assumed linear or a channel, so their outputs are not assumed to be density matrices. The finite types may be empty; is quantified over but cannot satisfy the weight-sum condition. All logarithms and divisions use their total real-valued definitions, including and division by zero equal to zero; real suprema and infima here are also total, with value zero for an empty set or, respectively, a set unbounded above or below.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.