Definitions for Performance and structure of single-mode bosonic codes
DefinitionQAlgorithms_Papers_Independent_Intakenext100_P65The objects the formalized statements of Performance and structure of single-mode bosonic codes (arXiv:1708.05010) are stated in. Each was checked against the paper by a blind read-back and a moderator.
FockCoordinates: PDF pp.2--3: number-basis coordinates, prior to imposing the Hilbert domain.fockDomain: PDF p.2: the full oscillator Hilbert domain, expressed in its countable ONB.fockNormSq: PDF p.2: squared Hilbert norm on the square-summable domain.fockInner: PDF p.2: inner product, conjugate-linear in the first entry.fockMomentDomain: PDF pp.2,4: a finite photon-number moment has a summability domain.numberMoment: PDF pp.4,18: kth number moment, only used onfockMomentDomain.codeMoment: PDF p.4 (2.1): literal half-sum of the two logical number moments.annPower: PDF p.2: coefficient of a^k, including its factorial normalization.annDomain: PDF p.2: natural domain of the unbounded annihilation power.lossCoefficient: PDF p.2 (1.4): the exact loss coefficient for input occupation n, zero below l.lossVector: PDF p.2 (1.4): loss Kraus action on the full number basis.qecBlock: PDF p.8 (4.1): actual compression of E_l^dagger E_k, not a free QEC matrix.qecC: PDF p.8 (4.4): coefficient of the identity.qecZ: PDF p.8 (4.4): coefficient of logical Z in the chosen basis.qecX: PDF p.8 (4.4): coefficient of logical X, including nonsymmetric off-diagonal blocks.liouvilleBasis: PDF p.3 (1.8): I,X,Y,Z, using the accepted Bool-indexed Pauli matrices with Fin 2 labels 0,1 mapped to false,true.liouville: PDF p.3 (1.8): Pauli Liouville matrix; this is distinct from the Choi matrix.traceReference: PDF p.7 (3.3): trace over the reference, leaving the channel's output marginal.reverseInformation: PDF p.7 (3.3): reverse coherentCoordinates information, without capacity optimization. The frozen output-first Choi operator is unnormalized; multiplying by 1/2 gives the trace-one qubit Choi state in (1.9).qubitFrobeniusSq: PDF p.7 (3.4): squared Frobenius norm from accepted Advance50.P29, specialized to the effective qubit channel.worstPureFidelity: PDF p.24 (A2): minimum over normalized pure inputs; compactness and CPTP supply a nonempty bounded set, with attainment asserted below.residueProject: PDF p.9 (5.3): periodic residue projector, allowing signed residue labels.coherentCoordinates: PDF p.9: normalized coherentCoordinates-state coefficients for real amplitude a.catNorm: PDF p.9 (5.2): the actual projected coherentCoordinates-state probability.catCodeCoordinates: PDF p.9 (5.1): normalized projected coherentCoordinates coordinates; a>0 in every use.residueCheck: PDF p.9 (5.7): bounded number-phase rotation.residueLogicalZ: PDF p.9 following (5.7): the specified square root of the check is logical Z.catNormFourier: PDF p.9 (5.5): Fourier projection using exact coherentCoordinates-state overlaps.catLossRatio: PDF pp.9--11: probability ratios with signed residues, before taking any limit.poissonWeight: PDF p.10 (5.12): Poisson weight whose mean g*a^2 varies with a.antipodal: PDF p.14 (6.11): finite spin coefficients, indexed by twice the spin.binomialCodeCoordinates: PDF p.11 (6.1): direct full-Fock binomialCodeCoordinates coordinates.binomialParity: PDF p.12 (6.4): the positive/negative logical combinations.binomialGenerator: PDF p.12 (6.5): exact generating polynomial, with plus/minus sign.spinX: PDF p.14: standard spin-x matrix, on m=0,...,M for spin M/2.embedOne: PDF pp.14--15: transport of a coefficient vector to one mode.embedTwo: PDF p.15 Fig.7(a), p.27: two-mode transport with the spacing in BOTH occupations. Printed (6.16) drops a spacing factor; use the explicit preceding basis map.qubitDickeCoordinates: PDF p.15: accepted Information100.P22.dicke in Fin 2 word coordinates; Bool false,true correspond to 0,1. Infeasible excitation weights give zero.embedDicke: PDF p.15 (6.14): the spaced Dicke transport (K >= M(S+1) at use sites).smallGenerator: PDF p.17: even/odd spin generator on the stated seven-dimensional invariant space.smallUnitary: PDF p.17 (6.21): a=8,b=5, with identity extension outside the invariant space.smallBasis: PDF p.17 Tables II--III: actual normalized code, dephasing residual, loss, and failure vectors. Residual normalization is sqrt(3), correcting the false coefficient 2 in (6.20).totalQuditExcitation: PDF p.28 (C4): totalQuditExcitation of an M-qudit computational word.extendedCount: PDF p.27 (C2),(C4): number of words of a given total totalQuditExcitation.extendedVector: PDF p.27 (C4): normalized extended binomialCodeCoordinates vector, distinct from a general qudit Dicke vector.quditFourierFactor: PDF p.28 (C8): positive Fourier phase, matching the explicit backwards shift (C7).extendedCoefficients: PDF p.27 (C3): totalQuditExcitation-basis coefficients, including the endpoint (d-1)M.permCode: PDF p.27 (C3): the new multi-qudit code, in extended-binomialCodeCoordinates coordinates.fourierProduct: PDF p.28 (C9): tensor product of M identical Fourier vectors.nextLabel: PDF p.28 (C7): the input label one step above the output label.collectiveShift: PDF p.28 (C10): average of the backwards cyclic shifts on individual qudits.compressedShift: PDF p.28: compression to the extended-binomialCodeCoordinates span, of dimension (d-1)M+1.weylPhase: PDF p.28 (D1b): the positive Weyl convention.lossEntry: PDF p.2 (1.4): number-basis kernel of a single loss Kraus operator.lossProduct: PDF p.19 (7.12): genuine product kernel, before the displacement expansion.lossDisplacementIntegrand: PDF p.19 (7.12): integrand INCLUDING the factor 1/pi, on complex-plane Lebesgue measure.fockDensity: PDF pp.2,20: positive trace-one full Fock kernels. Positivity of every finite principal compression and summability of the nonnegative diagonal characterize positive trace-class operators; there is no fixed cutoff.lossChannel: PDF p.2: pure loss, by the countable Kraus sum on actual Fock kernels.amplifierChannel: PDF p.20 (7.20): amplification after loss; Kraus operators sqrt(1-g) E_l^dagger.displaceDensity: PDF p.20 (7.21): displacement conjugation, evaluated on all matrix entries.amplifiedLossDensity: PDF p.20 (7.21): density of the amplified-loss displacement distribution on C.idealComb: PDF p.18 (7.5): distributional square-code comb acting linearly on tests.regularizedLattice: PDF pp.18,29 (7.6),(D5): Gaussian-Abel regularized coherentCoordinates-lattice sum. The ordered product is D_real D_imag; it is evaluated on the vacuum in position coordinates.kernelLattice: PDF p.29 (D9): normalizer-lattice displacement, with signed mu-nu offset.kernelPhase: PDF p.29 (D9): phase for the positive Weyl convention.idealDisplacementKernel: PDF p.29 (D9): weak delta-comb kernel, evaluated against a test function.smearedWave: PDF pp.18,29 (7.7c),(D10): actual Gaussian-smeared comb wavefunction. The factor sqrt(2/sqrt(pi)) is the D9 weak-kernel normalization, not unit norm.displaceWave: PDF p.29 (D10): D_z on position wavefunctions under the positive Weyl convention.smearedNorm: PDF p.29: exact, generally nonunit, squared norm of the smeared vector.normalizedSmearedWave: PDF pp.18,29: individual normalization; finite-delta logical orthogonality is NOT assumed.smearedKernelIntegral: PDF p.29 (D10): convolution after evaluating the weak delta kernel; the factor 1/(pi*d^2/2) and both ordered Weyl factors are retained.smearedKernelSum: PDF p.29 (D11): exact finite-smearing lattice kernel, including the envelope.hermitePhys: PDF p.18 (7.9): physicists' Hermite polynomial for the oscillator basis.hermiteWave: PDF p.18: normalized position wavefunction of the nth Fock state.gkpFock: PDF p.18 (7.7c): actual Fock coefficients of the individually normalized smeared wave.LatticeShape: PDF pp.20--21: the two lattice geometries explicitly covered by the bound.gkpNormalizerPoint: PDF pp.20--21: lattice normalizer step, covolume pi/2; stabilizers have twice the steps.nearestLattice: PDF p.20 (7.22): syndrome rounding in the normalizer lattice. A fixed classical choice only resolves measure-zero ties; it is independent of the logical input.correctableCell: PDF p.20: central Voronoi cell, including ties.modularSyndrome: PDF p.20 (7.22): measured residual displacement after the chosen ideal correction.logicalCoset: PDF p.20: normalizer modulo stabilizer (2L), i.e. the residual logical Pauli coset.amplifiedLossLaw: PDF p.20 (7.21): actual Gaussian measure, with no probability axiom assumed.cosetProbability: PDF pp.20--21: exact probabilities of the four logical cosets, including identity translates.cosetPauli: PDF p.20: logical X^a Z^b action after ideal modular correction.idealRecoveredChannel: PDF p.20 (7.22): logical channel constructed from syndrome and lattice cosets, with the amplification noise already included. It has no physical ideal-state encoder.centralSuccess: PDF p.20 (7.23): guaranteed central square-cell probability.centralFailure: PDF p.21 (7.24): central-cell failure, which can exceed logical entanglement infidelity.noJump: PDF p.22 (8.3): no-jump damping, with jump-rate scalar factors deliberately omitted.jumpTrajectory: PDF p.22 (8.3): chronological product of actual annihilations and damping intervals.trajectoryScalar: PDF p.22: the scalar relating the trajectory to the integrated loss Kraus operator.
import Mathlib
import Definitions.Def_QAlgorithms_Defs_QuditChannelFidelities
import Definitions.Def_QAlgorithms_Defs_Ensemble
import Definitions.Def_QAlgorithms_Defs_Gates
import Definitions.Def_QAlgorithms_Papers_Independent_Advance50_P29
import Definitions.Def_QAlgorithms_Papers_Independent_Frontier18_P14
import Definitions.Def_QAlgorithms_Papers_Independent_Information100_P56
import Definitions.Def_QAlgorithms_Papers_Independent_Dependency50_P40
/-!
Statements from Albert et al., arXiv:1708.05010v3. All page references are PDF pages.
Oscillator formulas use the complete number basis, never a numerical Fock cutoff.
A coordinate sequence is admitted as a Hilbert vector only with `fockDomain`;
unbounded powers carry `annDomain` or `fockMomentDomain`. Ideal combs instead act on
Schwartz test functions. No ideal comb is declared to be a unit Hilbert vector.
-/
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakenext100.P65
open MeasureTheory Filter
open QAlgorithms.Papers.Independent.Frontier18.P14 (displacementEntry)
open QAlgorithms.Papers.Independent.Dependency50.P40 (outputFirstChoi)
open scoped ComplexConjugate Matrix Topology
attribute [local instance] Classical.propDecidable
attribute [local instance] Classical.decEq
/-- PDF pp.2--3: number-basis coordinates, prior to imposing the Hilbert domain. -/
abbrev FockCoordinates := ℕ → ℂ
/-- PDF p.2: the full oscillator Hilbert domain, expressed in its countable ONB. -/
def fockDomain (v : FockCoordinates) : Prop := Summable (fun n => Complex.normSq (v n))
/-- PDF p.2: squared Hilbert norm on the square-summable domain. -/
def fockNormSq (v : FockCoordinates) : ℝ := ∑' n, Complex.normSq (v n)
/-- PDF p.2: inner product, conjugate-linear in the first entry. -/
def fockInner (v w : FockCoordinates) : ℂ := ∑' n, conj (v n) * w n
/-- PDF pp.2,4: a finite photon-number moment has a summability domain. -/
def fockMomentDomain (v : FockCoordinates) (k : ℕ) : Prop :=
Summable (fun n : ℕ => (n : ℝ) ^ k * Complex.normSq (v n))
/-- PDF pp.4,18: kth number moment, only used on `fockMomentDomain`. -/
def numberMoment (v : FockCoordinates) (k : ℕ) : ℝ :=
∑' n : ℕ, (n : ℝ) ^ k * Complex.normSq (v n)
/-- PDF p.4 (2.1): literal half-sum of the two logical number moments. -/
def codeMoment (B : Fin 2 → FockCoordinates) (k : ℕ) : ℝ :=
(numberMoment (B 0) k + numberMoment (B 1) k) / 2
/-- PDF p.2: coefficient of a^k, including its factorial normalization. -/
def annPower (k : ℕ) (v : FockCoordinates) : FockCoordinates :=
fun n => (Real.sqrt ((Nat.factorial (n + k) : ℝ) / Nat.factorial n) : ℂ) * v (n + k)
/-- PDF p.2: natural domain of the unbounded annihilation power. -/
def annDomain (k : ℕ) (v : FockCoordinates) : Prop := fockDomain v ∧ fockDomain (annPower k v)
/-- PDF p.2 (1.4): the exact loss coefficient for input occupation n, zero below l. -/
def lossCoefficient (g : ℝ) (l n : ℕ) : ℝ :=
if l ≤ n then Real.sqrt (Nat.choose n l : ℝ) * Real.sqrt g ^ l *
Real.sqrt (1 - g) ^ (n - l) else 0
/-- PDF p.2 (1.4): loss Kraus action on the full number basis. -/
def lossVector (g : ℝ) (l : ℕ) (v : FockCoordinates) : FockCoordinates :=
fun n => (lossCoefficient g l (n + l) : ℂ) * v (n + l)
/-- PDF p.8 (4.1): actual compression of E_l^dagger E_k, not a free QEC matrix. -/
def qecBlock (B : Fin 2 → FockCoordinates) (g : ℝ) (l k : ℕ) : Matrix (Fin 2) (Fin 2) ℂ :=
fun i j => fockInner (lossVector g l (B i)) (lossVector g k (B j))
/-- PDF p.8 (4.4): coefficient of the identity. -/
def qecC (B : Fin 2 → FockCoordinates) (g : ℝ) (l k : ℕ) : ℝ :=
((qecBlock B g l k 0 0 + qecBlock B g l k 1 1) / 2).re
/-- PDF p.8 (4.4): coefficient of logical Z in the chosen basis. -/
def qecZ (B : Fin 2 → FockCoordinates) (g : ℝ) (l k : ℕ) : ℝ :=
((qecBlock B g l k 0 0 - qecBlock B g l k 1 1) / 2).re
/-- PDF p.8 (4.4): coefficient of logical X, including nonsymmetric off-diagonal blocks. -/
def qecX (B : Fin 2 → FockCoordinates) (g : ℝ) (l k : ℕ) : ℝ :=
((qecBlock B g l k 0 1 + qecBlock B g l k 1 0) / 2).re
/-- PDF p.3 (1.8): I,X,Y,Z, using the accepted Bool-indexed Pauli matrices
with Fin 2 labels 0,1 mapped to false,true. -/
def liouvilleBasis : Fin 4 → Matrix (Fin 2) (Fin 2) ℂ :=
![1, (fun i j => pauliX (decide (i.val = 1)) (decide (j.val = 1))),
(fun i j => pauliY (decide (i.val = 1)) (decide (j.val = 1))),
(fun i j => pauliZ (decide (i.val = 1)) (decide (j.val = 1)))]
/-- PDF p.3 (1.8): Pauli Liouville matrix; this is distinct from the Choi matrix. -/
def liouville (T : Superop (Fin 2) (Fin 2)) : Matrix (Fin 4) (Fin 4) ℂ :=
fun k l => ((liouvilleBasis k * T (liouvilleBasis l)).trace) / 2
/-- PDF p.7 (3.3): trace over the reference, leaving the channel's output marginal. -/
def traceReference (R : Matrix (Fin 2 × Fin 2) (Fin 2 × Fin 2) ℂ) : Matrix (Fin 2) (Fin 2) ℂ :=
fun i j => ∑ r, R (i, r) (j, r)
/-- PDF p.7 (3.3): reverse coherentCoordinates information, without capacity optimization.
The frozen output-first Choi operator is unnormalized; multiplying by 1/2
gives the trace-one qubit Choi state in (1.9). -/
def reverseInformation (T : Superop (Fin 2) (Fin 2)) : ℝ :=
vnEntropy (traceReference ((1 / 2 : ℂ) • outputFirstChoi T)) - vnEntropy ((1 / 2 : ℂ) • outputFirstChoi T)
/-- PDF p.7 (3.4): squared Frobenius norm from accepted Advance50.P29,
specialized to the effective qubit channel. -/
def qubitFrobeniusSq (A : Matrix (Fin 2) (Fin 2) ℂ) : ℝ :=
QAlgorithms.Papers.Independent.Advance50.P29.frobeniusSq A
/-- PDF p.24 (A2): minimum over normalized pure inputs; compactness and CPTP
supply a nonempty bounded set, with attainment asserted below. -/
def worstPureFidelity (d : ℕ) (T : Superop (Fin d) (Fin d)) : ℝ :=
sInf {r : ℝ | ∃ v : EuclideanSpace ℂ (Fin d), ‖v‖ = 1 ∧
r = effectProb (pureDensity v) (T (pureDensity v))}
/-- PDF p.9 (5.3): periodic residue projector, allowing signed residue labels. -/
def residueProject (S : ℕ) (r : ℤ) (v : FockCoordinates) : FockCoordinates :=
fun n => if (n : ℤ) % (2 * (S + 1) : ℕ) = r % (2 * (S + 1) : ℕ) then v n else 0
/-- PDF p.9: normalized coherentCoordinates-state coefficients for real amplitude a. -/
def coherentCoordinates (a : ℝ) : FockCoordinates :=
QAlgorithms.Papers.Independent.Frontier18.P14.coherentCoefficient (a : ℂ)
/-- PDF p.9 (5.2): the actual projected coherentCoordinates-state probability. -/
def catNorm (a : ℝ) (S : ℕ) (r : ℤ) : ℝ :=
fockNormSq (residueProject S r (coherentCoordinates a))
/-- PDF p.9 (5.1): normalized projected coherentCoordinates coordinates; a>0 in every use. -/
def catCodeCoordinates (a : ℝ) (S : ℕ) (mu : Fin 2) : FockCoordinates :=
fun n => residueProject S ((S + 1) * mu.val : ℕ) (coherentCoordinates a) n /
(Real.sqrt (catNorm a S ((S + 1) * mu.val : ℕ)) : ℂ)
/-- PDF p.9 (5.7): bounded number-phase rotation. -/
def residueCheck (S : ℕ) (v : FockCoordinates) : FockCoordinates :=
fun n => Complex.exp (Complex.I * (2 * Real.pi * (n : ℝ) / (S + 1))) * v n
/-- PDF p.9 following (5.7): the specified square root of the check is logical Z. -/
def residueLogicalZ (S : ℕ) (v : FockCoordinates) : FockCoordinates :=
fun n => Complex.exp (Complex.I * (Real.pi * (n : ℝ) / (S + 1))) * v n
/-- PDF p.9 (5.5): Fourier projection using exact coherentCoordinates-state overlaps. -/
def catNormFourier (a : ℝ) (S : ℕ) (mu : Fin 2) : ℂ :=
(1 / (2 * (S + 1) : ℂ)) * ∑ s ∈ Finset.range (2 * (S + 1)),
(-1 : ℂ) ^ (mu.val * s) *
Complex.exp ((a ^ 2 : ℝ) * (Complex.exp (Complex.I * (Real.pi * (s : ℝ) / (S + 1))) - 1))
/-- PDF pp.9--11: probability ratios with signed residues, before taking any limit. -/
def catLossRatio (a : ℝ) (S : ℕ) (g : ℝ) (l : ℕ) (mu : Fin 2) : ℝ :=
catNorm (a * Real.sqrt (1 - g)) S ((((S + 1) * mu.val : ℕ) : ℤ) - (l : ℤ)) /
catNorm a S ((S + 1) * mu.val : ℕ)
/-- PDF p.10 (5.12): Poisson weight whose mean g*a^2 varies with a. -/
def poissonWeight (a g : ℝ) (l : ℕ) : ℝ :=
(g * a ^ 2) ^ l * Real.exp (-g * a ^ 2) / Nat.factorial l
/-- PDF p.14 (6.11): finite spin coefficients, indexed by twice the spin. -/
def antipodal (M : ℕ) (mu : Fin 2) (m : Fin (M + 1)) : ℂ :=
(-1 : ℂ) ^ (mu.val * m.val) * (Real.sqrt (Nat.choose M m.val) / Real.sqrt ((2 : ℝ) ^ M) : ℝ)
/-- PDF p.11 (6.1): direct full-Fock binomialCodeCoordinates coordinates. -/
def binomialCodeCoordinates (N S : ℕ) (mu : Fin 2) : FockCoordinates :=
fun n => if h : n % (S + 1) = 0 ∧ n / (S + 1) ≤ N + 1 then
antipodal (N + 1) mu ⟨n / (S + 1), Nat.lt_succ_of_le h.2⟩ else 0
/-- PDF p.12 (6.4): the positive/negative logical combinations. -/
def binomialParity (N S : ℕ) (mu : Fin 2) : FockCoordinates :=
fun n => (binomialCodeCoordinates N S 0 n + (-1 : ℂ) ^ mu.val * binomialCodeCoordinates N S 1 n) / (Real.sqrt 2 : ℂ)
/-- PDF p.12 (6.5): exact generating polynomial, with plus/minus sign. -/
def binomialGenerator (N S : ℕ) (minus : Bool) : Polynomial ℝ :=
((Polynomial.C (1 / 2)) *
(1 + Polynomial.C (if minus then -1 else 1) * Polynomial.X ^ (S + 1))) ^ (N + 1)
/-- PDF p.14: standard spin-x matrix, on m=0,...,M for spin M/2. -/
def spinX (M : ℕ) : Matrix (Fin (M + 1)) (Fin (M + 1)) ℂ :=
fun i j => if i.val = j.val + 1 then
(Real.sqrt (((j.val + 1 : ℕ) : ℝ) * (M - j.val)) / 2 : ℝ)
else if j.val = i.val + 1 then
(Real.sqrt (((i.val + 1 : ℕ) : ℝ) * (M - i.val)) / 2 : ℝ) else 0
/-- PDF pp.14--15: transport of a coefficient vector to one mode. -/
def embedOne (M S : ℕ) (v : Fin (M + 1) → ℂ) : FockCoordinates :=
fun n => ∑ m, if n = (S + 1) * m.val then v m else 0
/-- PDF p.15 Fig.7(a), p.27: two-mode transport with the spacing in BOTH occupations.
Printed (6.16) drops a spacing factor; use the explicit preceding basis map. -/
def embedTwo (M S : ℕ) (v : Fin (M + 1) → ℂ) : ℕ × ℕ → ℂ :=
fun n => ∑ m, if n = ((S + 1) * (M - m.val), (S + 1) * m.val) then v m else 0
/-- PDF p.15: accepted Information100.P22.dicke in Fin 2 word coordinates;
Bool false,true correspond to 0,1. Infeasible excitation weights give zero. -/
def qubitDickeCoordinates (K r : ℕ) (x : Fin K → Fin 2) : ℂ :=
QAlgorithms.Papers.Independent.Information100.P22.dicke (I := Fin K) r
(fun i => decide ((x i).val = 1))
/-- PDF p.15 (6.14): the spaced Dicke transport (K >= M(S+1) at use sites). -/
def embedDicke (M S K : ℕ) (v : Fin (M + 1) → ℂ) (x : Fin K → Fin 2) : ℂ :=
∑ m, v m * qubitDickeCoordinates K ((S + 1) * m.val) x
/-- PDF p.17: even/odd spin generator on the stated seven-dimensional invariant space. -/
def smallGenerator : Matrix (Fin 7) (Fin 7) ℂ :=
let even : Matrix (Fin 7) (Fin 4) ℂ := fun n m => if n.val = 2 * m.val then 1 else 0
let odd : Matrix (Fin 7) (Fin 3) ℂ := fun n m => if n.val = 2 * m.val + 1 then 1 else 0
8 • (even * spinX 3 * evenᴴ) ^ 2 + (odd * spinX 2 * oddᴴ) ^ 2
/-- PDF p.17 (6.21): a=8,b=5, with identity extension outside the invariant space. -/
def smallUnitary : Matrix (Fin 7) (Fin 7) ℂ :=
NormedSpace.exp (((((2 * Real.pi / 5 : ℝ) : ℂ) * Complex.I) • smallGenerator))
/-- PDF p.17 Tables II--III: actual normalized code, dephasing residual, loss, and failure vectors.
Residual normalization is sqrt(3), correcting the false coefficient 2 in (6.20). -/
def smallBasis (j : Fin 7) (n : Fin 7) : ℂ :=
if h0 : j.val < 2 then binomialCodeCoordinates 2 1 ⟨j.val, by omega⟩ n.val
else if h1 : j.val < 4 then
(((n.val : ℝ) - 3) / Real.sqrt 3 : ℝ) * binomialCodeCoordinates 2 1 ⟨j.val - 2, by omega⟩ n.val
else if h2 : j.val < 6 then
annPower 1 (binomialCodeCoordinates 2 1 ⟨j.val - 4, by omega⟩) n.val / (Real.sqrt 3 : ℂ)
else if n.val = 1 then (1 / Real.sqrt 2 : ℝ)
else if n.val = 5 then (-1 / Real.sqrt 2 : ℝ) else 0
/-- Small exact sanity cases for the new coordinate constructors. -/
example : lossCoefficient (0 : ℝ) 1 0 = 0 := by simp [lossCoefficient]
example (v : FockCoordinates) : residueProject 0 0 v 0 = v 0 := by simp [residueProject]
example : coherentCoordinates 0 0 = 1 := by simp [coherentCoordinates,
QAlgorithms.Papers.Independent.Frontier18.P14.coherentCoefficient]
example : binomialCodeCoordinates 0 0 0 0 = (1 / Real.sqrt 2 : ℝ) := by
simp [binomialCodeCoordinates, antipodal]
example : (spinX 0) 0 0 = 0 := by simp [spinX]
example (v : Fin 1 → ℂ) : embedTwo 0 0 v (0, 0) = v 0 := by simp [embedTwo]
/-- PDF p.28 (C4): totalQuditExcitation of an M-qudit computational word. -/
def totalQuditExcitation {d M : ℕ} (x : Fin M → Fin d) : ℕ := ∑ i, (x i).val
/-- PDF p.27 (C2),(C4): number of words of a given total totalQuditExcitation. -/
def extendedCount (d M m : ℕ) : ℕ :=
(Finset.univ.filter (fun x : Fin M → Fin d => totalQuditExcitation x = m)).card
/-- PDF p.27 (C4): normalized extended binomialCodeCoordinates vector, distinct from a general qudit Dicke vector. -/
def extendedVector (d M m : ℕ) (x : Fin M → Fin d) : ℂ :=
if totalQuditExcitation x = m then (1 / Real.sqrt (extendedCount d M m) : ℝ) else 0
/-- PDF p.28 (C8): positive Fourier phase, matching the explicit backwards shift (C7). -/
def quditFourierFactor (d : ℕ) (mu m : ℕ) : ℂ :=
Complex.exp (Complex.I * (2 * Real.pi * (mu : ℝ) * (m : ℝ) / d))
/-- PDF p.27 (C3): totalQuditExcitation-basis coefficients, including the endpoint (d-1)M. -/
def extendedCoefficients (d M : ℕ) (mu : Fin d) (m : Fin ((d - 1) * M + 1)) : ℂ :=
quditFourierFactor d mu.val m.val *
(Real.sqrt (extendedCount d M m.val) / Real.sqrt ((d : ℝ) ^ M) : ℝ)
/-- PDF p.27 (C3): the new multi-qudit code, in extended-binomialCodeCoordinates coordinates. -/
def permCode (d M : ℕ) (mu : Fin d) (x : Fin M → Fin d) : ℂ :=
∑ m : Fin ((d - 1) * M + 1), extendedCoefficients d M mu m * extendedVector d M m.val x
/-- PDF p.28 (C9): tensor product of M identical Fourier vectors. -/
def fourierProduct (d M : ℕ) (mu : Fin d) (x : Fin M → Fin d) : ℂ :=
∏ i, quditFourierFactor d mu.val (x i).val / (Real.sqrt d : ℂ)
/-- PDF p.28 (C7): the input label one step above the output label. -/
def nextLabel {d : ℕ} (hd : 0 < d) (j : Fin d) : Fin d :=
⟨(j.val + 1) % d, Nat.mod_lt _ hd⟩
/-- PDF p.28 (C10): average of the backwards cyclic shifts on individual qudits. -/
def collectiveShift (d M : ℕ) (hd : 0 < d) :
Matrix (Fin M → Fin d) (Fin M → Fin d) ℂ :=
fun x y => (1 / (M : ℂ)) * ∑ k : Fin M,
if y = Function.update x k (nextLabel hd (x k)) then 1 else 0
/-- PDF p.28: compression to the extended-binomialCodeCoordinates span, of dimension (d-1)M+1. -/
def compressedShift (d M : ℕ) (hd : 0 < d) :
Matrix (Fin ((d - 1) * M + 1)) (Fin ((d - 1) * M + 1)) ℂ :=
let V : Matrix (Fin M → Fin d) (Fin ((d - 1) * M + 1)) ℂ :=
fun x m => extendedVector d M m.val x
Vᴴ * collectiveShift d M hd * V
/-- PDF p.28 (D1b): the positive Weyl convention. -/
def weylPhase (a b : ℂ) : ℂ := Complex.exp ((a * conj b - conj a * b) / 2)
/-- PDF p.2 (1.4): number-basis kernel of a single loss Kraus operator. -/
def lossEntry (g : ℝ) (l n m : ℕ) : ℂ :=
if m = n + l then (lossCoefficient g l m : ℂ) else 0
/-- PDF p.19 (7.12): genuine product kernel, before the displacement expansion. -/
def lossProduct (g : ℝ) (l k n m : ℕ) : ℂ :=
∑' j, conj (lossEntry g l j n) * lossEntry g k j m
/-- PDF p.19 (7.12): integrand INCLUDING the factor 1/pi, on complex-plane Lebesgue measure. -/
def lossDisplacementIntegrand (g : ℝ) (l k n m : ℕ) (z : ℂ) : ℂ :=
(Real.exp (-(1 - g) * Complex.normSq z / 2) / Real.pi : ℝ) *
displacementEntry (conj z) l k * displacementEntry ((Real.sqrt g : ℂ) * z) n m
section FockDensityOrder
open scoped ComplexOrder
/-- PDF pp.2,20: positive trace-one full Fock kernels. Positivity of every finite
principal compression and summability of the nonnegative diagonal characterize
positive trace-class operators; there is no fixed cutoff. -/
def fockDensity (R : ℕ → ℕ → ℂ) : Prop :=
(∀ d : ℕ, Matrix.PosSemidef ((fun i j : Fin d => R i.val j.val) : Matrix (Fin d) (Fin d) ℂ)) ∧
Summable (fun n => (R n n).re) ∧ (∑' n, (R n n).re) = 1
end FockDensityOrder
/-- PDF p.2: pure loss, by the countable Kraus sum on actual Fock kernels. -/
def lossChannel (g : ℝ) (R : ℕ → ℕ → ℂ) (n m : ℕ) : ℂ :=
∑' l, (lossCoefficient g l (n + l) * lossCoefficient g l (m + l) : ℝ) * R (n + l) (m + l)
/-- PDF p.20 (7.20): amplification after loss; Kraus operators sqrt(1-g) E_l^dagger. -/
def amplifierChannel (g : ℝ) (R : ℕ → ℕ → ℂ) (n m : ℕ) : ℂ :=
∑ l ∈ Finset.range (min n m + 1),
((1 - g) * lossCoefficient g l n * lossCoefficient g l m : ℝ) * R (n - l) (m - l)
/-- PDF p.20 (7.21): displacement conjugation, evaluated on all matrix entries. -/
def displaceDensity (z : ℂ) (R : ℕ → ℕ → ℂ) (n m : ℕ) : ℂ :=
∑' j, ∑' k, displacementEntry z n j * R j k * conj (displacementEntry z m k)
/-- PDF p.20 (7.21): density of the amplified-loss displacement distribution on C. -/
def amplifiedLossDensity (g : ℝ) (z : ℂ) : ℝ :=
(1 - g) / (Real.pi * g) * Real.exp (-(1 - g) / g * Complex.normSq z)
/-- PDF p.18 (7.5): distributional square-code comb acting linearly on tests. -/
def idealComb (mu : Fin 2) (f : ℝ → ℂ) : ℂ :=
∑' n : ℤ, f (Real.sqrt Real.pi * (2 * (n : ℝ) + mu.val))
/-- PDF pp.18,29 (7.6),(D5): Gaussian-Abel regularized coherentCoordinates-lattice sum.
The ordered product is D_real D_imag; it is evaluated on the vacuum in position coordinates. -/
def regularizedLattice (mu : Fin 2) (r x : ℝ) : ℂ :=
∑' n : ℤ × ℤ,
let q := Real.sqrt Real.pi * (2 * (n.1 : ℝ) + mu.val)
(Real.exp (-r * ((n.1 : ℝ) ^ 2 + (n.2 : ℝ) ^ 2)) *
Real.rpow Real.pi (-1 / 4 : ℝ) * Real.exp (-(x - q) ^ 2 / 2) : ℝ) *
Complex.exp (Complex.I * (Real.sqrt Real.pi * (n.2 : ℝ) * (x - q)))
/-- PDF p.29 (D9): normalizer-lattice displacement, with signed mu-nu offset. -/
def kernelLattice (mu nu : Fin 2) (n : ℤ × ℤ) : ℂ :=
(Real.sqrt (Real.pi / 2) : ℂ) *
(((2 * (n.1 : ℝ) + (mu.val : ℝ) - nu.val) : ℂ) + Complex.I * (n.2 : ℝ))
/-- PDF p.29 (D9): phase for the positive Weyl convention. -/
def kernelPhase (mu nu : Fin 2) (n : ℤ × ℤ) : ℂ :=
Complex.exp (Complex.I * (Real.pi * ((n.1 : ℝ) + ((mu.val : ℝ) + nu.val) / 2) * (n.2 : ℝ)))
/-- PDF p.29 (D9): weak delta-comb kernel, evaluated against a test function. -/
def idealDisplacementKernel (mu nu : Fin 2) (f : ℂ → ℂ) : ℂ :=
∑' n : ℤ × ℤ, kernelPhase mu nu n * f (kernelLattice mu nu n)
/-- PDF pp.18,29 (7.7c),(D10): actual Gaussian-smeared comb wavefunction.
The factor sqrt(2/sqrt(pi)) is the D9 weak-kernel normalization, not unit norm. -/
def smearedWave (mu : Fin 2) (d x : ℝ) : ℂ :=
(Real.sqrt (2 / Real.sqrt Real.pi) : ℂ) * ∑' n : ℤ,
let q := Real.sqrt Real.pi * (2 * (n : ℝ) + mu.val)
(Real.exp (-(x - q) ^ 2 / (2 * d ^ 2) - d ^ 2 * (x + q) ^ 2 / 8) : ℝ)
/-- PDF p.29 (D10): D_z on position wavefunctions under the positive Weyl convention. -/
def displaceWave (z : ℂ) (v : ℝ → ℂ) (x : ℝ) : ℂ :=
Complex.exp (Complex.I * ((Real.sqrt 2 * z.im * x - z.re * z.im) : ℝ)) *
v (x - Real.sqrt 2 * z.re)
/-- PDF p.29: exact, generally nonunit, squared norm of the smeared vector. -/
def smearedNorm (mu : Fin 2) (d : ℝ) : ℝ := ∫ x : ℝ, Complex.normSq (smearedWave mu d x)
/-- PDF pp.18,29: individual normalization; finite-delta logical orthogonality is NOT assumed. -/
def normalizedSmearedWave (mu : Fin 2) (d x : ℝ) : ℂ :=
smearedWave mu d x / (Real.sqrt (smearedNorm mu d) : ℂ)
/-- PDF p.29 (D10): convolution after evaluating the weak delta kernel; the factor
1/(pi*d^2/2) and both ordered Weyl factors are retained. -/
def smearedKernelIntegral (mu nu : Fin 2) (d : ℝ) (z : ℂ) : ℂ :=
∑' n : ℤ × ℤ, kernelPhase mu nu n *
∫ b : ℂ,
(Real.exp (-(Complex.normSq b + Complex.normSq (kernelLattice mu nu n + b - z)) / d ^ 2) /
(Real.pi * d ^ 2 / 2) : ℝ) *
weylPhase (-b) z * weylPhase (z - b) (kernelLattice mu nu n + b - z)
/-- PDF p.29 (D11): exact finite-smearing lattice kernel, including the envelope. -/
def smearedKernelSum (mu nu : Fin 2) (d : ℝ) (z : ℂ) : ℂ :=
∑' n : ℤ × ℤ, kernelPhase mu nu n *
(Real.exp (-Complex.normSq (z - kernelLattice mu nu n) / (2 * d ^ 2) -
d ^ 2 * Complex.normSq (z + kernelLattice mu nu n) / 8) : ℝ)
/-- PDF p.18 (7.9): physicists' Hermite polynomial for the oscillator basis. -/
def hermitePhys : ℕ → Polynomial ℝ
| 0 => 1
| n + 1 => 2 * Polynomial.X * hermitePhys n - Polynomial.derivative (hermitePhys n)
/-- PDF p.18: normalized position wavefunction of the nth Fock state. -/
def hermiteWave (n : ℕ) (x : ℝ) : ℝ :=
(hermitePhys n).eval x * Real.exp (-x ^ 2 / 2) /
Real.sqrt ((2 : ℝ) ^ n * Nat.factorial n * Real.sqrt Real.pi)
/-- PDF p.18 (7.7c): actual Fock coefficients of the individually normalized smeared wave. -/
def gkpFock (d : ℝ) (mu : Fin 2) : FockCoordinates :=
fun n => ∫ x : ℝ, (hermiteWave n x : ℂ) * normalizedSmearedWave mu d x
/-- PDF pp.20--21: the two lattice geometries explicitly covered by the bound. -/
inductive LatticeShape where
| square
| hexagonal
deriving DecidableEq
/-- PDF pp.20--21: lattice normalizer step, covolume pi/2; stabilizers have twice the steps. -/
def gkpNormalizerPoint (shape : LatticeShape) (n : ℤ × ℤ) : ℂ :=
match shape with
| .square => (Real.sqrt (Real.pi / 2) : ℂ) * ((n.1 : ℂ) + Complex.I * (n.2 : ℂ))
| .hexagonal => (Real.sqrt (Real.pi / Real.sqrt 3) : ℂ) *
((n.1 : ℂ) + (n.2 : ℂ) * (1 / 2 + Complex.I * (Real.sqrt 3 / 2 : ℝ)))
/-- PDF p.20 (7.22): syndrome rounding in the normalizer lattice.
A fixed classical choice only resolves measure-zero ties; it is independent of the logical input. -/
def nearestLattice (shape : LatticeShape) (z : ℂ) : ℤ × ℤ :=
Classical.epsilon (fun n => ∀ m : ℤ × ℤ, ‖z - gkpNormalizerPoint shape n‖ ≤ ‖z - gkpNormalizerPoint shape m‖)
/-- PDF p.20: central Voronoi cell, including ties. -/
def correctableCell (shape : LatticeShape) : Set ℂ :=
{z | ∀ n : ℤ × ℤ, ‖z‖ ≤ ‖z - gkpNormalizerPoint shape n‖}
/-- PDF p.20 (7.22): measured residual displacement after the chosen ideal correction. -/
def modularSyndrome (shape : LatticeShape) (z : ℂ) : ℂ := z - gkpNormalizerPoint shape (nearestLattice shape z)
/-- PDF p.20: normalizer modulo stabilizer (2L), i.e. the residual logical Pauli coset. -/
def logicalCoset (shape : LatticeShape) (z : ℂ) : Fin 2 × Fin 2 :=
(⟨((nearestLattice shape z).1 % 2).toNat, by omega⟩,
⟨((nearestLattice shape z).2 % 2).toNat, by omega⟩)
/-- PDF p.20 (7.21): actual Gaussian measure, with no probability axiom assumed. -/
def amplifiedLossLaw (g : ℝ) : Measure ℂ :=
volume.withDensity (fun z => ENNReal.ofReal (amplifiedLossDensity g z))
/-- PDF pp.20--21: exact probabilities of the four logical cosets, including identity translates. -/
def cosetProbability (shape : LatticeShape) (g : ℝ) (c : Fin 2 × Fin 2) : ℝ :=
(amplifiedLossLaw g {z | logicalCoset shape z = c}).toReal
/-- PDF p.20: logical X^a Z^b action after ideal modular correction. -/
def cosetPauli (c : Fin 2 × Fin 2) : Matrix (Fin 2) (Fin 2) ℂ :=
(liouvilleBasis 1) ^ c.1.val * (liouvilleBasis 3) ^ c.2.val
/-- PDF p.20 (7.22): logical channel constructed from syndrome and lattice cosets,
with the amplification noise already included. It has no physical ideal-state encoder. -/
def idealRecoveredChannel (shape : LatticeShape) (g : ℝ) : Superop (Fin 2) (Fin 2) :=
krausApply (fun c : Fin 2 × Fin 2 => (Real.sqrt (cosetProbability shape g c) : ℂ) • cosetPauli c)
/-- PDF p.20 (7.23): guaranteed central square-cell probability. -/
def centralSuccess (g : ℝ) : ℝ :=
(amplifiedLossLaw g {z | |z.re| ≤ Real.sqrt (Real.pi / 8) ∧ |z.im| ≤ Real.sqrt (Real.pi / 8)}).toReal
/-- PDF p.21 (7.24): central-cell failure, which can exceed logical entanglement infidelity. -/
def centralFailure (g : ℝ) : ℝ :=
(amplifiedLossLaw g {z | ¬ (|z.re| ≤ Real.sqrt (Real.pi / 8) ∧ |z.im| ≤ Real.sqrt (Real.pi / 8))}).toReal
/-- PDF p.22 (8.3): no-jump damping, with jump-rate scalar factors deliberately omitted. -/
def noJump (k t : ℝ) (v : FockCoordinates) : FockCoordinates :=
fun n => (Real.exp (-k * t * n / 2) : ℂ) * v n
/-- PDF p.22 (8.3): chronological product of actual annihilations and damping intervals. -/
def jumpTrajectory (k t : ℝ) {l : ℕ} (times : Fin l → ℝ) (v : FockCoordinates) : FockCoordinates :=
let final := (List.ofFn times).foldl
(fun (s : ℝ × FockCoordinates) tau => (tau, annPower 1 (noJump k (tau - s.1) s.2))) (0, v)
noJump k (t - final.1) final.2
/-- PDF p.22: the scalar relating the trajectory to the integrated loss Kraus operator. -/
def trajectoryScalar (k : ℝ) {l : ℕ} (times : Fin l → ℝ) (g : ℝ) : ℝ :=
Real.sqrt (Nat.factorial l) * Real.exp (-k * (∑ i, times i) / 2) / Real.sqrt g ^ l
/-- Sanity tests: endpoints, orientations, and empty trajectories. -/
example (d : ℕ) (mu m : ℕ) : quditFourierFactor d mu 0 = 1 := by simp [quditFourierFactor]
example : displacementEntry 0 0 0 = 1 := by simp [QAlgorithms.Papers.Independent.Frontier18.P14.displacementEntry,
Complex.normSq_zero]
example (mu : Fin 2) : idealComb mu (fun _ => 0) = 0 := by simp [idealComb]
example : kernelLattice 0 0 (0, 0) = 0 := by simp [kernelLattice]
example (g : ℝ) : amplifiedLossDensity g 0 = (1 - g) / (Real.pi * g) := by simp [amplifiedLossDensity]
example (k t : ℝ) (v : FockCoordinates) :
jumpTrajectory k t (fun i : Fin 0 => Fin.elim0 i) v = noJump k t v := by
simp [jumpTrajectory]
end QAlgorithms.Papers.Independent.Intakenext100.P65
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
QAlgorithms.Papers.Independent.Intakenext100.P65.FockCoordinates
A Fock coordinate sequence is any function , assigning a complex number to each nonnegative integer . No summability or normalization condition is imposed.
QAlgorithms.Papers.Independent.Intakenext100.P65.LatticeShape
Define a type with exactly two distinct possible values, called and , and with decidable equality between its values.
QAlgorithms.Papers.Independent.Intakenext100.P65.amplifiedLossDensity
For every real and complex , define the real number
There is no restriction on and no assertion here that this function is a probability density. Division is total, with division by zero equal to zero; in particular, for every .
QAlgorithms.Papers.Independent.Intakenext100.P65.amplifiedLossLaw
For every real , define
The defined measure is complex-plane volume weighted by the extended nonnegative density ; equivalently, its value on a measurable set is , interpreted as a nonnegative extended integral. There is no assumption on and no normalization assertion in this definition. Division by zero is interpreted as zero; in particular, the resulting measure is zero whenever .
QAlgorithms.Papers.Independent.Intakenext100.P65.amplifierChannel
For any real , any complex array , and any , define
The real coefficients are regarded as complex scalars. This is a finite sum, including when or , and no restriction on or density assumption on is imposed. All square roots are real square roots, equal to zero on negative inputs; all natural-number subtractions in this sum occur with .
QAlgorithms.Papers.Independent.Intakenext100.P65.annDomain
For every nonnegative integer and every complex sequence , this predicate requires both of the following real series to be summable:
No normalization is required. When , the two requirements coincide; the zero sequence satisfies the predicate for every .
QAlgorithms.Papers.Independent.Intakenext100.P65.annPower
For every nonnegative integer and every complex sequence , this defines the complex sequence whose th coordinate, for every , is
where the factorials are converted to real numbers before division, and the real square root is viewed as a complex scalar. No summability condition is imposed on either sequence. The denominator is always positive, and gives the original sequence .
QAlgorithms.Papers.Independent.Intakenext100.P65.antipodal
For every natural number , label , and integer index with , this defines the complex number
with the real square-root ratio regarded as complex. The definition includes , when the only index is and the value is for either label.
QAlgorithms.Papers.Independent.Intakenext100.P65.binomialCodeCoordinates
For every pair of natural numbers and label , this defines a complex-valued sequence by
Here is the natural-number quotient when the first case applies. Both and are included; is always positive.
QAlgorithms.Papers.Independent.Intakenext100.P65.binomialGenerator
For every pair of natural numbers and Boolean parameter , this defines the real polynomial
The definition includes and .
QAlgorithms.Papers.Independent.Intakenext100.P65.binomialParity
For every pair of natural numbers and label , this defines the complex-valued sequence
where, for , for , and elsewhere. Equivalently,
and all other coordinates vanish. The definition includes and .
QAlgorithms.Papers.Independent.Intakenext100.P65.catCodeCoordinates
For every real , natural number , and label , let
This defines the complex sequence
There is no hypothesis that the denominator is nonzero: complex division by zero is defined to give zero, so a zero denominator makes the entire sequence zero. The definition includes and , and by itself asserts no normalization property.
QAlgorithms.Papers.Independent.Intakenext100.P65.catLossRatio
For every real , natural numbers , and label , define
The declaration defines
The residue is an integer difference and may be negative; it is not truncated at zero. There is no restriction on : the real square root is zero when . There is also no nonzero-denominator assumption, and real division by zero gives zero.
QAlgorithms.Papers.Independent.Intakenext100.P65.catNorm
For every real , natural number , and integer , this defines the real number
Thus the definition sums the squared absolute values of the coherent-coordinate sequence after retaining only the indicated residue class. No positivity assumption on is required. In particular, at the value is when , and otherwise.
QAlgorithms.Papers.Independent.Intakenext100.P65.catNormFourier
For every real , natural number , and label , this defines the complex number
All real quantities are embedded in where needed. The parameters include and ; the finite sum always has at least two terms. This definition alone asserts neither that its value is real nor that it equals any squared norm.
QAlgorithms.Papers.Independent.Intakenext100.P65.centralFailure
For every real , let be complex-plane volume weighted by the extended nonnegative density , with division by zero interpreted as zero. The defined real number is the real conversion of the measure of the complement of the closed square ; that complement consists of points satisfying or . An infinite measure converts to zero. The definition makes no restriction on and does not itself identify this value with one minus the square’s measure.
QAlgorithms.Papers.Independent.Intakenext100.P65.centralSuccess
For every real , let be complex-plane volume weighted by the extended nonnegative density , using zero for division by zero. The defined real number is the real conversion of
The square includes its boundary. The conversion sends an infinite measure value to zero, and no assumption is made.
QAlgorithms.Papers.Independent.Intakenext100.P65.codeMoment
Given any pair of complex sequences and any nonnegative integer , this defines
The sequences need not be normalized, orthogonal, or square summable. Each infinite sum is evaluated separately and returns if its series is not summable. For , .
QAlgorithms.Papers.Independent.Intakenext100.P65.coherentCoordinates
For every real number , this defines a complex sequence indexed by by
with the real quantities embedded in . The parameter is unrestricted, including negative values and zero; at , the sequence has value at and elsewhere.
QAlgorithms.Papers.Independent.Intakenext100.P65.collectiveShift
For natural numbers and a hypothesis , this defines a complex matrix , with rows and columns indexed by words in , by
Each coordinate contributes separately, even if several coordinates produce the same word. When , the sum is empty and the reciprocal of is zero, so the resulting matrix on the singleton set of empty words is zero. When and , its sole entry is .
QAlgorithms.Papers.Independent.Intakenext100.P65.compressedShift
For natural numbers and a hypothesis , put . For , let be the number of words with total excitation , and define
This defines the complex matrix , where
Reciprocals of zero are zero. In particular, is allowed and gives a zero matrix.
QAlgorithms.Papers.Independent.Intakenext100.P65.correctableCell
For either shape , let and for integers . The defined set is . Thus it includes all points whose distance to the origin is no greater than their distance to any lattice point, including points where equality holds.
QAlgorithms.Papers.Independent.Intakenext100.P65.cosetPauli
For every , the defined complex matrix is , where
The order is followed by in the matrix product: the four outputs for are respectively .
QAlgorithms.Papers.Independent.Intakenext100.P65.cosetProbability
For either shape , every real , and every , let and . Classically choose minimizing , with unspecified tie resolution and an unspecified pair if no minimizer exists, and let be its coordinatewise integer remainder modulo . Let be complex-plane volume weighted by , where , using zero for division by zero. The defined real number is converted from the extended nonnegative reals to the reals; this conversion sends an infinite measure value to zero. No restriction on or measurability assertion about this event is included.
QAlgorithms.Papers.Independent.Intakenext100.P65.displaceDensity
For any , any complex array , and any , define
where, for ,
The real prefactors are embedded in . No density or convergence assumption is imposed on ; the inner sum is taken first, and each infinite sum is assigned zero if its summands are not summable.
QAlgorithms.Papers.Independent.Intakenext100.P65.displaceWave
For every complex number , every function , and every , define the displaced function by
No integrability, continuity, or normalization condition is imposed on .
QAlgorithms.Papers.Independent.Intakenext100.P65.embedDicke
For natural numbers , complex coefficients , and a configuration , this defines
The real coefficients are regarded as complex numbers. All parameters may be zero. If , that summand is zero for every ; the inverse of zero used in the definition is also assigned the value zero.
QAlgorithms.Papers.Independent.Intakenext100.P65.embedOne
For every natural numbers and arbitrary complex vector , this defines the complex-valued sequence
Since , equivalently for , with zero at every other coordinate. There is no normalization assumption on ; places its entries at coordinates , and places only at coordinate .
QAlgorithms.Papers.Independent.Intakenext100.P65.embedTwo
For every natural numbers and arbitrary complex vector , this defines a function by
The subtraction is natural-number subtraction, with guaranteed by its index range. No normalization is required. The definition includes and ; in the latter case its only potentially nonzero value is .
QAlgorithms.Papers.Independent.Intakenext100.P65.extendedCoefficients
For natural numbers , an index , and an index , this defines
The square-root ratio is real and then embedded into ; the subtraction is natural-number subtraction, truncated at zero. Although is quantified over all natural numbers, an index exists only when . When , the sole index is and its coefficient is .
QAlgorithms.Papers.Independent.Intakenext100.P65.extendedCount
For arbitrary natural numbers , this defines
In particular, and for ; for and , every count is zero. For , the count is zero when .
QAlgorithms.Papers.Independent.Intakenext100.P65.extendedVector
For arbitrary natural numbers and a configuration , this defines the complex amplitude
The real value is embedded into . If the count is zero, the function is zero; division by zero is defined to return zero. For , its value on the empty configuration is when and otherwise.
QAlgorithms.Papers.Independent.Intakenext100.P65.fockDensity
For an arbitrary array , this defines the following conjunction: for every natural number , the finite matrix is positive semidefinite; the real sequence is summable; and
The finite-matrix condition includes , where it is vacuous. No separate trace-class hypothesis is included.
QAlgorithms.Papers.Independent.Intakenext100.P65.fockDomain
For any complex sequence , the predicate holds precisely when the real series is summable. It does not require the sum to equal ; in particular, the zero sequence satisfies it.
QAlgorithms.Papers.Independent.Intakenext100.P65.fockInner
For any two complex sequences , this defines
Neither sequence is required to be square summable or normalized. If the displayed complex series is not summable, the total infinite-sum operation returns .
QAlgorithms.Papers.Independent.Intakenext100.P65.fockMomentDomain
For every complex sequence and every nonnegative integer , this predicate means that the real series
is summable. For , including the convention , this is exactly square summability of . For , the term at is zero. No normalization is required.
QAlgorithms.Papers.Independent.Intakenext100.P65.fockNormSq
For any complex sequence , this defines the real number
No summability hypothesis is required. If this real series is not summable, the total infinite-sum operation used here returns .
QAlgorithms.Papers.Independent.Intakenext100.P65.fourierProduct
For natural numbers , a label , and a word , this defines the complex number
For , the empty product is . For , there is no possible label , so the definition has no instances with that value of .
QAlgorithms.Papers.Independent.Intakenext100.P65.gkpFock
For every real and , define a sequence by
where , , and
Real factors are regarded as complex when necessary. This defines coordinates for all without asserting square summability or normalization, and it includes : division by zero gives zero, nonsummable series have sum zero, and nonintegrable functions have Lebesgue integral zero.
QAlgorithms.Papers.Independent.Intakenext100.P65.gkpNormalizerPoint
For either shape or and every integer pair , define a complex point by
Both integer coordinates may be positive, negative, or zero; in particular, either shape sends to .
QAlgorithms.Papers.Independent.Intakenext100.P65.hermitePhys
Define a sequence of real polynomials for every natural number , including zero, recursively by
QAlgorithms.Papers.Independent.Intakenext100.P65.hermiteWave
For every natural number , including , and every real , define the real-valued function
where the real polynomials satisfy and . In particular, .
QAlgorithms.Papers.Independent.Intakenext100.P65.idealComb
For either and any function , define
No regularity or summability assumption is imposed on ; this sum is assigned zero if the family of sampled values is not summable.
QAlgorithms.Papers.Independent.Intakenext100.P65.idealDisplacementKernel
For any and any function , define
No regularity or summability assumption is imposed on . This is a sum over integer pairs as a single family, and it equals zero if that family is not summable.
QAlgorithms.Papers.Independent.Intakenext100.P65.idealRecoveredChannel
For either shape and every real , use the lattice maps and . Let be the coordinatewise parity of a classically selected nearest integer lattice label, with unspecified tie resolution and an unspecified label if no minimizer exists. Define as the real conversion of the measure of under complex-plane volume weighted by ; division by zero is zero, and an infinite measure converts to zero. With , , and , the defined map on every complex matrix is
The definition itself imposes no restriction on and does not assert the normalization .
QAlgorithms.Papers.Independent.Intakenext100.P65.jumpTrajectory
For any real numbers , natural number , list of real times , and complex sequence , start with and . For , set and
The defined output has coordinates . Thus the times are processed in index order, with no assumption that they increase or lie between and ; repeated times are allowed. No summability or normalization is required. When , the output is .
QAlgorithms.Papers.Independent.Intakenext100.P65.kernelLattice
For any and any integer pair , define the complex number
where the integer labels and real square root are embedded in .
QAlgorithms.Papers.Independent.Intakenext100.P65.kernelPhase
For any and any integer pair , define
QAlgorithms.Papers.Independent.Intakenext100.P65.liouville
For any function from complex matrices to complex matrices, is the complex matrix with entries
where , , , and . No linearity, positivity, or trace preservation is required of , and the entries retain their complex values.
QAlgorithms.Papers.Independent.Intakenext100.P65.liouvilleBasis
The function , indexed by , returns the following complex matrices, whose rows and columns are ordered :
QAlgorithms.Papers.Independent.Intakenext100.P65.logicalCoset
For either shape and every , define and . Let be the classically selected integer pair minimizing the distance from to , with unspecified tie resolution and an unspecified pair if there is no minimizer. The output is , regarded as a pair in . Integer remainders modulo the positive integer are used, so negative coordinates also give remainders or .
QAlgorithms.Papers.Independent.Intakenext100.P65.lossChannel
For any real , any complex array , and any , define
The real coefficients are regarded as complex scalars. There is no restriction on , no positivity or normalization assumption on , and no summability hypothesis; the infinite sum has value zero if its summands are not summable. Square roots are real square roots, which equal zero on negative inputs, and natural-number subtraction is truncated at zero.
QAlgorithms.Papers.Independent.Intakenext100.P65.lossCoefficient
For every real number and nonnegative integers , this defines
There is no restriction . Real square roots of negative arguments are defined to be zero, and every zeroth power, including , equals . The subtraction is natural-number subtraction, and the branch using it is selected only when .
QAlgorithms.Papers.Independent.Intakenext100.P65.lossDisplacementIntegrand
For any real , natural numbers , and complex number , this defines
where, for a complex number and natural numbers ,
Real factors are embedded into . The definition imposes no restriction on ; in particular, when .
QAlgorithms.Papers.Independent.Intakenext100.P65.lossEntry
For any real and natural numbers , this defines
as a complex number by embedding the displayed real coefficient into . The condition ensures , so the zero branch of the underlying loss coefficient for cannot occur in the first case. There is no assumption that ; real square roots of negative arguments are interpreted as zero, and zeroth powers remain .
QAlgorithms.Papers.Independent.Intakenext100.P65.lossProduct
For any real and natural numbers , this defines
where the real coefficients are regarded as complex numbers. At most one summand can be nonzero, and all summands vanish unless some natural number satisfies both and . No restriction on is imposed; natural-number subtraction is truncated at zero, and real square roots of negative arguments are zero.
QAlgorithms.Papers.Independent.Intakenext100.P65.lossVector
For every real number , nonnegative integer , and complex sequence , this defines the complex sequence
The coefficient uses the nonzero-branch formula because always holds. No square-summability or normalization condition is imposed, and may be any real number. Negative square-root arguments give zero, while zeroth powers, including , give .
QAlgorithms.Papers.Independent.Intakenext100.P65.modularSyndrome
For either shape and every , put and . Let be the classically selected pair minimizing over integer pairs, with an unspecified choice among ties and an unspecified returned pair if no minimizer exists. The defined complex number is .
QAlgorithms.Papers.Independent.Intakenext100.P65.nearestLattice
For either shape and every , define the lattice-point map, for , by and . This definition selects an integer pair satisfying for every , if such a pair exists. The selection is by classical choice, with no specified rule for resolving ties; if no minimizing pair exists, it still returns an unspecified integer pair.
QAlgorithms.Papers.Independent.Intakenext100.P65.nextLabel
For a natural number , a hypothesis , and , this defines the label , regarded as an element of the same label set. Thus maps to ; when , the sole label maps to itself.
QAlgorithms.Papers.Independent.Intakenext100.P65.noJump
For any real numbers and any complex sequence , this defines the complex sequence
There are no positivity, normalization, or summability assumptions; and may be zero or negative.
QAlgorithms.Papers.Independent.Intakenext100.P65.normalizedSmearedWave
For and every , define
where, with ,
The real square root in the denominator is viewed as a complex number. No condition on or nonvanishing denominator is assumed, and this definition itself asserts no normalization property. Division by zero gives zero; infinite sums and Lebesgue integrals have value zero when their summability or integrability requirement fails.
QAlgorithms.Papers.Independent.Intakenext100.P65.numberMoment
For every complex sequence and every nonnegative integer , this defines the real number
There is no summability or normalization hypothesis; if the series is not summable, the total infinite-sum operation returns . When , the expression is , with ; when , its term at is zero.
QAlgorithms.Papers.Independent.Intakenext100.P65.permCode
For natural numbers , an index , and a configuration , this defines
where is the number of configurations with . The upper summation bound uses natural subtraction, and inverses of zero are assigned zero, so any term with zero count contributes zero. An index requires ; is allowed and gives amplitude on the unique empty configuration.
QAlgorithms.Papers.Independent.Intakenext100.P65.poissonWeight
For every real and natural number , this defines
Neither nor is restricted, so the definition does not require this quantity to be a probability. It includes , when the value is , including when .
QAlgorithms.Papers.Independent.Intakenext100.P65.qecBlock
For any pair of complex sequences , any real number , and any nonnegative integers , this defines a complex matrix whose entry at is
No normalization, orthogonality, or summability hypotheses are imposed on , and is not restricted to . Real square roots of negative arguments are zero, zeroth powers include , and each matrix entry is if its displayed complex series is not summable.
QAlgorithms.Papers.Independent.Intakenext100.P65.qecC
For any two sequences of complex numbers , any real , and any natural numbers , including zero, define
Then . No normalization, square summability, or convergence hypotheses are imposed on , and is not restricted to . Each complex series is assigned zero if it is not summable; real square roots of negative numbers are zero.
QAlgorithms.Papers.Independent.Intakenext100.P65.qecX
For any two sequences of complex numbers , any real , and any natural numbers , including zero, define
Then . No normalization, square summability, or convergence hypotheses are imposed on , and is not restricted to . Each complex series is assigned zero if it is not summable; real square roots of negative numbers are zero.
QAlgorithms.Papers.Independent.Intakenext100.P65.qecZ
For any two sequences of complex numbers , any real , and any natural numbers , including zero, define
Then . No normalization, square summability, or convergence hypotheses are imposed on , and is not restricted to . Each complex series is assigned zero if it is not summable; real square roots of negative numbers are zero.
QAlgorithms.Papers.Independent.Intakenext100.P65.qubitDickeCoordinates
For every natural numbers and configuration , this defines the complex amplitude
Here the count is obtained by converting each coordinate to the Boolean assertion that its value is . No assumption is imposed: when , every amplitude is zero. When , the unique empty configuration has amplitude if and otherwise.
QAlgorithms.Papers.Independent.Intakenext100.P65.qubitFrobeniusSq
For any complex matrix , the real number is
No additional assumptions are imposed on .
QAlgorithms.Papers.Independent.Intakenext100.P65.quditFourierFactor
For arbitrary natural numbers , with no bounds on or , this defines
The division is real division before taking the complex exponential. The case is included: division by zero gives zero, so .
QAlgorithms.Papers.Independent.Intakenext100.P65.regularizedLattice
For either and arbitrary real , define
The real factors are embedded in . The sum is over integer pairs as a single family, with no assumption that or that this family is summable; its value is zero when the family is not summable.
QAlgorithms.Papers.Independent.Intakenext100.P65.residueCheck
For every natural number and arbitrary complex sequence , this defines the complex sequence
No summability or normalization condition is imposed on . The denominator is always positive, and the definition includes .
QAlgorithms.Papers.Independent.Intakenext100.P65.residueLogicalZ
For every natural number and arbitrary complex sequence , this defines
No summability or normalization assumption is required, and is included.
QAlgorithms.Papers.Independent.Intakenext100.P65.residueProject
For every natural number , integer , and complex sequence , this defines the complex sequence
Here ranges over all nonnegative integers, while may be negative; congruence is tested using integer remainders modulo the positive integer . No summability or normalization condition is imposed on , and is included.
QAlgorithms.Papers.Independent.Intakenext100.P65.reverseInformation
For any function from complex matrices to themselves, let denote the matrix with entry at and zero elsewhere, and define by , with all indices in . Put and . Then
where is formed using the continuous functional calculus. The definition requires no channel, linearity, positivity, or normalization assumptions on .
QAlgorithms.Papers.Independent.Intakenext100.P65.smallBasis
For indices , this defines the complex number as the -th coordinate of , where, in coordinate order ,
QAlgorithms.Papers.Independent.Intakenext100.P65.smallGenerator
This defines the complex matrix , indexed by , with diagonal
off-diagonal entries
and all other entries zero. Equivalently, the definition embeds the tridiagonal matrices with neighboring entries and into the even and odd coordinates respectively, squares each embedded matrix, and adds eight times the first square to the second square.
QAlgorithms.Papers.Independent.Intakenext100.P65.smallUnitary
This defines
where the exponential is the matrix exponential and is the complex matrix indexed by with diagonal , entries and , and every other off-diagonal entry zero. This declaration defines the matrix without itself asserting unitarity.
QAlgorithms.Papers.Independent.Intakenext100.P65.smearedKernelIntegral
For every , , and , define, for ,
The declared complex quantity is
Here is Lebesgue measure on , and the real exponential quotient is regarded as complex. No restriction on , convergence, or integrability is assumed: division by zero gives zero, nonintegrable integrands have integral zero, and nonsummable outer series have sum zero.
QAlgorithms.Papers.Independent.Intakenext100.P65.smearedKernelSum
For every , , and , set
Define
This definition includes and negative , imposes no summability hypothesis, uses zero for division by zero, and assigns zero to a nonsummable series.
QAlgorithms.Papers.Independent.Intakenext100.P65.smearedNorm
For and every real , put for and define
The declared real quantity is
The integral uses Lebesgue measure. There is no restriction on , including , and no positivity or integrability assertion is part of this definition; division by zero is assigned zero, a nonsummable series is assigned sum zero, and a nonintegrable function is assigned integral zero.
QAlgorithms.Papers.Independent.Intakenext100.P65.smearedWave
For either and arbitrary real , define
with all real quantities embedded in . No positivity condition on , normalization assertion, or summability hypothesis is included. Division by zero equals zero, and a nonsummable family has sum zero; consequently, at every summand is , so the defined value is zero.
QAlgorithms.Papers.Independent.Intakenext100.P65.spinX
For every natural number , this defines a complex matrix indexed by , with entries
where the displayed real values are regarded as complex numbers. In particular its diagonal is zero, and gives the zero matrix.
QAlgorithms.Papers.Independent.Intakenext100.P65.totalQuditExcitation
For arbitrary natural numbers and a configuration , this defines its total excitation to be the natural number
For , the unique empty configuration has total excitation zero, including when ; when and , no such configuration exists.
QAlgorithms.Papers.Independent.Intakenext100.P65.traceReference
For any complex matrix indexed by , is the complex matrix obtained by summing over the second coordinate:
No positivity or normalization assumption is imposed on .
QAlgorithms.Papers.Independent.Intakenext100.P65.trajectoryScalar
For any real numbers , natural number , and real times , this defines the real number
There are no sign or ordering assumptions. The real square root is zero for , and division by zero is defined to give zero; consequently, the value is zero when and . When , the empty sum is zero and the denominator is , so the value is for every .
QAlgorithms.Papers.Independent.Intakenext100.P65.weylPhase
For arbitrary complex numbers , this defines
QAlgorithms.Papers.Independent.Intakenext100.P65.worstPureFidelity
For any natural number and any function from complex matrices to themselves, define , so . Then
No channel or linearity assumption is required of . The real infimum used here is zero when the set is empty or unbounded below; in particular, the value is zero for .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.