Papers
Topics
Authors
Recent
Search
2000 character limit reached

Shifted Gaussian Encoding

Updated 18 July 2026
  • 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 ϕ(x)=[exp⁡(−∥x−μk∥2/(2σ2))]k=1…m\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∈[0,C]x \in [0,C] an mm-dimensional feature vector

ϕ(x)=[exp⁡(−∥x−μk∥2/(2σ2))]k=1…m,\phi(x) = \bigl[\exp(-\|x-\mu_k\|^2/(2\sigma^2))\bigr]_{k=1\ldots m},

with equally spaced shifts μk=(k−1)s\mu_k = (k-1)s and s=C/ms=C/m. In d>1d>1, a separable construction samples mim_i points per axis with standard deviation σi\sigma_i and concatenates the per-axis vectors, yielding total embedding dimension ∑imi\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 Δ\Delta and envelope width κ\kappa, the unnormalized codewords are

∣k~Δ,κ⟩=∑s∈Zexp⁡ ⁣[−12κ2((2s+k)π)2] D^ ⁣((2s+k)π) ∣SΔ⟩,k=0,1,\ket{\tilde k_{\Delta,\kappa}}= \sum_{s\in\mathbb Z} \exp\!\Biggl[-\frac{1}{2\kappa^2}\bigl((2s+k)\sqrt\pi\bigr)^2\Biggr] \,\hat D\!\bigl((2s+k)\sqrt\pi\bigr)\,\ket{S_{\Delta}}, \qquad k=0,1,

where ∣SΔ⟩=S^(Δ)∣0⟩\ket{S_\Delta}=\hat S(\Delta)\ket0 and D^(d)=e−idp^\hat D(d)=e^{-i d \hat p} (Takase et al., 2022).

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

fN(t)=∑n=1Nan exp⁡ ⁣(−(t−μn)22σ2),f_N(t)=\sum_{n=1}^{N} a_n\,\exp\!\Bigl(-\frac{(t-\mu_n)^2}{2\sigma^2}\Bigr),

with μn=n\mu_n=n, σ=δ>0\sigma=\delta>0, and coefficients

an=(1/2)n+(−1)nn.a_n=\frac{(1/2)^n+(-1)^n}{n}.

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

ϕ(r;A,s)=exp⁡[−(r−s)TA(r−s)],\phi(r;A,s)=\exp[-(r-s)^T A (r-s)],

with real symmetric positive-definite block-diagonal A∈R3Np×3NpA\in\mathbb R^{3N_p\times 3N_p} and shift vector s∈R3Nps\in\mathbb R^{3N_p}. The shifted center ss 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 Φ∈Rm×N\Phi\in\mathbb R^{m\times N} formed from sampled coordinates {xj}\{x_j\}. The stable rank

srank(Φ)≔∥Φ∥F2/∥Φ∥22\mathrm{srank}(\Phi)\coloneqq \|\Phi\|_F^2/\|\Phi\|_2^2

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

demb(x,x′)≔⟨ϕ(x),ϕ(x′)⟩d_{\mathrm{emb}}(x,x')\coloneqq \langle \phi(x),\phi(x')\rangle

is desired to be a monotonic function of the original distance ∥x−x′∥\|x-x'\| 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

D(x,x′)=∫exp⁡(−(t−x)2/(2σ2)) exp⁡(−(t−x′)2/(2σ2)) dt=πσ exp⁡(−∥x−x′∥2/(4σ2)).D(x,x')=\int \exp(-(t-x)^2/(2\sigma^2))\,\exp(-(t-x')^2/(2\sigma^2))\,dt =\sqrt{\pi}\sigma\,\exp(-\|x-x'\|^2/(4\sigma^2)).

After zero-mean centering and normalizing, one may ignore the πσ\sqrt{\pi}\sigma prefactor and view

demb(x,x′)∝exp⁡(−∥x−x′∥2/(4σ2)).d_{\mathrm{emb}}(x,x')\propto \exp(-\|x-x'\|^2/(4\sigma^2)).

When mm and NN are large enough,

srank(Φ)≈min⁡{N,(2πσ)−1}.\mathrm{srank}(\Phi)\approx \min\{N,(2\sqrt{\pi}\sigma)^{-1}\}.

The bandwidth parameter σ\sigma controls the central trade-off. Decreasing σ\sigma raises the upper bound 1/(2πσ)1/(2\sqrt{\pi}\sigma) on stable rank and therefore increases memorization capacity for high-frequency content, but it also makes dembd_{\mathrm{emb}} decay rapidly, so nearby points become nearly orthogonal. Increasing σ\sigma reduces stable rank and can underfit high-frequency structure, while making interpolation overly smooth. The embedding dimension must satisfy m≥bandwidth B≃2C/σm \ge \mathrm{bandwidth}\ B \simeq 2C/\sigma to reach the stable-rank ceiling, and Nyquist sampling requires s≲σs\lesssim \sigma to preserve the inner-product integral. A practical one-dimensional rule chooses σ\sigma so that

demb(Δx)=exp⁡(−Δx2/(4σ2))d_{\mathrm{emb}}(\Delta x)=\exp(-\Delta x^2/(4\sigma^2))

stays above a small threshold ϵ=10−k\epsilon=10^{-k} for nearest-neighbor spacing Δx=C/m\Delta x=C/m, giving

σ≈C/m2kln⁡10.\sigma \approx \frac{C/m}{2\sqrt{k\ln 10}}.

In dd dimensions, the same per-axis rule is applied under separable sampling, while keeping total dimension linear in dd 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 m∈{16,…,10 000}m\in\{16,\ldots,10\,000\} over 10 seeds, the Gaussian embedder with σ\sigma set by σ⋅m≈1/(22π)\sigma\cdot m\approx 1/(2\sqrt{2\pi}) yields test PSNR ∼34 dB\sim 34\,\mathrm{dB} with small error bars, whereas RFF is volatile at low mm and stabilizes only at large mm. In 2D experiments with a 4-layer ReLU MLP, separable Gaussian sampling along x,yx,y and optionally additional rotated axes matches or exceeds RFF in test PSNR, for example ∼32 dB\sim 32\,\mathrm{dB} at m≃1 000m\simeq 1\,000, while requiring smaller mm 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 κ=Δ\kappa=\Delta, and in the limit Δ,κ→∞\Delta,\kappa\to\infty the logical states approach ideal Dirac-comb codewords (Takase et al., 2022).

The paper’s central operation is the coherent bifurcation Bw\mathcal B_w, which acts linearly on superpositions of displaced squeezed vacua according to

D^(d)∣SΔ⟩↦[D^(d−w)+D^(d+w)]∣SΔ⟩.\hat D(d)\ket{S_\Delta}\mapsto [\hat D(d-w)+\hat D(d+w)]\ket{S_\Delta}.

Iterating it NN times with step size w=πw=\sqrt{\pi} yields

Bπ(N)[∣SΔ⟩]=∑l=0N(Nl) D^((2l−N)π)∣SΔ⟩≈∣k~Δ,Nπ⟩,k≡N(mod2).\mathcal B_{\sqrt\pi}^{(N)}[\ket{S_\Delta}] = \sum_{l=0}^N \binom Nl\,\hat D\bigl((2l-N)\sqrt\pi\bigr)\ket{S_\Delta} \approx \ket{\tilde k_{\Delta,\sqrt{N\pi}}}, \qquad k\equiv N\pmod 2.

This constructs a comb of N+1N+1 peaks (Takase et al., 2022).

A physical implementation starts from two single-mode squeezers and combines them either on a beam splitter of transmittance TT or through a QND gate exp⁡[igp^1x^2]\exp[i g \hat p_1 \hat x_2], followed by photon-number-resolving detection on the second mode. Detecting nn photons heralds an approximate two-peak superposition

Gw[∣SΔ1⟩]≃[D^(−w)+D^(w)]∣SΔ1⟩,w=2n/Δ1,\mathcal G_w[\ket{S_{\Delta_1}}]\simeq [\hat D(-w)+\hat D(w)]\ket{S_{\Delta_1}}, \qquad w=\sqrt{2n}/\Delta_1,

up to small overlap errors, and for even nn the wavefunction is symmetric. The QND variant G~w\tilde{\mathcal G}_w commutes with displacements, so linearity holds exactly and the coherent bifurcation becomes fully iterable (Takase et al., 2022).

Envelope control is implemented by heralding n=0n=0 in the QND setup, which realizes an unsharp measurement in pp equivalent to multiplication by a Gaussian in momentum space, or operatorially

e−tp^2.e^{-t\hat p^2}.

After a 90∘90^\circ phase rotation one also obtains e−tx^2e^{-t\hat x^2}. These damping steps set the global envelope κ\kappa without changing the internal peak spacing. To prepare an arbitrary superposition α∣0L⟩+β∣1L⟩\alpha\ket{0_L}+\beta\ket{1_L}, one first constructs a seed

∣seed⟩Δ,α,β=Bw(2)[∣SΔ⟩]≈α∣SΔ⟩+β D^(π)∣SΔ⟩,\ket{\mathrm{seed}}_{\Delta,\alpha,\beta} = \mathcal B_w^{(2)}[\ket{S_\Delta}] \approx \alpha\ket{S_\Delta}+\beta\,\hat D(\sqrt\pi)\ket{S_\Delta},

then applies Bπ(N)\mathcal B_{\sqrt\pi}^{(N)} to obtain

Bπ(N)[∣seed⟩]≈X^N[α∣0~Δ,Nπ⟩+β∣1~Δ,Nπ⟩].\mathcal B_{\sqrt\pi}^{(N)}[\ket{\mathrm{seed}}] \approx \hat X^N\Bigl[\alpha\ket{\tilde 0_{\Delta,\sqrt{N\pi}}} +\beta\ket{\tilde 1_{\Delta,\sqrt{N\pi}}}\Bigr].

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 (Δ1,n)(\Delta_1,n) at each stage reduces the beam-splitter count to NN (Takase et al., 2022).

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

P(n)=2 (2n)!4n(n!)2  tn (t+2)−n−12,t=g2Δ12Δ22,P(n)=\frac{\sqrt2\,(2n)!}{4^n(n!)^2}\;t^n\,(t+2)^{-n-\tfrac12}, \qquad t=g^2\frac{\Delta_1^2}{\Delta_2^2},

maximized at t=4nt=4n, giving

Pmax⁡(n)=(2n)!2n(n!)212n+1(n2n+1)n∼O(n−1/2).P_{\max}(n) = \frac{(2n)!}{2^n(n!)^2} \sqrt{\frac{1}{2n+1}\Bigl(\frac{n}{2n+1}\Bigr)^n} \sim \mathcal O(n^{-1/2}).

After NN bifurcations with w=πw=\sqrt\pi, the comb envelope has variance κ2=Nπ\kappa^2=N\pi, and in the square-lattice case additional damping yields total squeezing parameter Δ2=Nπ\Delta^2=N\pi. Each two-peak building block has overlap

Fn≈1−0.03/n,F_n\approx 1-0.03/n,

so the overall infidelity remains small provided n≳10n\gtrsim 10. Threshold analyses cited in the summary typically require ≳10 dB\gtrsim 10\,\mathrm{dB} of squeezing, that is Δ2≥10\Delta^2\ge 10, together with logical-state fidelity >0.99>0.99. With n=16n=16, one achieves Δ2≈10.6 dB\Delta^2\approx 10.6\,\mathrm{dB} and state fidelities >0.998>0.998 after N=4N=4 rounds. For generation of ∣0L⟩\ket{0_L} to F>0.99F>0.99, the example resource count is n=16n=16 photons per bifurcation, N=3N=3–$4$ rounds, per-round success probability P(n=16)≈2×10−2P(n=16)\approx 2\times 10^{-2}, and total success probability ≈10−6…10−7\approx 10^{-6}\ldots 10^{-7}, potentially improvable by multiplexing or quantum memory. For arbitrary magic states, the seed succeeds with probability ≈10−5\approx 10^{-5} and the full process reaches ≈10−10\approx 10^{-10} with F>0.99F>0.99 (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

U(k)=exp⁡[−i(ln⁡k)(qp+pq)/2]U(k)=\exp[-i(\ln k)(q p+p q)/2]

associated with the symplectic matrix

Sk=diag(k,1/k).S_k=\mathrm{diag}(k,1/k).

Under conjugation, the quadratures become q′=kqq'=kq and p′=(1/k)pp'=(1/k)p, and displacement operators transform as

D(νq,νp)↦D(kνq,νp/k).D(\nu_q,\nu_p)\mapsto D(k\nu_q,\nu_p/k).

The square-lattice GKP stabilizer lattice

L□={(2πn1,2πn2)∣ni∈Z}\mathcal L_\square=\{(2\sqrt\pi n_1,2\sqrt\pi n_2)\mid n_i\in\mathbb Z\}

is deformed into the rectangular lattice

Lk=SkL□={(2πkn1,2πn2/k)},\mathcal L_k=S_k\mathcal L_\square = \bigl\{(2\sqrt\pi k n_1,2\sqrt\pi n_2/k)\bigr\},

with dual lattice

Lk⊥={(πkm1,πm2/k)}.\mathcal L_k^\perp = \bigl\{(\sqrt\pi k m_1,\sqrt\pi m_2/k)\bigr\}.

In the rescaled coordinates, the logical Pauli operators are

XL=D(πk,0)=e−iπkp′,ZL=D(0,π/k)=eiπq′/kX_L=D(\sqrt\pi k,0)=e^{-i\sqrt\pi k p'}, \qquad Z_L=D(0,\sqrt\pi/k)=e^{i\sqrt\pi q'/k}

(Hänggli et al., 2020).

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

Nσ2(ρ)=12πσ2∫e−∥ν∥2/(2σ2)D(ν)ρD(ν)† d2ν\mathcal N_{\sigma^2}(\rho) = \frac1{2\pi\sigma^2} \int e^{-\|\nu\|^2/(2\sigma^2)}D(\nu)\rho D(\nu)^\dagger\,d^2\nu

becomes an anisotropic channel with covariance

Σk=diag(σ~Q2,σ~P2)=diag(σ2/k2,k2σ2).\Sigma_k=\mathrm{diag}(\tilde\sigma_Q^2,\tilde\sigma_P^2) = \mathrm{diag}(\sigma^2/k^2,k^2\sigma^2).

Equivalently, the quadrature jitters satisfy

σ~Q=σ/k,σ~P=kσ,\tilde\sigma_Q=\sigma/k,\qquad \tilde\sigma_P=k\sigma,

and the bias parameter is

B=σ~Pσ~Q=k2.B=\frac{\tilde\sigma_P}{\tilde\sigma_Q}=k^2.

For k≫1k\gg 1, the p′p'-quadrature noise, which causes logical XX errors, is much larger than the q′q'-quadrature noise, which causes logical ZZ errors (Hänggli et al., 2020).

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

qX≈1−Φ ⁣(142πk2σ2),qZ≈1−Φ ⁣(142πk2σ2),q_X\approx 1-\Phi\!\Bigl(\tfrac14\sqrt{\tfrac{2\pi k^2}{\sigma^2}}\Bigr), \qquad q_Z\approx 1-\Phi\!\Bigl(\tfrac14\sqrt{\tfrac{2\pi}{k^2\sigma^2}}\Bigr),

so qZ≪qXq_Z\ll q_X for large kk. The encoding is then relabeled so that the small-noise quadrature is associated with the qubit’s YY basis; in the paper the GKP “0/1” states are mapped to ∣±i⟩\lvert \pm i\rangle. The resulting single-qubit channel has

pX=qZ(1−qY),pY=qY(1−qZ),pZ=qZqY,p_X=q_Z(1-q_Y),\qquad p_Y=q_Y(1-q_Z),\qquad p_Z=q_Z q_Y,

with qY=qXq_Y=q_X, and in the large-kk limit one finds pZ≪pX≈pYp_Z\ll p_X\approx p_Y. The purpose is to realize a Pauli-ZZ-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 χ\chi up to $100$, which approaches maximum-likelihood decoding as χ→∞\chi\to\infty. Monte Carlo simulations show that, even without using GKP side information, an optimal choice of k>1k>1 raises the threshold from σc≃0.54\sigma_c\simeq 0.54 at k=1k=1 to σc≃0.58\sigma_c\simeq 0.58 for k≈3k\approx \sqrt3. Incorporating GKP analog-syndrome information into the prior further boosts the threshold to σc≈0.61\sigma_c\approx 0.61; even for k=2k=2 one observes σc≈0.606\sigma_c\approx 0.606, and a similar effect persists on asymmetric hexagonal lattices with σc≈0.605\sigma_c\approx 0.605 (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 ZZ errors.

5. Smooth integer encoding by shifted Gaussian integral balance

The integer-encoding construction of (Semenov, 28 Apr 2025) represents N∈NN\in\mathbb N by a smooth bump sum

fN(t)=∑n=1Nanexp⁡ ⁣(−(t−μn)22δ2),μn=n,f_N(t)=\sum_{n=1}^{N} a_n\exp\!\Bigl(-\frac{(t-\mu_n)^2}{2\delta^2}\Bigr), \qquad \mu_n=n,

with K(N)=NK(N)=N bumps and coefficients

an=(1/2)n+(−1)nn=1n(1/2)n+(−1)nn.a_n=\frac{(1/2)^n+(-1)^n}{n} = \frac{1}{n}(1/2)^n+\frac{(-1)^n}{n}.

Because ∑n=1∞an=ln⁡2−ln⁡2=0\sum_{n=1}^\infty a_n=\ln 2-\ln 2=0, the total integral tends to zero in the large-NN limit (Semenov, 28 Apr 2025).

Exact Gaussian integration gives

∫−∞∞exp⁡ ⁣(−(t−n)22δ2) dt=δ2π,\int_{-\infty}^{\infty} \exp\!\Bigl(-\frac{(t-n)^2}{2\delta^2}\Bigr)\,dt = \delta\sqrt{2\pi},

hence

I(N):=∫−∞∞fN(t) dt=δ2π∑n=1Nan=δ2π S(N).I(N):=\int_{-\infty}^{\infty} f_N(t)\,dt = \delta\sqrt{2\pi}\sum_{n=1}^{N} a_n = \delta\sqrt{2\pi}\,S(N).

Since ∣an∣≤Cρn\lvert a_n\rvert\le C\rho^n for some ρ<1\rho<1, the tail obeys ∑n>Nan=O(ρN+1)\sum_{n>N}a_n=O(\rho^{N+1}), so I(N)→0I(N)\to 0 exponentially fast. Because the coefficients alternate in sign, S(N)S(N) and I(N)I(N) oscillate about zero with exponentially decaying amplitude. Recovery is defined by the first near-cancellation: ∣I(N)∣<ε,I(N) locally minimal in magnitude,|I(N)|<\varepsilon, \qquad I(N)\text{ locally minimal in magnitude}, or operationally

N=min⁡{k∈N: ∣I(k)∣<ε}.N=\min\{k\in\mathbb N:\ |I(k)|<\varepsilon\}.

The summary states that no two integers share the same small-magnitude value once ε\varepsilon lies below the preceding oscillation amplitude (Semenov, 28 Apr 2025).

Several inversion procedures are given. Threshold-based inversion from a measured integral I∗I^* uses

N^=min⁡{k≥1: ∣I(k)−I∗∣<ε},\hat N=\min\{k\ge 1:\ |I(k)-I^*|<\varepsilon\},

and is stable if measurement noise satisfies ∣ΔI∣<ε/2|\Delta I|<\varepsilon/2. A tabulation-and-binary-search scheme precomputes {I(1),…,I(Nmax⁡)}\{I(1),\dots,I(N_{\max})\} and locates the smallest compatible kk in O(log⁡Nmax⁡)O(\log N_{\max}) time. A spline interpolation I(x)≈I(⌊x⌋)\mathcal I(x)\approx I(\lfloor x\rfloor) may be inverted numerically via

x∗=I−1(I∗),N^=round(x∗),x^*=\mathcal I^{-1}(I^*),\qquad \hat N=\mathrm{round}(x^*),

and Newton’s method can be applied to I(x)−I∗=0\mathcal I(x)-I^*=0. The local error relation is

ΔN≈ΔI/(δ2π∣ak+1∣).\Delta N\approx \Delta I / (\delta\sqrt{2\pi}|a_{k+1}|).

A piecewise analytical inversion is also supplied: I(x)=δ2π(∑n=1kan+(x−k)ak+1),k≤x≤k+1,\mathcal I(x) = \delta\sqrt{2\pi}\Bigl(\sum_{n=1}^{k} a_n +(x-k)a_{k+1}\Bigr), \qquad k\le x\le k+1, so that if I∈[I(k),I(k+1)]I\in[\mathcal I(k),\mathcal I(k+1)] then

x=k+I−δ2π∑n=1kanδ2π ak+1.x= k+\frac{I-\delta\sqrt{2\pi}\sum_{n=1}^{k} a_n}{\delta\sqrt{2\pi}\,a_{k+1}}.

The construction extends to tuples N⃗=(N1,…,Nd)\vec N=(N_1,\dots,N_d) by summing dd-dimensional Gaussian bumps centered at (n1,…,nd)(n_1,\dots,n_d) with coefficients such as

an1,…,nd=∏i=1d((1/2)ni+(−1)ni)/ni,a_{n_1,\dots,n_d} = \prod_{i=1}^{d}\bigl((1/2)^{n_i}+(-1)^{n_i}\bigr)/n_i,

producing

I(N⃗)=(2π)d/2δd∑n1=1N1⋯∑nd=1Ndan1,…,nd.I(\vec N) = (2\pi)^{d/2}\delta^d \sum_{n_1=1}^{N_1}\cdots\sum_{n_d=1}^{N_d} a_{n_1,\dots,n_d}.

The paper further notes that the map N↦I(N)N\mapsto I(N) is differentiable, or C∞C^\infty 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 NpN_p-particle system in three dimensions, a single basis element is

ϕ(r;A,s)=exp⁡[−(r−s)TA(r−s)].\phi(r;A,s)=\exp[-(r-s)^T A (r-s)].

With x≡rx\equiv r, u≡Asu\equiv As, and c≡−sTAsc\equiv -s^TAs, one may equivalently write

ϕ(x;A,u)=exp⁡[−xTAx+2uTx+c].\phi(x;A,u)=\exp[-x^T A x + 2u^T x + c].

In practice, A=Aˉ⊗I3A=\bar A\otimes I_3 with Aˉ∈RNp×Np\bar A\in\mathbb R^{N_p\times N_p}, while the shifted center ss is a 3Np3N_p-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: ⟨ϕI∣ϕJ⟩=(π3Npdet⁡(AI+AJ))3/2exp⁡ ⁣[sITAIsI+sJTAJsJ−eT(AI+AJ)−1e],\langle \phi_I\mid \phi_J\rangle = \Bigl(\frac{\pi^{3N_p}}{\det(A_I+A_J)}\Bigr)^{3/2} \exp\!\bigl[ s_I^T A_I s_I+s_J^T A_J s_J-e^T(A_I+A_J)^{-1}e \bigr], where e=AIsI+AJsJe=A_I s_I+A_J s_J. For I=JI=J,

⟨ϕI∣ϕI⟩=(π3Np/det⁡(2AI))3/2,\langle \phi_I\mid \phi_I\rangle = \bigl(\pi^{3N_p}/\det(2A_I)\bigr)^{3/2},

so the normalized basis function is

ϕ~I(x)=NIexp⁡[−(x−sI)TAI(x−sI)],NI=(det⁡(2AI)/π3Np)3/4.\tilde\phi_I(x)=N_I\exp[-(x-s_I)^T A_I(x-s_I)], \qquad N_I=(\det(2A_I)/\pi^{3N_p})^{3/4}.

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

PMM′L=2L+18π2∫02πdα∫0πsin⁡β dβ∫02πdγ DMM′L∗(α,β,γ) R(α,β,γ),P^L_{MM'} = \frac{2L+1}{8\pi^2} \int_0^{2\pi}d\alpha \int_0^\pi \sin\beta\,d\beta \int_0^{2\pi}d\gamma\, D^{L*}_{MM'}(\alpha,\beta,\gamma)\,R(\alpha,\beta,\gamma),

with R(α,β,γ)=e−iαLze−iβLye−iγLzR(\alpha,\beta,\gamma)=e^{-i\alpha L_z}e^{-i\beta L_y}e^{-i\gamma L_z}. Parity projection is

Pπ=12[1+πI^].P^\pi=\tfrac12[1+\pi \hat I].

The projected function

ϕM[L,π](r)=PπPMMLϕ(r)\phi_M^{[L,\pi]}(r)=P^\pi P^L_{MM}\phi(r)

then satisfies the requisite L2L^2, LzL_z, and parity eigenvalue equations (Muolo et al., 2018).

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

PMMLϕ(r)≃2L+18π2∑i,j,k=1nwi(α)wj(β)wk(γ)DMML∗(αi,βj,γk) R(αi,βj,γk)ϕ(r).P^L_{MM}\phi(r)\simeq \frac{2L+1}{8\pi^2} \sum_{i,j,k=1}^{n} w_i^{(\alpha)}w_j^{(\beta)}w_k^{(\gamma)} D^{L*}_{MM}(\alpha_i,\beta_j,\gamma_k)\, R(\alpha_i,\beta_j,\gamma_k)\phi(r).

Typical values n≈20n\approx 20–$30$ suffice to converge ⟨L2⟩\langle L^2\rangle to a few 10−410^{-4}, and the naive cost scaling Nb2n3N_b^2 n^3 can be reduced to Nb2nN_b^2 n 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 ⟨H⟩\langle H\rangle 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 H3+\mathrm{H}_3^+ ion with target state L=1L=1, M=0M=0, parity π=−1\pi=-1. Basis sets range from a small Nb=3N_b=3 test through Nb=120N_b=120 to Nb=1 560N_b=1\,560. For the largest projected basis,

E=−1.322826 Eh,⟨p⟩=−0.999994,⟨L2⟩=2.000055,E=-1.322826\,E_h,\qquad \langle p\rangle=-0.999994,\qquad \langle L^2\rangle=2.000055,

and extrapolation with E(Nb)=a+b/NbE(N_b)=a+b/N_b gives

E(∞)=−1.323005 Eh.E(\infty)=-1.323005\,E_h.

The previous best non-shifted ECG result cited is E=−1.3143836 EhE=-1.3143836\,E_h, differing by approximately +8.44 mEh+8.44\,\mathrm{m}E_h, while a perturbative non-adiabatic model estimate is E=−1.323146 EhE=-1.323146\,E_h (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 σ\sigma 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 μk\mu_k 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 ∣I(N)∣|I(N)|. 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.

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Shifted Gaussian Encoding.