How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Bosonic loss, Kerr shifts and finite-code comparison scope
Definition
Assume Countable Choice. A single bosonic mode is represented here by the symmetric Fock space over a one-dimensional complex Hilbert space with a chosen unit vector. Its occupation basis is , where is the occupation number. On the finite linear span of these vectors, define the annihilation operator by and for , and define the number operator by . In this model a single-loss event is represented by on vectors in its domain; this specifies an error operator, not a normalized channel or a loss rate.
In units with , prescribe the diagonal Kerr Hamiltonian , with real parameters , initially on the finite occupation span. Its energy assigned to is ; the adjacent downward transition frequency in this model is for . Here Kerr anharmonicity means the occupation-dependent quadratic term; no sign or stability condition on is assumed.
For a finite-dimensional logical Hilbert space , an oscillator encoding is a linear isometry : it preserves inner products and its image is the code subspace. It has finite mean occupation when every normalized satisfies . Normalizability alone means only and does not impose this energy condition. The ideal comb states in the Gottesman–Kitaev–Preskill construction are nonnormalizable; their use as actual encoded states requires an approximation or a separately specified limiting prescription.
Fix the dimensionless position representation by the complex-linear unitary with . Here and for are the normalized Hermite functions. Thus , with convergence in . On use , matching the Fock convention. The Hermite suppliers use the conjugate, first-variable-linear pairing; conjugating it leaves norms and completeness unchanged. On the finite Hermite span, and . Only these finite-span differential identities are asserted.
For the GKP qubit family used here, use this dimensionless position coordinate and a spacing . Its ideal code is the formal span of for , where is the unit point mass at . These combs are distributions, not normalizable oscillator vectors. A Gaussian approximation uses
Here normalizes each wavefunction, specifies peak width, and specifies the width of the envelope weighting the peak centers. The corresponding normalized oscillator vectors are . The two approximate vectors need not be orthogonal; an encoding still must meet the isometry condition above. Approximating an ideal comb refers to narrow peaks and a broad envelope, not Hilbert-norm convergence to a normalizable ideal vector.
A comparison of logical lifetimes as mean occupation varies must specify an encoding family, a time-indexed physical noise family, a decoding or recovery procedure, a logical fidelity functional and a target value. Given these, take the time domain to be , write for the chosen real-valued logical fidelity and for its real target, and put . Define the lifetime by when , and by when ; here denotes the no-crossing convention. The infimum need not belong to , and no continuity or monotonicity of is required. This contract by itself asserts no monotonic relation between occupation and lifetime.
Facts & Assumptions
Under Countable Choice the Fock operators have the stated domains and their finite-particle domain is dense. Bosonic and fermionic Fock operators with exact domains The Axiom of Countable Choice (AC_ω)
The one-mode Fock occupation vectors have the stated lowering action on finite-particle vectors. One-mode factorization of symmetric Fock space
The symmetric Fock space is the square-summable direct sum of its symmetric occupation sectors, and the finite-particle subspace consists of vectors supported in finitely many sectors. Schwartz/distribution spaces and Hilbert Fock conventions
An infimum is a greatest lower bound. Every nonempty subset of bounded below has a real infimum. Greatest lower bound (infimum) Every nonempty set bounded below has an infimum
Under Countable Choice, the recursively defined Hermite functions form a complete orthonormal family in complex , and for , with . Hermite recurrence Hermite completeness
For real , converges exactly when ; in particular it converges for and diverges for . The p-series for a real exponent p converges exactly when p is greater than one
Justification
Given: The stated definitions, hypotheses and cited interfaces.
Goal: Justify the stated construction and its scope.
1.1 The finite occupation span is invariant under the displayed ladder and diagonal maps, so the formulas define linear maps there. [given, F1, F2, F3]
2.1 By [F3] the occupation coordinates are square-summable, and by [F5] the Hermite functions are an orthonormal basis of . The finite-sum map preserves inner products; square-summable coordinates give Cauchy partial sums, so completeness of extends it uniquely to an isometry on the Fock space. Every has a Hermite expansion with square-summable coefficients by [F5]; those coefficients define a Fock vector by [F3] mapping to , so is onto. Conjugating the supplier's pairing gives exactly the second-variable-linear pairing specified above, and preserves this calculation. The lowering relation in [F5] agrees with [F2] on each occupation vector, while the number identity follows from ; linearity proves both stated identities on the finite Hermite span. [given, F1, F2, F3, F5, step 1.1]
2.2 The assigned energies follow by substitution, and subtracting consecutive values gives the stated gap. The Fock construction supplies the occupation basis and the domain of the loss operator; no unbounded-operator identity is asserted outside the specified domains. For example, the isometry from sending to a normalized multiple of is normalizable but has divergent mean occupation, so the additional finite-occupation requirement is substantive. Indeed, [F6] gives , so has norm one by [F3], whereas its mean occupation is by [F6]. Thus is the claimed isometry. [F1, F2, F3, F6, step 1.1]
3.1 If , it is a subset of bounded below by , so [F4] gives its real infimum. This infimum is nonnegative because is a lower bound. If , the explicit value applies instead. Thus the lifetime is defined even when there is no least below-target time, without asserting a crossing or a monotonic relation between occupation and lifetime. [given, F4] ∎
External input
The GKP combs and Gaussian approximate wavefunctions above are imported from Gottesman, Kitaev and Preskill, Section IV, Eq. (27) with , and Section V, Eqs. (30)–(31). The ideal combs are nonnormalizable, whereas the normalized approximate vectors can overlap, as reported there. This construction is an external definition, not a local proof of approximation quality or a lifetime law. The preceding local justification concerns the Fock/Kerr model, the position-representation identification and the lifetime convention only.
Depends on
- Schwartz/distribution spaces and Hilbert Fock conventions
- Greatest lower bound (infimum)
- Every nonempty set bounded below has an infimum
- Bosonic and fermionic Fock operators with exact domains
- One-mode factorization of symmetric Fock space
- The Axiom of Countable Choice (AC_ω)
- Hermite recurrence
- Hermite completeness
- The p-series for a real exponent p converges exactly when p is greater than one
- Gottesman, Kitaev and Preskill, Encoding a qubit in an oscillator · Section IV, Eq. (27), position-space codewords with code dimension n=2; Section V, Eqs. (30)–(31) and the paragraph following Eq. (34).
Dependency tree · 2 levels
Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.
External dependencies
For n=2 and lattice spacing alpha>0, the ideal position codewords are the formal combs sum over s in Z of |q=alpha(j+2s)>, j=0,1. They are nonnormalizable. Replacing each peak by a Gaussian exp(-(q-x)^2/(2 Delta^2)) and weighting its center x=alpha(j+2s) by exp(-kappa^2 x^2/2), with Delta,kappa>0, gives the normalized approximate codewords of Eq. (31). Their envelope width is kappa^{-1}; the two approximate codewords can have nonzero overlap.
Hypotheses: One oscillator in its dimensionless position representation, with hbar=1; qubit specialization n=2 of the rectangular GKP construction, alpha>0. The ideal expressions are distributions, not Hilbert-space states. The Gaussian approximation uses Delta,kappa>0; the source uses Delta/alpha and kappa alpha small for its subsequent asymptotic approximations, which are not imported here.
Reading limits: Read the arXiv HTML Section IV around Eqs. (21)–(27), and Section V from its opening through the overlap paragraph preceding Eq. (35). Checked Eq. (31) against the wavefunction formula below by substituting the translated Gaussian of Eq. (30). No error-probability estimates, photon-number asymptotics, Kerr dynamics or lifetime claims are imported. The representation map is justified locally from the declared mathematical Hermite suppliers, not attributed to this paper.
Sources
- Gottesman, Kitaev and Preskill, Encoding a qubit in an oscillator · Section IV, Eq. (27), position-space codewords with code dimension n=2; Section V, Eqs. (30)–(31) and the paragraph following Eq. (34).