Infinite quantum signal processing for arbitrary Szegő functions

Abstract We provide a complete solution to the problem of infinite quantum signal processing (QSP) for the class of Szegő functions, which are functions that satisfy a logarithmic integrability condition and include almost any function that allows for a QSP representation. We do so by introducing a new algorithm called the Riemann–Hilbert–Weiss algorithm, which can compute any individual phase factor independent of all other phase factors. Our algorithm is also the first provably stable numerical algorithm for computing phase factors of any arbitrary Szegő function. The proof of stability involves solving a Riemann–Hilbert factorization problem in nonlinear Fourier analysis using elements of spectral theory.

Authors

Institutions

Publication Details

Journal
Communications on Pure and Applied Mathematics
Published
2025-09-09
DOI
https://doi.org/10.1002/cpa.70007
Citations
3
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Infinite quantum signal processing for arbitrary Szegő functions

Gevorg Mnatsakanyan, Christoph Thiele, Michel Alexis, Jiasu Wang et al.
3 citations
Communications on Pure and Applied Mathematics
Quantum Computing Algorithms and Architecture
4.96
article

Infinite quantum signal processing for arbitrary Szegő functions

Gevorg Mnatsakanyan, Christoph Thiele, Michel Alexis, Jiasu Wang, Lin Lin
article en
3 citations

Abstract

Abstract We provide a complete solution to the problem of infinite quantum signal processing (QSP) for the class of Szegő functions, which are functions that satisfy a logarithmic integrability condition and include almost any function that allows for a QSP representation. We do so by introducing a new algorithm called the Riemann–Hilbert–Weiss algorithm, which can compute any individual phase factor independent of all other phase factors. Our algorithm is also the first provably stable numerical algorithm for computing phase factors of any arbitrary Szegő function. The proof of stability involves solving a Riemann–Hilbert factorization problem in nonlinear Fourier analysis using elements of spectral theory.

Communications on Pure and Applied MathematicsVol. 79(1)
University of Bonn (DE), University of California, Berkeley (US), National Academy of Sciences of Armenia (AM)
Openalex Percentile: Top 5%
Quantum Computing Algorithms and Architecture
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Infinite quantum signal processing for arbitrary Szegő functions — Gevorg Mnatsakanyan, Christoph Thiele, et al. · Communications on Pure and Applied Mathematics (2025) | TGRS Research Map | TGRS