Definitions for Unbounded number of channel uses are required to see quantum capacity
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P70The objects the formalized statements of Unbounded number of channel uses are required to see quantum capacity (arXiv:1408.5115) are stated in. Each was checked against the paper by a blind read-back and a moderator.
cubittBlockInformation: PDF p.1: Q^(n), with the factor 1/n and a tensor channel on arbitrary joint inputs. Only positive n are used in result statements. The accepted quantumCapacity is the supremum over precisely these normalized positive-block rates.cubittWholeErasure: PDF p.5: E_p on the WHOLE input, with a separate first output flag. The trace factor specifies the linear map on every operator, not only on states.cubittSwitched: PDF p.5: the measured and RETAINED switch, sum_i P_i tensor N_i. Only diagonal switch blocks survive; off-diagonal main-input entries within a block survive.cubittSelectedInput: PDF p.5, proof of Lemma 1: deterministic switch input with arbitrary main density.cubittNormalizedChoi: PDF pp.6--7: normalized Choi matrix, in input:output order.cubittOutputTranspose: PDF p.7: partial transpose on the output in the computational basis.CubittPPTBinding: PDF p.7: a channel is PPT-binding iff its Choi matrix is PPT. CPTP is part of the predicate; no assumption about its coherent information is inserted.cubittNoisySwitch: PDF p.6, S15--S16: switch 0 applies E_kappa after Gamma; switch 1 applies E_p. Both output flags, the switch, and the full main output are retained.cubittErasureThreshold: PDF pp.3,8,11: the lower erasure threshold, with a REAL exponent -1/n.CubittParameters: PDF p.6: paper-specific parameters; admissibility is stated separately.CubittValid: PDF pp.5--7: positive numbers of shares/copies, d>=2, and physical S18 weights. The results choose q=1/3; q<=1/2 is the positivity range of that construction.CubittShare: PDF p.6: A_i consists of r*m d-dimensional factors.CubittShield: PDF p.6: A consists of N shares; finite functions preserve all named factors.CubittMain: PDF p.6: main input aA and equal-dimensional output bB, key qubit first.cubittSymmetricState: PDF p.7: normalized projector onto the symmetric subspace, (I+swap)/(d(d+1)).cubittAntisymmetricState: PDF p.7: normalized antisymmetric projector, (I-swap)/(d(d-1)); used only at d>=2.cubittHidingOmega: PDF p.7: omega on C_k, tensoring the equal mixture over all N*r pairs.cubittHidingSigma: PDF p.7: sigma on C_k, tensoring the symmetric state over all N*r pairs.cubittRawChoi: PDF p.6, S18: the unnormalized three key blocks, reordered across aA:bB. Products over k retain q/2 in EACH copy, including the off-diagonal block's sign.cubittZeta: PDF pp.6--7, S18: COMPUTED normalized Choi state. For admissible parameters its trace normalizer is 2*(q^m+(1/2-q)^m)>0.cubittGammaChannel: PDF pp.6--7: inverse normalized Choi transform; Gamma is computed from S18. Its input-reference marginal is I/dim(CubittMain), so this is CPTP on admissible parameters.cubittPaperChannel: PDF p.6, S15: the fully specified paper channel, without any capacity assumption.CubittPPTCondition: PDF p.7, S19: sufficient PPT condition; the exponent is the product r*N.cubittRepetitions: PDF pp.7--8: integer ceiling retained from Lemma 2 (the p.10 shorthand omits it).cubittApproximationParameters: PDF p.7, Lemma 2: q=1/3 and the prescribed integer repetition count.cubittInsertFirst: PDF p.7, S20: reinsert the first shield share, indexed by 0 in Lean.cubittFirstShareState: PDF p.7, S20: actual partial trace over A_2 B_2 ... A_N B_N of the computed cubittZeta. The rho/cubittZeta change in Lemma 2 is resolved by this marginal, not by an arbitrary state.cubittPrivateState: PDF p.6, S12: twisted Bell pair with arbitrary density sigma and key-controlled unitaries. Coordinates are aA:bB; this is S10--S11 expanded in the fixed basis.CubittPerfectPbit: PDF p.6, S10--S12: normalized perfect private bit; shield dimension is unrestricted.cubittApproximationBound: PDF pp.7--8, Lemma 2: full trace-norm approximation, not half trace distance.cubittContinuityLoss: PDF p.10, S52: continuity loss; applied only with 0<=tau<1.cubittExplicitShares: PDF p.11: final concrete N, which grows with the requested undetectable block length.cubittExplicitParameters: PDF pp.10--11: d=2Nr, a product (not a power).
import Mathlib
import Definitions.Def_QAlgorithms_Defs_Channel
import Definitions.Def_QAlgorithms_Defs_Ensemble
import Definitions.Def_QAlgorithms_Defs_Measurement
import Definitions.Def_QAlgorithms_Defs_MatrixDistances
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P22
/-!
Statements for arXiv:1408.5115v1. All page numbers are PDF pages.
All spaces are finite matrices in the fixed computational basis; entropy is in bits.
Only the seven result declarations have sorry. Paper-specific constructors have complete bodies.
The capacity definitions are reused from the pinned accepted Information100.P22 (lines 854--877),
under the independent-paper override permitting accepted library imports. Compilation and independent moderation are pending.
-/
namespace QAlgorithms.Papers.Independent.Intakenext100.P70
noncomputable section
open scoped Matrix ComplexConjugate ComplexOrder
attribute [local instance] Classical.propDecidable Classical.decEq
open QAlgorithms.Papers.Independent.Information100.P22
(Op coherentInformation singleUseInformation quantumCapacity mixed)
/-- PDF p.1: Q^(n), with the factor 1/n and a tensor channel on arbitrary joint inputs.
Only positive n are used in result statements. The accepted quantumCapacity is the
supremum over precisely these normalized positive-block rates. -/
def cubittBlockInformation {I J : Type*} [Fintype I] [Fintype J]
[DecidableEq I] [DecidableEq J] (Phi : Superop I J) (n : ℕ) : ℝ :=
singleUseInformation (piSuperop (fun _ : Fin n => Phi)) / (n : ℝ)
/-- PDF p.5: E_p on the WHOLE input, with a separate first output flag.
The trace factor specifies the linear map on every operator, not only on states. -/
def cubittWholeErasure {I : Type*} [Fintype I] [DecidableEq I] (p : ℝ) :
Superop I (Bool × I) :=
fun X x y =>
if x.1 = y.1 then
if x.1 then (p : ℂ) * X.trace * mixed I x.2 y.2
else (1 - (p : ℂ)) * X x.2 y.2
else 0
/-- PDF p.5: the measured and RETAINED switch, sum_i P_i tensor N_i.
Only diagonal switch blocks survive; off-diagonal main-input entries within a block survive. -/
def cubittSwitched {S A B : Type*} (branches : S → Superop A B) :
Superop (S × A) (S × B) :=
fun X x y => if x.1 = y.1 then
branches x.1 (fun a b => X (x.1, a) (x.1, b)) x.2 y.2 else 0
/-- PDF p.5, proof of Lemma 1: deterministic switch input with arbitrary main density. -/
def cubittSelectedInput {S A : Type*} (i : S) (rho : Op A) : Op (S × A) :=
fun x y => if x.1 = i ∧ y.1 = i then rho x.2 y.2 else 0
/-- PDF pp.6--7: normalized Choi matrix, in input:output order. -/
def cubittNormalizedChoi {I J : Type*} [Fintype I] [DecidableEq I]
(Phi : Superop I J) : Op (I × J) :=
fun x y => Phi (Matrix.single x.1 y.1 1) x.2 y.2 / (Fintype.card I : ℂ)
/-- PDF p.7: partial transpose on the output in the computational basis. -/
def cubittOutputTranspose {I J : Type*} (X : Op (I × J)) : Op (I × J) :=
fun x y => X (x.1, y.2) (y.1, x.2)
/-- PDF p.7: a channel is PPT-binding iff its Choi matrix is PPT.
CPTP is part of the predicate; no assumption about its coherent information is inserted. -/
def CubittPPTBinding {I J : Type*} [Fintype I] [Fintype J] [DecidableEq I]
(Phi : Superop I J) : Prop :=
IsChannel Phi ∧ (cubittOutputTranspose (cubittNormalizedChoi Phi)).PosSemidef
/-- PDF p.6, S15--S16: switch 0 applies E_kappa after Gamma; switch 1 applies E_p.
Both output flags, the switch, and the full main output are retained. -/
def cubittNoisySwitch {I : Type*} [Fintype I] [DecidableEq I]
(Gamma : Superop I I) (kappa p : ℝ) : Superop (Bool × I) (Bool × (Bool × I)) :=
cubittSwitched fun s => if s then cubittWholeErasure p else cubittWholeErasure kappa ∘ Gamma
/-- PDF pp.3,8,11: the lower erasure threshold, with a REAL exponent -1/n. -/
def cubittErasureThreshold (n : ℕ) (kappa : ℝ) : ℝ :=
(1 + kappa ^ n) ^ (-(1 : ℝ) / (n : ℝ))
/-- PDF p.6: paper-specific parameters; admissibility is stated separately. -/
structure CubittParameters where
N : ℕ
r : ℕ
m : ℕ
d : ℕ
q : ℝ
/-- PDF pp.5--7: positive numbers of shares/copies, d>=2, and physical S18 weights.
The results choose q=1/3; q<=1/2 is the positivity range of that construction. -/
def CubittValid (P : CubittParameters) : Prop :=
0 < P.N ∧ 0 < P.r ∧ 0 < P.m ∧ 2 ≤ P.d ∧ 0 < P.q ∧ P.q ≤ 1 / 2
/-- PDF p.6: A_i consists of r*m d-dimensional factors. -/
abbrev CubittShare (r m d : ℕ) := Fin r → Fin m → Fin d
/-- PDF p.6: A consists of N shares; finite functions preserve all named factors. -/
abbrev CubittShield (P : CubittParameters) := Fin P.N → CubittShare P.r P.m P.d
/-- PDF p.6: main input aA and equal-dimensional output bB, key qubit first. -/
abbrev CubittMain (P : CubittParameters) := Bool × CubittShield P
/-- PDF p.7: normalized projector onto the symmetric subspace, (I+swap)/(d(d+1)). -/
def cubittSymmetricState (d : ℕ) : Op (Fin d × Fin d) :=
fun x y => ((if x = y then 1 else 0) +
(if x.1 = y.2 ∧ x.2 = y.1 then 1 else 0)) / ((d : ℂ) * ((d : ℂ) + 1))
/-- PDF p.7: normalized antisymmetric projector, (I-swap)/(d(d-1)); used only at d>=2. -/
def cubittAntisymmetricState (d : ℕ) : Op (Fin d × Fin d) :=
fun x y => ((if x = y then 1 else 0) -
(if x.1 = y.2 ∧ x.2 = y.1 then 1 else 0)) / ((d : ℂ) * ((d : ℂ) - 1))
/-- PDF p.7: omega on C_k, tensoring the equal mixture over all N*r pairs. -/
def cubittHidingOmega (P : CubittParameters) (k : Fin P.m)
(x y : CubittShield P × CubittShield P) : ℂ :=
∏ i, ∏ j, (cubittSymmetricState P.d (x.1 i j k, x.2 i j k) (y.1 i j k, y.2 i j k) +
cubittAntisymmetricState P.d (x.1 i j k, x.2 i j k) (y.1 i j k, y.2 i j k)) / 2
/-- PDF p.7: sigma on C_k, tensoring the symmetric state over all N*r pairs. -/
def cubittHidingSigma (P : CubittParameters) (k : Fin P.m)
(x y : CubittShield P × CubittShield P) : ℂ :=
∏ i, ∏ j, cubittSymmetricState P.d (x.1 i j k, x.2 i j k) (y.1 i j k, y.2 i j k)
/-- PDF p.6, S18: the unnormalized three key blocks, reordered across aA:bB.
Products over k retain q/2 in EACH copy, including the off-diagonal block's sign. -/
def cubittRawChoi (P : CubittParameters) : Op (CubittMain P × CubittMain P) :=
fun x y =>
let u := (x.1.2, x.2.2)
let v := (y.1.2, y.2.2)
if x.1.1 = x.2.1 ∧ y.1.1 = y.2.1 then
if x.1.1 = y.1.1 then
∏ k, (P.q : ℂ) / 2 * (cubittHidingOmega P k u v + cubittHidingSigma P k u v)
else
∏ k, (P.q : ℂ) / 2 * (cubittHidingOmega P k u v - cubittHidingSigma P k u v)
else if x.1.1 ≠ x.2.1 ∧ x.1.1 = y.1.1 ∧ x.2.1 = y.2.1 then
∏ k, ((1 / 2 : ℂ) - (P.q : ℂ)) * cubittHidingSigma P k u v
else 0
/-- PDF pp.6--7, S18: COMPUTED normalized Choi state.
For admissible parameters its trace normalizer is 2*(q^m+(1/2-q)^m)>0. -/
def cubittZeta (P : CubittParameters) : Op (CubittMain P × CubittMain P) :=
(2 * ((P.q : ℂ) ^ P.m + ((1 / 2 : ℂ) - (P.q : ℂ)) ^ P.m))⁻¹ • cubittRawChoi P
/-- PDF pp.6--7: inverse normalized Choi transform; Gamma is computed from S18.
Its input-reference marginal is I/dim(CubittMain), so this is CPTP on admissible parameters. -/
def cubittGammaChannel (P : CubittParameters) : Superop (CubittMain P) (CubittMain P) :=
fun X b c => (Fintype.card (CubittMain P) : ℂ) *
∑ a, ∑ a2, X a a2 * cubittZeta P (a, b) (a2, c)
/-- PDF p.6, S15: the fully specified paper channel, without any capacity assumption. -/
def cubittPaperChannel (P : CubittParameters) (kappa p : ℝ) := cubittNoisySwitch (cubittGammaChannel P) kappa p
/-- PDF p.7, S19: sufficient PPT condition; the exponent is the product r*N. -/
def CubittPPTCondition (P : CubittParameters) : Prop :=
0 < P.q ∧ P.q ≤ 1 / 3 ∧
((P.d : ℝ) / ((P.d : ℝ) - 1)) ^ (P.r * P.N) ≤ (1 - P.q) / P.q
/-- PDF pp.7--8: integer ceiling retained from Lemma 2 (the p.10 shorthand omits it). -/
def cubittRepetitions (m : ℕ) : ℕ := 2 * m + Nat.ceil (Real.logb 2 (m : ℝ))
/-- PDF p.7, Lemma 2: q=1/3 and the prescribed integer repetition count. -/
def cubittApproximationParameters (N m d : ℕ) : CubittParameters :=
⟨N, cubittRepetitions m, m, d, 1 / 3⟩
/-- PDF p.7, S20: reinsert the first shield share, indexed by 0 in Lean. -/
def cubittInsertFirst (P : CubittParameters) (hN : 0 < P.N) (x : CubittShare P.r P.m P.d)
(rest : {i : Fin P.N // i ≠ ⟨0, hN⟩} → CubittShare P.r P.m P.d) : CubittShield P :=
fun i => if h : i = ⟨0, hN⟩ then x else rest ⟨i, h⟩
/-- PDF p.7, S20: actual partial trace over A_2 B_2 ... A_N B_N of the computed cubittZeta.
The rho/cubittZeta change in Lemma 2 is resolved by this marginal, not by an arbitrary state. -/
def cubittFirstShareState (P : CubittParameters) (hN : 0 < P.N) :
Op ((Bool × CubittShare P.r P.m P.d) × (Bool × CubittShare P.r P.m P.d)) :=
fun x y => ∑ aRest, ∑ bRest,
cubittZeta P ((x.1.1, cubittInsertFirst P hN x.1.2 aRest),
(x.2.1, cubittInsertFirst P hN x.2.2 bRest))
((y.1.1, cubittInsertFirst P hN y.1.2 aRest),
(y.2.1, cubittInsertFirst P hN y.2.2 bRest))
/-- PDF p.6, S12: twisted Bell pair with arbitrary density sigma and key-controlled unitaries.
Coordinates are aA:bB; this is S10--S11 expanded in the fixed basis. -/
def cubittPrivateState {I : Type*} [Fintype I] [DecidableEq I] (sigma : Op (I × I))
(U : Bool → Bool → Matrix.unitaryGroup (I × I) ℂ) :
Op ((Bool × I) × (Bool × I)) :=
fun x y => if x.1.1 = x.2.1 ∧ y.1.1 = y.2.1 then
(1 / 2 : ℂ) * (((U x.1.1 x.1.1 : Op (I × I)) * sigma *
(U y.1.1 y.1.1 : Op (I × I))ᴴ) (x.1.2, x.2.2) (y.1.2, y.2.2))
else 0
/-- PDF p.6, S10--S12: normalized perfect private bit; shield dimension is unrestricted. -/
def CubittPerfectPbit {I : Type*} [Fintype I] [DecidableEq I]
(rho : Op ((Bool × I) × (Bool × I))) : Prop :=
IsDensityMatrix rho ∧ ∃ sigma : Op (I × I), IsDensityMatrix sigma ∧
∃ U : Bool → Bool → Matrix.unitaryGroup (I × I) ℂ, rho = cubittPrivateState sigma U
/-- PDF pp.7--8, Lemma 2: full trace-norm approximation, not half trace distance. -/
def cubittApproximationBound (m : ℕ) : ℝ :=
16 * Real.sqrt (m : ℝ) * (2 : ℝ) ^ (-(m : ℝ) / 4)
/-- PDF p.10, S52: continuity loss; applied only with 0<=tau<1. -/
def cubittContinuityLoss (tau : ℝ) : ℝ := 4 * tau + 2 * binEntropy2 tau
/-- PDF p.11: final concrete N, which grows with the requested undetectable block length. -/
def cubittExplicitShares (n : ℕ) : ℕ := 2 * n * 4 ^ n
/-- PDF pp.10--11: d=2*N*r, a product (not a power). -/
def cubittExplicitParameters (n m : ℕ) : CubittParameters :=
cubittApproximationParameters (cubittExplicitShares n) m (2 * cubittExplicitShares n * cubittRepetitions m)
/-! Small constructor sanity examples. No result theorem is proved in this stage. -/
example {I : Type*} [Fintype I] [DecidableEq I] (X : Op I) (a b : I) :
cubittWholeErasure 0 X (false, a) (false, b) = X a b := by
simp [cubittWholeErasure]
example {I : Type*} [Fintype I] [DecidableEq I] (X : Op I) (a b : I) :
cubittWholeErasure 1 X (true, a) (true, b) = X.trace * mixed I a b := by
simp [cubittWholeErasure]
example {A B : Type*} (branches : Bool → Superop A B) (X : Op (Bool × A)) (a b : B) :
cubittSwitched branches X (false, a) (true, b) = 0 := by
simp [cubittSwitched]
example {I J : Type*} (X : Op (I × J)) : cubittOutputTranspose (cubittOutputTranspose X) = X := rfl
example : cubittSymmetricState 2 (0, 0) (0, 0) = 1 / 3 := by
norm_num [cubittSymmetricState]
example : cubittAntisymmetricState 2 (0, 1) (1, 0) = -(1 / 2) := by
norm_num [cubittAntisymmetricState]
example (P : CubittParameters) (hN : 0 < P.N) (x : CubittShare P.r P.m P.d)
(rest : {i : Fin P.N // i ≠ ⟨0, hN⟩} → CubittShare P.r P.m P.d) :
cubittInsertFirst P hN x rest ⟨0, hN⟩ = x := by
simp [cubittInsertFirst]
example : cubittExplicitShares 1 = 8 := rfl
example (m : ℕ) : (cubittExplicitParameters 1 m).q = 1 / 3 := rfl
end
end QAlgorithms.Papers.Independent.Intakenext100.P70
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P70.CubittMain
For any parameter tuple , with and , the type consists of pairs , where and is an array with entries , indexed by , , and . No restrictions on the parameters are imposed. If any array index range is empty, there are exactly two such pairs; if all three ranges are nonempty and , there are none.
QAlgorithms.Papers.Independent.Intakenext100.P70.CubittPPTBinding
For finite types , with decidable equality on , and any function , this predicate requires both that have a finite Kraus representation and that a specified matrix be positive semidefinite. Explicitly, there must exist a natural number and matrices , for , such that
and the matrix
must be positive semidefinite, where is the matrix unit on . The types may be empty, and is allowed; the normalization equation still applies, and division by zero uses the total complex-field convention.
QAlgorithms.Papers.Independent.Intakenext100.P70.CubittPPTCondition
For any parameter tuple , with and , this predicate means precisely
where the fractions and subtraction are real arithmetic and the exponent is a natural number. It imposes no additional restrictions on , and does not occur in the conditions. In particular, and are included, with real division by zero defined as zero; if , the left-hand side is , including when its base is zero.
QAlgorithms.Papers.Independent.Intakenext100.P70.CubittParameters
This structure consists of five fields: natural numbers and a real number . It imposes no further conditions: any of the natural-number fields may be zero, and may be any real number.
QAlgorithms.Papers.Independent.Intakenext100.P70.CubittPerfectPbit
For any finite type with decidable equality and any complex matrix on , this predicate means that is positive semidefinite with trace , and there exist a positive semidefinite, trace-one matrix on and a Boolean-indexed family of unitaries on such that
The off-diagonal members of the unitary family are existentially supplied but do not affect this equality. Empty is included in the definition, but then the trace-one conditions cannot hold.
QAlgorithms.Papers.Independent.Intakenext100.P70.CubittShare
For arbitrary natural numbers , this abbreviates the type of functions assigning to every a function from to , equivalently an array with entries in a -element set. If or , this type has exactly one element, including when ; if and , it has no elements.
QAlgorithms.Papers.Independent.Intakenext100.P70.CubittShield
For any parameter tuple , where are arbitrary natural numbers and , the type consists of arrays
There are no positivity or validity hypotheses on . If any of is zero, this type contains exactly one empty array; if all three are positive and , it is empty.
QAlgorithms.Papers.Independent.Intakenext100.P70.CubittValid
For a record consisting of natural numbers and a real number , this predicate holds exactly when
All six inequalities are required simultaneously; there are no additional conditions.
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittAntisymmetricState
For every natural number , this defines a complex square matrix indexed by pairs in . For every row and column , its entry is
with all arithmetic in , so here is complex subtraction. No hypothesis is imposed. For the index set is empty; for the unique entry is zero, using the convention that division by zero equals zero.
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittApproximationBound
For every natural number , including , this defines the real number
where is converted to a real number before taking the square root and forming the real exponent. Its value at is . The declaration defines this number without asserting any approximation inequality.
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittApproximationParameters
For arbitrary natural numbers , this defines a parameter record with fields
where denotes the least natural number at least , with value when , and the total real logarithm has . Thus gives . No positivity or validity conditions on are required or asserted.
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittBlockInformation
For any finite types with decidable equality, any function , and any natural number , this defines the real number . Here is the function on matrices indexed by whose entries, indexed by , are
where has entry at and zero elsewhere. For a function , is the real supremum, over all positive semidefinite of trace , of
The vector has coordinates , the blockwise extension is , and , using the total continuous functional calculus. No linearity or channel assumption is imposed on . Empty sums and products retain their usual values; the real supremum of an empty set is , and is allowed, in which case the final division by zero gives .
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittContinuityLoss
For every real number , this defines
Here is the total real logarithm, with and for . Thus the definition applies to all real , without a hypothesis , and gives values at and at . It does not itself assert a continuity inequality.
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittErasureThreshold
For every natural number and every real number , this defines
where the inner power has natural exponent and the outer power is the total real-power operation. No positivity assumption on , , or the base is imposed. In particular, when , the inner power is , the exponent is because real division by zero gives zero, and the value is ; a zero base with a negative exponent also receives the total-operation value .
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittExplicitParameters
For arbitrary natural numbers , put and , where the natural-number ceiling is truncated below at and . This defines the parameter record
No validity conditions are required or asserted. In particular, gives , and gives .
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittExplicitShares
For every natural number , this defines the natural number
The input is included and gives ; no positivity hypothesis is required.
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittFirstShareState
Let , where are natural numbers and is real, and assume . Put , , and , for , where assigns shares to the nonzero indices. This defines a complex matrix indexed by , whose entries, for and , are
Here both sums range independently over all assignments of shares to the indices , and is the following explicitly defined matrix on . For pairs , set
For , define
For row and column , the corresponding entry of is times
with evaluated at . All scalars in these matrix formulas are interpreted in . No validity, positivity, or trace-one hypothesis is imposed: are unrestricted, empty sums and products have values and , and division by zero has value .
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittGammaChannel
For arbitrary parameters , with and , let and . This defines a function from all complex matrices to complex matrices by
Here is specified entrywise as follows: for and , put
and
The formula applies to every , with no density-matrix or parameter hypotheses. Entry arithmetic is complex, division by zero is zero, empty sums are zero, and empty products are ; in particular, if is empty, this is the unique function between the corresponding singleton matrix spaces.
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittHidingOmega
For any parameters , with and , any , and any two pairs of shield arrays and , whose entries lie in and have indices , this defines the complex number
where
The fractions are complex fractions, with division by zero equal to zero. The parameter does not enter the formula. Empty products equal , so the value is if or ; if , there is no possible argument .
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittHidingSigma
For any parameters , with and , any , and pairs of shield arrays , with entries in and indices , this defines
No parameter validity assumptions are imposed, and does not enter the formula. Complex division by zero equals zero. If or , the empty product gives ; if , there is no argument .
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittInsertFirst
Let be a parameter record with natural-number fields and real field , and assume . Write for the set of shares. Given and a function , this defines the shield configuration by
There are no restrictions on ; in particular, permits the unique function on the empty set as .
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittNoisySwitch
For any finite type with decidable equality, any function , and arbitrary real numbers , this defines a function from matrices indexed by to matrices indexed by . For an input , set and set , , with and . The output entries are
There is no channel or linearity assumption on and no range restriction on . The type may be empty, and inverses use .
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittNormalizedChoi
For any finite type with decidable equality, any type , and any function , this defines a complex matrix indexed by through
where has entry at and zero elsewhere, and the denominator is interpreted in . No linearity or channel assumption is imposed on , and need not be finite. The type may be empty; complex division by zero is total and gives zero.
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittOutputTranspose
For arbitrary types and any complex matrix indexed by , this defines the matrix by
Only the two indices are exchanged. No finiteness, positivity, normalization, or nonemptiness assumption is imposed.
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittPaperChannel
For arbitrary , with natural and real , and arbitrary real numbers , this defines a function from complex matrices indexed by to complex matrices indexed by , where and . For an input matrix , write . Set , , , and . The output entry is
The function used here is given by
For , , define , , and
Then
All matrix-entry arithmetic is complex. There are no restrictions requiring to lie in , or requiring to be valid; division by zero equals zero and empty products equal .
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittPrivateState
For any finite type with decidable equality, any complex matrix indexed by , and any family of unitary matrices on , indexed by two Booleans, this defines the matrix on by
Only the diagonal members enter this formula, although all four members of the supplied family must be unitary. The matrix need not be positive semidefinite or have trace one, and may be empty, in which case the resulting matrix is empty.
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittRawChoi
For arbitrary parameters , where and , this defines a complex matrix indexed by pairs , with Boolean and arrays in . To specify a row and column , put
and define, for ,
Then its entry is
All displayed entry arithmetic is complex arithmetic. There are no validity hypotheses on ; division by zero is zero and empty products are , including each product over when .
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittRepetitions
For every natural number , this defines the natural number
where is the real natural logarithm and is the least natural number greater than or equal to , hence is zero for . The definition includes : the total real logarithm has , so the resulting number is .
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittSelectedInput
For arbitrary types , an element , and an arbitrary complex matrix indexed by , this defines the complex matrix indexed by with entries
Neither finiteness of the types nor positivity or normalization of is required; specifying requires to be inhabited.
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittSwitched
For arbitrary types and a family of functions indexed by , this defines a function from matrices indexed by to matrices indexed by by
Thus each diagonal block is passed to its corresponding function, and every off-diagonal block of the output is zero. The types need not be finite or nonempty, and the branch functions need not be linear or channels.
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittSymmetricState
For every natural number , this defines a complex square matrix indexed by pairs in . For every row and column , its entry is
where indicators and the denominator are interpreted in . The definition includes , when the matrix has an empty index set; complex division is total, with division by zero equal to zero.
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittWholeErasure
For any finite type with decidable equality and any real , this defines a function from complex matrices indexed by to complex matrices indexed by . Writing , its value on an arbitrary matrix is
Scalars are regarded as complex numbers, and is when and otherwise. There is no restriction and no assumption on . The type may be empty; inverses are total, with .
QAlgorithms.Papers.Independent.Intakenext100.P70.cubittZeta
For arbitrary , with natural and real , this defines a complex matrix on pairs of Boolean–shield pairs, where a shield is an array in . For row and column , define
Its entries are
All arithmetic here is in . No nonzero-denominator or validity assumptions are imposed: zero has inverse zero, and empty products equal . In particular, when , the prefactor is .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.