Metraipolis › archive › dc_577de2e7a8e5

Constrained minimax approximation for quantum signal processing — arXiv:2608.30937

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.30937
License (as archived)
CC0-1.0
Archived
2026-10-17T09:28:43.110Z
SHA-256 of the archived text
7a81b5b9e09dcb71ff75c8509c407c1ae2cf0308b7d58600ae1f27674cbf478f
Stable URL of this page
https://metraipolis.com/documento/dc_577de2e7a8e5

How to cite

Constrained minimax approximation for quantum signal processing — arXiv:2608.30937 — arXiv (en), https://arxiv.org/abs/2608.30937 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_577de2e7a8e5 (Metraipolis archive dc_577de2e7a8e5, sha256 7a81b5b9e09dcb71ff75c8509c407c1ae2cf0308b7d58600ae1f27674cbf478f)
BibTeX
@misc{dc577de2e7a8e5,
  title = {Constrained minimax approximation for quantum signal processing — arXiv:2608.30937},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.30937},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_577de2e7a8e5; sha256 7a81b5b9e09dcb71ff75c8509c407c1ae2cf0308b7d58600ae1f27674cbf478f},
  year = {2026}
}

Archived text

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

Quantum signal processing (QSP) provides a simple and efficient framework for implementing polynomial transformations using quantum circuits. Its classical design stage leads to a constrained minimax approximation problem: find a polynomial of prescribed parity that approximates a target function uniformly on a fitting set while remaining bounded in magnitude by one on the domain $[0,1]$, which can be viewed as a semi-infinite constraint. Discretization converts the problem into a linear program, but feasibility at a set of finitely many sampled points does not ensure feasibility on the whole domain, especially when an optimal approximant reaches the boundary of the feasible set. We investigate two approaches to address this difficulty. A Remez exchange method combined with active-set constraint enforcement is efficient on many tested instances, but its stability depends on the target and problem geometry. We then introduce nonlinear Fourier retraction, which uses QSP completion and phase synthesis to turn a nearly feasible polynomial into phase factors for a feasible QSP polynomial without increasing the degree. Across representative problems, retraction largely preserves approximation accuracy and remains effective on instances where the Remez heuristic is unstable. The resulting workflow connects classical minimax approximation and semi-infinite optimization with nonlinear Fourier analysis, and is implemented in the qsppack software package.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in math.NA).
Categorie arXiv: Quantum Physics (quant-ph) ; Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2608.30937 — 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-10-17T08:59:54.383Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).