Quantum complexity of the approximation for the classes B(W^r_p([0,1]^d)) and B(H^r_p([0,1]^d))
From MaRDI portal
Publication:716524
Recommendations
- The quantum complexity of computing Schatten p-norms
- Quantum complexity of Sobolev imbeddings
- Exact quantum query complexity of \(\mathrm{EXACT}_{k,l}^n\)
- On interpolating between quantum and classical complexity classes
- Randomized and quantum complexity of nonlinear two-point BVPs
- scientific article; zbMATH DE number 2186559
- Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument
- The quantum query complexity of \(\mathrm{AC}^0\)
- Optimal query error of quantum approximation on some Sobolev classes
- Hardness of approximation for quantum problems
Cited in
(14)- Quantum integration in Sobolev classes
- Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
- Quantum approximation. II: Sobolev embeddings
- Quantum complexity of parametric integration
- Tractability of approximation for weighted Korobov spaces on classical and quantum computers
- Quantum complexity of Sobolev imbeddings
- Qubit complexity of continuous problems
- On the complexity of the multivariate Sturm-Liouville eigenvalue problem
- On the complexity of searching for a maximum of a function on a quantum computer
- Optimal query error of quantum approximation on some Sobolev classes
- scientific article; zbMATH DE number 2186559 (Why is no real title available?)
- Uniform approximation by (quantum) polynomials
- Quantum approximation on anisotropic Sobolev and Hölder-Nikolskii classes
- Lower bound for quantum integration error on anisotropic Sobolev classes
This page was built for publication: Quantum complexity of the approximation for the classes \({\mathcal B}(W^r_p([0,1]^d))\) and \({\mathcal B}(H^r_p([0,1]^d))\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q716524)
