Related papers: A quantum computing approach to fixed-node Monte C…

In this Ph.D. thesis quantum Monte Carlo methods are applied to investigate the properties of a number of ultracold quantum systems. In Chapter 1 we discuss the analytical approaches and approximations used in the subsequent Chapters; also…

This article provides a survey of recent research efforts on the application of quasi-Monte Carlo (QMC) methods to elliptic partial differential equations (PDEs) with random diffusion coefficients. It considers, and contrasts, the uniform…

We apply the Quasi Monte Carlo (QMC) and recursive numerical integration methods to evaluate the Euclidean, discretized time path-integral for the quantum mechanical anharmonic oscillator and a topological quantum mechanical rotor model.…

We describe a practical approach for accessing the logical failure rates of quantum error-correcting (QEC) circuits under low physical (component) failure rate regimes. Standard Monte Carlo is often the de facto approach for studying the…

Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential…

Variational Monte Carlo (VMC) methods are used to sample classically from distributions corresponding to quantum states which have an efficient classical description. VMC methods are based on performing a number of steps of a Markov chain…

We tutorially review the determinantal Quantum Monte Carlo method for fermionic systems, using the Hubbard model as a case study. Starting with the basic ingredients of Monte Carlo simulations for classical systems, we introduce aspects…

Deploying deep learning models in safety-critical applications remains a very challenging task, mandating the provision of assurances for the dependable operation of these models. Uncertainty quantification (UQ) methods estimate the model's…

The fast computation of large kernel sums is a challenging task, which arises as a subproblem in any kernel method. We approach the problem by slicing, which relies on random projections to one-dimensional subspaces and fast Fourier…

Classical shadow tomography is a sample-efficient technique for characterizing quantum systems and predicting many of their properties. Circuit cutting is a technique for dividing large quantum circuits into smaller fragments that can be…

Quasi-Monte Carlo (qMC) methods are a powerful alternative to classical Monte-Carlo (MC) integration. Under certain conditions, they can approximate the desired integral at a faster rate than the usual Central Limit Theorem, resulting in…

This paper introduces the first quantum computing framework for Stochastic Quantum Power Flow (SQPF) analysis in power systems. The proposed method leverages quantum states to encode power flow distributions, enabling the use of Quantum…

To evaluate the effectiveness of machine learning in systems with competing interactions, we developed a self-learning quantum Monte Carlo (SLQMC) method to simulate the phase transition in the classical Holstein-spin-fermion model. In…

Using quantum Monte Carlo (QMC) simulations we study the ground-state properties of the one-dimensional fermionic Hubbard model in traps with an underlying lattice. Since due to the confining potential the density is space dependent,…

A unitary coupled-cluster (UCC) form for the wavefunction in the variational quantum eigensolver has been suggested as a systematic way to go beyond the mean-field approximation and include electron correlation in solving quantum chemistry…

Sampling problems are widely regarded as the task for which quantum computers can most readily provide a quantum advantage. Leveraging this feature, the quantum-enhanced Markov chain Monte Carlo [Layden, D. et al., Nature 619, 282-287…

We study cluster perturbation theory [Phys. Rev. Lett. \textbf{84}, 522 (2000)] when auxiliary field quantum Monte Carlo method is used for solving the cluster hamiltonian. As a case study, we calculate the spectral functions of the Hubbard…

We develop Monte Carlo methods for sampling random states and corresponding bit strings in qubit systems. To this end, we derive exact probability density functions that yield the Porter-Thomas distribution in the limit of large systems. We…

We marry tensor network states (TNS) and projector quantum Monte Carlo (PMC) to overcome the high computational scaling of TNS and the sign problem of PMC. Using TNS as trial wavefunctions provides a route to systematically improve the sign…

We present a reduced-scaling auxiliary-field quantum Monte Carlo (AFQMC) framework designed for large molecular systems and ensembles, with or without coupling to optical cavities. Our approach leverages the natural block sparsity of…