Density theorems with applications in quantum signal processing

DOI10.1016/J.CAM.2023.115243MaRDI QIDQ6178622zbMATH OpenOpenAlexWikidataFDO

Authors Rahul Sarkar, Theodore J. Yoder

Publication date 4 September 2023

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2111.07182

zbMATH Keywords

constrained polynomial approximationquantum signal processingstep function approximationWeierstrass approximation theorem

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Approximation with constraints (41A29) Algorithms for approximation of functions (65D15)

Abstract: We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families are defined by bound constraints not just in $[0,1]$, but also with additional bound constraints outside $[0,1]$. One might wonder then if these additional constraints inhibit their approximation properties within $[0,1]$. The main result of this paper is that this is not the case -- the additional constraints do not hinder the ability of these polynomial families to approximate arbitrarily well any continuous function $f:[0,1]ightarrow[0,1]$ in the supremum norm, provided $f$ also matches any polynomial in the family at $0$ and $1$. We additionally study the specific problem of approximating the step function on $[0,1]$ (with the step from $0$ to $1$ occurring at $x=frac12$) using one of these families, and propose two subfamilies of monotone and non-monotone approximations. For the non-monotone case, under some additional assumptions, we provide an iterative heuristic algorithm that finds the optimal polynomial approximation.

Recommendations

• Uniform approximation by (quantum) polynomials
• Polynomial approximation on disjoint segments and amplification of approximation
• Bounds-constrained polynomial approximation using the Bernstein basis
• scientific article; zbMATH DE number 2166297
• On the approximation by polynomials in \(C^ q_{[0,1]}\)

Cites work

• A Generalization of Hermite's Interpolation Formula
• A projection algorithm on the set of polynomials with two bounds
• Algorithms for positive polynomial approximation
• Approximation of functions by polynomials with various constraints
• Density of convex intersections and applications
• Exponentially Stable Nonlinear Systems Have Polynomial Lyapunov Functions on Bounded Regions
• scientific article; zbMATH DE number 3687942 (Why is no real title available?)
• scientific article; zbMATH DE number 3707042 (Why is no real title available?)
• scientific article; zbMATH DE number 1292382 (Why is no real title available?)
• scientific article; zbMATH DE number 274553 (Why is no real title available?)
• scientific article; zbMATH DE number 3234590 (Why is no real title available?)
• scientific article; zbMATH DE number 2226270 (Why is no real title available?)
• scientific article; zbMATH DE number 3105335 (Why is no real title available?)
• On the density of classes of closed convex sets with pointwise constraints in Sobolev spaces
• Optimized explicit finite-difference schemes for spatial derivatives using maximum norm
• Piecewise monotone polynomial interpolation
• Polynomials with bounds and numerical approximation
• Positive polynomials and sums of squares
• Positivity of cubic polynomials on intervals and positive spline interpolation
• Self-Adjoint Operators and Cones
• Sur un polynôme d'interpolation

Cited in

(1)

• Polynomial approximation on disjoint segments and amplification of approximation

This page was built for publication: Density theorems with applications in quantum signal processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178622)