betaFeedback

WorksPhysics and Astronomy

Efficient quantum ultraspherical transform and a well-conditioned quantum spectral method

Abstract

Solving differential equations is a promising application of quantum computing. Spectral methods, where the solution is represented by coefficients in a basis, are particularly well suited to quantum solvers because their structured discretizations can enable efficient linear-algebra operations while providing rapid convergence. Their quantum implementation, however, requires an efficient transform between amplitudes encoding function values and amplitudes encoding expansion coefficients. This work develops two key components of a quantum spectral method. First, we construct the quantum ultraspherical transform (QUT) for orthonormal ultraspherical polynomials, a basis that supports sparse and well-conditioned discretizations of differential equations. For the basis parameters m=0m=0 and 11, this transform reduces to the discrete cosine and sine transforms with known efficient circuits. Our contribution covers every fixed integer m≥2m\geq2: for dimensions NN with N+m=2nN+m=2^n, where nn is the number of qubits, the QUT achieves error at most ε\varepsilon using a gate count polynomial in nn and log⁡(1/ε)\log(1/\varepsilon). The construction builds on the quantum Fourier transform, augmented by approximations whose accuracy guarantees are independent of NN. Second, we develop a quantum spectral solver for regular linear ordinary differential equations based on the QUT. Under suitable boundary conditions and data-access assumptions, preconditioning keeps condition numbers bounded independently of the basis size, allowing the solution state to be prepared at polylogarithmic cost in system size and inverse error. Together, these contributions provide a framework for quantum spectral methods with the potential to solve linear differential equations efficiently.

Introduction

A common workflow in quantum algorithms for differential equations [1, 2, 3, 4, 5, 6, 7, 8, 9] involves discretizing the equation, embedding the discretized operator in a unitary circuit as a block encoding [10, 11, 12], and preparing a state proportional to the solution with a quantum linear-system algorithm [13, 14, 15, 16]. Its cost grows with the condition number of the discretized operator and with the cost of the block encoding. Spectral discretizations suit this workflow: they expand the solution in a basis of orthogonal functions and converge rapidly for smooth solutions [17, 18], so small systems often suffice. The choice of basis affects this cost in two ways. First, it determines how differential operators act on the coefficients and therefore the structure and conditioning of the linear system. Second, it determines whether function values at the associated quadrature nodes and expansion coefficients can be converted into one another efficiently. On a quantum computer, this conversion must act coherently on the amplitudes of a state, as the quantum Fourier transform does for the Fourier basis [19].

Existing quantum spectral methods typically use Fourier, sinusoidal, or Chebyshev bases, for which the quantum Fourier transform and its sine and cosine variants provide efficient transforms [20, 21]. The Chebyshev basis, which approximates general nonperiodic boundary conditions, is employed in linear-system solvers [5, 6], variational models [22, 23], and effective-Hamiltonian methods [24]. However, differentiation matrices in the Chebyshev basis are dense. The resulting linear systems typically have condition numbers that grow polynomially with the basis size [6, 25, 26]. The classical ultraspherical spectral method avoids this growth by representing each derivative in the ultraspherical (Gegenbauer) basis whose parameter equals the order of the derivative [26, 27, 28, 29]. The resulting systems are sparse, and upon diagonal preconditioning, their condition numbers can remain bounded as the system size increases [26]. A quantum version of this method needs an efficient transform for each basis. However, only the first two bases—the Chebyshev polynomials of the first and second kinds—correspond to cosine and sine transforms, for which efficient quantum implementations are known.

Our first contribution is an efficient circuit for the quantum ultraspherical transform (QUT) with any fixed integer parameter mm. The QUT maps function values at Gauss quadrature nodes to expansion coefficients in an orthonormal ultraspherical basis. For m=0m = 0 and m=1m = 1, the QUT reduces to the discrete cosine and sine transforms with efficient circuit implementations [20, 21]. For m≥2m \ge2, Theorem 1 presents a circuit that implements the QUT to error ε\varepsilon with a gate count polylogarithmic in the system size and 1/ε1/\varepsilon and a small ancilla overhead. The construction builds on the quantum Fourier transform, followed by corrections and rotational changes of basis that can be implemented efficiently. Together with the cosine and sine transforms, the QUT enables a quantum ultraspherical spectral method, as summarized in Figure 1.

Figure 1. Discretizing a differential equation in the ultraspherical basis produces a linear system with a banded matrix, except for boundary rows. The QUT, built from a quantum Fourier transform (QFT) with corrections followed by hierarchical rotations, enables a block encoding of the matrix. It can be used by a quantum linear-system algorithm to prepare the solution state.

Other efficient quantum polynomial transforms have recently been developed for Hermite polynomials [30], integer-parameter Laguerre polynomials [31], and several families of hypergeometric orthogonal polynomials [31, 32]. The work [31] also addresses the Jacobi family, which contains the ultraspherical polynomials, but its gate count scales linearly with the dimension, with additional polylogarithmic factors. To our knowledge, the QUT is the first efficient transform for a Jacobi family beyond the Chebyshev cases (Table I). We also discuss how a key idea underlying the QUT extends to Jacobi polynomials with half-integer parameters.

Our second contribution uses the QUT to construct a quantum ultraspherical spectral method for regular one-dimensional linear boundary-value problems. Within this method, QUTs convert functions to their expansion coefficients, enabling an efficient block encoding of the discretized system. For uniquely solvable problems with a broad class of boundary conditions, we show that its condition number, upon diagonal preconditioning, is bounded independently of the basis size (Proposition 2). Given efficient quantum access to the problem data, the preconditioned solution state can therefore be prepared at a cost polylogarithmic in the basis size and the inverse error. Extracting useful quantities from the solution would add further costs, which determines whether the solver could provide a computational advantage in practice. We therefore do not claim an end-to-end quantum speedup for these one-dimensional problems.

The rest of the paper is organized as follows. Section II introduces the ultraspherical basis, defines the QUT, and states the main theorem. Section III collects the main tools used throughout the paper. Section IV develops the QUT circuit and its complexity analysis. Readers primarily interested in the application may skip this section and proceed directly to § 0.6, where we apply the transform to a quantum ultraspherical spectral method and analyze its conditioning and complexity. Finally, § 1 discusses the scope of the results and outlook.

Quantum ultraspherical transform

This section defines the ultraspherical basis and the corresponding quantum transform before stating the main circuit guarantee and outlining its proof. Throughout the rest of the paper, we use ∥⋅∥2\lVert\cdot\rVert_2 for the ℓ2\ell^2 vector norm and the induced operator norm. For a scalar function ff on [−1,1][-1,1], we write ∥f∥∞=sup⁡x∈[−1,1]∣f(x)∣\lVert f\rVert_\infty= \sup_{x\in[-1,1]}|f(x)| for the supremum norm.

Ultraspherical basis

The ultraspherical polynomials, also called Gegenbauer polynomials, are denoted by Ck(λ)(x)C_k^{(\lambda)}(x). The index k=0,1,2,…k = 0,1,2,\ldots is the polynomial degree, and λ>−1/2\lambda> -1/2, λ≠0\lambda\ne0, denotes the basis parameter. The polynomials are orthogonal on [−1,1][-1,1] with respect to the weight wλ(x)=(1−x2)λ−1/2w_\lambda(x) = (1-x^2)^{\lambda-1/2}:

∫−11wλ(x)Ck(λ)(x)Cℓ(λ)(x) dx=hk(λ)δkℓ,(1)\int_{-1}^{1} w_\lambda(x) C_k^{(\lambda)}(x) C_\ell^{(\lambda)}(x)\,\mathrm{d}x = h_k^{(\lambda)} \delta_{k\ell}, \tag*{(1)}

where δkℓ\delta_{k\ell} is the Kronecker delta and hk(λ)h_k^{(\lambda)} is the squared norm of Ck(λ)C_k^{(\lambda)}. In terms of Euler’s Gamma function Γ\Gamma,

hk(λ)=π21−2λΓ(k+2λ)k!(k+λ)Γ(λ)2.(2)h_k^{(\lambda)} = \frac{\pi2^{1-2\lambda}\Gamma(k+2\lambda)}{k!(k+\lambda)\Gamma(\lambda)^2}. \tag*{(2)}

For λ>0\lambda> 0, the polynomials can be defined through the generating function

(1−2xt+t2)−λ=∑k=0∞Ck(λ)(x)tk,∣x∣,∣t∣<1.(3)(1-2xt+t^2)^{-\lambda} = \sum_{k=0}^{\infty} C_k^{(\lambda)}(x)t^k,\qquad|x|,|t|<1. \tag*{(3)}

Ultraspherical polynomials constitute the symmetric subclass of the Jacobi polynomial family Pk(α,β)P_k^{(\alpha,\beta)}. In particular, Ck(λ)(x)=(2λ)k(λ+1/2)kPk(λ−1/2,λ−1/2)(x)C_k^{(\lambda)}(x) = \frac{(2\lambda)_k}{(\lambda+1/2)_k}P_k^{(\lambda-1/2,\lambda-1/2)}(x), where (α)k=Γ(α+k)Γ(α)=α(α+1)⋯(α+k−1)(\alpha)_k = \frac{\Gamma(\alpha+k)}{\Gamma(\alpha)} = \alpha(\alpha+1)\cdots(\alpha+k-1) denotes the rising factorial. Several classical polynomial families appear as special cases: λ=12\lambda= \frac{1}{2} yields the Legendre polynomials, while λ=1\lambda= 1 corresponds to the Chebyshev polynomials of the second kind. The Chebyshev polynomials of the first kind, Tk(x)T_k(x), arise as a limiting case:

lim⁡λ→0k2λCk(λ)(x)=Tk(x),k≥1.(4)\lim_{\lambda\to0}\frac{k}{2\lambda}C_k^{(\lambda)}(x) = T_k(x),\qquad k\ge1. \tag*{(4)}

The ultraspherical basis is useful in spectral methods because differentiation maps each nonconstant basis polynomial to a scalar multiple of one polynomial in the next family. We begin by approximating the solution with a Chebyshev expansion,

FamilyMechanismGate complexity
Chebyshev, first and second kinds (λ=0,1\lambda= 0, 1)Cosine and sine transforms from the QFT [20, 21]polylog
HermiteHarmonic-oscillator evolution [30]polylog
Laguerre of integer parameter, Charlier, Meixner, KravchukQuantum optical operations [31]; fast-forwarding in oscillator representation for Kravchuk [32]polylog
Jacobi, integer parameters α,β\alpha, \betaDiscrete Hahn transform [31]linear, with extra polylog factors
Ultraspherical, integer m≥2m \ge2 (Jacobi with α=β=m−12\alpha= \beta= m - \frac{1}{2})QFT with corrections, followed by rotations (this work)polylog (Theorem 1)

Table 1. Quantum transforms for classical orthogonal polynomials with known circuits. Polylog denotes a gate count polynomial in log⁡N\log N and log⁡(1/ε)\log(1/\varepsilon).

u~N(x):=∑k=0N−1ukTk(x),(5)\widetilde{u}_N(x) := \sum_{k=0}^{N-1} u_k T_k(x), \tag*{(5)}

where uku_k are the expansion coefficients. Differentiation then follows from

dTkdx={kCk−1(1),k≥10,k=0(6)\frac{\mathrm{d}T_k}{\mathrm{d}x} = \begin{cases} kC_{k-1}^{(1)}, & k \ge1 \\ 0, & k = 0 \end{cases} \tag*{(6)}

and, for λ≥1\lambda\ge1,

dCk(λ)dx={2λCk−1(λ+1),k≥10,k=0(7)\frac{\mathrm{d}C_k^{(\lambda)}}{\mathrm{d}x} = \begin{cases} 2\lambda C_{k-1}^{(\lambda+1)}, & k \ge1 \\ 0, & k = 0 \end{cases} \tag*{(7)}

Iterating these identities gives the qqth derivative of a Chebyshev polynomial,

dqdxqTk(x)=2q−1(q−1)! kCk−q(q)(x),k≥q≥1.(8)\frac{\mathrm{d}^q}{\mathrm{d}x^q}T_k(x) = 2^{q-1}(q-1)! \, k C_{k-q}^{(q)}(x), \qquad k \ge q \ge1. \tag*{(8)}

The derivative vanishes for k<qk < q. The solution’s derivatives can be written compactly as

dqu~Ndxq=2q−1(q−1)!∑k=qN−1kukCk−q(q)(x).(9)\frac{\mathrm{d}^q\widetilde{u}_N}{\mathrm{d}x^q} = 2^{q-1}(q-1)! \sum_{k=q}^{N-1} k u_k C_{k-q}^{(q)}(x). \tag*{(9)}

Therefore, for 1≤q<N1 \le q < N, the qqth-order differentiation matrix Dq∈R(N−q)×ND_q \in\mathbb{R}^{(N-q)\times N} maps Chebyshev coefficients u0,…,uN−1u_0,\ldots,u_{N-1} to coefficients in the ultraspherical basis C0(q),…,CN−q−1(q)C_0^{(q)},\ldots,C_{N-q-1}^{(q)}. Its first qq columns vanish, and the remaining nonzero entries lie on the qqth superdiagonal,

(Dq)jk=2q−1(q−1)! k δj,k−q.(10)(D_q)_{jk} = 2^{q-1}(q-1)! \, k \, \delta_{j,k-q}. \tag*{(10)}

A differential equation generally involves derivatives of several orders, whose coefficient representations must be expressed in a common basis. The initial conversion from the Chebyshev basis is given by Tk(x)=12[Ck(1)(x)−Ck−2(1)(x)]T_k(x) = \frac{1}{2}[C_k^{(1)}(x) - C_{k-2}^{(1)}(x)] for k≥1k \ge1, with T0=C0(1)=1T_0 = C_0^{(1)} = 1. For λ≥1\lambda\ge1, consecutive ultraspherical families are related by

Ck(λ)(x)=λk+λ[Ck(λ+1)(x)−Ck−2(λ+1)(x)].(11)C_k^{(\lambda)}(x) = \frac{\lambda}{k+\lambda}\left[C_k^{(\lambda+1)}(x) - C_{k-2}^{(\lambda+1)}(x)\right]. \tag*{(11)}

with the convention that Cj(λ)(x)=0C_j^{(\lambda)}(x) = 0 for j<0j < 0. Accordingly, each conversion matrix contains only the main diagonal and the second superdiagonal. Composing these sparse conversion operators with the differentiation matrices yields a banded representation of the residual operator. Imposing boundary conditions introduces only a small number of dense rows [26].

Quantum transform

References

  1. [1]B. D. Clader, B. C. Jacobs, and C. R. Sprouse, Preconditioned quantum linear system algorithm, Phys. Rev. Lett. 110, 250504 (2013).DOI
  2. [2]D. W. Berry, High-order quantum algorithm for solving linear differential equations, J. Phys. A: Math. Theor. 47, 105301 (2014).DOI
  3. [3]A. Montanaro and S. Pallister, Quantum algorithms and the finite element method, Phys. Rev. A 93, 032324 (2016).DOI
  4. [4]D. W. Berry, A. M. Childs, A. Ostrander, and G. Wang, Quantum algorithm for linear differential equations with exponentially improved dependence on precision, Commun. Math. Phys. 356, 1057 (2017).DOI
  5. [5]A. M. Childs and J.-P. Liu, Quantum spectral methods for differential equations, Commun. Math. Phys. 375, 1427 (2020).DOI
  6. [6]A. M. Childs, J.-P. Liu, and A. Ostrander, High-precision quantum algorithms for partial differential equations, Quantum 5, 574 (2021).DOI
  7. [7]J.-P. Liu, H. Ø. Kolden, H. K. Krovi, N. F. Loureiro, K. Trivisa, and A. M. Childs, Efficient quantum algorithm for dissipative nonlinear differential equations, Proc. Natl. Acad. Sci. USA 118, e2026805118 (2021).DOI
  8. [8]H. Krovi, Improved quantum algorithms for linear and nonlinear differential equations, Quantum 7, 913 (2023).DOI
  9. [9]D. W. Berry and P. C. S. Costa, Quantum algorithm for time-dependent differential equations using Dyson series, Quantum 8, 1369 (2024).DOI
  10. [10]G. H. Low and I. L. Chuang, Hamiltonian simulation by qubitization, Quantum 3, 163 (2019).
  11. [11]A. Gilyén, Y. Su, G. H. Low, and N. Wiebe, Quantum singular value transformation and beyond: Exponential improvements for quantum matrix arithmetics, in Proceedings of STOC 2019 (2019) pp. 193–204, arXiv:1806.01838.DOI
  12. [12]C. Sünderhauf, E. Campbell, and J. Camps, Block-encoding structured matrices for data input in quantum computing, Quantum 8, 1226 (2024).DOI
  13. [13]A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009).pubmed.ncbi.nlm.nih.gov/19905613
  14. [14]A. M. Childs, R. Kothari, and R. D. Somma, Quantum algorithm for systems of linear equations with exponentially improved dependence on precision, SIAM J. Comput. 46, 1920 (2017).DOI
  15. [15]P. C. S. Costa, D. An, Y. R. Sanders, Y. Su, R. Babbush, and D. W. Berry, Optimal scaling quantum linear-systems solver via discrete adiabatic theorem, PRX Quantum 3, 040303 (2022).arxiv.org/abs/2111.08152
  16. [16]A. M. Dalzell, A shortcut to an optimal quantum linear systems solver, arXiv:2406.12086 (2024).arxiv.org/abs/2406.12086
  17. [17]J. P. Boyd, Chebyshev and Fourier Spectral Methods, 2nd ed. (Dover, Mineola, NY, 2001).
  18. [18]J. Shen, T. Tang, and L.-L. Wang, Spectral Methods: Algorithms, Analysis and Applications (Springer, Berlin, 2011).DOI
  19. [19]D. Coppersmith, An approximate Fourier transform useful in quantum factoring, Tech. Rep. RC 19642 (IBM Research, 1994) arXiv:quant-ph/0201067.
  20. [20]A. Kleppenecker and M. Rötteler, Discrete cosine transforms on quantum computers, in Proceedings of the 2nd International Symposium on Image and Signal Processing and Analysis (2001) pp. 464–468.
  21. [21]C. A. Williams, A. E. Paine, H.-Y. Wu, V. E. Elfving, and O. Kyriienko, Quantum Chebyshev transform: Mapping, embedding, learning and sampling distributions, arXiv:2306.17026 (2023).arxiv.org/abs/2306.17026
  22. [22]O. Kyriienko, A. E. Paine, and V. E. Elfving, Solving nonlinear differential equations with differentiable quantum circuits, Phys. Rev. A 103, 052416 (2021).DOI
  23. [23]A. E. Paine, V. E. Elfving, and O. Kyriienko, Physics-informed quantum machine learning: Solving nonlinear differential equations in latent spaces without costly grid evaluations, arXiv:2308.01827 (2023).arxiv.org/abs/2308.01827
  24. [24]H.-Y. Wu, A. E. Paine, E. Philip, A. A. Gentile, and O. Kyriienko, Quantum algorithms for solving nonlinear differential equations based on physics-informed effective Hamiltonians, arXiv:2504.13174 (2025).arxiv.org/abs/2504.13174
  25. [25]F. Ghoreishi and S. Mohammad Hosseini, The Tau method and a new preconditioner, J. Comput. Appl. Math. 163, 351 (2004).DOI
  26. [26]S. Olver and A. Townsend, A fast and well-conditioned spectral method, SIAM Rev. 55, 462 (2013).
  27. [27]A. Townsend and S. Olver, The automatic solution of partial differential equations using a global spectral method, J. Comput. Phys. 299, 106 (2015).
  28. [28]S. Olver, R. M. Slevinsky, and A. Townsend, Fast algorithms using orthogonal polynomials, Acta Numer. 29, 573 (2020).DOI
  29. [29]D. Fortunato, N. Hale, and A. Townsend, The ultraspherical spectral element method, J. Comput. Phys. 436, 110087 (2021).DOI
  30. [30]S. Jain, V. Iyer, R. D. Somma, N. Bao, and S. P. Jordan, Efficient quantum Hermite transform, in Proceedings of STOC 2026 (2026) pp. 541–552.arxiv.org/abs/2510.04929
  31. [31]A. Prakash, S. H. Sureshbabu, D. Herman, and S. Chakrabarti, Quantum algorithms for orthogonal polynomial transforms, arXiv:2610.03581 (2026).arxiv.org/abs/2610.03581
  32. [32]C. Guan and A. Katiyar, Quantum Kravchuk transform using su(2) fast-forwarding, arXiv:2600.08443 (2026).arxiv.org/abs/2606.08443
  33. [33]D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma, Exponential improvement in precision for simulating sparse hamiltonians, in Proceedings of STOC 2014 (2014) pp. 283–292.
  34. [34]D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma, Simulating hamiltonian dynamics with a truncated taylor series, Phys. Rev. Lett. 114, 090502 (2015).DOI
  35. [35]L. N. Trefethen, Approximation Theory and Approximation Practice (SIAM, Philadelphia, 2013).
  36. [36]J. Haah, Product decomposition of periodic functions in quantum signal processing, Quantum 3, 190 (2019).DOI
  37. [37]Y. Dong, X. Meng, K. B. Whaley, and L. Lin, Efficient phase-factor evaluation in quantum signal processing, Phys. Rev. A 103, 042419 (2021).DOI
  38. [38]M. Möttönen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa, Quantum circuits for general multiqubit gates, Phys. Rev. Lett. 93, 130502 (2004).DOI
  39. [39]NIST Digital Library of Mathematical Functions, https://dlmf.nist.gov/ (2026), Release 1.2.8 of 2026-09-15, F. W. J. Olver, A. B. Olde Daalhuis, D. W. Lozier, B. I. Schneider, R. F. Boisvert, C. W. Clark, B. R. Miller, B. V. Saunders, H. S. Cohl, and M. A. McClain, eds.
  40. [40]J. M. Martyn, Z. M. Rossi, A. K. Tan, and I. L. Chuang, Grand unification of quantum algorithms, PRX Quantum 2, 040203 (2021).DOI
  41. [41]M. M. Crum, Associated Sturm–Liouville systems, Q. J. Math. 6, 121 (1955).
  42. [42]Y. Grandati, A short proof of the Gaillard–Matveev theorem based on shape invariance arguments, Phys. Lett. A 378, 1755 (2014).
  43. [43]E. Hahn, Asymptotik bei Jacobi-Polynomen und Jacobi-Funktionen, Math. Z. 171, 201 (1980).DOI
  44. [44]J. Bremer and H. Yang, Fast algorithms for Jacobi expansions via nonscillatory phase functions, IMA J. Numer. Anal. 40, 2019 (2020).
  45. [45]J. C. W. Rayner and G. C. Livingston, Jr., Orthogonal contrasts for both balanced and unbalanced designs and both ordered and unordered treatments, Statistica Neerlandica 78, 68 (2024).DOI
  46. [46]N. J. Ross and P. Selinger, Optimal ancilla-free Clifford+T approximation of z-rotations, Quantum Inf. Comput. 16, 901 (2016).arxiv.org/abs/1403.2975
  47. [47]Y. Tong, D. An, N. Wiebe, and L. Lin, Fast inversion, pre-conditioned quantum linear system solvers, fast Green’s-function computation, and fast evaluation of matrix functions, Phys. Rev. A 104, 032422 (2021).
  48. [48]G. H. Golub and J. H. Welsch, Calculation of Gauss quadrature rules, Math. Comp. 23, 221 (1969).DOI
  49. [49]W. Markoff, Über Polynome, die in einem gegebenen Intervalle möglichst wenig von Null abweichen, Math. Ann. 77, 213 (1916).DOI
  50. [50]G. Brassard, P. Høyer, M. Mosca, and A. Tapp, Quantum amplitude amplification and estimation, in Quantum Computation and Information, Contemporary Mathematics, Vol. 305 (American Mathematical Society, 2002) pp. 53–74.DOI
  51. [51]A. Townsend, M. Webb, and S. Olver, Fast polynomial transforms based on Toeplitz and Hankel matrices, Math. Comp. 87, 1913 (2018).arxiv.org/abs/1604.07486
  52. [52]N. Linden, A. Montanaro, and C. Shao, Quantum vs. classical algorithms for solving the heat equation, Commun. Math. Phys. 395, 601 (2022).arxiv.org/abs/2004.06516
  53. [53]M. Bagherimehrab, K. Nakaji, N. Wiebe, G. K. Brennen, B. C. Sanders, and A. Aspuru-Guzik, Fast quantum algorithm for differential equations, Phys. Rev. Res. 8, 101103/2mlq-dbfg (2026), to be published, arXiv:2306.11802.arxiv.org/abs/2306.11802
  54. [54]D. J. Fernández C., Supersymmetric quantum mechanics, AIP Conf. Proc. 1287, 3 (2010).DOI
  55. [55]G. Szegő, Orthogonal Polynomials, 4th ed., American Mathematical Society Colloquium Publications, Vol. 23 (American Mathematical Society, Providence, RI, 1975).
  56. [56]T. Khattar and C. Gidney, Rise of conditionally clean ancillae for efficient quantum circuit constructions, Quantum 9, 1752 (2025).DOI
  57. [57]O. O’Brien and C. Sünd er hauf, Quantum state preparation via piecewise QSVT, Quantum 9, 1786 (2025).DOI
  58. [58]F. Bréhard, N. Brisebarre, and M. Joldeş, Validated and numerically efficient Chebyshev spectral methods for linear ordinary differential equations, ACM Trans. Math. Softw. 44, 1 (2018).DOI
  59. [59]J. J. Duistermaat and F. A. Grünbaum, Differential equations in the spectral parameter, Commun. Math. Phys. 103, 177 (1986).DOI
  60. [60]S. Odake and R. Sasaki, Exactly solvable quantum mechanics and infinite families of multi-indexed orthogonal polynomials, Phys. Lett. B 702, 164 (2011).DOI
  61. [61]Y. Grandati and C. Quesne, m-step rational extensions of the trigonometric Darboux–Pöschl–Teller potential based on para-Jacobi polynomials, J. Math. Phys. 66, 102101 (2025).

Paper details

vlnc:W_ks6fxgqa
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY-SA 4.0
Usage

views · 1

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents