Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1711.05943 · Reports on Mathematical Physics

Quantum Systems Associated with the Hahn and Continuous Hahn Polynomials

Abdulaziz D Alhaidari, Y.-T. Li

Published Dec 1, 2018• 9 citations
arXivHTMLPDF
DOI
10.1016/s0034-4877(19)30002-3

Related papers

Exactly solvable discrete quantum mechanical systems and multi-indexed orthogonal polynomials of the continuous Hahn and Meixner–Pollaczek types

Satoru Odake

Abstract We present new exactly solvable systems of the discrete quantum mechanics with pure imaginary shifts, whose physical range of coordinates is a whole real line. These systems are shape invariant and their eigenfunctions are described by the multi-indexed continuous Hahn and Meixner–Pollaczek orthogonal polynomials. The set of degrees of these multi-indexed polynomials is $\{\ell_{\mathcal{D}},\ell_{\mathcal{D}}+1,\ell_{\mathcal{D}}+2,\ldots\}$, where $\ell_{\mathcal{D}}$ is an even positive integer ($\mathcal{D}$: a multi-index set), but they form a complete set of orthogonal basis in the weighted Hilbert space.

arXiv:1907.12218•Progress of Theoretical and Experimental Physics•Oct 11, 2019•8 citations

Quantum algorithms for orthogonal polynomial transforms

Anupam Prakash, Shree Hari Sureshbabu, Dylan Herman +1 more

A quantum orthogonal polynomial transform (QOPT) is an algorithmic primitive that maps a superposition of standard basis states $\sum_k α_{k} \ket{k}$ coherently to a basis of normalized univariate polynomials orthogonal with respect to a probability measure $μ(x)$. We provide new discrete and continuous QOPTs for polynomial families in the Askey scheme extending the results for the quantum Hermite transform (Jain et al., STOC'26). Our efficient QOPT algorithms require time $O(\text{polylog}(N, 1/ε))$, where $N$ is the grid size and $ε$ is the error, for the discrete Charlier, Meixner and Krawtchouk transforms and for the integer-order Laguerre transform in the continuous setting. The efficient QOPTs are obtained by uncovering the links between Askey scheme polynomials and Gaussian quantum optical gates and developing a compilation framework for $SU(2)$ and $SU(1,1)$ optical gates on Cartesian grids extending the framework developed by Iyer et al. (arXiv:2602.15180). Further, we reduce the continuous Jacobi transform to the discrete Hahn transform and provide an $O\!\left(N\operatorname{polylog}((N+α+β+1)/ε)\right)$-time Hahn transform, a quadratic speedup over the naive implementation. This is based on a more efficient compilation of the Clebsch--Gordan transform for coupling $\mathrm{SU}(2)$ representations with spins $(j_{1}, j_{2})$. Finally, we develop a new framework for Laguerre transforms for all orders $ν>0$ by fast-forwarding the corresponding radial oscillator using a 3-term chirp decomposition and an efficient algorithm for the Quantum Hankel Transform on a logarithmic grid.

quant-pharXiv:2610.03581•Oct 5, 2026•1 citation

Quantum systems with finite Hilbert space and Chebyshev polynomials

Apostol Vourdas

Journal of Computational and Applied Mathematics•Aug 1, 2001•2 citations

Continuous Quantum Systems. I

Ola Bratteli, Derek W. Robinson

Springer eBooks•Jan 1, 1997•0 citations

Continuous Quantum Systems. II

Ola Bratteli, Derek W. Robinson

Springer eBooks•Jan 1, 1997•0 citations

Representation of the quantum mechanical wavefunction by orthogonal polynomials in the energy and physical parameters

Abdulaziz D Alhaidari

Abstract We present a formulation of quantum mechanics based on the theory of orthogonal polynomials. The wavefunction is expanded over a complete set of square integrable basis where the expansion coefficients are orthogonal polynomials in the energy and physical parameters. Information about the corresponding physical systems (both structural and dynamical) are derived from the properties of these polynomials. We demonstrate that an advantage of this formulation is that the class of exactly solvable quantum mechanical problems becomes larger than in the conventional formulation (see, for example, table 3 in the text). We limit our investigation in this work to the Askey classification scheme of hypergeometric orthogonal polynomials and focus on the Wilson polynomial and two of its limiting cases (the Meixner–Pollaczek and continuous dual Hahn polynomials). Nonetheless, the formulation is amenable to other classes of orthogonal polynomials.

Communications in Theoretical Physics•Dec 30, 2019•20 citations
Abstract We present new exactly solvable systems of the discrete quantum mechanics with pure imaginary shifts, whose physical range of coordinates is a whole real line. These systems are shape invariant and their eigenfunctions are described by the multi-indexed continuous Hahn and Meixner–Pollaczek orthogonal polynomials. The set of degrees of these multi-indexed polynomials is {ℓD,ℓD+1,ℓD+2,…}\{\ell_{\mathcal{D}},\ell_{\mathcal{D}}+1,\ell_{\mathcal{D}}+2,\ldots\}{ℓD​,ℓD​+1,ℓD​+2,…}, where ℓD\ell_{\mathcal{D}}ℓD​ is an even positive integer (D\mathcal{D}D: a multi-index set), but they form a complete set of orthogonal basis in the weighted Hilbert space.
A quantum orthogonal polynomial transform (QOPT) is an algorithmic primitive that maps a superposition of standard basis states ∑kαk∣k⟩\sum_k α_{k} \ket{k}∑k​αk​∣k⟩ coherently to a basis of normalized univariate polynomials orthogonal with respect to a probability measure μ(x)μ(x)μ(x). We provide new discrete and continuous QOPTs for polynomial families in the Askey scheme extending the results for the quantum Hermite transform (Jain et al., STOC'26). Our efficient QOPT algorithms require time O(polylog(N,1/ε))O(\text{polylog}(N, 1/ε))O(polylog(N,1/ε)), where NNN is the grid size and εεε is the error, for the discrete Charlier, Meixner and Krawtchouk transforms and for the integer-order Laguerre transform in the continuous setting. The efficient QOPTs are obtained by uncovering the links between Askey scheme polynomials and Gaussian quantum optical gates and developing a compilation framework for SU(2)SU(2)SU(2) and SU(1,1)SU(1,1)SU(1,1) optical gates on Cartesian grids extending the framework developed by Iyer et al. (arXiv:2602.15180). Further, we reduce the continuous Jacobi transform to the discrete Hahn transform and provide an O ⁣(Npolylog⁡((N+α+β+1)/ε))O\!\left(N\operatorname{polylog}((N+α+β+1)/ε)\right)O(Npolylog((N+α+β+1)/ε))-time Hahn transform, a quadratic speedup over the naive implementation. This is based on a more efficient compilation of the Clebsch--Gordan transform for coupling SU(2)\mathrm{SU}(2)SU(2) representations with spins (j1,j2)(j_{1}, j_{2})(j1​,j2​). Finally, we develop a new framework for Laguerre transforms for all orders ν>0ν>0ν>0 by fast-forwarding the corresponding radial oscillator using a 3-term chirp decomposition and an efficient algorithm for the Quantum Hankel Transform on a logarithmic grid.
Abstract We present a formulation of quantum mechanics based on the theory of orthogonal polynomials. The wavefunction is expanded over a complete set of square integrable basis where the expansion coefficients are orthogonal polynomials in the energy and physical parameters. Information about the corresponding physical systems (both structural and dynamical) are derived from the properties of these polynomials. We demonstrate that an advantage of this formulation is that the class of exactly solvable quantum mechanical problems becomes larger than in the conventional formulation (see, for example, table 3 in the text). We limit our investigation in this work to the Askey classification scheme of hypergeometric orthogonal polynomials and focus on the Wilson polynomial and two of its limiting cases (the Meixner–Pollaczek and continuous dual Hahn polynomials). Nonetheless, the formulation is amenable to other classes of orthogonal polynomials.