Definitions for Remarks on additivity of the Holevo channel capacity and of the entanglement of formation
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P60The objects the formalized statements of Remarks on additivity of the Holevo channel capacity and of the entanglement of formation (arXiv:quant-ph/0206148) are stated in. Each was checked against the paper by a blind read-back and a moderator.
pureEntropyBits: PDF p.3: entropy in bits of the first-party marginal of a pure vector. Physical vector arguments are normalized in the theorem or imported ensemble.finiteBasisState: PDF p.3: change only the local basis labels to the accepted finite-dimensional operational cost interface. The same bijection is used in both matrix indices.formationCostBits: PDF p.3: operational entanglement cost in singlets per copy, with half trace norm error. Reuse the accepted actual finite adaptive two-way LOCC definition; local basis relabelling accommodates all finite registers, including direct sums.HasRangeIn: PDF p.4: support means every matrix column belongs to the stated linear subspace.dilationSpace: PDF pp.4,9--13: range of the actual displayed embedding, as the span of its columns.SignalEnsemble: PDF pp.2,5--6: a finite ensemble on an arbitrary input Hilbert space.FiniteOutputDualChannel: PDF pp.2,5--6: unital completely positive dual channel, with no finite input assumption. Complete positivity uses all positive block matrices and all test vectors.pureOutput: PDF p.6: actual pure output; Tr(rho E_ji)=rho_ij fixes the transposition.signalBarycenter: PDF pp.2,6: output barycenter of an input ensemble.signalHolevo: PDF p.2, (1): Holevo objective, in bits. Only normalized physical signals are used.signalCapacity: PDF p.2, (1): the actual finite-ensemble supremum. With positive finite output and an attaining ensemble it is nonempty and bounded between zero and log2(output dim).completedOperator: Canonical bounded-operator extension to the Hilbert completion; its embedding is isometric and dense, so ContinuousLinearMap.extend never takes its junk branch.tensorDualOutput: PDF p.6, (9): tensor channel on the completed Hilbert tensor product. This formula uses the actual tensor product of each pair of dual matrix units, and includes arbitrary infinite-Schmidt-rank inputs through completion, not merely algebraic simple tensors.PauliAdmissible: PDF p.9, (13): the closed weight simplex and both axis-order inequalities.pauliDilation: PDF p.9: columns are exactly psi_T and psi_T_perp, output:environment order. The y-column phases are +i and -i, and the second z coefficient is negative.pauliMixture: PDF p.9, (14): mixtures of the two specified projectors; endpoints are allowed.pauliDilationWord: PDF p.9: a named tensor word, regrouped across the party cut.pauliWordMixture: PDF p.9: an arbitrary convex mixture of the named tensor-word projectors.gapPolynomial: PDF p.14: the exact quartic, with no total negative-root selector.GapCriterion: PDF p.14, (20): the entire numerator 2^h-1 is negated before division by two.DepolarizingData: PDF p.10: physical parameter and the source's orthogonal unitary error basis.depolarizingWeight: PDF p.10: p0=lambda+(1-lambda)/d^2, all other weights equal.depolarizingDilation: PDF p.10: the actual Kraus-block embedding, in output:environment order.depolarizingEntropyBits: PDF p.10: entropy of the printed spectrum (a,b,...,b), including zero eigenvalues.productMatrices: Grouped tensor product of a list of local density matrices.productMixture: PDF p.10: finite convex mixtures of supported product states, not arbitrary entangled states in the tensor-power subspace.jointDepolarizing: PDF p.8: tensor of the specified dilation maps, allowing different local dimensions.pairMarginal: PDF p.8: the actual ith pair marginal, summing the remaining coordinates once. The update changes only coordinate i in the column; all other registers are traced.IrreducibleMatrix: PDF p.11: irreducibility on exactly the represented space.CovariantData: PDF p.11, (15): compact continuous unitary actions on K and H2, both irreducible. W is the actual isometry into environment:output. Covariance is imposed on all input operators; no twirling identity, optimum, or product-case action is a hypothesis.projectorState: PDF p.11: P/Tr(P), constructed from W, whose rank and trace are k>0.embedded: PDF p.11: embed a source vector using the actual isometry.minimumEntanglement: PDF p.11, (17): minimum-entropy value over unit vectors, not all vectors of K. The result below also asserts attainment, so the printed minimum is retained.dilationHolevo: PDF p.11: finite-input Holevo objective for the channel defined by W and traceLeft.dilationCapacity: PDF p.11, (16): actual channel capacity (1), with unit normalized inputs.minimizingProjectorHull: PDF pp.11--12: convex hull of the orbit of the minimizing pure projector. This is a convex hull of density matrices, not their linear support span.PureTransitive: PDF p.12: transitivity on pure projectors, thus insensitive to global phase.exampleSevenDilation: PDF p.13, Example 7: the three displayed orthonormal columns. j+3 is an ordinary environment coordinate (3,4,5), not a residue modulo three.exampleSevenMixtureDilation: PDF p.13: coherent superposition in C3 tensor (C6 direct-sum (C3 tensor C3)). The right branch is |Phi_3> tensor |j>; no incoherent flag replaces the direct sum.exampleSevenMixtureEntropy: PDF p.13: explicit constant from the spectrum of the printed channel. a=(1-|c|^2)/3+|c|^2/2, b=(1-|c|^2)/3+|c|^2/4, spectrum (a,b,b).antisymmetricDilation: PDF p.13, Example 8: the specified normalized antisymmetric basis wedges.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_QuantumOutputMetrics
import Definitions.Def_QAlgorithms_Defs_BipartiteSeparability
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P08
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P21
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P80
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P42
import Definitions.Def_QAlgorithms_Papers_Independent_Gap48_P32
/-!
Matsumoto--Shimono--Winter, arXiv:quant-ph/0206148v4.
Accepted interfaces are imported; paper-specific adapters have complete bodies.
Only result statements have sorry.
Entropy and operational rates are in bits. Compilation is pending batch handoff.
-/
namespace QAlgorithms.Papers.Independent.Intakenext100.P60
open scoped Matrix ComplexConjugate ComplexOrder TensorProduct
noncomputable section
attribute [local instance] Classical.propDecidable Classical.decEq
-- Exact accepted matrix, normalized ensemble, convex roof, grouped copies and LOCC.
open QAlgorithms.Papers.Independent.Information100.P21 (Op FiniteLOCC)
open QAlgorithms.Papers.Independent.Information100.P08 (PureEnsemble pureAverage formation)
open QAlgorithms.Papers.Independent.Information100.P80 (groupedPower)
open QAlgorithms.Papers.Independent.Gap48.P32 (twoWayDistillable)
/-- PDF p.3: entropy in bits of the first-party marginal of a pure vector.
Physical vector arguments are normalized in the theorem or imported ensemble. -/
def pureEntropyBits {A B : Type*} [Fintype A] [Fintype B] [DecidableEq A]
(v : EuclideanSpace ℂ (A × B)) : ℝ := vnEntropy (traceRight (pureDensity v))
/-- PDF p.3: change only the local basis labels to the accepted finite-dimensional
operational cost interface. The same bijection is used in both matrix indices. -/
def finiteBasisState {A B : Type*} [Fintype A] [Fintype B]
(rho : Op (A × B)) : Op (Fin (Fintype.card A) × Fin (Fintype.card B)) :=
fun p q => rho ((Fintype.equivFin A).symm p.1, (Fintype.equivFin B).symm p.2)
((Fintype.equivFin A).symm q.1, (Fintype.equivFin B).symm q.2)
/-- PDF p.3: operational entanglement cost in singlets per copy, with half trace
norm error. Reuse the accepted actual finite adaptive two-way LOCC definition;
local basis relabelling accommodates all finite registers, including direct sums. -/
def formationCostBits {A B : Type*} [Fintype A] [Fintype B]
(rho : Op (A × B)) : ℝ :=
QAlgorithms.Papers.Independent.Dependency50.P42.entanglementCost
QAlgorithms.Papers.Independent.Dependency50.P42.halfTraceDistance (finiteBasisState rho)
/-- The cost adapter changes basis labels without changing any matrix entry. -/
example {A B : Type*} [Fintype A] [Fintype B] (rho : Op (A × B))
(p q : Fin (Fintype.card A) × Fin (Fintype.card B)) :
finiteBasisState rho p q =
rho ((Fintype.equivFin A).symm p.1, (Fintype.equivFin B).symm p.2)
((Fintype.equivFin A).symm q.1, (Fintype.equivFin B).symm q.2) := rfl
/-- PDF p.4: support means every matrix column belongs to the stated linear subspace. -/
def HasRangeIn {I : Type*} (K : Submodule ℂ (I → ℂ)) (rho : Op I) : Prop :=
∀ j, (fun i => rho i j) ∈ K
/-- PDF pp.4,9--13: range of the actual displayed embedding, as the span of its columns. -/
def dilationSpace {I J : Type*} (W : Matrix I J ℂ) : Submodule ℂ (I → ℂ) :=
Submodule.span ℂ (Set.range fun j => fun i => W i j)
/-- Normalization sanity for the finite roof, not a proof of a source theorem. -/
example {I : Type} [Fintype I] (v : EuclideanSpace ℂ I) (hv : ‖v‖ = 1) :
∃ e : PureEnsemble I, pureAverage e = pureDensity v := by
refine ⟨⟨1, fun _ => 1, fun _ => v, fun _ => by norm_num, by simp,
fun _ => hv⟩, ?_⟩
simp [pureAverage]
/-- Zero copies are the scalar trace-one operator, without a division by zero. -/
example {A B : Type*} (rho : Op (A × B))
(x y : (Fin 0 → A) × (Fin 0 → B)) : groupedPower rho 0 x y = 1 := by
simp [groupedPower]
/-- The protocol class includes the identity without spending entanglement. -/
example (a b : ℕ) : FiniteLOCC (fun X : Op (Fin a × Fin b) => X) :=
FiniteLOCC.identity a b
/-! General Hilbert input, finite output: Heisenberg-picture normal channels.
The domain algebra is finite dimensional, so positivity at all matrix levels and
unitality specify precisely the adjoint of a trace-preserving completely positive
Schrodinger channel on all trace-class input states. No input dimension restriction. -/
/-- PDF pp.2,5--6: a finite ensemble on an arbitrary input Hilbert space. -/
structure SignalEnsemble (H : Type*) [NormedAddCommGroup H] where
size : ℕ
prob : Fin size → ℝ
vector : Fin size → H
nonneg : ∀ j, 0 ≤ prob j
total : ∑ j, prob j = 1
unit : ∀ j, ‖vector j‖ = 1
/-- PDF pp.2,5--6: unital completely positive dual channel, with no finite input
assumption. Complete positivity uses all positive block matrices and all test vectors. -/
structure FiniteOutputDualChannel (H : Type*) [NormedAddCommGroup H] [InnerProductSpace ℂ H]
(d : ℕ) where
dual : Op (Fin d) →ₗ[ℂ] (H →L[ℂ] H)
unital : dual 1 = ContinuousLinearMap.id ℂ H
completely_positive : ∀ k : ℕ, ∀ X : Op (Fin k × Fin d), X.PosSemidef →
∀ v : Fin k → H,
0 ≤ ∑ r, ∑ s, inner ℂ (v r)
(dual (fun i j => X (r, i) (s, j)) (v s))
/-- PDF p.6: actual pure output; Tr(rho E_ji)=rho_ij fixes the transposition. -/
def pureOutput {H : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
{d : ℕ} (T : FiniteOutputDualChannel H d) (v : H) : Op (Fin d) :=
fun i j => inner ℂ v (T.dual (Matrix.single j i 1) v)
/-- PDF pp.2,6: output barycenter of an input ensemble. -/
def signalBarycenter {H I : Type*} [NormedAddCommGroup H]
(signal : H → Op I) (e : SignalEnsemble H) : Op I :=
∑ j, (e.prob j : ℂ) • signal (e.vector j)
/-- PDF p.2, (1): Holevo objective, in bits. Only normalized physical signals are used. -/
def signalHolevo {H I : Type*} [NormedAddCommGroup H] [Fintype I] [DecidableEq I]
(signal : H → Op I) (e : SignalEnsemble H) : ℝ :=
vnEntropy (signalBarycenter signal e) - ∑ j, e.prob j * vnEntropy (signal (e.vector j))
/-- PDF p.2, (1): the actual finite-ensemble supremum. With positive finite output and
an attaining ensemble it is nonempty and bounded between zero and log2(output dim). -/
def signalCapacity {H I : Type*} [NormedAddCommGroup H] [Fintype I] [DecidableEq I]
(signal : H → Op I) : ℝ := sSup (Set.range (signalHolevo signal))
/-- Canonical bounded-operator extension to the Hilbert completion; its embedding
is isometric and dense, so ContinuousLinearMap.extend never takes its junk branch. -/
def completedOperator {E : Type*} [NormedAddCommGroup E] [InnerProductSpace ℂ E]
(f : E →L[ℂ] E) : UniformSpace.Completion E →L[ℂ] UniformSpace.Completion E :=
((UniformSpace.Completion.toComplL : E →L[ℂ] UniformSpace.Completion E).comp f).extend
(UniformSpace.Completion.toComplL : E →L[ℂ] UniformSpace.Completion E)
/-- PDF p.6, (9): tensor channel on the completed Hilbert tensor product. This formula
uses the actual tensor product of each pair of dual matrix units, and includes arbitrary
infinite-Schmidt-rank inputs through completion, not merely algebraic simple tensors. -/
def tensorDualOutput {H K : Type*} [NormedAddCommGroup H] [InnerProductSpace ℂ H]
[NormedAddCommGroup K] [InnerProductSpace ℂ K] {d e : ℕ}
(T : FiniteOutputDualChannel H d) (S : FiniteOutputDualChannel K e)
(v : UniformSpace.Completion (H ⊗[ℂ] K)) : Op (Fin d × Fin e) :=
fun i j => inner ℂ v (completedOperator
(TensorProduct.mapL (T.dual (Matrix.single j.1 i.1 1))
(S.dual (Matrix.single j.2 i.2 1))) v)
/-- PDF p.9, (13): the closed weight simplex and both axis-order inequalities. -/
def PauliAdmissible (p : Fin 4 → ℝ) : Prop :=
(∀ i, 0 ≤ p i) ∧ (∑ i, p i) = 1 ∧
|p 0 + p 2 - p 1 - p 3| ≤ p 0 + p 3 - p 1 - p 2 ∧
|p 0 + p 1 - p 2 - p 3| ≤ p 0 + p 3 - p 1 - p 2
/-- PDF p.9: columns are exactly psi_T and psi_T_perp, output:environment order.
The y-column phases are +i and -i, and the second z coefficient is negative. -/
def pauliDilation (p : Fin 4 → ℝ) : Matrix (Fin 2 × Fin 4) (Fin 2) ℂ :=
fun q j =>
if q.2 = 0 then if q.1 = j then (Real.sqrt (p 0) : ℂ) else 0
else if q.2 = 1 then if q.1 ≠ j then (Real.sqrt (p 1) : ℂ) else 0
else if q.2 = 2 then if q.1 ≠ j then
(if j = 0 then Complex.I else -Complex.I) * (Real.sqrt (p 2) : ℂ) else 0
else if q.1 = j then
(if j = 0 then (1 : ℂ) else -1) * (Real.sqrt (p 3) : ℂ) else 0
/-- PDF p.9, (14): mixtures of the two specified projectors; endpoints are allowed. -/
def pauliMixture (p : Fin 4 → ℝ) (s : ℝ) : Op (Fin 2 × Fin 4) :=
(s : ℂ) • pureDensity (WithLp.toLp 2 fun q => pauliDilation p q 0) +
((1 - s : ℝ) : ℂ) • pureDensity (WithLp.toLp 2 fun q => pauliDilation p q 1)
/-- PDF p.9: a named tensor word, regrouped across the party cut. -/
def pauliDilationWord (p : Fin 4 → ℝ) (n : ℕ) (w : Fin n → Fin 2) :
EuclideanSpace ℂ ((Fin n → Fin 2) × (Fin n → Fin 4)) :=
WithLp.toLp 2 fun q => ∏ i, pauliDilation p (q.1 i, q.2 i) (w i)
/-- PDF p.9: an arbitrary convex mixture of the named tensor-word projectors. -/
def pauliWordMixture (p : Fin 4 → ℝ) (n : ℕ) (mu : (Fin n → Fin 2) → ℝ) :
Op ((Fin n → Fin 2) × (Fin n → Fin 4)) :=
∑ w, (mu w : ℂ) • pureDensity (pauliDilationWord p n w)
/-- PDF p.14: the exact quartic, with no total negative-root selector. -/
def gapPolynomial (p : Fin 4 → ℝ) (z : ℝ) : ℝ :=
z ^ 4 - z ^ 3 + 4 * (p 0 * p 1 * p 2 + p 0 * p 1 * p 3 +
p 0 * p 2 * p 3 + p 1 * p 2 * p 3) * z - 16 * p 0 * p 1 * p 2 * p 3
/-- PDF p.14, (20): the entire numerator 2^h-1 is negated before division by two. -/
def GapCriterion (p : Fin 4 → ℝ) : Prop :=
0 < gapPolynomial p (-(((2 : ℝ) ^ binEntropy2 (p 0 + p 3) - 1) / 2))
/-- The y-phase and perpendicular z-sign are pinned directly at matrix entries. -/
example (p : Fin 4 → ℝ) :
pauliDilation p (1, 2) 0 = Complex.I * (Real.sqrt (p 2) : ℂ) ∧
pauliDilation p (0, 2) 1 = -Complex.I * (Real.sqrt (p 2) : ℂ) ∧
pauliDilation p (1, 3) 1 = -(Real.sqrt (p 3) : ℂ) := by
norm_num [pauliDilation, Fin.ext_iff]
/-- Quartic boundary check: the allowed identity channel has no negative root. -/
example (z : ℝ) : gapPolynomial ![1, 0, 0, 0] z = z ^ 4 - z ^ 3 := by
change z ^ 4 - z ^ 3 +
4 * (1 * 0 * 0 + 1 * 0 * 0 + 1 * 0 * 0 + 0 * 0 * 0) * z -
16 * 1 * 0 * 0 * 0 = z ^ 4 - z ^ 3
ring
/-! General depolarizing subspaces. -/
/-- PDF p.10: physical parameter and the source's orthogonal unitary error basis. -/
structure DepolarizingData (d : ℕ) where
dimension : 2 ≤ d
parameter : ℝ
lower : -1 / ((d : ℝ) ^ 2 - 1) ≤ parameter
upper : parameter ≤ 1
sigma : Fin (d ^ 2) → Op (Fin d)
identity : ∀ i, i.val = 0 → sigma i = 1
unitary : ∀ i, (sigma i)ᴴ * sigma i = 1
orthogonal : ∀ i j, ((sigma i)ᴴ * sigma j).trace = if i = j then (d : ℂ) else 0
/-- PDF p.10: p0=lambda+(1-lambda)/d^2, all other weights equal. -/
def depolarizingWeight {d : ℕ} (D : DepolarizingData d) (i : Fin (d ^ 2)) : ℝ :=
let p0 := D.parameter + (1 - D.parameter) / (d : ℝ) ^ 2
if i.val = 0 then p0 else (1 - p0) / ((d : ℝ) ^ 2 - 1)
/-- PDF p.10: the actual Kraus-block embedding, in output:environment order. -/
def depolarizingDilation {d : ℕ} (D : DepolarizingData d) :
Matrix (Fin d × Fin (d ^ 2)) (Fin d) ℂ :=
fun q j => (Real.sqrt (depolarizingWeight D q.2) : ℂ) * D.sigma q.2 q.1 j
/-- PDF p.10: entropy of the printed spectrum (a,b,...,b), including zero eigenvalues. -/
def depolarizingEntropyBits {d : ℕ} (D : DepolarizingData d) : ℝ :=
let b := (1 - D.parameter) / (d : ℝ)
let a := D.parameter + b;
-(a * Real.logb 2 a + (d - 1 : ℕ) * b * Real.logb 2 b)
/-- Grouped tensor product of a list of local density matrices. -/
def productMatrices {A B : Type*} (n : ℕ) (rho : Fin n → Op (A × B)) :
Op ((Fin n → A) × (Fin n → B)) :=
fun p q => ∏ i, rho i (p.1 i, p.2 i) (q.1 i, q.2 i)
/-- PDF p.10: finite convex mixtures of supported product states, not arbitrary
entangled states in the tensor-power subspace. -/
def productMixture {A B : Type*} (n m : ℕ) (mu : Fin m → ℝ)
(rho : Fin m → Fin n → Op (A × B)) : Op ((Fin n → A) × (Fin n → B)) :=
∑ j, (mu j : ℂ) • productMatrices n (rho j)
/-- PDF p.8: tensor of the specified dilation maps, allowing different local dimensions. -/
def jointDepolarizing {n : ℕ} {d : Fin n → ℕ} (D : ∀ i, DepolarizingData (d i)) :
Matrix ((∀ i, Fin (d i)) × (∀ i, Fin (d i ^ 2))) (∀ i, Fin (d i)) ℂ :=
fun q j => ∏ i, depolarizingDilation (D i) (q.1 i, q.2 i) (j i)
/-- PDF p.8: the actual ith pair marginal, summing the remaining coordinates once.
The update changes only coordinate i in the column; all other registers are traced. -/
def pairMarginal {n : ℕ} {a b : Fin n → ℕ}
(rho : Op ((∀ i, Fin (a i)) × (∀ i, Fin (b i)))) (i : Fin n) :
Op (Fin (a i) × Fin (b i)) :=
fun p q => ∑ x : {x : ∀ j, Fin (a j) // x i = p.1},
∑ y : {y : ∀ j, Fin (b j) // y i = p.2},
rho (x.val, y.val) (Function.update x.val i q.1, Function.update y.val i q.2)
/-- At the identity endpoint the nonidentity Kraus weights vanish, without 0/0. -/
example {d : ℕ} (D : DepolarizingData d) (h : D.parameter = 1)
(i : Fin (d ^ 2)) (hi : i.val ≠ 0) : depolarizingWeight D i = 0 := by
simp [depolarizingWeight, h, hi]
/-! Compact symmetry, on a nonzero finite-dimensional effective dilation.
An arbitrary ambient environment can be compressed to the component span of the finite
range, preserving every supported matrix, its marginal spectrum, and operational rates. -/
/-- PDF p.11: irreducibility on exactly the represented space. -/
def IrreducibleMatrix {G : Type*} {k : ℕ} (V : G → Op (Fin k)) : Prop :=
∀ L : Submodule ℂ (Fin k → ℂ),
(∀ g x, x ∈ L → (V g).mulVec x ∈ L) → L = ⊥ ∨ L = ⊤
/-- PDF p.11, (15): compact continuous unitary actions on K and H2, both irreducible.
W is the actual isometry into environment:output. Covariance is imposed on all input
operators; no twirling identity, optimum, or product-case action is a hypothesis. -/
structure CovariantData (G : Type*) [Group G] [TopologicalSpace G]
(a b k : ℕ) where
environment_positive : 0 < a
output_positive : 0 < b
input_positive : 0 < k
W : Matrix (Fin a × Fin b) (Fin k) ℂ
isometry : Wᴴ * W = 1
V : G → Op (Fin k)
U : G → Op (Fin b)
V_one : V 1 = 1
U_one : U 1 = 1
V_mul : ∀ g h, V (g * h) = V g * V h
U_mul : ∀ g h, U (g * h) = U g * U h
V_unitary : ∀ g, (V g)ᴴ * V g = 1
U_unitary : ∀ g, (U g)ᴴ * U g = 1
V_continuous : ∀ i j, Continuous (fun g => V g i j)
U_continuous : ∀ i j, Continuous (fun g => U g i j)
V_irreducible : IrreducibleMatrix V
U_irreducible : IrreducibleMatrix U
covariance : ∀ g X, traceLeft (W * (V g * X * (V g)ᴴ) * Wᴴ) =
U g * traceLeft (W * X * Wᴴ) * (U g)ᴴ
/-- PDF p.11: P/Tr(P), constructed from W, whose rank and trace are k>0. -/
def projectorState {G : Type*} [Group G] [TopologicalSpace G] {a b k : ℕ}
(D : CovariantData G a b k) : Op (Fin a × Fin b) :=
(k : ℂ)⁻¹ • (D.W * D.Wᴴ)
/-- PDF p.11: embed a source vector using the actual isometry. -/
def embedded {a b k : ℕ} (W : Matrix (Fin a × Fin b) (Fin k) ℂ)
(v : EuclideanSpace ℂ (Fin k)) : EuclideanSpace ℂ (Fin a × Fin b) :=
WithLp.toLp 2 (W.mulVec (WithLp.ofLp v))
/-- PDF p.11, (17): minimum-entropy value over unit vectors, not all vectors of K.
The result below also asserts attainment, so the printed minimum is retained. -/
def minimumEntanglement {G : Type*} [Group G] [TopologicalSpace G] {a b k : ℕ}
(D : CovariantData G a b k) : ℝ :=
sInf {r | ∃ v : EuclideanSpace ℂ (Fin k), ‖v‖ = 1 ∧
r = pureEntropyBits (embedded D.W v)}
/-- PDF p.11: finite-input Holevo objective for the channel defined by W and traceLeft. -/
def dilationHolevo {a b k : ℕ} (W : Matrix (Fin a × Fin b) (Fin k) ℂ)
(e : PureEnsemble (Fin k)) : ℝ :=
vnEntropy (traceLeft (W * pureAverage e * Wᴴ)) -
∑ j, e.prob j * vnEntropy (traceLeft (pureDensity (embedded W (e.vector j))))
/-- PDF p.11, (16): actual channel capacity (1), with unit normalized inputs. -/
def dilationCapacity {a b k : ℕ} (W : Matrix (Fin a × Fin b) (Fin k) ℂ) : ℝ :=
sSup (Set.range (dilationHolevo W))
/-- PDF pp.11--12: convex hull of the orbit of the minimizing pure projector.
This is a convex hull of density matrices, not their linear support span. -/
def minimizingProjectorHull {G : Type*} [Group G] [TopologicalSpace G] {a b k : ℕ}
(D : CovariantData G a b k) (v : EuclideanSpace ℂ (Fin k)) : Set (Op (Fin a × Fin b)) :=
convexHull ℝ {rho | ∃ g : G, rho = pureDensity (embedded D.W (act (D.V g) v))}
/-- PDF p.12: transitivity on pure projectors, thus insensitive to global phase. -/
def PureTransitive {G : Type*} [Group G] [TopologicalSpace G] {a b k : ℕ}
(D : CovariantData G a b k) : Prop :=
∀ v w : EuclideanSpace ℂ (Fin k), ‖v‖ = 1 → ‖w‖ = 1 →
∃ g : G, pureDensity (act (D.V g) v) = pureDensity w
/-- PDF p.13, Example 7: the three displayed orthonormal columns. j+3 is an
ordinary environment coordinate (3,4,5), not a residue modulo three. -/
def exampleSevenDilation : Matrix (Fin 3 × Fin 6) (Fin 3) ℂ :=
fun q j =>
if q.1 = j ∧ q.2.val = j.val + 3 then (Real.sqrt 2 / 2 : ℝ)
else if (q.1.val = (j.val + 1) % 3 ∧ q.2.val = (j.val + 2) % 3) ∨
(q.1.val = (j.val + 2) % 3 ∧ q.2.val = (j.val + 1) % 3) then (1 / 2 : ℂ) else 0
/-- PDF p.13: coherent superposition in C3 tensor (C6 direct-sum (C3 tensor C3)).
The right branch is |Phi_3> tensor |j>; no incoherent flag replaces the direct sum. -/
def exampleSevenMixtureDilation (c s : ℂ) :
Matrix (Fin 3 × (Fin 6 ⊕ (Fin 3 × Fin 3))) (Fin 3) ℂ :=
fun q j => match q.2 with
| Sum.inl e => c * exampleSevenDilation (q.1, e) j
| Sum.inr e => if q.1 = e.1 ∧ e.2 = j then s * ((Real.sqrt 3)⁻¹ : ℂ) else 0
/-- PDF p.13: explicit constant from the spectrum of the printed channel.
a=(1-|c|^2)/3+|c|^2/2, b=(1-|c|^2)/3+|c|^2/4, spectrum (a,b,b). -/
def exampleSevenMixtureEntropy (c : ℂ) : ℝ :=
let t := Complex.normSq c
let a := (1 - t) / 3 + t / 2
let b := (1 - t) / 3 + t / 4;
-(a * Real.logb 2 a + 2 * b * Real.logb 2 b)
/-- PDF p.13, Example 8: the specified normalized antisymmetric basis wedges. -/
def antisymmetricDilation : Matrix (Fin 3 × Fin 3) (Fin 3) ℂ :=
fun q j =>
if q.1.val = (j.val + 1) % 3 ∧ q.2.val = (j.val + 2) % 3 then ((Real.sqrt 2)⁻¹ : ℂ)
else if q.1.val = (j.val + 2) % 3 ∧ q.2.val = (j.val + 1) % 3 then -((Real.sqrt 2)⁻¹ : ℂ)
else 0
/-- Sanity: the noncyclic environment coordinate and the first cross coefficient. -/
example : exampleSevenDilation (0, 3) 0 = ((Real.sqrt 2 / 2 : ℝ) : ℂ) ∧
exampleSevenDilation (1, 2) 0 = (1 / 2 : ℂ) := by
norm_num [exampleSevenDilation]
/-- The direct-sum zero branch is exactly the scaled original vector. -/
example (c s : ℂ) (i j : Fin 3) (e : Fin 6) :
exampleSevenMixtureDilation c s (i, Sum.inl e) j = c * exampleSevenDilation (i, e) j := rfl
/-- The antisymmetric sign is fixed by the printed order of the wedge. -/
example : antisymmetricDilation (2, 1) 0 = -((Real.sqrt 2)⁻¹ : ℂ) := by
norm_num [antisymmetricDilation]
end
end QAlgorithms.Papers.Independent.Intakenext100.P60
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P60.CovariantData
For a group equipped with a topology and natural numbers , this structure consists of proofs that ; a complex matrix satisfying ; and matrix families and satisfying , , , , , and for every . Every matrix entry of each family is continuous in , and each family's only common invariant complex linear subspaces are the zero and full spaces. Finally, for every and every complex matrix , it requires
where . The topology on is an argument of the structure; continuity of the group operations is not a separate requirement here.
QAlgorithms.Papers.Independent.Intakenext100.P60.DepolarizingData
For a natural number , an element of this structure consists of a proof that , a real parameter satisfying
and complex matrices , indexed by , satisfying whenever , for every , and
The dimension condition excludes , and the permitted parameter interval includes negative values.
QAlgorithms.Papers.Independent.Intakenext100.P60.FiniteOutputDualChannel
For any complex inner-product space with its normed additive commutative group structure, and any natural number , this structure consists of a complex-linear map
where the codomain consists of continuous complex-linear operators, such that and, for every natural number , every positive semidefinite matrix indexed by , and every family ,
is real and nonnegative. Completeness of is not assumed. The test includes , when the sum is zero; is also allowed, in which case unitality forces .
QAlgorithms.Papers.Independent.Intakenext100.P60.GapCriterion
For every real four-tuple , put
The predicate means exactly
The inequality is strict. No admissibility condition or restriction is part of this definition; the real binary-entropy function is used with its total definition for all real inputs.
QAlgorithms.Papers.Independent.Intakenext100.P60.HasRangeIn
For any type , any complex linear subspace , and any complex matrix indexed by , this predicate means that every column of belongs to :
No finiteness, boundedness, positivity, or normalization is required. If is empty, the condition is vacuous.
QAlgorithms.Papers.Independent.Intakenext100.P60.IrreducibleMatrix
For any type , natural number , and family of complex matrices, this property says that every complex linear subspace satisfying for every and every is either or all of . No group structure on is assumed. The definition includes empty , when every subspace satisfies the invariance hypothesis, and , when the zero and full subspaces coincide.
QAlgorithms.Papers.Independent.Intakenext100.P60.PauliAdmissible
For an arbitrary real four-tuple , this predicate means exactly
together with
All inequalities are non-strict, so zero coordinates and equality cases are included.
QAlgorithms.Papers.Independent.Intakenext100.P60.PureTransitive
For a group equipped with a topology and data comprising positive dimensions , an isometry , and entrywise continuous irreducible unitary representations on , respectively, satisfying for every , this property says that for every pair with , there exists such that
Here irreducibility means that the only common invariant complex subspaces are zero and the whole space, and the partial trace sums over the -dimensional factor. The required equality is equality of rank-one matrices, so it allows the vectors and to differ by a complex scalar of modulus one.
QAlgorithms.Papers.Independent.Intakenext100.P60.SignalEnsemble
For any normed additive commutative group , this structure consists of a natural number , real weights , and vectors , indexed by , together with the requirements
Weights may be zero and vectors may repeat; even a vector with zero weight must have norm . The choice cannot satisfy the required total weight.
QAlgorithms.Papers.Independent.Intakenext100.P60.antisymmetricDilation
This defines a complex matrix with rows indexed by and columns indexed by , with
Thus column is , where each ket is a coordinate unit vector.
QAlgorithms.Papers.Independent.Intakenext100.P60.completedOperator
For any complex inner-product space with its normed additive commutative group structure, and any continuous complex-linear operator , this defines its continuous complex-linear extension to the uniform-space completion. Writing for the canonical completion map, the construction extends along , so that
Completeness or nontriviality of is not assumed.
QAlgorithms.Papers.Independent.Intakenext100.P60.depolarizingDilation
For any natural number and data comprising , , and matrices satisfying , , and , this defines the complex matrix with rows indexed by pairs , , , and columns indexed by , by
The square root is the real square root, embedded into ; zero weights, including those at parameter endpoints, give zero entries in the corresponding row blocks.
QAlgorithms.Papers.Independent.Intakenext100.P60.depolarizingEntropyBits
For any natural number and data comprising , a parameter , and matrices , , with , , and , this defines the real number
Here uses the total real logarithm, with , so a term is zero. The subtraction is natural-number subtraction, which equals ordinary subtraction because ; the matrices do not enter this formula.
QAlgorithms.Papers.Independent.Intakenext100.P60.depolarizingWeight
For any natural number and data consisting of , a real parameter , and complex matrices , , with , , and for and zero otherwise, define
This defines a real number for every index ; the matrices in do not enter the formula. Both endpoints of the parameter interval are allowed, so weights may vanish.
QAlgorithms.Papers.Independent.Intakenext100.P60.dilationCapacity
For arbitrary natural numbers and any complex matrix , this definition is the real supremum, over all finite ensembles with , , and , of
Here ranges over natural numbers, the partial trace sums over the -dimensional factor, and , where is applied by continuous functional calculus. No isometry condition is imposed on . If , there are no admissible ensembles, and the real supremum of the empty set used here is ; if or , all the displayed entropy terms are zero.
QAlgorithms.Papers.Independent.Intakenext100.P60.dilationHolevo
For arbitrary natural numbers , a complex matrix , and a finite pure ensemble consisting of a natural number , probabilities with , and vectors with for every , this definition returns
The partial trace sums over the first, -dimensional factor, and , with applied by continuous functional calculus. The matrix is arbitrary, so the definition imposes no trace-one requirement on its output matrices. Although and are natural-number possibilities, no such ensemble exists in either case: empty probabilities cannot sum to one, and the zero-dimensional vector space has no unit vector.
QAlgorithms.Papers.Independent.Intakenext100.P60.dilationSpace
For arbitrary types and any complex matrix with rows indexed by and columns indexed by , this defines the complex linear subspace of spanned by its columns:
The span consists of finite linear combinations, with no topological closure. Neither index type must be finite, and if is empty the result is the zero subspace.
QAlgorithms.Papers.Independent.Intakenext100.P60.embedded
For arbitrary natural numbers , any complex matrix with rows indexed by and columns indexed by , and any vector , this definition returns the vector , with coordinates
Neither normalization of nor an isometry condition on is assumed. Zero dimensions are allowed: makes every coordinate an empty sum, hence zero, and or gives a vector on an empty coordinate set.
QAlgorithms.Papers.Independent.Intakenext100.P60.exampleSevenDilation
This defines a complex matrix with rows indexed by and columns indexed by , whose entries are
The first case takes priority. Thus, writing for the coordinate vector that is at and elsewhere, column is .
QAlgorithms.Papers.Independent.Intakenext100.P60.exampleSevenMixtureDilation
For arbitrary complex numbers , this defines a complex matrix with columns and rows indexed by , where and belongs to the disjoint union of and . On the first part of that disjoint union,
with the first case taking priority. On the second part,
The two parts of the row label remain distinct even when their numerical components coincide. There is no normalization or nonzero assumption on or .
QAlgorithms.Papers.Independent.Intakenext100.P60.exampleSevenMixtureEntropy
For every complex number , this defines the real number
There is no assumption that , so this formula also applies when is zero or negative. The logarithm is the total real base- logarithm used by the code: , and for nonzero real , .
QAlgorithms.Papers.Independent.Intakenext100.P60.finiteBasisState
For any finite types and any complex matrix indexed by , let , , and let and be the chosen finite-type equivalences. This defines the matrix indexed by whose entries are
Thus both indices are relabelled by these chosen equivalences. The types may be empty, and need not be positive or normalized.
QAlgorithms.Papers.Independent.Intakenext100.P60.formationCostBits
For finite types and any complex matrix indexed by , first relabel as a matrix on , where , , using the chosen equivalences with these finite index sets. This defines the real infimum of all such that, for every and , there exist natural numbers with and a finite local-operations-and-classical-communication map satisfying
Here , with ; each tensor power is grouped into its two parties and relabelled by the chosen equivalences from functions on the copy indices to , , or . The zeroth singlet power is the one-dimensional identity. A finite local-operations-and-classical-communication map belongs to the recursively generated class containing identity maps and maps obtained by either party applying finitely many local Kraus operators with , following each outcome by another map in the class, and summing the branch outputs; intermediate register dimensions may be zero. The trace norm is . No density-matrix or nonemptiness hypothesis is imposed on the original input; the infimum uses the total real-infimum convention, which gives for an empty set or a set unbounded below.
QAlgorithms.Papers.Independent.Intakenext100.P60.gapPolynomial
For every real four-tuple and every real number , this definition assigns the real value
No sign, normalization, or admissibility conditions on are required.
QAlgorithms.Papers.Independent.Intakenext100.P60.jointDepolarizing
For any natural number , any family of natural dimensions , , and data consisting of , parameters , and matrices , , satisfying , , and , this defines a complex matrix with rows indexed by and columns indexed by , by
All square roots are real square roots embedded into . The case is allowed: all indexing products are singletons, no component data are required, and the sole matrix entry is the empty product .
QAlgorithms.Papers.Independent.Intakenext100.P60.minimizingProjectorHull
For a group equipped with a topology, data comprising positive dimensions , an isometry , and entrywise continuous irreducible unitary representations and satisfying for all , and any vector , this definition is the real convex hull
Thus its elements are finite convex combinations of these matrices, with nonnegative real coefficients summing to one. Here , irreducibility means that the only common invariant complex subspaces are zero and the whole space, and the partial trace sums over the first factor. The argument is arbitrary; this definition requires neither unit norm nor an entropy-minimizing property, and it takes a convex hull without adding a closure.
QAlgorithms.Papers.Independent.Intakenext100.P60.minimumEntanglement
For a group with a topology and data consisting of positive dimensions , an isometry , and entrywise continuous irreducible unitary representations on and on satisfying for every , this definition is the real infimum
Here irreducibility means that only the zero and full complex subspaces are invariant under every representation matrix, is ordinary matrix multiplication, , and , where is applied by continuous functional calculus. The unit-vector indexing set is nonempty because ; the definition itself asserts an infimum, without asserting attainment.
QAlgorithms.Papers.Independent.Intakenext100.P60.pairMarginal
For any natural number , natural-number families , , any complex matrix indexed on , and any index , this defines a matrix indexed on by
The notation means replacing only coordinate by . No positivity or trace assumption on , and no positivity assumption on the dimensions, is imposed. Empty summation sets contribute zero; when , there is no index at which to apply the definition.
QAlgorithms.Papers.Independent.Intakenext100.P60.pauliDilation
For every real four-tuple , the definition gives a complex matrix with rows indexed by and columns indexed by , namely
Here each square root is the real square root, embedded into . No nonnegativity, normalization, or admissibility condition is imposed on ; in particular, a negative has real square root zero under the total square-root convention used by the definition.
QAlgorithms.Papers.Independent.Intakenext100.P60.pauliDilationWord
For every real four-tuple , natural number , and word , the definition gives a complex Euclidean vector indexed by pairs of words and , with amplitude
where
The square roots are real, with negative inputs assigned zero. No admissibility or normalization of is assumed. The case is included: all three word types then have one empty word, and the sole amplitude is the empty product .
QAlgorithms.Papers.Independent.Intakenext100.P60.pauliMixture
For every real four-tuple and every real number , define vectors in by
where the kets are coordinate unit vectors and the square roots are real square roots, equal to zero on negative inputs. The definition assigns the matrix
so its -entry is . Neither nor is restricted, and the vectors are not required to have norm ; the definition therefore does not itself require this matrix to be a density matrix.
QAlgorithms.Papers.Independent.Intakenext100.P60.pauliWordMixture
For every real four-tuple , natural number , and arbitrary real function on binary words of length , define , indexed by a binary word and a four-symbol word , by
The definition assigns
Real square roots are used, with negative inputs assigned zero. There are no assumptions that or is nonnegative or normalized. For , the matrix has one entry, equal to , because each vector has sole amplitude .
QAlgorithms.Papers.Independent.Intakenext100.P60.productMatrices
For arbitrary types , any natural number , and any family of complex matrices indexed on , , this defines a complex matrix on by
where and mean functions from into and , respectively. There are no finiteness, nonemptiness, positivity, trace, or normalization assumptions on . When , both function spaces are singletons and the empty product makes the sole matrix entry equal to .
QAlgorithms.Papers.Independent.Intakenext100.P60.productMixture
For arbitrary types , natural numbers , arbitrary real coefficients , , and arbitrary complex matrices indexed on , , this defines the matrix on with entries
The coefficients are embedded into , and no nonnegativity, unit-sum, density, or finiteness assumptions on the types are imposed. If , the result is the zero matrix; if , the indexing space is a singleton and its sole entry is , including zero when also .
QAlgorithms.Papers.Independent.Intakenext100.P60.projectorState
For a group equipped with a topology, natural numbers , and data consisting of positive , an isometry , and entrywise continuous unitary representations , , each having only zero and full invariant complex subspaces and satisfying for all , this definition returns the matrix
on . Here , and the partial trace in the data sums over the index. The data require , so the reciprocal in this definition has a nonzero denominator.
QAlgorithms.Papers.Independent.Intakenext100.P60.pureEntropyBits
For finite types , with decidable equality on , and any vector equipped with its Euclidean norm, this defines
Here denotes continuous functional calculus, and is the total real logarithm to base . No normalization of or nonemptiness of either type is assumed; zero vectors and empty index types are included.
QAlgorithms.Papers.Independent.Intakenext100.P60.pureOutput
For any complex inner-product space with its normed additive commutative group structure, any natural number , any complex-linear map belonging to the specified structure, and any , this defines a complex matrix by
where has entry in row , column , and zero elsewhere. The structure requires and, for every , positive semidefinite block matrix , and vectors , that be real and nonnegative. The vector need not be normalized, need not be complete, and is included whenever such a structure exists.
QAlgorithms.Papers.Independent.Intakenext100.P60.signalBarycenter
For any normed additive commutative group , any type , any function , and any finite ensemble consisting of real weights summing to and vectors of norm , this defines
where is the ensemble size and the real weights act as complex scalars. No finiteness assumption on , or linearity, positivity, or normalization assumption on , is imposed. Zero weights and repeated vectors are allowed; an ensemble of size zero cannot satisfy the weight requirement.
QAlgorithms.Papers.Independent.Intakenext100.P60.signalCapacity
For any normed additive commutative group , any finite type with decidable equality, and any function , this defines the real supremum
The supremum ranges over every finite ensemble size , real weights summing to , and vectors with for every ; zero weights and repeated vectors are allowed. No linearity, positivity, or normalization of is assumed, and may be empty. This is the total real supremum, giving if the set is empty—for example, when has no unit vector—or unbounded above.
QAlgorithms.Papers.Independent.Intakenext100.P60.signalHolevo
For any normed additive commutative group , any finite type with decidable equality, any function , and any finite ensemble with , , and for every , this defines
The functional calculus and real logarithm are the total functions appearing in the definitions. There is no requirement that be linear or that its values be density matrices, and may be empty. Zero ensemble weights are allowed, although their associated vectors must still have norm .
QAlgorithms.Papers.Independent.Intakenext100.P60.tensorDualOutput
Let and be complex inner product spaces with their normed additive group structures, without any completeness assumption, and let be arbitrary natural numbers, including zero. Let and have complex linear maps and , respectively, which send the identity matrix to the identity operator and satisfy the following positivity condition: for every natural number , every positive semidefinite block matrix indexed by , and every family , the complex number is nonnegative; impose the corresponding condition on . For any vector in the completion of , the definition assigns the matrix indexed by pairs whose entries are
where has entry at row , column , and zero elsewhere, and the hat denotes the continuous operator on the completion obtained by extending the tensor product operator through the canonical map into the completion. No normalization of is required. If either output dimension is zero, the resulting matrix has an empty index set.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.