Definitions for Conjugate Degradability and the Quantum Capacity of Cloning Channels
DefinitionQAlgorithms_Papers_Independent_Support50_P01The objects the formalized statements of Conjugate Degradability and the Quantum Capacity of Cloning Channels (arXiv:0909.3297) are stated in. Each was checked against the paper by a blind read-back and a moderator.
ConjugateDegradable: PDF p.4, Eq.(2): a single CPTP witness, on all input operators. Transpose is the complex-linear extension of conjugation on density matrices.ConjugateAntidegradable: PDF p.4, Eq.(3): one CPTP antidegrading witness, independent of the input.blockCoherentInformation: PDF p.3, Eq.(1): n-use coherent information from the full tensor dilation.partialTransposeOutput: PDF p.5: partial transpose of the channel output (reference is first).ConjugateAntiChannel: PDF pp.13–14: channel-level conjugate antidegradability. Each channel may have its own environment dimension and witness. This includes CPTP, via its dilation.cloningCoefficient: PDF p.10, Eq.(22): squared occupation-basis cloning amplitude. All uses carry 1 ≤ N ≤ M and indices in their stated ranges.clonerDilation: PDF p.10, Eqs.(21),(22): the specified optimal universal qubit cloner, on the complete normalized occupation basis of Sym^N(C²), with symmetric receiver and minimal environment coordinates. No property of an arbitrary equal-marginal map is substituted for this concrete construction.cloningAlpha: PDF pp.16–17, Eqs.(47),(50): alpha is the squared amplitude, padded by zero ONLY outside 0,...,M-N. This also sets alpha_(M-N+1)=0 as prescribed.cloningBeta: PDF p.17, Eq.(50): scalar beta coefficients; no inconsistent physical ket from Eq.(46) is used to define these vectors.CloningMajorizes: PDF p.17: ordinary majorization for already decreasing vectors: prefix inequalities AND equal total sums, here with both probability normalizations.unruhWeight: PDF p.7, Eqs.(11)–(13): the fixed probability of sector k.unruhSectorDilation: PDF p.7, Eq.(12), and p.10, Eqs.(21),(22) with N=1,M=k+1: common normalized sector isometry, receiver dimension k+2, environment k+1. The positive square roots fix the occupation-basis phases.unruhBlockDilation: PDF p.7: full positive-block-length sector dilation. Sector labels are independent of the input, and the input can be entangled across every use.unruhBlockWeight: PDF p.7, Eq.(11): product of the fixed sector weights for memoryless uses.unruhReceiverBlock: PDF p.7: subnormalized receiver block of the full flagged channel, with all off-diagonal input matrix entries retained.unruhEnvironmentBlock: PDF p.7: genuine complement blocks from the very same sector isometries and weights. Both parties receive the common classical sector flag.UnruhReceiverIndex: PDF p.7: countable receiver direct sum, not a truncated register.UnruhEnvironmentIndex: PDF p.7: countable environment direct sum.unruhDilation: PDF pp.2–3,7: the COMMON countable Stinespring dilation, in coordinates. Both sector flags agree. Its coefficient is sqrt(product weight) times the sector tensor isometry; 0<z<1 ensures summability and normalization.unruhReceiver: PDF p.7, Eq.(11): full receiver matrix on the countable direct sum. Different sector flags have zero coherence, without removing input coherence.unruhComplement: PDF p.7: full complementary matrix, with the same countable flag.unruhReceiverEntropy: PDF p.7: entropy of the full receiver direct sum, from subnormalized finite blocks; includes the sector Shannon entropy. Convergence is a conclusion.unruhEnvironmentEntropy: PDF p.7: entropy of the true full complement, including its flags.unruhCoherentInformation: PDF pp.3,7: full infinite-output block coherent information.unruhCapacity: PDF pp.3,7: full regularized optimized information, over arbitrary entangled density matrices at every positive block length. No energy bound or finite-cutoff replacement. For 0<z<1 the entropy sums converge and rates are bounded.unruhSeriesTerm: PDF p.7: capacity series in bits, before the printed polylogarithm formula.unruhMixedInput: PDF p.7: I/2 on one use, in the tensor-coordinate convention.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Channel
import Definitions.Def_QAlgorithms_Defs_Ensemble
import Definitions.Def_QAlgorithms_Defs_BipartiteSeparability
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P67
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P22
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P08
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P41
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P40
/-!
Statements from Bradler–Dutil–Hayden–Muhammad, arXiv:0909.3297v1.
Page numbers below are PDF pages. All entropies are in bits.
The three source-level deferrals are recorded in the unit HARD.md.
Compilation is pending the batch mechanical handoff.
-/
noncomputable section
namespace QAlgorithms.Papers.Independent.Support50.P01
open scoped BigOperators Matrix ComplexConjugate ComplexOrder
open Filter
open QAlgorithms.Papers.Independent.Information100.P67
(receiverChannel complementaryChannel IsDegradable dilationPower maximumCoherentInformation)
open QAlgorithms.Papers.Independent.Information100.P22 (coherentInformation quantumCapacity)
open QAlgorithms.Papers.Independent.Information100.P08 (maximallyMixed)
open QAlgorithms.Papers.Independent.Dependency50.P41 (EntanglementBreaking)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
variable {a b e c : ℕ}
/-- PDF p.4, Eq.(2): a single CPTP witness, on all input operators.
Transpose is the complex-linear extension of conjugation on density matrices. -/
def ConjugateDegradable (U : Matrix (Fin b × Fin e) (Fin a) ℂ) : Prop :=
Uᴴ * U = 1 ∧ ∃ D : Superop (Fin b) (Fin e), IsChannel D ∧
∀ X, D (receiverChannel U X) = (complementaryChannel U X)ᵀ
/-- PDF p.4, Eq.(3): one CPTP antidegrading witness, independent of the input. -/
def ConjugateAntidegradable (U : Matrix (Fin b × Fin e) (Fin a) ℂ) : Prop :=
Uᴴ * U = 1 ∧ ∃ D : Superop (Fin e) (Fin b), IsChannel D ∧
∀ X, D (complementaryChannel U X) = (receiverChannel U X)ᵀ
/-- PDF p.3, Eq.(1): n-use coherent information from the full tensor dilation. -/
def blockCoherentInformation (U : Matrix (Fin b × Fin e) (Fin a) ℂ) (n : ℕ)
(rho : Matrix (Fin n → Fin a) (Fin n → Fin a) ℂ) : ℝ :=
let tau := dilationPower U n * rho * (dilationPower U n)ᴴ
vnEntropy (traceRight tau) - vnEntropy (traceLeft tau)
/-- PDF p.5: partial transpose of the channel output (reference is first). -/
def partialTransposeOutput {r d : ℕ}
(X : Matrix (Fin r × Fin d) (Fin r × Fin d) ℂ) :
Matrix (Fin r × Fin d) (Fin r × Fin d) ℂ :=
fun p q => X (p.1,q.2) (q.1,p.2)
/-- PDF pp.13–14: channel-level conjugate antidegradability. Each channel may have
its own environment dimension and witness. This includes CPTP, via its dilation. -/
def ConjugateAntiChannel (Phi : Superop (Fin a) (Fin b)) : Prop :=
∃ e : ℕ, 0 < e ∧ ∃ U : Matrix (Fin b × Fin e) (Fin a) ℂ,
ConjugateAntidegradable U ∧ receiverChannel U = Phi
/-- PDF p.10, Eq.(22): squared occupation-basis cloning amplitude.
All uses carry 1 ≤ N ≤ M and indices in their stated ranges. -/
def cloningCoefficient (N M k j : ℕ) : ℝ :=
((Nat.factorial (M-N) : ℝ) * Nat.factorial (N+1) *
Nat.factorial (k+j) * Nat.factorial (M-k-j)) /
((Nat.factorial k : ℝ) * Nat.factorial (N-k) * Nat.factorial (M+1) *
Nat.factorial j * Nat.factorial (M-N-j))
/-- PDF p.10, Eqs.(21),(22): the specified optimal universal qubit cloner,
on the complete normalized occupation basis of Sym^N(C²), with symmetric receiver
and minimal environment coordinates. No property of an arbitrary equal-marginal map
is substituted for this concrete construction. -/
def clonerDilation (N M : ℕ) :
Matrix (Fin (M+1) × Fin (M-N+1)) (Fin (N+1)) ℂ :=
fun bj k => if bj.1.val = k.val + bj.2.val then
(Real.sqrt (cloningCoefficient N M k.val bj.2.val) : ℂ) else 0
/-- PDF pp.16–17, Eqs.(47),(50): alpha is the squared amplitude, padded by zero
ONLY outside 0,...,M-N. This also sets alpha_(M-N+1)=0 as prescribed. -/
def cloningAlpha (N M j : ℕ) : ℝ :=
if j ≤ M-N then
((N+1 : ℕ) : ℝ) / (M+1) *
((Nat.factorial (M-N) : ℝ) * Nat.factorial (M-j)) /
((Nat.factorial (M-N-j) : ℝ) * Nat.factorial M)
else 0
/-- PDF p.17, Eq.(50): scalar beta coefficients; no inconsistent physical ket
from Eq.(46) is used to define these vectors. -/
def cloningBeta (N M j : ℕ) : ℝ :=
cloningAlpha N M j * ((M-j : ℕ) : ℝ) / M + cloningAlpha N M (j+1) * (j+1) / M
/-- PDF p.17: ordinary majorization for already decreasing vectors: prefix
inequalities AND equal total sums, here with both probability normalizations. -/
def CloningMajorizes (N M : ℕ) : Prop :=
(∀ j ≤ M-N, 0 ≤ cloningAlpha N M j ∧ 0 ≤ cloningBeta N M j) ∧
(∀ j < M-N, cloningAlpha N M (j+1) ≤ cloningAlpha N M j ∧
cloningBeta N M (j+1) ≤ cloningBeta N M j) ∧
(∀ k ≤ M-N+1,
(∑ j ∈ Finset.range k, cloningAlpha N M j) ≤ ∑ j ∈ Finset.range k, cloningBeta N M j) ∧
(∑ j ∈ Finset.range (M-N+1), cloningAlpha N M j) = 1 ∧
(∑ j ∈ Finset.range (M-N+1), cloningBeta N M j) = 1
/-- PDF p.7, Eqs.(11)–(13): the fixed probability of sector k. -/
def unruhWeight (z : ℝ) (k : ℕ) : ℝ :=
(1-z)^3 * z^k * (k+1) * (k+2) / 2
/-- PDF p.7, Eq.(12), and p.10, Eqs.(21),(22) with N=1,M=k+1:
common normalized sector isometry, receiver dimension k+2, environment k+1.
The positive square roots fix the occupation-basis phases. -/
def unruhSectorDilation (k : ℕ) :
Matrix (Fin (k+2) × Fin (k+1)) (Fin 2) ℂ :=
fun bj x => if bj.1.val = x.val + bj.2.val then
(Real.sqrt (2 * (if x.val = 0 then ((k+1-bj.2.val : ℕ) : ℝ)
else (bj.2.val+1 : ℕ)) / ((k+1 : ℝ)*(k+2))) : ℂ) else 0
/-- PDF p.7: full positive-block-length sector dilation. Sector labels are
independent of the input, and the input can be entangled across every use. -/
def unruhBlockDilation {n : ℕ} (ks : Fin n → ℕ) :
Matrix (((i : Fin n) → Fin (ks i+2)) × ((i : Fin n) → Fin (ks i+1)))
(Fin n → Fin 2) ℂ :=
fun bj x => ∏ i, unruhSectorDilation (ks i) (bj.1 i,bj.2 i) (x i)
/-- PDF p.7, Eq.(11): product of the fixed sector weights for memoryless uses. -/
def unruhBlockWeight {n : ℕ} (z : ℝ) (ks : Fin n → ℕ) : ℝ :=
∏ i, unruhWeight z (ks i)
/-- PDF p.7: subnormalized receiver block of the full flagged channel, with
all off-diagonal input matrix entries retained. -/
def unruhReceiverBlock {n : ℕ} (z : ℝ) (ks : Fin n → ℕ)
(rho : Matrix (Fin n → Fin 2) (Fin n → Fin 2) ℂ) :
Matrix ((i : Fin n) → Fin (ks i+2)) ((i : Fin n) → Fin (ks i+2)) ℂ :=
(unruhBlockWeight z ks : ℂ) •
traceRight (unruhBlockDilation ks * rho * (unruhBlockDilation ks)ᴴ)
/-- PDF p.7: genuine complement blocks from the very same sector isometries
and weights. Both parties receive the common classical sector flag. -/
def unruhEnvironmentBlock {n : ℕ} (z : ℝ) (ks : Fin n → ℕ)
(rho : Matrix (Fin n → Fin 2) (Fin n → Fin 2) ℂ) :
Matrix ((i : Fin n) → Fin (ks i+1)) ((i : Fin n) → Fin (ks i+1)) ℂ :=
(unruhBlockWeight z ks : ℂ) •
traceLeft (unruhBlockDilation ks * rho * (unruhBlockDilation ks)ᴴ)
/-- PDF p.7: countable receiver direct sum, not a truncated register. -/
abbrev UnruhReceiverIndex (n : ℕ) :=
Sigma fun ks : Fin n → ℕ => (i : Fin n) → Fin (ks i+2)
/-- PDF p.7: countable environment direct sum. -/
abbrev UnruhEnvironmentIndex (n : ℕ) :=
Sigma fun ks : Fin n → ℕ => (i : Fin n) → Fin (ks i+1)
/-- PDF pp.2–3,7: the COMMON countable Stinespring dilation, in coordinates.
Both sector flags agree. Its coefficient is sqrt(product weight) times the
sector tensor isometry; 0<z<1 ensures summability and normalization. -/
def unruhDilation (z : ℝ) (n : ℕ) :
Matrix (UnruhReceiverIndex n × UnruhEnvironmentIndex n) (Fin n → Fin 2) ℂ :=
fun be x => if h : be.1.1 = be.2.1 then
(Real.sqrt (unruhBlockWeight z be.1.1) : ℂ) *
unruhBlockDilation be.1.1 (be.1.2, h.symm ▸ be.2.2) x else 0
/-- PDF p.7, Eq.(11): full receiver matrix on the countable direct sum.
Different sector flags have zero coherence, without removing input coherence. -/
def unruhReceiver {n : ℕ} (z : ℝ)
(rho : Matrix (Fin n → Fin 2) (Fin n → Fin 2) ℂ) :
Matrix (UnruhReceiverIndex n) (UnruhReceiverIndex n) ℂ :=
fun p q => if h : p.1 = q.1 then
unruhReceiverBlock z p.1 rho p.2 (h.symm ▸ q.2) else 0
/-- PDF p.7: full complementary matrix, with the same countable flag. -/
def unruhComplement {n : ℕ} (z : ℝ)
(rho : Matrix (Fin n → Fin 2) (Fin n → Fin 2) ℂ) :
Matrix (UnruhEnvironmentIndex n) (UnruhEnvironmentIndex n) ℂ :=
fun p q => if h : p.1 = q.1 then
unruhEnvironmentBlock z p.1 rho p.2 (h.symm ▸ q.2) else 0
/-- PDF p.7: entropy of the full receiver direct sum, from subnormalized
finite blocks; includes the sector Shannon entropy. Convergence is a conclusion. -/
def unruhReceiverEntropy {n : ℕ} (z : ℝ)
(rho : Matrix (Fin n → Fin 2) (Fin n → Fin 2) ℂ) : ℝ :=
∑' ks : Fin n → ℕ, vnEntropy (unruhReceiverBlock z ks rho)
/-- PDF p.7: entropy of the true full complement, including its flags. -/
def unruhEnvironmentEntropy {n : ℕ} (z : ℝ)
(rho : Matrix (Fin n → Fin 2) (Fin n → Fin 2) ℂ) : ℝ :=
∑' ks : Fin n → ℕ, vnEntropy (unruhEnvironmentBlock z ks rho)
/-- PDF pp.3,7: full infinite-output block coherent information. -/
def unruhCoherentInformation {n : ℕ} (z : ℝ)
(rho : Matrix (Fin n → Fin 2) (Fin n → Fin 2) ℂ) : ℝ :=
unruhReceiverEntropy z rho - unruhEnvironmentEntropy z rho
/-- PDF pp.3,7: full regularized optimized information, over arbitrary
entangled density matrices at every positive block length. No energy bound or
finite-cutoff replacement. For 0<z<1 the entropy sums converge and rates are bounded. -/
def unruhCapacity (z : ℝ) : ℝ :=
sSup {v | ∃ n : ℕ, 0 < n ∧
∃ rho : Matrix (Fin n → Fin 2) (Fin n → Fin 2) ℂ,
IsDensityMatrix rho ∧ v = unruhCoherentInformation z rho / (n : ℝ)}
/-- PDF p.7: capacity series in bits, before the printed polylogarithm formula. -/
def unruhSeriesTerm (z : ℝ) (k : ℕ) : ℝ :=
unruhWeight z k * (Real.logb 2 (k+2) - Real.logb 2 (k+1))
/-- PDF p.7: I/2 on one use, in the tensor-coordinate convention. -/
def unruhMixedInput : Matrix (Fin 1 → Fin 2) (Fin 1 → Fin 2) ℂ :=
(2 : ℂ)⁻¹ • 1
/-- Occupation coefficients pin the 1→2 normalization, PDF pp.10,16–17. -/
example : cloningCoefficient 1 2 0 0 = 2/3 ∧ cloningAlpha 1 2 0 = 2/3 ∧
cloningBeta 1 2 0 = 5/6 := by
norm_num [cloningCoefficient, cloningAlpha, cloningBeta, Nat.factorial]
/-- Identity-cloner boundary, PDF pp.8–10; N=M=1 has no adjacent coefficient pair. -/
example : cloningCoefficient 1 1 0 0 = 1 ∧ cloningAlpha 1 1 0 = 1 ∧ cloningBeta 1 1 0 = 1 := by
norm_num [cloningCoefficient, cloningAlpha, cloningBeta, Nat.factorial]
/-- At z=0 the sector weights have only the k=0 identity sector, PDF p.7. -/
example : unruhWeight 0 0 = 1 ∧ unruhWeight 0 1 = 0 := by
norm_num [unruhWeight]
/-- The k=0 sector transmits the computational basis state 0 exactly, PDF p.7. -/
example : unruhSectorDilation 0 (0,0) 0 = 1 := by
norm_num [unruhSectorDilation]
/-- Partial transpose is an involution, PDF p.5. -/
example {r d : ℕ} (X : Matrix (Fin r × Fin d) (Fin r × Fin d) ℂ) :
partialTransposeOutput (partialTransposeOutput X) = X := rfl
/-- The common-dilation maps are linear at zero, PDF pp.2–3. Zero is not a state. -/
example (U : Matrix (Fin b × Fin e) (Fin a) ℂ) :
receiverChannel U 0 = 0 ∧ complementaryChannel U 0 = 0 := by
constructor <;> ext i j <;>
simp [receiverChannel, complementaryChannel, traceRight, traceLeft]
/-- The one-dimensional maximally mixed state is the identity, PDF pp.10–11. -/
example : maximallyMixed 1 = 1 := by
simp [maximallyMixed]
/-- The empty tensor convention is one; zero-length blocks are excluded from rates, PDF p.3. -/
example (z : ℝ) : unruhBlockWeight (n := 0) z Fin.elim0 = 1 := by
simp [unruhBlockWeight]
/-- Distinct sector flags are incoherent in the full receiver, PDF p.7, Eq.(11). -/
example {n : ℕ} (z : ℝ) (rho : Matrix (Fin n → Fin 2) (Fin n → Fin 2) ℂ)
(p q : UnruhReceiverIndex n) (h : p.1 ≠ q.1) :
unruhReceiver z rho p q = 0 := by
simp [unruhReceiver, h]
/-- The full common dilation requires both parties to have the same flag, PDF p.7. -/
example (z : ℝ) (n : ℕ) (be : UnruhReceiverIndex n × UnruhEnvironmentIndex n)
(x : Fin n → Fin 2) (h : be.1.1 ≠ be.2.1) :
unruhDilation z n be x = 0 := by
simp [unruhDilation, h]
end QAlgorithms.Papers.Independent.Support50.P01
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Support50.P01.CloningMajorizes
For natural numbers , put , where is subtraction truncated at zero, and define for and otherwise, and , using real division with division by zero equal to zero. This predicate is the conjunction that for every natural ; and for every ; for every natural ; and . The sums are empty and equal zero, and the monotonicity condition is vacuous when . No assumption or is included, but the normalization conditions cannot hold when or when .
QAlgorithms.Papers.Independent.Support50.P01.ConjugateAntiChannel
For natural numbers , including zero, and an arbitrary map from complex matrices to complex matrices, this predicate means that there exist a positive natural number and a complex matrix such that , and there exists a finite Kraus family of matrices , for some , satisfying , with the following properties for every complex matrix : writing , , and , one has and . These identities apply to all matrices . Although and are not explicitly required to be positive, makes the Kraus completeness equation impossible because .
QAlgorithms.Papers.Independent.Support50.P01.ConjugateAntidegradable
For natural numbers , including zero, and a complex matrix with rows indexed by and columns, this predicate means that and there exists a map from complex matrices to complex matrices admitting a finite Kraus representation , where , each is , and , such that for every complex matrix , setting , one has , where and . The transpose is ordinary transpose, and need not be a density matrix. All dimensions and the Kraus-family size may be zero, subject to the displayed equations; in particular, the isometry equation requires .
QAlgorithms.Papers.Independent.Support50.P01.ConjugateDegradable
For natural numbers , including zero, and a complex matrix with rows indexed by and columns indexed by , this predicate means that and there exists a map from complex matrices to complex matrices admitting a finite Kraus representation , where , each is , and , such that for every complex matrix , setting , one has , where and . The transpose is ordinary transpose, and is unrestricted. Empty dimensions and an empty Kraus family are permitted by the quantifiers; the isometry equation requires .
QAlgorithms.Papers.Independent.Support50.P01.UnruhEnvironmentIndex
For every natural number , this abbreviates the type of pairs , where is any tuple of natural numbers and satisfies for every . The allowed range of each depends on the corresponding ; different tuples give distinct pairs even when their -coordinates agree numerically. When , there is exactly one such pair, consisting of two empty tuples; for , the index type is countably infinite.
QAlgorithms.Papers.Independent.Support50.P01.UnruhReceiverIndex
For every natural number , this abbreviates the type of pairs , where is any tuple of natural numbers and satisfies for every . The allowed range of each depends on the corresponding ; different tuples give distinct pairs even when their -coordinates agree numerically. When , there is exactly one such pair, consisting of two empty tuples; for , the index type is countably infinite.
QAlgorithms.Papers.Independent.Support50.P01.blockCoherentInformation
For arbitrary natural numbers , a complex matrix , and an arbitrary complex matrix indexed by length- strings over , define by , where , , and are strings over the -, -, and -element sets, respectively, and put . The defined real number is , where , , and with applied through continuous functional calculus. No isometry, positivity, or normalization hypothesis is imposed. Zero dimensions are allowed; when , every string-index set is a singleton, the product defining is , and the defined difference is .
QAlgorithms.Papers.Independent.Support50.P01.clonerDilation
For arbitrary natural numbers , this defines a complex matrix with rows satisfying and , and columns satisfying , where denotes subtraction truncated at zero. Its entry is zero unless ; when that equality holds, its entry is the nonnegative real square root, regarded as a complex number, of . This definition imposes no assumption and asserts no isometry property; all three indexing dimensions are positive even when or is zero.
QAlgorithms.Papers.Independent.Support50.P01.cloningAlpha
For any natural numbers , write . This defines when , and defines otherwise, with all quantities interpreted in . No assumption is made, and the denominator is always positive. In particular, if , only can be nonzero, with value ; if , that value is .
QAlgorithms.Papers.Independent.Support50.P01.cloningBeta
For any natural numbers , let denote subtraction truncated at zero and define for , and otherwise. The defined real number is . There are no restrictions on . Real division by zero is defined to be zero, so this value is zero for every when .
QAlgorithms.Papers.Independent.Support50.P01.cloningCoefficient
For every four natural numbers , this defines the real number , where denotes subtraction truncated at zero, and all factorials are converted to real numbers. No ordering restrictions on are imposed, so the formula also applies when , , or . Every denominator factorial is positive, including , so the denominator never vanishes.
QAlgorithms.Papers.Independent.Support50.P01.partialTransposeOutput
For any natural numbers , including zero, and any complex matrix indexed by pairs with and , this defines the matrix on the same index set by . Thus it transposes the second coordinate while retaining the first-coordinate row and column positions, without complex conjugation or any positivity hypothesis. If either dimension is zero, the index set is empty.
QAlgorithms.Papers.Independent.Support50.P01.unruhBlockDilation
For every natural number , including , and every tuple of natural numbers, this defines a complex matrix with columns indexed by and rows indexed by pairs , where and . Its entries are
Here in the single-coordinate formula is the integer or , the square roots are real and then regarded as complex numbers, and , so involves no truncated-subtraction edge case. When , both index sets are singletons and the sole matrix entry is the empty product .
QAlgorithms.Papers.Independent.Support50.P01.unruhBlockWeight
For every natural number , every real number , and every tuple of natural numbers, this defines the real number
There is no restriction placing in a probability interval and no assertion that this number is nonnegative or normalized. Powers use the convention , including . When , the empty product is , independently of .
QAlgorithms.Papers.Independent.Support50.P01.unruhCapacity
For every real number , this defines the real number
where is indexed by , with applied by continuous functional calculus, and
Here , and , with , , , and
Each partial trace sums the diagonal indices of the indicated register. The definition excludes , permits every real , and imposes no summability hypothesis: each displayed infinite sum is the total real-valued sum, which is for a nonsummable family. The real supremum likewise uses its total convention, giving if its defining set is unbounded above.
QAlgorithms.Papers.Independent.Support50.P01.unruhCoherentInformation
For every natural number , real number , and arbitrary complex matrix indexed by , this defines the difference of two separately evaluated real total sums,
Here the functional calculus is the total real continuous functional calculus, and the finite blocks are specified by
with , , and . No positivity or normalization assumption on , restriction on , or summability assumption is imposed; either total sum is assigned when its own family is not summable. For , both sums equal , so the defined difference is .
QAlgorithms.Papers.Independent.Support50.P01.unruhComplement
For every natural number , real number , and arbitrary complex matrix indexed by , this defines a complex matrix indexed by pairs , where are arbitrary natural numbers and . Define
where and . The defined matrix is block diagonal in , with entries
No density-matrix assumption on , restriction on , or convergence condition on this generally infinite indexed matrix is imposed. For , it is the original one-entry matrix .
QAlgorithms.Papers.Independent.Support50.P01.unruhDilation
For every real number and natural number , this defines a complex matrix whose columns are and whose rows are pairs , with arbitrary natural-number tuples , bounds , and bounds . Its entry is zero unless ; when these tuples agree, its entry is
All square roots are real and then viewed as complex numbers; in particular, a negative argument to a real square root gives . No restriction on , summability condition, or isometry property is part of this definition. When , the matrix has one row and one column, and its entry is .
QAlgorithms.Papers.Independent.Support50.P01.unruhEnvironmentBlock
For every natural number , real number , natural-number tuple , and arbitrary complex matrix indexed by , this defines a matrix indexed by tuples with . Set
where and . The defined matrix has entries
Thus the first row coordinate of is summed out. Neither positivity nor trace normalization of , nor any restriction on , is assumed. For , this returns the original one-entry matrix .
QAlgorithms.Papers.Independent.Support50.P01.unruhEnvironmentEntropy
For every natural number , real number , and arbitrary complex matrix indexed by , this defines the real total sum
where denotes the total real continuous functional calculus. To specify each finite matrix , let
Here , , and . Neither normalization nor positivity of these matrices is assumed, and is unrestricted. No summability hypothesis is required: the real total-sum operation returns if the family is not summable. When , there is one empty tuple , its block is , and the value is .
QAlgorithms.Papers.Independent.Support50.P01.unruhMixedInput
This defines the complex matrix indexed by the two functions to be one half of the identity:
Thus its two diagonal entries are and its off-diagonal entries are .
QAlgorithms.Papers.Independent.Support50.P01.unruhReceiver
For every natural number , real number , and arbitrary complex matrix indexed by , this defines a complex matrix indexed by pairs , where are arbitrary natural numbers and . Define
where and . The defined matrix is block diagonal in , with entries
No density-matrix assumption on , restriction on , or convergence condition on this generally infinite indexed matrix is imposed. For , it is the original one-entry matrix .
QAlgorithms.Papers.Independent.Support50.P01.unruhReceiverBlock
For every natural number , real number , natural-number tuple , and arbitrary complex matrix indexed by , this defines a matrix indexed by tuples with . Set
where and . The defined matrix has entries
Thus the second row coordinate of is summed out. Neither positivity nor trace normalization of , nor any restriction on , is assumed. For , this returns the original one-entry matrix .
QAlgorithms.Papers.Independent.Support50.P01.unruhReceiverEntropy
For every natural number , real number , and arbitrary complex matrix indexed by , this defines the real total sum
where denotes the total real continuous functional calculus. To specify each finite matrix , let
Here , , and . Neither normalization nor positivity of these matrices is assumed, and is unrestricted. No summability hypothesis is required: the real total-sum operation returns if the family is not summable. When , there is one empty tuple , its block is , and the value is .
QAlgorithms.Papers.Independent.Support50.P01.unruhSectorDilation
For every natural number , including zero, this defines a complex matrix with rows satisfying and , and columns . The entry is zero unless ; when this equality holds, it is if , and if , with these real square roots regarded as complex numbers. The subtraction in is natural-number subtraction truncated at zero, though the row bound ensures that it is positive here, and the denominator is always positive. At the matrix is the identity under the identification of its rows with ; the definition itself asserts no isometry property.
QAlgorithms.Papers.Independent.Support50.P01.unruhSeriesTerm
For every and every natural number , including , this defines
There is no restriction on , so the coefficient need not be nonnegative; natural powers use , including when .
QAlgorithms.Papers.Independent.Support50.P01.unruhWeight
For every real number and natural number , including , this defines the real number . There is no restriction on , and the definition imposes no nonnegativity or normalization condition. Natural powers use , including at ; consequently the value at is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.