scientific article; zbMATH DE number 1790425

MaRDI QIDQ4549490zbMATHFDO

Authors Stefan Heinrich, Erich Novak

Publication date 28 August 2002

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

zbMATH Keywords

Monte Carlo methodsintegrationoptimal algorithmsquantum algorithmsquantum computationsummation of finite sequences

Mathematics Subject Classification ID

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

Recommendations

• Quantum complexity of integration
• Quantum summation with an application to integration.
• From Monte Carlo to quantum computation
• Lower bound for quantum integration error on anisotropic Sobolev classes
• scientific article; zbMATH DE number 2186559

Cited in

(15)

• Quantum algorithms for numerical differentiation of expected values with respect to parameters
• Quantum integration in Sobolev classes
• Some results on the complexity of numerical integration
• Optimal Monte Carlo and quantum algorithms for parametric integration.
• Almost optimal solution of initial-value problems by randomized and quantum algorithms
• From Monte Carlo to quantum computation
• Randomized and quantum algorithms yield a speed-up for initial-value problems
• Adiabatic quantum counting by geometric phase estimation
• scientific article; zbMATH DE number 1979676 (Why is no real title available?)
• Super-polynomial accuracy of one dimensional randomized nets using the median of means
• Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms
• On a problem in quantum summation.
• Quantum summation with an application to integration.
• Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
• Improved bounds on the randomized and quantum complexity of initial-value problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4549490)