Definitions for Degenerate Quantum Codes for Pauli Channels
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P93The objects the formalized statements of Degenerate Quantum Codes for Pauli Channels (arXiv:quant-ph/0604107) are stated in. Each was checked against the paper by a blind read-back and a moderator.
pauliMass: PDF p.2: the physical one-qubit Pauli law, with Y carrying both bits.pauliErrorWordMass: PDF p.2: reuse the accepted product law on paired physical amplitude/phase labels, so all three Pauli parameters are retained.catLogicalSyndromeMass: PDF p.2, Eq.(6) left side: actual pushforward of physical errors to one logical Pauli and one specific syndrome. No weight multiplicity is inserted.iidCatSyndromeMass: PDF p.2: marginal probability of one syndrome string.amplitudeCount: PDF p.2, Eq.(6): number of physical amplitude errors for fixed logical amplitude and syndrome. The subtraction is only k+1-|s|, always positive.noAmplitudeCount: PDF p.2, Eq.(6): number of positions without amplitude errors.orderedPauli: PDF p.2: matrix of the accepted ordered physical Pauli, on every vector.iidPauliNoise: PDF p.2: the tensor power of the three-parameter Pauli channel.decoderBranch: PDF p.2: accepted cat decoder followed by the indicated syndrome branch; this is a rectangular Kraus matrix, with the logical qubit remaining.branchChannel: PDF p.2: actual encode/noise/measure/decode branch before normalization.catBellInput: PDF p.2: reindex the frozen one-pair Bell vector by Bool, reference first.branchBell: PDF p.2: Bell output of the ACTUAL branch instrument, not a mixture postulated from Eq.(6).conditionalChannel: PDF p.2: the conditional channel; an impossible branch is assigned the identity, whose weighted contribution is zero.catInstrumentOutput: PDF p.2: actual output with the entire classical syndrome in the receiver.catRate: PDF p.2, Eq.(5): signed Bell-input cat rate, without optimizing the input.catBlockEncoder: PDF p.2: tensor product of this fixed inner cat encoder on n blocks.CatAchievable: PDF p.2, Eq.(5): operational fixed-cat/additive-outer achievability. The encoder is fixed before the unknown input. All sufficiently large positive outer blocklengths work, with rate measured per (k+1)n physical qubits. The only resources are the specified encoder, independent noise and a CPTP decoder.syndromeWeightMass: PDF pp.2--3: distribution of the syndrome Hamming weight, summing strings only here.concentrationTail: PDF pp.2--3: mass away from BOTH limiting syndrome-weight centers. The k=0 branch is defined separately, avoiding a meaningless empty-word ratio.xCatEncoder: PDF p.3: X-basis cat, including the logical Hadamard H^tensor(b+1) Enc H.concatenatedEncoder: PDF p.3: encode the outer X cat, then an inner Z cat on EACH output. The physical register consists of b+1 blocks of a+1 qubits.concatenatedBlockEncoder: PDF pp.2--3: tensor copies of the fixed two-level inner encoder. Every physical wire is indexed by (copy, outer-cat wire, inner-cat wire).ConcatenatedAchievable: PDF pp.2--3, Eq.(5) and Concatenated Repetition Codes: communication through the fixed two-level inner cat and an additive random-code outer layer. Rates count (a+1)(b+1)n physical uses; one code handles every unknown input.concatenatedRawOutput: PDF p.3: actual encoded Bell output before the two-level syndrome instrument.concatenatedDecoderBranch: PDF p.3: inner Z-check branches followed by the outer X-check branch. The logical Hadamard is included in the inverse of the X-basis encoder.concatenatedOutput: PDF p.3: actual two-level instrument output. Both the outer X-check syndrome and ALL inner Z-check syndromes are retained at the receiver.concatenatedRate: PDF p.3: signed concatenated-cat rate per (a+1)(b+1) channel uses.noiseThreshold: PDF p.3, Fig.2: zero-rate noise threshold, restricted to physical noise p in [0,3/4]. The explicit zero ensures a nonempty bounded supremum domain.twoPauliChannel: PDF pp.3--4: N_p^tp with equal X/Z errors and no Y error.twoPauliDilation: PDF pp.3--4: concrete Stinespring matrix, with environment order X,Z,I. Its two partial traces define the receiver and complement of the SAME dilation.
import Mathlib
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P15
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P67
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P40
import Definitions.Def_QAlgorithms_Papers_Independent_Support50_P38
/-!
Smith--Smolin, arXiv:quant-ph/0604107v2, PDF pp.2--4.
All new interfaces belong to this paper. A cat has length k+1; k=0 is the
identity cat. Physical and logical Paulis have the ordered convention X^u Z^v.
Syndromes are retained without majority correction. Rates and entropies use bits.
Numerical and underspecified claims are inventoried separately in HARD.md.
-/
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P93
open QAlgorithms
open scoped BigOperators ComplexConjugate Matrix
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.2: the physical one-qubit Pauli law, with Y carrying both bits. -/
def pauliMass (px py pz : ℝ) (u v : Bool) : ℝ :=
if u then (if v then py else px) else (if v then pz else 1 - px - py - pz)
/-- PDF p.2: reuse the accepted product law on paired physical amplitude/phase
labels, so all three Pauli parameters are retained. -/
def pauliErrorWordMass {m : ℕ} (px py pz : ℝ) (u v : Qubits m) : ℝ :=
QAlgorithms.Papers.Independent.Support50.P38.wordMass
(fun e : Bool × Bool => pauliMass px py pz e.1 e.2) (fun i => (u i, v i))
/-- PDF p.2, Eq.(6) left side: actual pushforward of physical errors to one
logical Pauli and one specific syndrome. No weight multiplicity is inserted. -/
def catLogicalSyndromeMass (k : ℕ) (px py pz : ℝ) (u v : Bool) (s : Qubits k) : ℝ :=
∑ x : Qubits (k + 1), ∑ z : Qubits (k + 1),
if x 0 = u ∧ dotBits z (fun _ => true) = v ∧ QAlgorithms.Papers.Independent.Advance50.P15.repetitionSyndrome x = s
then pauliErrorWordMass px py pz x z else 0
/-- PDF p.2: marginal probability of one syndrome string. -/
def iidCatSyndromeMass (k : ℕ) (px py pz : ℝ) (s : Qubits k) : ℝ :=
∑ u : Bool, ∑ v : Bool, catLogicalSyndromeMass k px py pz u v s
/-- PDF p.2, Eq.(6): number of physical amplitude errors for fixed logical
amplitude and syndrome. The subtraction is only k+1-|s|, always positive. -/
def amplitudeCount (k : ℕ) (u : Bool) (s : Qubits k) : ℕ :=
if u then k + 1 - hammingWeight s else hammingWeight s
/-- PDF p.2, Eq.(6): number of positions without amplitude errors. -/
def noAmplitudeCount (k : ℕ) (u : Bool) (s : Qubits k) : ℕ :=
if u then hammingWeight s else k + 1 - hammingWeight s
/-- PDF p.2: matrix of the accepted ordered physical Pauli, on every vector. -/
def orderedPauli {m : ℕ} (u v : Qubits m) : Matrix (Qubits m) (Qubits m) ℂ :=
fun x y => QAlgorithms.Papers.Independent.Advance50.P15.physicalPauli u v (ket y) x
/-- PDF p.2: the tensor power of the three-parameter Pauli channel. -/
def iidPauliNoise (m : ℕ) (px py pz : ℝ) : Superop (Qubits m) (Qubits m) :=
fun rho => ∑ u : Qubits m, ∑ v : Qubits m,
(pauliErrorWordMass px py pz u v : ℂ) • conjSuperop (orderedPauli u v) rho
/-- PDF p.2: accepted cat decoder followed by the indicated syndrome branch;
this is a rectangular Kraus matrix, with the logical qubit remaining. -/
def decoderBranch (k : ℕ) (s : Qubits k) : Matrix Bool (Qubits (k + 1)) ℂ :=
fun b x => if QAlgorithms.Papers.Independent.Advance50.P15.repetitionCoordinates k x = (b, s) then 1 else 0
/-- PDF p.2: actual encode/noise/measure/decode branch before normalization. -/
def branchChannel (k : ℕ) (px py pz : ℝ) (s : Qubits k) : Superop Bool Bool :=
conjSuperop (decoderBranch k s) ∘ iidPauliNoise (k + 1) px py pz ∘
conjSuperop (QAlgorithms.Papers.Independent.Support50.P40.catEncoder k)
/-- PDF p.2: reindex the frozen one-pair Bell vector by Bool, reference first. -/
def catBellInput : EuclideanSpace ℂ (Bool × Bool) :=
WithLp.toLp 2 fun x => maxEntangled 1 ((fun _ => x.1), (fun _ => x.2))
/-- PDF p.2: Bell output of the ACTUAL branch instrument, not a mixture
postulated from Eq.(6). -/
def branchBell (k : ℕ) (px py pz : ℝ) (s : Qubits k) :
Matrix (Bool × Bool) (Bool × Bool) ℂ :=
idTensorSuperop (R := Bool) (branchChannel k px py pz s) (pureDensity catBellInput)
/-- PDF p.2: the conditional channel; an impossible branch is assigned the
identity, whose weighted contribution is zero. -/
def conditionalChannel (k : ℕ) (px py pz : ℝ) (s : Qubits k) : Superop Bool Bool :=
if iidCatSyndromeMass k px py pz s = 0 then id
else fun rho => ((iidCatSyndromeMass k px py pz s)⁻¹ : ℂ) • branchChannel k px py pz s rho
/-- PDF p.2: actual output with the entire classical syndrome in the receiver. -/
def catInstrumentOutput (k : ℕ) (px py pz : ℝ) :
Matrix (Bool × (Bool × Qubits k)) (Bool × (Bool × Qubits k)) ℂ :=
fun x y => if x.2.2 = y.2.2 then
branchBell k px py pz x.2.2 (x.1, x.2.1) (y.1, y.2.1) else 0
/-- PDF p.2, Eq.(5): signed Bell-input cat rate, without optimizing the input. -/
def catRate (k : ℕ) (px py pz : ℝ) : ℝ :=
(vnEntropy (traceLeft (catInstrumentOutput k px py pz)) -
vnEntropy (catInstrumentOutput k px py pz)) / (k + 1 : ℕ)
/-- PDF p.2: tensor product of this fixed inner cat encoder on n blocks. -/
def catBlockEncoder (k n : ℕ) : Matrix (Fin n → Qubits (k + 1)) (Qubits n) ℂ :=
fun y x => ∏ i, QAlgorithms.Papers.Independent.Support50.P40.catEncoder k (y i) (x i)
/-- PDF p.2, Eq.(5): operational fixed-cat/additive-outer achievability.
The encoder is fixed before the unknown input. All sufficiently large positive
outer blocklengths work, with rate measured per (k+1)n physical qubits. The only
resources are the specified encoder, independent noise and a CPTP decoder. -/
def CatAchievable (k : ℕ) (px py pz R : ℝ) : Prop :=
0 ≤ R ∧ ∀ epsilon > (0 : ℝ), ∀ delta > (0 : ℝ), ∃ n0 : ℕ, 1 ≤ n0 ∧
∀ n ≥ n0, ∃ l : ℕ, (R - delta) * ((k + 1) * n : ℕ) ≤ (l : ℝ) ∧
∃ E : Matrix (Qubits n) (Qubits l) ℂ, QAlgorithms.Papers.Independent.Support50.P40.IsAdditiveEncoder E ∧
∃ D : Superop (Fin n → Qubits (k + 1)) (Qubits l), IsChannel D ∧
let transmission := D ∘ piSuperop (fun _ : Fin n => iidPauliNoise (k + 1) px py pz) ∘
conjSuperop (catBlockEncoder k n) ∘ conjSuperop E
1 - epsilon ≤ entanglementFidelity transmission ∧
∀ psi : EuclideanSpace ℂ (Qubits l), IsState psi →
1 - epsilon ≤ effectProb (pureDensity psi) (transmission (pureDensity psi))
/-- PDF pp.2--3: distribution of the syndrome Hamming weight, summing strings
only here. -/
def syndromeWeightMass (k : ℕ) (px py pz : ℝ) (r : ℕ) : ℝ :=
∑ s : Qubits k, if hammingWeight s = r then iidCatSyndromeMass k px py pz s else 0
/-- PDF pp.2--3: mass away from BOTH limiting syndrome-weight centers.
The k=0 branch is defined separately, avoiding a meaningless empty-word ratio. -/
def concentrationTail (k : ℕ) (qx qz epsilon : ℝ) : ℝ :=
if k = 0 then 0 else ∑ s : Qubits k,
if epsilon < min |(hammingWeight s : ℝ) / k - qx|
|(hammingWeight s : ℝ) / k - (1 - qx)|
then iidCatSyndromeMass k (qx * (1 - qz)) (qx * qz) (qz * (1 - qx)) s else 0
/-- PDF p.3: X-basis cat, including the logical Hadamard H^tensor(b+1) Enc H. -/
def xCatEncoder (b : ℕ) : Matrix (Qubits (b + 1)) Bool ℂ :=
fun y c => ∑ d : Bool, (∏ j : Fin (b + 1), hadamard (y j) d) * hadamard d c
/-- PDF p.3: encode the outer X cat, then an inner Z cat on EACH output.
The physical register consists of b+1 blocks of a+1 qubits. -/
def concatenatedEncoder (a b : ℕ) : Matrix (Fin (b + 1) → Qubits (a + 1)) Bool ℂ :=
fun x c => ∑ y : Qubits (b + 1),
xCatEncoder b y c * ∏ j : Fin (b + 1), QAlgorithms.Papers.Independent.Support50.P40.catEncoder a (x j) (y j)
/-- PDF pp.2--3: tensor copies of the fixed two-level inner encoder.
Every physical wire is indexed by (copy, outer-cat wire, inner-cat wire). -/
def concatenatedBlockEncoder (a b n : ℕ) :
Matrix (Fin n → (Fin (b + 1) → Qubits (a + 1))) (Qubits n) ℂ :=
fun y x => ∏ i, concatenatedEncoder a b (y i) (x i)
/-- PDF pp.2--3, Eq.(5) and Concatenated Repetition Codes: communication
through the fixed two-level inner cat and an additive random-code outer layer.
Rates count (a+1)(b+1)n physical uses; one code handles every unknown input. -/
def ConcatenatedAchievable (a b : ℕ) (p R : ℝ) : Prop :=
0 ≤ R ∧ ∀ epsilon > (0 : ℝ), ∀ delta > (0 : ℝ), ∃ n0 : ℕ, 1 ≤ n0 ∧
∀ n ≥ n0, ∃ l : ℕ, (R - delta) * (((a + 1) * (b + 1)) * n : ℕ) ≤ (l : ℝ) ∧
∃ E : Matrix (Qubits n) (Qubits l) ℂ,
QAlgorithms.Papers.Independent.Support50.P40.IsAdditiveEncoder E ∧
∃ D : Superop (Fin n → (Fin (b + 1) → Qubits (a + 1))) (Qubits l), IsChannel D ∧
let innerNoise := piSuperop (fun _ : Fin (b + 1) =>
iidPauliNoise (a + 1) (p / 3) (p / 3) (p / 3))
let transmission := D ∘ piSuperop (fun _ : Fin n => innerNoise) ∘
conjSuperop (concatenatedBlockEncoder a b n) ∘ conjSuperop E
1 - epsilon ≤ entanglementFidelity transmission ∧
∀ psi : EuclideanSpace ℂ (Qubits l), IsState psi →
1 - epsilon ≤ effectProb (pureDensity psi) (transmission (pureDensity psi))
/-- PDF p.3: actual encoded Bell output before the two-level syndrome instrument. -/
def concatenatedRawOutput (a b : ℕ) (p : ℝ) :
Matrix (Bool × (Fin (b + 1) → Qubits (a + 1)))
(Bool × (Fin (b + 1) → Qubits (a + 1))) ℂ :=
idTensorSuperop (R := Bool)
(piSuperop (fun _ : Fin (b + 1) => iidPauliNoise (a + 1) (p / 3) (p / 3) (p / 3)))
(idTensorSuperop (R := Bool) (conjSuperop (concatenatedEncoder a b))
(pureDensity catBellInput))
/-- PDF p.3: inner Z-check branches followed by the outer X-check branch.
The logical Hadamard is included in the inverse of the X-basis encoder. -/
def concatenatedDecoderBranch (a b : ℕ) (t : Qubits b)
(s : Fin (b + 1) → Qubits a) : Matrix Bool (Fin (b + 1) → Qubits (a + 1)) ℂ :=
hadamard * decoderBranch b t * hadamardN (b + 1) *
(Matrix.of fun (y : Qubits (b + 1)) (x : Fin (b + 1) → Qubits (a + 1)) =>
∏ j : Fin (b + 1), decoderBranch a (s j) (y j) (x j))
/-- PDF p.3: actual two-level instrument output. Both the outer X-check
syndrome and ALL inner Z-check syndromes are retained at the receiver. -/
def concatenatedOutput (a b : ℕ) (p : ℝ) :
Matrix (Bool × (Bool × (Qubits b × (Fin (b + 1) → Qubits a))))
(Bool × (Bool × (Qubits b × (Fin (b + 1) → Qubits a)))) ℂ :=
fun x y => if x.2.2 = y.2.2 then
idTensorSuperop (R := Bool)
(conjSuperop (concatenatedDecoderBranch a b x.2.2.1 x.2.2.2))
(concatenatedRawOutput a b p) (x.1, x.2.1) (y.1, y.2.1)
else 0
/-- PDF p.3: signed concatenated-cat rate per (a+1)(b+1) channel uses. -/
def concatenatedRate (a b : ℕ) (p : ℝ) : ℝ :=
(vnEntropy (traceLeft (concatenatedOutput a b p)) -
vnEntropy (concatenatedOutput a b p)) / ((a + 1) * (b + 1) : ℕ)
/-- PDF p.3, Fig.2: zero-rate noise threshold, restricted to physical noise
p in [0,3/4]. The explicit zero ensures a nonempty bounded supremum domain. -/
def noiseThreshold (R : ℝ → ℝ) : ℝ :=
sSup ({0} ∪ {p : ℝ | 0 ≤ p ∧ p ≤ 3 / 4 ∧ 0 < R p})
/-- PDF pp.3--4: N_p^tp with equal X/Z errors and no Y error. -/
def twoPauliChannel (p : ℝ) : Superop Bool Bool :=
fun rho => ((1 - p : ℝ) : ℂ) • rho +
((p / 2 : ℝ) : ℂ) • conjSuperop pauliX rho +
((p / 2 : ℝ) : ℂ) • conjSuperop pauliZ rho
/-- PDF pp.3--4: concrete Stinespring matrix, with environment order X,Z,I.
Its two partial traces define the receiver and complement of the SAME dilation. -/
def twoPauliDilation (p : ℝ) : Matrix (Bool × Fin 3) Bool ℂ :=
fun be c => match be.2.val with
| 0 => (Real.sqrt (p / 2) : ℂ) * pauliX be.1 c
| 1 => (Real.sqrt (p / 2) : ℂ) * pauliZ be.1 c
| _ => (Real.sqrt (1 - p) : ℂ) * (1 : Matrix Bool Bool ℂ) be.1 c
/-! Small checks pin the conventions and degenerate branches, without proving
any of the source results. -/
example (px py pz : ℝ) : pauliMass px py pz true true = py := rfl
example (px py pz : ℝ) (u v : Qubits 0) : pauliErrorWordMass px py pz u v = 1 := by
simp [pauliErrorWordMass, QAlgorithms.Papers.Independent.Support50.P38.wordMass]
example (k : ℕ) (s : Qubits k) : amplitudeCount k false s = hammingWeight s := rfl
example (k : ℕ) (s : Qubits k) : noAmplitudeCount k true s = hammingWeight s := rfl
example (k : ℕ) (s : Qubits k) (b : Bool) :
decoderBranch k s b ((QAlgorithms.Papers.Independent.Advance50.P15.repetitionCoordinates k).symm (b, s)) = 1 := by
simp [decoderBranch]
example (b c : Bool) :
catBellInput (b, c) = maxEntangled 1 ((fun _ => b), (fun _ => c)) := rfl
example (a b : ℕ) (x : Fin 0 → (Fin (b + 1) → Qubits (a + 1))) (y : Qubits 0) :
concatenatedBlockEncoder a b 0 x y = 1 := by
simp [concatenatedBlockEncoder]
example (y : Qubits 1) (c : Bool) :
xCatEncoder 0 y c = ∑ d : Bool, hadamard (y 0) d * hadamard d c := by
simp [xCatEncoder]
example (a b : ℕ) (p : ℝ)
(x y : Bool × (Bool × (Qubits b × (Fin (b + 1) → Qubits a))))
(h : x.2.2 ≠ y.2.2) : concatenatedOutput a b p x y = 0 := by
simp [concatenatedOutput, h]
example (k : ℕ) (px py pz : ℝ) (x y : Bool × (Bool × Qubits k))
(h : x.2.2 ≠ y.2.2) : catInstrumentOutput k px py pz x y = 0 := by
simp [catInstrumentOutput, h]
example (k : ℕ) (px py pz : ℝ) (s : Qubits k)
(h : iidCatSyndromeMass k px py pz s = 0) : conditionalChannel k px py pz s = id := by
simp [conditionalChannel, h]
example (k : ℕ) (x : Fin 0 → Qubits (k + 1)) (y : Qubits 0) :
catBlockEncoder k 0 x y = 1 := by simp [catBlockEncoder]
example (qx qz epsilon : ℝ) : concentrationTail 0 qx qz epsilon = 0 := by
simp [concentrationTail]
example (p : ℝ) (b c : Bool) :
twoPauliDilation p (b, (0 : Fin 3)) c = (Real.sqrt (p / 2) : ℂ) * pauliX b c := rfl
end QAlgorithms.Papers.Independent.Intakenext100.P93
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P93.CatAchievable
For a natural number and arbitrary real numbers , this property means that and that, for every and , there is a natural number such that for every natural number there exist a natural number , a complex matrix , and a function from matrices indexed by -tuples of length- binary words to matrices indexed by length- binary words, satisfying
The range of must be the common fixed-vector space of some subgroup of the -qubit unitary group such that lies in the subgroup generated by matrices , with and , all elements of commute, and no element of equals . The function must admit a finite Kraus representation with . Define by exactly when for every , and otherwise. Put , , , ; for length- words , put and if , and otherwise. Let , and let denote its tensor product over the blocks. For
the required bounds are
for every with . In these expressions, extension by the identity acts separately on each matrix block of the reference register. The definition includes and ; it assumes no inequalities on .
QAlgorithms.Papers.Independent.Intakenext100.P93.ConcatenatedAchievable
For natural numbers and unrestricted real numbers , this defines the following property. Write , use bitwise exclusive-or for addition of bit strings, and let . Define matrices
Here is a list of strings in , is a bit, is a list of such lists, and . For , define
and the matrix map
For any matrix map , its -fold extension in this definition means the map specified by
The defined property requires and, for every and , an integer such that for every natural number there are a natural number , a complex matrix , and a map from matrices indexed by to matrices indexed by , satisfying
The matrix must satisfy and ; moreover, there must be a subgroup of the unitary matrices on such that lies in the subgroup generated by all matrices , with and , every two elements of commute, , and the range of is exactly . The map must have a finite Kraus representation with . Set
It is required that
and that, for every vector with ,
Here has entries , and applies separately to each matrix block determined by the first register. No bound on is part of this property; in particular the displayed weights are used algebraically even outside the probability range. The values , , and are included; for , the logical register is one-dimensional.
QAlgorithms.Papers.Independent.Intakenext100.P93.amplitudeCount
For every natural number , Boolean value , and Boolean word of length , let be the number of true entries of . This defines the natural number when is true, and when is false. Subtraction is natural-number subtraction, truncated at zero, although ensures that no truncation occurs here. When , the value is for true and for false .
QAlgorithms.Papers.Independent.Intakenext100.P93.branchBell
For every natural number , arbitrary real numbers , and Boolean word of length , this defines the complex matrix indexed by Boolean pairs
where for and otherwise. The matrix is exactly when every bit of equals ; is when , and otherwise; and is exactly when and for all , with all other entries zero. Here denotes exclusive-or, denotes conjugate transpose, and , , , . This applies the specified branch function to the second Boolean register while leaving the first unchanged; is included, and no positivity assumptions or branch normalization are imposed.
QAlgorithms.Papers.Independent.Intakenext100.P93.branchChannel
For every natural number , arbitrary real numbers , and Boolean word of length , this defines a function on all two-by-two complex matrices :
Here if every bit of equals , and is otherwise; if , and is otherwise; and if and for every , and is otherwise. The weights are , , , and . The dagger denotes conjugate transpose. The definition includes , imposes no positivity restrictions, and does not normalize the selected branch.
QAlgorithms.Papers.Independent.Intakenext100.P93.catBellInput
This defines the vector in the complex Euclidean space indexed by pairs of Boolean values, with amplitudes
Thus , where each displayed basis vector has amplitude at its indicated Boolean pair and elsewhere.
QAlgorithms.Papers.Independent.Intakenext100.P93.catBlockEncoder
For all natural numbers , this defines a complex matrix with rows indexed by -tuples of binary words of length , and columns indexed by binary words of length , whose entry is
Equivalently, the entry is exactly when each block consists entirely of the bit , and is otherwise. Both and are included; when , the empty product is , so the sole matrix entry is .
QAlgorithms.Papers.Independent.Intakenext100.P93.catInstrumentOutput
For every natural number and arbitrary real numbers , this defines a complex matrix indexed by triples . Put , , , , and . For length- binary words, let ; let be if every bit of equals , and otherwise; let be if and , and otherwise; and let be if , and otherwise. Then its entries are
Thus each diagonal syndrome block is obtained by encoding the second half of , applying the displayed weighted Pauli conjugations, and applying on that half. There is no division by the syndrome mass. The definition includes and imposes no positivity or normalization assumptions on the real parameters.
QAlgorithms.Papers.Independent.Intakenext100.P93.catLogicalSyndromeMass
For any natural number , arbitrary real numbers , Boolean values , and Boolean word of length , this defines
where is Boolean exclusive-or and , , , and . The parity condition comes from summing the Boolean conjunctions of with the all-true word. The parameters need not give nonnegative weights. When , is empty, the syndrome conditions are vacuous, and the value is .
QAlgorithms.Papers.Independent.Intakenext100.P93.catRate
For every natural number and arbitrary real numbers , this defines the real number
where , with applied through continuous functional calculus. Here has indices and entries
with ranging over length- binary words, , and . The matrix has entry exactly when all bits of equal ; has entry exactly when and for every ; and has entry at when , with all other entries zero. No assumption that these matrices are density matrices is imposed. The case is included, and the denominator is always positive.
QAlgorithms.Papers.Independent.Intakenext100.P93.concatenatedBlockEncoder
For arbitrary natural numbers , this defines a complex matrix whose rows are indexed by arrays , where , , and each is an -bit string, and whose columns are indexed by -bit strings . Identify Boolean values with , put , and write for when every bit of equals , and otherwise. The matrix entry is
Thus each factor uses the explicitly displayed matrix . The parameters and may be zero, so their corresponding strings still have lengths and . When , both indexing sets contain their unique empty array or string, and the sole matrix entry is the empty product .
QAlgorithms.Papers.Independent.Intakenext100.P93.concatenatedDecoderBranch
For all natural numbers , a binary word of length , and a tuple of binary words of length , this defines a complex matrix from tuples of length- binary words to a single bit. For any natural number and word , define the matrix
with bit row and length- word column . Define , define for length- binary words, and define . The matrix being defined is exactly
with ordinary matrix multiplication, so the rightmost factor acts first. Both and are permitted; the corresponding syndrome words are empty, and reads the sole bit.
QAlgorithms.Papers.Independent.Intakenext100.P93.concatenatedEncoder
For all natural numbers , this defines a complex matrix with rows indexed by tuples of binary words of length , and columns indexed by a bit , whose entries are
Here is when its condition holds and otherwise, and bits in the exponent are interpreted numerically. The definition includes , , and ; each block still has at least one bit.
QAlgorithms.Papers.Independent.Intakenext100.P93.concatenatedOutput
For all natural numbers and arbitrary real , this defines a complex matrix indexed by , where are bits, , and with . Let , let , and define exactly when and for every , with other entries zero. Set
and define
For tuples of length- words, put , with and , and put , where if , and otherwise. The defined entries are
Thus distinct combined syndrome labels have zero off-diagonal blocks, and the individual blocks are retained without normalization by their traces. The definition includes and , and imposes no probability assumptions on .
QAlgorithms.Papers.Independent.Intakenext100.P93.concatenatedRate
For every pair of natural numbers , including zero, and every real , this defines a real number as follows. Write , use for bitwise XOR, and let have entries ; write for the corresponding single-bit Hadamard matrix. Let when every bit of equals , and otherwise, and define
For , let , and set
Here tensor products of maps act separately on the indicated blocks. With , define the raw matrix
For , define to be if and for every , and otherwise. For and , put
Define , indexed by with , to have zero entries between distinct blocks, and within each block to equal . Then the defined value is
where uses continuous functional calculus and the real logarithm is totalized, with and for negative . The partial trace removes the first, reference-bit register. No restriction on or density-matrix hypothesis is imposed; the denominator is always positive.
QAlgorithms.Papers.Independent.Intakenext100.P93.concatenatedRawOutput
For all natural numbers and arbitrary real , this defines a complex matrix indexed by pairs , where is a bit and is a tuple of length- binary words. Define
For tuples of words of length , put
and define by , where if , and otherwise. The output entries are
Equivalently, the definition starts with , conjugates its second register by , and then applies the displayed weighted Pauli conjugations independently to its blocks, leaving the first register untouched. Zero values of and are included, and no restriction on is assumed.
QAlgorithms.Papers.Independent.Intakenext100.P93.concentrationTail
For every natural number and arbitrary real numbers , this defines when ; otherwise it defines
where counts true bits and
The selection condition is strict: the normalized syndrome weight must have distance greater than from both and . There are no assumptions that lie in , or that is nonnegative.
QAlgorithms.Papers.Independent.Intakenext100.P93.conditionalChannel
For every natural number , arbitrary real numbers , and binary word , this defines a function on complex matrices. To specify it, put , , , , and for binary words of length . Write , define when every bit of equals and otherwise, define when and and otherwise, and define when and otherwise. Here denotes bitwise exclusive-or. With
the defined function sends to if , and to otherwise. No restrictions ensuring that the are probabilities are assumed, and is arbitrary. The case , with its unique empty syndrome, is included.
QAlgorithms.Papers.Independent.Intakenext100.P93.decoderBranch
For every natural number and Boolean word of length , this defines a complex matrix with Boolean row index and length- Boolean column index , by
Here is exclusive-or: the coordinate map used in the definition sends to its first bit together with these exclusive-or values. When , the syndrome is empty and the entry is exactly when .
QAlgorithms.Papers.Independent.Intakenext100.P93.iidCatSyndromeMass
For any natural number , arbitrary real numbers , and Boolean word of length , this defines
where denotes exclusive-or and , , , and . Thus both the first-bit label and the phase-parity label are summed over. No positivity assumptions are imposed. For , the unique empty syndrome has value .
QAlgorithms.Papers.Independent.Intakenext100.P93.iidPauliNoise
For every natural number and arbitrary real numbers , this defines a function on all complex matrices indexed by length- Boolean words:
where , , , , and if , and otherwise. The dagger denotes conjugate transpose. Neither nor the parameters are subject to positivity hypotheses, and the definition itself imposes no channel condition. For , the function is the identity on one-by-one complex matrices.
QAlgorithms.Papers.Independent.Intakenext100.P93.noAmplitudeCount
For every natural number , Boolean value , and Boolean word of length , let be the number of true entries of . This defines the natural number when is true, and when is false. Subtraction is natural-number subtraction, truncated at zero, although ensures that no truncation occurs here. When , the value is for true and for false .
QAlgorithms.Papers.Independent.Intakenext100.P93.noiseThreshold
For every function , with no continuity, monotonicity, or sign assumption, this defines
Thus is included regardless of , both endpoints of the search interval are permitted, and strict positivity of is required for membership through the second set. The supremum is if that second set is empty; it need not itself be a point where is positive.
QAlgorithms.Papers.Independent.Intakenext100.P93.orderedPauli
For every natural number and Boolean words of length , this defines a complex matrix with rows and columns indexed by Boolean words of length , whose entries are
Here bits are interpreted as or , and exclusive-or is applied coordinatewise. Equivalently, its action on a vector has amplitude at ; the column indexed by is obtained by taking to have amplitude at and elsewhere. For , this is the one-by-one matrix with entry .
QAlgorithms.Papers.Independent.Intakenext100.P93.pauliErrorWordMass
For any natural number , arbitrary real numbers , and Boolean words of length , this defines
where and denote false and true. No restrictions on the real parameters are imposed. When , both words are empty and the empty product is .
QAlgorithms.Papers.Independent.Intakenext100.P93.pauliMass
For arbitrary real numbers and Boolean values , this defines the real number
There are no nonnegativity or normalization hypotheses on the parameters; in particular, these values may be negative.
QAlgorithms.Papers.Independent.Intakenext100.P93.syndromeWeightMass
For every natural number , arbitrary real numbers , and natural number , this defines the real sum
where counts the true bits of , is exclusive-or, and . Thus it adds the prescribed syndrome masses over precisely the syndromes of weight . No probability assumptions on the parameters are made. If , the sum is empty and equals ; when , only selects the unique empty syndrome.
QAlgorithms.Papers.Independent.Intakenext100.P93.twoPauliChannel
For every real , this defines a map on all complex matrices by
with rows and columns ordered by the Boolean values false, true. The definition accepts arbitrary matrices , without positivity or trace assumptions, and arbitrary , including values outside .
QAlgorithms.Papers.Independent.Intakenext100.P93.twoPauliDilation
For every real , this defines a complex matrix with input index and output index by
The square roots are real square roots, embedded in ; for a negative argument this total real-square-root operation returns . No range assumption on or isometry assertion is part of this definition.
QAlgorithms.Papers.Independent.Intakenext100.P93.xCatEncoder
For every natural number , this defines a complex matrix with rows indexed by binary words of length and columns indexed by a bit , with entry
where bits in exponents are interpreted as or . Thus the product uses the same bit at every position before summing over . The case is included; its matrix is after identifying a one-bit word with its bit.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.