In mathematics, the Hermite transform is an integral transform named after the mathematician Charles Hermite that uses Hermite polynomials Hn(x){\displaystyle H_{n}(x)} as kernels of the transform.
The Hermite transform H{F(x)}≡fH(n){\displaystyle H\{F(x)\}\equiv f_{H}(n)} of a function F(x){\displaystyle F(x)} is H{F(x)}≡fH(n)=∫−∞∞e−x2 Hn(x) F(x) dx{\displaystyle H\{F(x)\}\equiv f_{H}(n)=\int _{-\infty }^{\infty }e^{-x^{2}}\ H_{n}(x)\ F(x)\ dx}
The inverse Hermite transform H−1{fH(n)}{\displaystyle H^{-1}\{f_{H}(n)\}} is given by H−1{fH(n)}≡F(x)=∑n=0∞1π2nn!fH(n)Hn(x){\displaystyle H^{-1}\{f_{H}(n)\}\equiv F(x)=\sum _{n=0}^{\infty }{\frac {1}{{\sqrt {\pi }}2^{n}n!}}f_{H}(n)H_{n}(x)}
Direct evaluation of a discrete Hermite transform with N{\displaystyle N} coefficients and O(N){\displaystyle O(N)} sample points requires O(N2){\displaystyle O(N^{2})} arithmetic operations. Leibon, Rockmore, Park, Taintor, and Chirikjian developed fast algorithms for the forward and inverse transforms requiring O(Nlog2N){\displaystyle O(N\log ^{2}N)} operations, exploiting the three-term recurrence satisfied by the Hermite polynomials. [1]
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 logN{\displaystyle \log N} and log(1/ε){\displaystyle \log(1/\varepsilon )}, where N{\displaystyle N} is the number of Hermite modes and ε{\displaystyle \varepsilon } 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. [2]
{{citation}}