Related papers: Constructing QMC finite element methods for ellipt…
We propose a component-based (CB) parametric model order reduction (pMOR) formulation for parameterized {nonlinear} elliptic partial differential equations (PDEs). CB-pMOR is designed to deal with large-scale problems for which full-order…
This paper studies the numerical approximation of parametric time-dependent partial differential equations (PDEs) by proper orthogonal decomposition reduced order models (POD-ROMs). Although many papers in the literature consider reduced…
The $\mathcal{L}_2$ discrepancy is one of several well-known quantitative measures for the equidistribution properties of point sets in the high-dimensional unit cube. The concept of weights was introduced by Sloan and Wo\'{z}niakowski to…
Quantum weight reduction is the task of transforming a quantum code with large check weight into one with small check weight. Low-weight codes are essential for implementing quantum error correction on physical hardware, since high-weight…
We consider the problem of estimating an expectation $ \mathbb{E}\left[ h(W)\right]$ by quasi-Monte Carlo (QMC) methods, where $ h $ is an unbounded smooth function on $ \mathbb{R}^d $ and $ W$ is a standard normal distributed random…
The cyclic block coordinate descent-type (CBCD-type) methods, which performs iterative updates for a few coordinates (a block) simultaneously throughout the procedure, have shown remarkable computational performance for solving strongly…
One bottleneck of quantum Monte Carlo (QMC) simulation of strongly correlated electron systems lies at the scaling relation of computational complexity with respect to the system sizes. For generic lattice models of interacting fermions,…
Quantum error correction (QEC) is critical for practical realization of fault-tolerant quantum computing, and recently proposed families of quantum low-density parity-check (QLDPC) code are prime candidates for advanced QEC hardware…
We investigate the application of randomized quasi-Monte Carlo (RQMC) methods in random feature approximations for kernel-based learning. Compared to the classical Monte Carlo (MC) approach \citep{rahimi2007random}, RQMC improves the…
We analyze combined Quasi-Monte Carlo quadrature and Finite Element approximations in Bayesian estimation of solutions to countably-parametric operator equations with holomorphic dependence on the parameters as considered in [Cl.~Schillings…
Minimum Weight Cycle (MWC) is the problem of finding a simple cycle of minimum weight in a graph $G=(V,E)$. This is a fundamental graph problem with classical sequential algorithms that run in $\tilde{O}(n^3)$ and $\tilde{O}(mn)$ time where…
We propose cube thinning, a novel method for compressing the output of a MCMC (Markov chain Monte Carlo) algorithm when control variates are available. It amounts to resampling the initial MCMC sample (according to weights derived from…
This paper is on Bayesian inference for parametric statistical models that are defined by a stochastic simulator which specifies how data is generated. Exact sampling is then possible but evaluating the likelihood function is typically…
We study multivariate numerical integration of smooth functions in weighted Sobolev spaces with dominating mixed smoothness $\alpha\geq 2$ defined over the $s$-dimensional unit cube. We propose a new quasi-Monte Carlo (QMC)-based quadrature…
In this paper we present a rigorous cost and error analysis of a multilevel estimator based on randomly shifted Quasi-Monte Carlo (QMC) lattice rules for lognormal diffusion problems. These problems are motivated by uncertainty…
Deep learning algorithms have been widely used to solve linear Kolmogorov partial differential equations~(PDEs) in high dimensions, where the loss function is defined as a mathematical expectation. We propose to use the randomized…
For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to making short cycles. Also, the existing high-rate quasi-cyclic…
We introduce the multivariate decomposition finite element method (MDFEM) for solving elliptic PDEs with uniform random diffusion coefficients. We show that the MDFEM can be used to reduce the computational complexity of estimating the…
In this paper, we study the Schr\"odinger equation with a Gaussian random potential (SE-GP) and develop an efficient numerical method to approximate the expectation of physical observables. The unboundedness of Gaussian random variables…
We present a hybrid method for time-dependent particle transport that combines Monte Carlo (MC) estimation with a deterministic discrete ordinates (\(S_N\)) solve, augmented by quasi-Monte Carlo (QMC) sampling. For spatial discretizations,…