Related papers: Comparison among HB-inspired algorithms for contin…
Faithfully simulating the dynamics of open quantum systems requires efficiently addressing the challenge of an infinite Hilbert space. Inspired by the shifted boson operator technique used in ground-state studies of the spin-boson model…
We suggest alternative quantum Otto engines, using heat bath algorithmic cooling with partner pairing algorithm instead of isochoric cooling. Liquid state nuclear magnetic resonance systems in one entropy sink are considered as working…
At fine lattice spacings, Markov chain Monte Carlo simulations of QCD and other gauge theories with or without fermions are plagued by slow modes that give rise to large autocorrelation times. This can lead to simulation runs that are…
Momentum methods for convex optimization often rely on precise choices of algorithmic parameters, based on knowledge of problem parameters, in order to achieve fast convergence, as well as to prevent oscillations that could severely…
We analyze the dynamical nearest-neighbor and next-nearest-neighbor spin correlations in the 4-site and 8-site dynamical cluster approximation to the two-dimensional Hubbard model. Focusing on the robustness of these correlations at long…
The thinning method for numerical generation of the nonhomogeneous Poisson process (NHPP) arrival times has been adapted to accelerate Monte Carlo simulations of the kinetic Ising models (KIMs) with the Glauber spin-flip dynamics. The…
We propose an efficient Monte Carlo algorithm for simulating a ``hardly-relaxing" system, in which many replicas with different temperatures are simultaneously simulated and a virtual process exchanging configurations of these replica is…
We investigate the feasibility of simulating different model Hamiltonians used in high-temperature superconductivity. We briefly discuss the most common models and then focus on the simulation of the so-called t-J-U Hamiltonian using…
Standard sampling algorithms for lattice QCD suffer from topology freezing (or critical slowing down) when approaching the continuum limit, thus leading to poor sampling of the distinct topological sectors. I will present a modified…
We apply algorithms based on Lieb-Robinson bounds to simulate time-dependent and thermal quantities in quantum systems. For time-dependent systems, we modify a previous mapping to quantum circuits to significantly reduce the computer…
The $\mathrm{SU}(4)$ Heisenberg model on the honeycomb lattice is expected to host a quantum spin-orbital liquid at low temperature with an astonishing candidate material, $\alpha$-ZrCl$_3$. We employed the canonical thermal pure quantum…
Simulated cooling is a robust method for preparing low-energy states of many-body Hamiltonians on near-term quantum simulators. In such schemes, a subset of the simulator's spins (or qubits) are treated as a ``bath,'' which extracts energy…
We show how to optimally reduce the local Hilbert basis of lattice quantum many-body (QMB) Hamiltonians. The basis truncation exploits the most relevant eigenvalues of the estimated single-site reduced density matrix (RDM). It is accurate…
We investigate the performance and accuracy of digital quantum algorithms for the study of static and dynamic properties of the fermionic Hubbard model at half-filling with next-nearest neighbour hopping terms. We provide quantum circuits…
How heterogeneous multiscale methods (HMM) handle fluctuations acting on the slow variables in fast-slow systems is investigated. In particular, it is shown via analysis of central limit theorems (CLT) and large deviation principles (LDP)…
A spin dynamics algorithm, combining checkerboard updating and a rotation algorithm based on the local second-rank ordering field, is developed for the Lebwohl-Lasher model of liquid crystals. The method is shown to conserve energy well and…
Cold atoms have become a powerful platform for quantum-simulating lattice gauge theories in higher spatial dimensions. However, such realizations have been restricted to the lowest possible truncations of the gauge field, which limit the…
Global optimization heuristics are popular to optimize hard non-convex problems. Despite their irrefutably large cost-to-solution, in the lack of other working greedy or convex approaches, global optimization algorithms remain the…
The Hubbard model is a longstanding problem in the theory of strongly correlated electrons and a very active one in the experiments with ultracold fermionic atoms. Motivated by current and prospective quantum simulations, we apply a…
Many physical phenomena, including thermalization in open quantum systems and quantum Gibbs sampling, are modeled by Lindbladians approximating a system weakly coupled to a bath. Understanding the convergence speed of these Lindbladians to…