Uniform approximation by (quantum) polynomials

MaRDI QIDQ3171708zbMATH OpenFDO

Authors Andrew Drucker, Ronald de Wolf

Publication date 5 October 2011

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

zbMATH Keywords

approximation theoryquantum algorithmJackson's theorem

Mathematics Subject Classification ID

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)

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

Cited in

(8)

• Algorithmic Polynomials
• Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
• Density theorems with applications in quantum signal processing
• Polynomial approximation of quantum Lipschitz functions
• Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
• Query complexity in expectation
• Uniform treatment of Darboux's method and the Heisenberg polynomials
• 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)