scientific article; zbMATH DE number 1790425

zbMATH Open1002.65008arXivquant-ph/0105114MaRDI QIDQ4549490FDOQ4549490

Authors: Stefan Heinrich, Erich Novak 

Publication date: 28 August 2002

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

Title of this publication is not available (Why is that?)

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

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)

Cited In (14)

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

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)