scientific article; zbMATH DE number 1790425

zbMath1002.65008arXivquant-ph/0105114MaRDI QIDQ4549490

Erich Novak, Stefan Heinrich

Publication date: 28 August 2002

Full work available at URL: https://arxiv.org/abs/quant-ph/0105114

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

quantum algorithmsMonte Carlo methodsintegrationquantum computationoptimal algorithmssummation of finite sequences

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Numerical quadrature and cubature formulas (65D32) Numerical summation of series (65B10)

Related Items (12)

From Monte Carlo to quantum computation ⋮ Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces ⋮ Super-polynomial accuracy of one dimensional randomized nets using the median of means ⋮ Almost optimal solution of initial-value problems by randomized and quantum algorithms ⋮ On a problem in quantum summation. ⋮ Quantum integration in Sobolev classes ⋮ Some Results on the Complexity of Numerical Integration ⋮ Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms ⋮ Randomized and quantum algorithms yield a speed-up for initial-value problems ⋮ Adiabatic quantum counting by geometric phase estimation ⋮ Improved bounds on the randomized and quantum complexity of initial-value problems ⋮ Quantum summation with an application to integration.

This page was built for publication: