Hermite transform

In mathematics, the Hermite transform is an integral transform named after the mathematician Charles Hermite that uses Hermite polynomials Hn(x) as kernels of the transform.

The Hermite transform H{F(x)}≡fH(n) of a function F(x) is H{F(x)}≡fH(n)=∫−∞∞e−x2 Hn(x) F(x) dx

The inverse Hermite transform H−1{fH(n)} is given by H−1{fH(n)}≡F(x)=∑n=0∞1π2nn!fH(n)Hn(x)

Computational complexity

Direct evaluation of a discrete Hermite transform with N coefficients and O(N) sample points requires O(N2) arithmetic operations. Leibon, Rockmore, Park, Taintor, and Chirikjian developed fast algorithms for the forward and inverse transforms requiring O(Nlog2N) operations, exploiting the three-term recurrence satisfied by the Hermite polynomials.

Jain, Iyer, Somma, Bao, and Jordan developed a quantum algorithm that implements an approximate discrete Hermite transform using a number of quantum gates polynomial in log⁡N and log⁡(1/ε), where N is the number of Hermite modes and ε is the approximation error. The algorithm uses fast-forwarding of the quantum harmonic oscillator. It transforms information encoded in the amplitudes of a quantum state, rather than producing an explicit classical list of transform coefficients; the gate bound does not include preparing an arbitrary input state from classical data.

Some Hermite transform pairs

F(x) fH(n)
xm {m!π2m−n(m−n2)!,(m−n) even and≥00,otherwise
eax πanea2/4
e2xt−t2, |t|<12 π(2t)n
Hm(x) π2nn!δnm
x2Hm(x) 2nn!π{1,n=m+2(n+12),n=m(n+1)(n+2),n=m−20,otherwise
e−x2Hm(x) (−1)p−m2p−1/2Γ(p+1/2), m+n=2p, p∈ℤ
Hm2(x) {2m+n/2π(mn/2)m!n!(n/2)!,n even and≤2m0,otherwise
Hm(x)Hp(x) {2kπm!n!p!(k−m)!(k−n)!(k−p)!,n+m+p=2k, k∈ℤ; |m−p|≤n≤m+p0,otherwise
Hn+p+q(x)Hp(x)Hq(x) π2n+p+q(n+p+q)!
dmdxmF(x) fH(n+m)
xdmdxmF(x) nfH(n+m−1)+12fH(n+m+1)
ex2ddx[e−x2ddxF(x)] −2nfH(n)
F(x−x0) π∑k=0∞(−x0)kk!fH(n+k)
F(x)∗G(x) π(−1)n[22n+1Γ(n+32)]−1fH(n)gH(n)
ez2sin⁡(xz), |z|<12  {π(−1)⌊n2⌋(2z)n,nodd0,neven
(1−z2)−1/2exp⁡[2xyz−(x2+y2)z2(1−z2)] πznHn(y)
Hm(y)Hm+1(x)−Hm(x)Hm+1(y)2m+1m!(x−y) {πHn(y)n≤m0n>m

References

  1. ↑ Leibon, Gregory; Rockmore, Daniel N.; Park, Wooram; Taintor, Robert; Chirikjian, Gregory S. (2008). "A fast Hermite transform". Theoretical Computer Science. 409 (2): 211–228. doi:10.1016/j.tcs.2008.09.010. PMC 2630232.
  2. ↑ Jain, Siddhartha; Iyer, Vishnu; Somma, Rolando D.; Bao, Ning; Jordan, Stephen P. (2026). "Efficient Quantum Hermite Transform". Proceedings of the 58th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery. pp. 541–552. arXiv:2510.04929. doi:10.1145/3798129.3800772.
  3. ↑ McCully, Joseph Courtney; Churchill, Ruel Vance (1953), Hermite and Laguerre integral transforms : preliminary report
  4. ↑ Feldheim, Ervin (1938). "Quelques nouvelles relations pour les polynomes d'Hermite". Journal of the London Mathematical Society (in French). s1-13: 22–29. doi:10.1112/jlms/s1-13.1.22.
  5. ↑ Bailey, W. N. (1939). "On Hermite polynomials and associated Legendre functions". Journal of the London Mathematical Society. s1-14 (4): 281–286. doi:10.1112/jlms/s1-14.4.281.
  6. ↑ Glaeske, Hans-Jürgen (1983). "On a convolution structure of a generalized Hermite transformation" (PDF). Serdica Bulgariacae Mathematicae Publicationes. 9 (2): 223–229.
  7. ↑ Erdélyi et al. 1955, p. 194, 10.13 (22).
  8. ↑ Mehler, F. G. (1866), "Ueber die Entwicklung einer Function von beliebig vielen Variabeln nach Laplaceschen Functionen höherer Ordnung" [On the development of a function of arbitrarily many variables according to higher-order Laplace functions], Journal für die Reine und Angewandte Mathematik (in German) (66): 161–176, ISSN 0075-4102, ERAM 066.1720cj. See p. 174, eq. (18) and p. 173, eq. (13).

Sources