Hermite transform
In mathematics, the Hermite transform is an integral transform named after the mathematician Charles Hermite that uses Hermite polynomials as kernels of the transform.
The Hermite transform of a function
is
The inverse Hermite transform is given by
01Computational complexity
Direct evaluation of a discrete Hermite transform with coefficients and
sample points requires
arithmetic operations. Leibon, Rockmore, Park, Taintor, and Chirikjian developed fast algorithms for the forward and inverse transforms requiring
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 and
, where
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.
Sources and credits
This article is adapted from the Wikipedia article “Hermite transform”, written by its contributors and licensed under CC BY-SA 4.0. Fathomly has changed the layout, removed citation markers, navigation and maintenance notices, and adjusted punctuation. This adapted version is shared under the same license. For references, see the original article.
Fathomly is not affiliated with or endorsed by the Wikimedia Foundation. Spotted a problem? Tell us.