Non-linear Quantum Monte Carlo
원문 초록
The mean of a random variable can be understood as a $\textit{linear}$ functional on the space of probability distributions. Quantum computing is known to provide a quadratic speedup over classical Monte Carlo methods for mean estimation. In this paper, we investigate whether a similar quadratic speedup is achievable for estimating $\textit{non-linear}$ functionals of probability distributions. We propose a quantum-inside-quantum Monte Carlo algorithm that achieves such a speedup for a broad class of non-linear estimation problems, including nested conditional expectations and stochastic optimization. Our algorithm improves upon the direct application of the quantum multilevel Monte Carlo algorithm introduced by An et al.. The existing lower bound indicates that our algorithm is optimal up polylogarithmic factors. A key innovation of our approach is a new sequence of multilevel Monte Carlo approximations specifically designed for quantum computing, which is central to the algorithm's improved performance.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Adaptive Semantic Token Communication for Transformer-based Edge Inference
Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
JaxSGMC: Modular stochastic gradient MCMC in JAX
SIM-Shapley: A Stable and Computationally Efficient Approach to Shapley Value Approximation
Adversarial Subspace Generation for Outlier Detection in High-Dimensional Data
CatCMA with Margin: Stochastic Optimization for Continuous, Integer, and Categorical Variables
토론
이 논문과 연결된 포럼 글이 아직 없습니다.