On the quantum and randomized approximation of linear functionals on function spaces

DOI10.1007/s11128-010-0195-9zbMath1216.81050OpenAlexW1977460615MaRDI QIDQ544821

Bolesław Kacewicz

Publication date: 16 June 2011

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11128-010-0195-9

zbMATH Keywords

approximationquantum algorithmsupper and lower boundslinear functionalsrandomized algorithms

Mathematics Subject Classification ID

Quantum computation (81P68) Bounds on codes (94B65) Special properties of functions of several variables, Hölder conditions, etc. (26B35) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Almost optimal solution of initial-value problems by randomized and quantum algorithms
• Deterministic and stochastic error bounds in numerical analysis
• Quantum summation with an application to integration.
• The optimal error of Monte Carlo integration
• The quantum query complexity of approximating the median and related statistics
• The Monte Carlo Complexity of Fredholm Integral Equations
• Quantum complexity of integration

This page was built for publication: On the quantum and randomized approximation of linear functionals on function spaces