Optimal summation and integration by deterministic, randomized, and quantum algorithms
From MaRDI portal
Recommendations
Cited in
(17)- On a problem in quantum summation.
- Quantum integration in Sobolev classes
- Quantum summation with an application to integration.
- From Monte Carlo to quantum computation
- Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
- Quantum algorithms for numerical differentiation of expected values with respect to parameters
- Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms
- Improved bounds on the randomized and quantum complexity of initial-value problems
- Some results on the complexity of numerical integration
- 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 Monte Carlo and quantum algorithms for parametric integration.
- Automatic optimal-rate convergence of randomized nets using median-of-means
- Quantum algorithm for the advection-diffusion equation and the Koopman-von Neumann approach to nonlinear dynamical systems
- Randomized and quantum algorithms yield a speed-up for initial-value problems
- Almost optimal solution of initial-value problems by randomized and quantum algorithms
- Adiabatic quantum counting by geometric phase estimation
This page was built for publication: Optimal summation and integration by deterministic, randomized, and quantum algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4549490)
