Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

How Many Random Bits Do We Need for Monte Carlo Integration?

Stefan Heinrich, Erich Novak, Harald Pfeiffer

Published Jan 1, 2004• 17 citations
Publisher
DOI
10.1007/978-3-642-18743-8_2

Related papers

Lower Bounds for the Number of Random Bits in Monte Carlo Algorithms

Stefan Heinrich

arXiv:2012.12774•Springer proceedings in mathematics & statistics•Jan 1, 2022•2 citations

Quantum Random Bit Generator Service for Monte Carlo and Other Stochastic Simulations

Radomir Stevanović, Goran Topić, Karolj Skala +2 more

Lecture notes in computer science•Jan 1, 2008•17 citations

Monte Carlo integration with small random bits

Sheng Zhang, Peixin Ye, Jingfan Long

Motivated by the recent progress on quantum integration, we study restricted Monte Carlo integration for anisotropic Hölder-Nikolskii classes. The results show that with c · log2n random bits we have the same optimal order for the n-th minimal Monte Carlo integration error as with arbitrary random numbers.

International Conference on Natural Computation (ICNC)•Aug 1, 2010•0 citations

Restricted Monte Carlo Integration on Some Multivariate Functions

Peixin Ye, Qing He

We study restricted Monte Carlo integration for anisotropic Holder-Nikolskii classes. The results show that with c ldr log2n random bits we have the same optimal order for the n-th minimal Monte Carlo integration error as with arbitrary random numbers.

•Jan 1, 2008•0 citations

When Does Monte Carlo Depend Polynomially on the Number of Variables?

Ian H. Sloan, Henryk Woźniakowski

Springer eBooks•Jan 1, 2004•14 citations

Optimal error bound of restricted Monte Carlo integration on anisotropic Sobolev classes*

Wenhua Gao, Peixin Ye, Hui Wang

Abstract We study the restricted Monte Carlo integration error for anisotropic Sobolev classes. Results prove that with O(log2 n)random bits we have the optimal order for the n-th minimal Monte Carlo integration error with arbitrary random numbers. Supported by National Natural Science Foundation of China (Grant Nos. 10261007 and 10501026), Tianyuan Fund for Mathematics (Grant No. 10426020) and the fund for Nankai University

Progress in Natural Science Materials International•Jun 1, 2006•8 citations