Related papers: Quasi-adiabatic quantum Monte Carlo algorithm for …
Convergence conditions for quantum annealing are derived for optimization problems represented by the Ising model of a general form. Quantum fluctuations are introduced as a transverse field and/or transverse ferromagnetic interactions, and…
The jump-walking Monte-Carlo algorithm is revisited and updated to study the equilibrium properties of systems exhibiting quasi-ergodicity. It is designed for a single processing thread as opposed to currently predominant algorithms for…
A new algorithm for analytic continuation of noisy quantum Monte Carlo (QMC) data from the Matsubara domain to real frequencies is proposed. Unlike the widely used maximum-entropy (MaxEnt) procedure, our method is linear with respect to…
We present a numerical quantum Monte Carlo (QMC) method for simulating the 3D phase transition on the recently proposed fuzzy sphere [Phys. Rev. X 13, 021009 (2023)]. By introducing an additional $SU(2)$ layer degree of freedom, we…
We apply a recently developed quasi-diabatic (QD) scheme to the symmetric quasi-classical (SQC) approach for accurate quantum dynamics propagation. By using the adiabatic states as the quasi-diabatic states during a short-time quantum…
We extend the Mixed Quantum-Classical Initial Value Representation (MQC-IVR), a semiclassical method for computing real-time correlation functions, to electronically nonadiabatic systems using the Meyer-Miller-Stock-Thoss (MMST) Hamiltonian…
Ab initio quantum Monte Carlo (QMC) is a stochastic approach for solving the many-body Schr\"odinger equation without resorting to one-body approximations. QMC algorithms are readily parallelizable via ensembles of $N_w$ walkers, making…
We import the tools of Morse theory to study quantum adiabatic evolution, the core mechanism in adiabatic quantum computations (AQC). AQC is computationally equivalent to the (pre-eminent paradigm) of the Gate model but less error-prone, so…
Importance Sampling (IS), an effective variance reduction strategy in Monte Carlo (MC) simulation, is frequently utilized for Bayesian inference and other statistical challenges. Quasi-Monte Carlo (QMC) replaces the random samples in MC…
Quantum systems are typically subject to various environmental noise sources. Treating these environmental disturbances with a system-bath approach beyond weak coupling one must refer to numerical methods as, for example, the numerically…
Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is…
Recently, Huggins et. al. [Nature, 603, 416-420 (2022)] devised a general projective Quantum Monte Carlo method suitable for implementation on quantum computers. This hybrid approach, however, relies on a subroutine -the computation of the…
We investigate the short time quantum critical dynamics in the imaginary time relaxation processes of finite size systems. Universal scaling behaviors exist in the imaginary time evolution and in particular, the system undergoes a critical…
Computing the ground-state properties of quantum many-body systems is a promising application of near-term quantum hardware with a potential impact in many fields. The conventional algorithm quantum phase estimation uses deep circuits and…
Understanding the real time dynamics of quantum systems without quasiparticles constitutes an important yet challenging problem. We study the superfluid-insulator quantum-critical point of bosons on a two-dimensional lattice, a system whose…
Quantum Monte Carlo (QMC) methods represent a powerful family of computational techniques for tackling complex quantum many-body problems and performing calculations of stationary state properties. QMC is among the most accurate and…
The dynamics of a quantum phase transition is inextricably woven with the formation of excitations, as a result of the critical slowing down in the neighborhood of the critical point. We design a transitionless quantum driving through a…
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,…
Ising spin Hamiltonians are often used to encode a computational problem in their ground states. Quantum Annealing (QA) computing searches for such a state by implementing a slow time-dependent evolution from an easy-to-prepare initial…
In this paper, we generalize the Quantum Kinetic Monte Carlo (QKMC) method of the Schrodinger equation, which was first proposed by [Z. Cai and J. Lu. SIAM J. Sci. Comput., 40(3):B706-B722, 2018] to the Lindblad equation. This algorithm…