Related papers: Preconditioning and perturbative estimators in ful…
Monte Carlo (MC) sampling algorithms are an extremely widely-used technique to estimate expectations of functions f(x), especially in high dimensions. Control variates are a very powerful technique to reduce the error of such estimates, but…
In this work we propose a novel approach to solve the Schr\"{o}dinger equation which combines projection onto the ground state with a path-filtering truncation scheme. The resulting projector configuration interaction (PCI) approach…
The expectation-maximization (EM) algorithm is a powerful computational technique for finding the maximum likelihood estimates for parametric models when the data are not fully observed. The EM is best suited for situations where the…
A generalized method of moments (GMM) estimator is unreliable for a large number of moment conditions, that is, it is comparable, or larger than the sample size. While classical GMM literature proposes several provisions to this problem,…
Large, sparse linear systems are pervasive in modern science and engineering, and Krylov subspace solvers are an established means of solving them. Yet convergence can be slow for ill-conditioned matrices, so practical deployments usually…
Machine learning models have become indispensable tools in applications across the physical sciences. Their training is often time-consuming, vastly exceeding the inference timescales. Several protocols have been developed to perturb the…
Pre-conditioning is a well-known concept that can significantly improve the convergence of optimization algorithms. For noise-free problems, where good pre-conditioners are not known a priori, iterative linear algebra methods offer one way…
A critical engineering challenge in quantum technology is the accurate control of quantum dynamics. Model-based methods for optimal control have been shown to be highly effective when theory and experiment closely match. Consequently,…
In quantum Monte Carlo (QMC) methods, energy estimators are calculated as the statistical average of the Markov chain sampling of energy estimator along with an associated statistical error. This error estimation is not straightforward and…
An approximation method which combines the perturbation theory with the variational calculation is constructed for quantum mechanical problems. Using the anharmonic oscillator and the He atom as examples, we show that the present method…
In the absence of a fermion sign problem, auxiliary field (or determinantal) quantum Monte Carlo (DQMC) approaches have long been the numerical method of choice for unbiased, large-scale simulations of interacting many-fermion systems. More…
Monte Carlo methods are widely used for approximating complicated, multidimensional integrals for Bayesian inference. Population Monte Carlo (PMC) is an important class of Monte Carlo methods, which utilizes a population of proposals to…
We address the slow convergence and poor stability of quasi-newton sequential quadratic programming (SQP) methods that is observed when solving experimental design problems, in particular when they are large. Our findings suggest that this…
We explore the use in quantum Monte Carlo (QMC) of trial wave functions consisting of a Jastrow factor multiplied by a truncated configuration-interaction (CI) expansion in Slater determinants obtained from a CI perturbatively selected…
Configuring the hybrid precoders and combiners in a millimeter wave (mmWave) multiuser (MU) multiple-input multiple-output (MIMO) system is challenging in frequency selective channels. In this paper, we develop a system that uses…
The variational principle serves as a fundamental framework for describing equilibrium states of physical systems via the minimization or extremization of an energy-like functional. While quantum algorithms have demonstrated promising…
We propose using the wave function generated by the quantum selected configuration interaction (QSCI) method as the trial wave function in phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC). In the QSCI framework, electronic…
Programmable quantum simulators based on Rydberg atom arrays are a fast-emerging quantum platform, bringing together long coherence times, high-fidelity operations, and large numbers of interacting qubits deterministically arranged in…
We consider the problem of improving the efficiency of randomized Fourier feature maps to accelerate training and testing speed of kernel methods on large datasets. These approximate feature maps arise as Monte Carlo approximations to…
Estimating Monte Carlo error is critical to valid simulation results in Markov chain Monte Carlo (MCMC) and initial sequence estimators were one of the first methods introduced for this. Over the last few years, focus has been on…