Related papers: Quantum Approximation II. Sobolev Embeddings
We study approximation of embeddings between finite dimensional L_p spaces in the quantum model of computation. For the quantum query complexity of this problem matching (up to logarithmic factors) upper and lower bounds are obtained. The…
We study high dimensional integration in the quantum model of computation. We develop quantum algorithms for integration of functions from Sobolev classes $W^r_p([0,1]^d)$ and analyze their convergence rates. We also prove lower bounds…
Polynomial approximation is studied in the Sobolev space $W_p^r(w_{\alpha,\beta})$ that consists of functions whose $r$-th derivatives are in weighted $L^p$ space with the Jacobi weight function $w_{\alpha,\beta}$. This requires…
Understanding the capacity of quantum circuits through the lens of approximation theory is essential for evaluating the complexity of quantum circuits required to solve various problems in scientific computation. We design quantum circuits…
In this paper, we investigate the approximation problem for functions in Gaussian Sobolev spaces $W^s_p(\mathbb{R}^d, \gamma)$ of smoothness $s > 0$, where the approximation error is measured in the Gaussian Lebesgue space…
Approximation by polynomials on a triangle is studied in the Sobolev space $W_2^r$ that consists of functions whose derivatives of up to $r$-th order have bounded $L^2$ norm. The first part aims at understanding the orthogonal structure in…
We study $L_q$-approximation and integration for functions from the Sobolev space $W^s_p(\Omega)$ and compare optimal randomized (Monte Carlo) algorithms with algorithms that can only use iid sample points, uniformly distributed on the…
The matrix $p \rightarrow q$ norm is a fundamental quantity appearing in a variety of areas of mathematics. This quantity is known to be efficiently computable in only a few special cases. The best known algorithms for approximately…
We show that independent and uniformly distributed sampling points are as good as optimal sampling points for the approximation of functions from the Sobolev space $W_p^s(\Omega)$ on bounded convex domains $\Omega\subset \mathbb{R}^d$ in…
This paper studies function approximation in Gaussian Sobolev spaces over the real line and measures the error in a Gaussian-weighted $L^p$-norm. We construct two linear approximation algorithms using $n$ function evaluations that achieve…
Calibration refers to the statistical estimation of unknown model parameters in computer experiments, such that computer experiments can match underlying physical systems. This work develops a new calibration method for imperfect computer…
We obtain sufficient conditions on kernels of quantum states under which Wigner functions, optical quantum tomograms and linking their formulas are correctly defined. Our approach is based upon the Sobolev embedding theorem. The transition…
We survey key techniques and results from approximation theory in the context of uniform approximations to real functions such as e^{-x}, 1/x, and x^k. We then present a selection of results demonstrating how such approximations can be used…
Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and…
This thesis studies three topics in quantum computation and information: The approximability of quantum problems, quantum proof systems, and non-classical correlations in quantum systems. In the first area, we demonstrate a polynomial-time…
In this paper, we study the approximation problem for functions in the Gaussian-weighted Sobolev space $W^\alpha_p(\mathbb{R}^d, \gamma)$ of mixed smoothness $\alpha \in \mathbb{N}$ with error measured in the Gaussian-weighted space…
The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\ell_{p}$ norm…
Suppose $X$ is an $\rm{RCD}(K,N)$ space with $K \in \mathbb{R}$ and $N \in (1,\infty)$. We obtain a characterisation of the Newtonian-Sobolev space $N^{1,2}(X)$ in terms of a quantity which measures to what extent a function is locally…
Quantum counting is the task of determining the dimension of the subspace of states that are accepted by a quantum verifier circuit. It is the quantum analog of counting the number of valid solutions to NP problems -- a problem well-studied…
A family of logarithmic Sobolev inequalities on finite dimensional quantum state spaces is introduced. The framework of non-commutative $\bL_p$-spaces is reviewed and the relationship between quantum logarithmic Sobolev inequalities and the…