Uniform approximation by (quantum) polynomials
From MaRDI portal
Publication:3171708
zbMATH Open1237.81048arXiv1008.1599MaRDI QIDQ3171708FDOQ3171708
Ronald de Wolf, Andrew Drucker
Publication date: 5 October 2011
Full work available at URL: https://arxiv.org/abs/1008.1599
Recommendations
- Polynomials, quantum query complexity, and Grothendieck's inequality
- Quantum approximation. II: Sobolev embeddings
- 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))\)
- Quantum lower bounds by polynomials
- The power of various real-valued quantum queries
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Approximation by polynomials (41A10) Holomorphic, polynomial and rational approximation, and interpolation in several complex variables; Runge pairs (32E30)
Cited In (7)
- Algorithmic Polynomials
- Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
- Polynomial approximation of quantum Lipschitz functions
- Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
- Uniform treatment of Darboux's method and the Heisenberg polynomials
- Query Complexity in Expectation
- A quantum algorithm to approximate the linear structures of Boolean functions
This page was built for publication: Uniform approximation by (quantum) polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171708)
