Shifted Gaussian Encoding

• Shifted Gaussian encoding is a design motif that deliberately translates Gaussian centers to represent structured data in domains such as positional embedding, quantum error correction, and integer encoding.
• In coordinate MLPs and GKP state synthesis, tuning parameters like shift, width, and damping controls memorization capacity, interpolation smoothness, and error fidelity.
• Applications such as smooth integer recovery and explicitly correlated Gaussians require tailored post-processing like integral cancellation and symmetry projection for optimal results.

Searching arXiv for the specified paper and closely related uses of shifted Gaussian encoding. Search results will help anchor citations and confirm related terminology across domains. Searching "Rethinking Positional Encoding" (Zheng et al., 2021), shifted Gaussian encoding, GKP Gaussian breeding, surface-GKP designed bias. Shifted Gaussian encoding denotes a family of constructions in which information is represented by Gaussian functions whose centers are deliberately translated across a domain. In the cited literature, this motif appears in several technically distinct forms: as a positional embedding for coordinate-based MLPs, with features $$\phi(x) = [\exp(-\|x-\mu_k\|^2/(2\sigma^2))]_{k=1\ldots m}$$ (Zheng et al., 2021); as approximate Gottesman–Kitaev–Preskill (GKP) codewords built from displaced squeezed Gaussians in propagating light (Takase et al., 2022); as a squeezing-deformed GKP lattice used to bias logical noise in a concatenated surface–GKP code (Hänggli et al., 2020); as a smooth integer representation based on localized Gaussian bumps with alternating coefficients (Semenov, 28 Apr 2025); and as shifted-center explicitly correlated Gaussians in pre-Born–Oppenheimer variational calculations (Muolo et al., 2018). Across these settings, the operative degrees of freedom are the Gaussian centers, widths, and, where relevant, amplitudes and projection operations.

1. Mathematical forms and shared structure

A basic shifted Gaussian positional embedding associates to a coordinate $x \in [0,C]$ an $m$-dimensional feature vector

$$\phi(x) = \bigl[\exp(-\|x-\mu_k\|^2/(2\sigma^2))\bigr]_{k=1\ldots m},$$

with equally spaced shifts $\mu_k = (k-1)s$ and $s=C/m$. In $d>1$, a separable construction samples $m_i$ points per axis with standard deviation $\sigma_i$ and concatenates the per-axis vectors, yielding total embedding dimension $\sum_i m_i$ (Zheng et al., 2021).

In continuous-variable quantum information, approximate GKP codewords are superpositions of equally spaced, squeezed Gaussians in the position basis. With squeezing parameter $x \in [0,C]$0 and envelope width $x \in [0,C]$1, the unnormalized codewords are

$x \in [0,C]$2

where $x \in [0,C]$3 and $x \in [0,C]$4 (Takase et al., 2022).

A smooth integer encoding uses a finite sum of shifted Gaussian bumps,

$x \in [0,C]$5

with $x \in [0,C]$6, $x \in [0,C]$7, and coefficients

$x \in [0,C]$8

Here the integer is not an explicit parameter of a symbolic representation; it is recovered from the integral balance of the smooth function (Semenov, 28 Apr 2025).

In few-body quantum chemistry, a floating explicitly correlated Gaussian (FECG) is

$x \in [0,C]$9

with real symmetric positive-definite block-diagonal $m$0 and shift vector $m$1. The shifted center $m$2 supplies the basis with localization flexibility unavailable to origin-centered ECGs (Muolo et al., 2018).

These examples share a common translation mechanism but differ in what is being encoded: Euclidean coordinates, logical qubits, effective error bias, integers, or many-particle wavefunctions. This suggests that “shifted Gaussian encoding” is best understood as a structural motif rather than a single canonical formalism.

2. Shifted Gaussian positional encoding in coordinate MLPs

For coordinate-based MLPs, the shifted Gaussian embedder is analyzed through two metrics defined on the embedding matrix $m$3 formed from sampled coordinates $m$4. The stable rank

$m$5

measures the effective number of non-negligible singular values, and higher stable rank gives more capacity to memorize arbitrary $m$6's. The embedded-distance quantity

$m$7

is desired to be a monotonic function of the original distance $m$8 so that nearby coordinates remain similar and far points remain dissimilar in feature space (Zheng et al., 2021).

For the Gaussian embedder, the continuous-limit inner product satisfies

$m$9

After zero-mean centering and normalizing, one may ignore the $$\phi(x) = \bigl[\exp(-\|x-\mu_k\|^2/(2\sigma^2))\bigr]_{k=1\ldots m},$$0 prefactor and view

$$\phi(x) = \bigl[\exp(-\|x-\mu_k\|^2/(2\sigma^2))\bigr]_{k=1\ldots m},$$1

When $$\phi(x) = \bigl[\exp(-\|x-\mu_k\|^2/(2\sigma^2))\bigr]_{k=1\ldots m},$$2 and $$\phi(x) = \bigl[\exp(-\|x-\mu_k\|^2/(2\sigma^2))\bigr]_{k=1\ldots m},$$3 are large enough,

$$\phi(x) = \bigl[\exp(-\|x-\mu_k\|^2/(2\sigma^2))\bigr]_{k=1\ldots m},$$4

The bandwidth parameter $$\phi(x) = \bigl[\exp(-\|x-\mu_k\|^2/(2\sigma^2))\bigr]_{k=1\ldots m},$$5 controls the central trade-off. Decreasing $$\phi(x) = \bigl[\exp(-\|x-\mu_k\|^2/(2\sigma^2))\bigr]_{k=1\ldots m},$$6 raises the upper bound $$\phi(x) = \bigl[\exp(-\|x-\mu_k\|^2/(2\sigma^2))\bigr]_{k=1\ldots m},$$7 on stable rank and therefore increases memorization capacity for high-frequency content, but it also makes $$\phi(x) = \bigl[\exp(-\|x-\mu_k\|^2/(2\sigma^2))\bigr]_{k=1\ldots m},$$8 decay rapidly, so nearby points become nearly orthogonal. Increasing $$\phi(x) = \bigl[\exp(-\|x-\mu_k\|^2/(2\sigma^2))\bigr]_{k=1\ldots m},$$9 reduces stable rank and can underfit high-frequency structure, while making interpolation overly smooth. The embedding dimension must satisfy $\mu_k = (k-1)s$0 to reach the stable-rank ceiling, and Nyquist sampling requires $\mu_k = (k-1)s$1 to preserve the inner-product integral. A practical one-dimensional rule chooses $\mu_k = (k-1)s$2 so that

$\mu_k = (k-1)s$3

stays above a small threshold $\mu_k = (k-1)s$4 for nearest-neighbor spacing $\mu_k = (k-1)s$5, giving

$\mu_k = (k-1)s$6

In $\mu_k = (k-1)s$7 dimensions, the same per-axis rule is applied under separable sampling, while keeping total dimension linear in $\mu_k = (k-1)s$8 through concatenation (Zheng et al., 2021).

Empirically, the paper studies 1D and 2D image-signal reconstruction with coordinate-MLPs. Baselines include no encoding, fixed sinusoid (“basic”), Random Fourier Features (RFF), impulse, square wave, and random noise. In 1D experiments with a linear one-layer network, varying $\mu_k = (k-1)s$9 over 10 seeds, the Gaussian embedder with $s=C/m$0 set by $s=C/m$1 yields test PSNR $s=C/m$2 with small error bars, whereas RFF is volatile at low $s=C/m$3 and stabilizes only at large $s=C/m$4. In 2D experiments with a 4-layer ReLU MLP, separable Gaussian sampling along $s=C/m$5 and optionally additional rotated axes matches or exceeds RFF in test PSNR, for example $s=C/m$6 at $s=C/m$7, while requiring smaller $s=C/m$8 for similar quality. Rank-versus-distance plots place Gaussian and RFF in a sweet spot of intermediate stable rank and reasonable distance preservation, whereas impulse and random noise over-rank and sine and square-wave embeddings under-rank. Training dynamics further show faster convergence, lower hidden-layer stable-rank growth, and higher final accuracy than unencoded or basic encodings (Zheng et al., 2021).

3. Shifted Gaussian codewords and Gaussian breeding for GKP qubits

In propagating-light implementations of the GKP code, logical basis states are approximate codewords formed from equally spaced displaced squeezed vacua with a Gaussian envelope. In the square-lattice case one often takes $s=C/m$9, and in the limit $d>1$0 the logical states approach ideal Dirac-comb codewords (Takase et al., 2022).

The paper’s central operation is the coherent bifurcation $d>1$1, which acts linearly on superpositions of displaced squeezed vacua according to

$d>1$2

Iterating it $d>1$3 times with step size $d>1$4 yields

$d>1$5

This constructs a comb of $d>1$6 peaks (Takase et al., 2022).

A physical implementation starts from two single-mode squeezers and combines them either on a beam splitter of transmittance $d>1$7 or through a QND gate $d>1$8, followed by photon-number-resolving detection on the second mode. Detecting $d>1$9 photons heralds an approximate two-peak superposition

$m_i$0

up to small overlap errors, and for even $m_i$1 the wavefunction is symmetric. The QND variant $m_i$2 commutes with displacements, so linearity holds exactly and the coherent bifurcation becomes fully iterable (Takase et al., 2022).

Envelope control is implemented by heralding $m_i$3 in the QND setup, which realizes an unsharp measurement in $m_i$4 equivalent to multiplication by a Gaussian in momentum space, or operatorially

$m_i$5

After a $m_i$6 phase rotation one also obtains $m_i$7. These damping steps set the global envelope $m_i$8 without changing the internal peak spacing. To prepare an arbitrary superposition $m_i$9, one first constructs a seed

$\sigma_i$0

then applies $\sigma_i$1 to obtain

$\sigma_i$2

Via Bloch–Messiah reduction, all on-line squeezers and QND gates can be replaced by a fixed interferometer, off-line squeezing, and photon-number detection; in practice, using the same $\sigma_i$3 at each stage reduces the beam-splitter count to $\sigma_i$4 (Takase et al., 2022).

The performance formulas quantify scalability. The per-round success probability is

$\sigma_i$5

maximized at $\sigma_i$6, giving

$\sigma_i$7

After $\sigma_i$8 bifurcations with $\sigma_i$9, the comb envelope has variance $\sum_i m_i$0, and in the square-lattice case additional damping yields total squeezing parameter $\sum_i m_i$1. Each two-peak building block has overlap

$\sum_i m_i$2

so the overall infidelity remains small provided $\sum_i m_i$3. Threshold analyses cited in the summary typically require $\sum_i m_i$4 of squeezing, that is $\sum_i m_i$5, together with logical-state fidelity $\sum_i m_i$6. With $\sum_i m_i$7, one achieves $\sum_i m_i$8 and state fidelities $\sum_i m_i$9 after $x \in [0,C]$00 rounds. For generation of $x \in [0,C]$01 to $x \in [0,C]$02, the example resource count is $x \in [0,C]$03 photons per bifurcation, $x \in [0,C]$04–$x \in [0,C]$05 rounds, per-round success probability $x \in [0,C]$06, and total success probability $x \in [0,C]$07, potentially improvable by multiplexing or quantum memory. For arbitrary magic states, the seed succeeds with probability $x \in [0,C]$08 and the full process reaches $x \in [0,C]$09 with $x \in [0,C]$10 (Takase et al., 2022).

4. Noise-biased surface–GKP encoding through squeezing deformation

A different use of shifted Gaussian structure appears in the concatenated surface–GKP code, where each bosonic GKP mode is first transformed by a single-mode squeezing unitary

$x \in [0,C]$11

associated with the symplectic matrix

$x \in [0,C]$12

Under conjugation, the quadratures become $x \in [0,C]$13 and $x \in [0,C]$14, and displacement operators transform as

$x \in [0,C]$15

The square-lattice GKP stabilizer lattice

$x \in [0,C]$16

is deformed into the rectangular lattice

$x \in [0,C]$17

with dual lattice

$x \in [0,C]$18

In the rescaled coordinates, the logical Pauli operators are

$x \in [0,C]$19

(Hänggli et al., 2020).

This deformation converts isotropic Gaussian displacement noise into anisotropic noise. An original channel

$x \in [0,C]$20

becomes an anisotropic channel with covariance

$x \in [0,C]$21

Equivalently, the quadrature jitters satisfy

$x \in [0,C]$22

and the bias parameter is

$x \in [0,C]$23

For $x \in [0,C]$24, the $x \in [0,C]$25-quadrature noise, which causes logical $x \in [0,C]$26 errors, is much larger than the $x \in [0,C]$27-quadrature noise, which causes logical $x \in [0,C]$28 errors (Hänggli et al., 2020).

Using nearest-lattice-point decoding at the GKP level, the residual logical-qubit error probabilities satisfy approximately

$x \in [0,C]$29

so $x \in [0,C]$30 for large $x \in [0,C]$31. The encoding is then relabeled so that the small-noise quadrature is associated with the qubit’s $x \in [0,C]$32 basis; in the paper the GKP “0/1” states are mapped to $x \in [0,C]$33. The resulting single-qubit channel has

$x \in [0,C]$34

with $x \in [0,C]$35, and in the large-$x \in [0,C]$36 limit one finds $x \in [0,C]$37. The purpose is to realize a Pauli-$x \in [0,C]$38-biased qubit channel that the outer surface code can exploit (Hänggli et al., 2020).

For decoding, the study uses the Bravyi–Suchara–Vargo tensor-network decoder with bond dimension $x \in [0,C]$39 up to $x \in [0,C]$40, which approaches maximum-likelihood decoding as $x \in [0,C]$41. Monte Carlo simulations show that, even without using GKP side information, an optimal choice of $x \in [0,C]$42 raises the threshold from $x \in [0,C]$43 at $x \in [0,C]$44 to $x \in [0,C]$45 for $x \in [0,C]$46. Incorporating GKP analog-syndrome information into the prior further boosts the threshold to $x \in [0,C]$47; even for $x \in [0,C]$48 one observes $x \in [0,C]$49, and a similar effect persists on asymmetric hexagonal lattices with $x \in [0,C]$50 (Hänggli et al., 2020). The paper frames this as a two-step map: single-mode squeezing reshapes isotropic displacements into an anisotropic Gaussian channel, and reinterpretation of the logical axes turns the small-variance direction into predominantly $x \in [0,C]$51 errors.

5. Smooth integer encoding by shifted Gaussian integral balance

The integer-encoding construction of (Semenov, 28 Apr 2025) represents $x \in [0,C]$52 by a smooth bump sum

$x \in [0,C]$53

with $x \in [0,C]$54 bumps and coefficients

$x \in [0,C]$55

Because $x \in [0,C]$56, the total integral tends to zero in the large-$x \in [0,C]$57 limit (Semenov, 28 Apr 2025).

Exact Gaussian integration gives

$x \in [0,C]$58

hence

$x \in [0,C]$59

Since $x \in [0,C]$60 for some $x \in [0,C]$61, the tail obeys $x \in [0,C]$62, so $x \in [0,C]$63 exponentially fast. Because the coefficients alternate in sign, $x \in [0,C]$64 and $x \in [0,C]$65 oscillate about zero with exponentially decaying amplitude. Recovery is defined by the first near-cancellation: $x \in [0,C]$66 or operationally

$x \in [0,C]$67

The summary states that no two integers share the same small-magnitude value once $x \in [0,C]$68 lies below the preceding oscillation amplitude (Semenov, 28 Apr 2025).

Several inversion procedures are given. Threshold-based inversion from a measured integral $x \in [0,C]$69 uses

$x \in [0,C]$70

and is stable if measurement noise satisfies $x \in [0,C]$71. A tabulation-and-binary-search scheme precomputes $x \in [0,C]$72 and locates the smallest compatible $x \in [0,C]$73 in $x \in [0,C]$74 time. A spline interpolation $x \in [0,C]$75 may be inverted numerically via

$x \in [0,C]$76

and Newton’s method can be applied to $x \in [0,C]$77. The local error relation is

$x \in [0,C]$78

A piecewise analytical inversion is also supplied: $x \in [0,C]$79 so that if $x \in [0,C]$80 then

$x \in [0,C]$81

The construction extends to tuples $x \in [0,C]$82 by summing $x \in [0,C]$83-dimensional Gaussian bumps centered at $x \in [0,C]$84 with coefficients such as

$x \in [0,C]$85

producing

$x \in [0,C]$86

The paper further notes that the map $x \in [0,C]$87 is differentiable, or $x \in [0,C]$88 under a smooth blending replacement for the floor-based extension, enabling uses such as a differentiable layer “SmoothInteger,” a regularizer for integer constraints, and soft-argmax with guaranteed exact recovery (Semenov, 28 Apr 2025).

6. Shifted-center explicitly correlated Gaussians in pre-Born–Oppenheimer calculations

In pre-Born–Oppenheimer quantum calculations, shifted Gaussian encoding appears as floating explicitly correlated Gaussian basis functions. For an $x \in [0,C]$89-particle system in three dimensions, a single basis element is

$x \in [0,C]$90

With $x \in [0,C]$91, $x \in [0,C]$92, and $x \in [0,C]$93, one may equivalently write

$x \in [0,C]$94

In practice, $x \in [0,C]$95 with $x \in [0,C]$96, while the shifted center $x \in [0,C]$97 is a $x \in [0,C]$98-vector of Gaussian centers in the laboratory frame. The role of the shift is to describe localized structures, including nuclei positions, more flexibly than origin-centered ECGs (Muolo et al., 2018).

The overlap of two FECGs is analytic: $x \in [0,C]$99 where $m$00. For $m$01,

$m$02

so the normalized basis function is

$m$03

Because a general FECG is not an eigenfunction of total angular momentum or parity, projection is required. Rotation-inversion projection uses

$m$04

with $m$05. Parity projection is

$m$06

The projected function

$m$07

then satisfies the requisite $m$08, $m$09, and parity eigenvalue equations (Muolo et al., 2018).

The triple Euler-angle integral is evaluated numerically by a product Gauss–Legendre scheme. With $m$10 nodes per angle,

$m$11

Typical values $m$12–$m$13 suffice to converge $m$14 to a few $m$15, and the naive cost scaling $m$16 can be reduced to $m$17 by exploiting idempotency and Hermiticity of the projector. For on-the-fly optimization, a nested Gauss–Kronrod rule may be used (Muolo et al., 2018).

Parameter optimization proceeds through competitive selection and Powell’s derivative-free refinement, often in a two-stage procedure: optimize non-projected FECGs by $m$18 minimization, then solve the linear variational problem with projected functions. Fully projected optimization is possible but more expensive. The reported benefit of shifted centers is that Gaussians can be localized at arbitrary interparticle distances, so fewer functions are needed to capture nuclear motion; the shift vector also explicitly encodes global translation, rotation, and internal equilibrium geometry (Muolo et al., 2018).

The principal application reported is the five-particle $m$19 ion with target state $m$20, $m$21, parity $m$22. Basis sets range from a small $m$23 test through $m$24 to $m$25. For the largest projected basis,

$m$26

and extrapolation with $m$27 gives

$m$28

The previous best non-shifted ECG result cited is $m$29, differing by approximately $m$30, while a perturbative non-adiabatic model estimate is $m$31 (Muolo et al., 2018).

7. Comparative interpretation and recurrent trade-offs

The cited literature does not present a single universal theory covering all uses of shifted Gaussian encoding. Instead, each field uses shifted centers to control a different structural property. In positional encoding, the decisive variables are stable rank and embedded-distance preservation, both governed by $m$32 and sampling density (Zheng et al., 2021). In GKP-state synthesis, the central issues are iterable superposition growth, envelope control, heralding probability, and fidelity under repeated coherent bifurcation (Takase et al., 2022). In the surface–GKP setting, squeezing-induced anisotropy is used to transform isotropic Gaussian displacement noise into a biased qubit channel that is better matched to the surface code (Hänggli et al., 2020). In smooth integer encoding, the essential mechanism is oscillatory near-cancellation of the total integral with exponentially decaying tails (Semenov, 28 Apr 2025). In shifted-center ECGs, the gain is variational flexibility at the cost of numerical projection onto symmetry sectors (Muolo et al., 2018).

A common misconception would be to treat these constructions as interchangeable merely because they use translated Gaussians. The source material instead indicates domain-specific semantics for the same geometric operation. In one case the centers $m$33 sample a coordinate domain; in another they mark lattice displacements of squeezed vacua; in another they are laboratory-frame centers of many-particle basis functions. This suggests that the unifying concept is not a shared application, but a shared representational device: localization through Gaussian basis elements whose positions are shifted to encode structure, constraints, or discrete alternatives.

A second recurring theme is that translation alone is insufficient; usefulness depends on accompanying control variables. Positional encoding requires an appropriate balance between rank and distance preservation. GKP breeding requires damping to shape the global envelope without changing the peak spacing. Surface–GKP biasing requires reinterpretation of logical axes after squeezing. Integer encoding requires carefully designed alternating coefficients and a recovery rule based on local minima of $m$34. Projected FECGs require explicit symmetry projection to restore good quantum numbers. The literature therefore presents shifted Gaussian encoding not as a generic recipe, but as a design pattern whose efficacy depends on how shifts, widths, amplitudes, and post-processing are coupled to the target problem.