English
Related papers

Related papers: Robust wave function optimization procedures in qu…

200 papers

Hybrid quantum/classical variational algorithms can be implemented on noisy intermediate-scale quantum computers and can be used to find solutions for combinatorial optimization problems. Approaches discussed in the literature minimize the…

We consider how different choices of kinetic energy in Hamiltonian Monte Carlo affect algorithm performance. To this end, we introduce two quantities which can be easily evaluated, the composite gradient and the implicit noise. Results are…

Computation · Statistics 2018-11-19 Samuel Livingstone , Michael F. Faulkner , Gareth O. Roberts

Quantum Monte Carlo and quantum simulation are both important tools for understanding quantum many-body systems. As a classical algorithm, quantum Monte Carlo suffers from the sign problem, preventing its application to most fermion systems…

Quantum Physics · Physics 2022-01-06 Yongdan Yang , Bing-Nan Lu , Ying Li

We study the feature-scaled version of the Monte Carlo algorithm with linear function approximation. This algorithm converges to a scale-invariant solution, which is not unduly affected by states having feature vectors with large norms. The…

Machine Learning · Computer Science 2022-05-31 Rahul Madhavan , Hemanta Makwana

We develop a Monte-Carlo based numerical method for solving discrete-time stochastic optimal control problems with inventory. These are optimal control problems in which the control affects only a deterministically evolving inventory…

Optimization and Control · Mathematics 2018-02-05 Alessandro Balata , Jan Palczewski

Real-world distributed systems and networks are often unreliable and subject to random failures of its components. Such a stochastic behavior affects adversely the complexity of optimization tasks performed routinely upon such systems, in…

Artificial Intelligence · Computer Science 2012-12-12 Milos Hauskrecht , Tomas Singliar

Present quantum Monte Carlo codes use statistical techniques adapted to find the amplitude of a quantum system or the associated eigenvalues. Thus, they do not use a true physical random source. It is demonstrated that, in fact, quantum…

Quantum Physics · Physics 2007-05-23 J. M. A. Figueiredo

One of the challenging scientific computing problems is topology optimization, where searching through the combinatorially complex configurations and solving the constraints of partial differential equations need to be done simultaneously.…

Quantum Physics · Physics 2025-03-05 Jungin E. Kim , Yan Wang

We study evolution of a quantum particle in a harmonic potential whose position and momentum are repeatedly monitored. A back-action of measuring devices is accounted for. Our model utilizes a generalized measurement corresponding to the…

Quantum Physics · Physics 2023-06-16 Filip Gampel , Mariusz Gajda

Diffusion Monte Carlo (DMC) simulations for fermions are becoming the standard to provide high quality reference data in systems that are too large to be investigated via quantum chemical approaches. DMC with the fixed-node approximation…

Chemical Physics · Physics 2016-07-06 Andrea Zen , Sandro Sorella , Michael J. Gillan , Angelos Michaelides , Dario Alfè

A path integral Monte Carlo method based on the worm algorithm has been developed to compute the chemical potential of interacting bosonic quantum fluids. By applying it to finite-sized systems of helium-4 atoms, we have confirmed that the…

Statistical Mechanics · Physics 2014-06-24 C. M. Herdman , A. Rommal , A. Del Maestro

In this work, we consider the problem of estimating the probability distribution, the quantile or the conditional expectation above the quantile, the so called conditional-value-at-risk, of output quantities of complex random differential…

Computation · Statistics 2023-05-23 Quentin Ayoul-Guilmard , Sundar Ganesh , Sebastian Krumscheid , Fabio Nobile

In this paper, I investigate more closely the recently proposed Free Energy Monte Carlo algorithm that is devised in particular for calculations where conventional Monte Carlo simulations struggle with ergodicity problems. The simplest…

Condensed Matter · Physics 2007-05-23 M. J. Thill

A quantum Monte Carlo method combining update of the loop algorithm with the global flip of the world line is proposed as an efficient method to study the magnetization process in an external field, which has been difficult because of…

Statistical Mechanics · Physics 2009-10-31 Hiroaki Onishi , Masamichi Nishino , Naoki Kawashima , Seiji Miyashita

We describe an embarrassingly parallel, anytime Monte Carlo method for likelihood-free models. The algorithm starts with the view that the stochasticity of the pseudo-samples generated by the simulator can be controlled externally by a…

Machine Learning · Computer Science 2015-12-03 Edward Meeds , Max Welling

Elastic systems that are spatially heterogeneous in their mechanical response pose special challenges for molecular simulations. Standard methods for sampling thermal fluctuations of a system's size and shape proceed through a series of…

Materials Science · Physics 2015-05-13 Sander Pronk , Phillip L. Geissler

An intrinsic measure of the quality of a variational wave function is given by its overlap with the ground state of the system. We derive a general formula to compute this overlap when quantum dynamics in imaginary time is accessible. The…

Statistical Mechanics · Physics 2007-07-26 Christophe Mora , Xavier Waintal

We introduce an optimisation method for variational quantum algorithms and experimentally demonstrate a 100-fold improvement in efficiency compared to naive implementations. The effectiveness of our approach is shown by obtaining…

The conventional tensor-network states employ real-space product states as reference wave functions. Here, we propose a many-variable variational Monte Carlo (mVMC) method combined with tensor networks by taking advantages of both to study…

Strongly Correlated Electrons · Physics 2017-08-09 Hui-Hai Zhao , Kota Ido , Satoshi Morita , Masatoshi Imada

We present two Monte Carlo sampling algorithms for probabilistic inference that guarantee polynomial-time convergence for a larger class of network than current sampling algorithms provide. These new methods are variants of the known…

Artificial Intelligence · Computer Science 2013-02-18 Malcolm Pradhan , Paul Dagum