Metraipolis › archive › dc_bbf82400bedf

Efficient quantum ultraspherical transform and a well-conditioned quantum spectral method — arXiv:2611.06651

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.06651
License (as archived)
CC0-1.0
Archived
2026-11-05T18:32:58.902Z
SHA-256 of the archived text
0584ee8b605c8a623ee39ea88bd365d5fc63219399f2ffe024adf4c9ad810902
Stable URL of this page
https://metraipolis.com/documento/dc_bbf82400bedf

How to cite

Efficient quantum ultraspherical transform and a well-conditioned quantum spectral method — arXiv:2611.06651 — arXiv (en), https://arxiv.org/abs/2611.06651 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bbf82400bedf (Metraipolis archive dc_bbf82400bedf, sha256 0584ee8b605c8a623ee39ea88bd365d5fc63219399f2ffe024adf4c9ad810902)
BibTeX
@misc{dcbbf82400bedf,
  title = {Efficient quantum ultraspherical transform and a well-conditioned quantum spectral method — arXiv:2611.06651},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.06651},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bbf82400bedf; sha256 0584ee8b605c8a623ee39ea88bd365d5fc63219399f2ffe024adf4c9ad810902},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06651. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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=0$ and $1$, this transform reduces to the discrete cosine and sine transforms with known efficient circuits. Our contribution covers every fixed integer $m\geq2$: for dimensions $N$ with $N+m=2^n$, where $n$ is the number of qubits, the QUT achieves error at most $\varepsilon$ using a gate count polynomial in $n$ and $\log(1/\varepsilon)$. The construction builds on the quantum Fourier transform, augmented by approximations whose accuracy guarantees are independent of $N$. 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.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2611.06651 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-05T18:22:49.023Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).