Related papers: $i$QIST: An open source continuous-time quantum Mo…
We extend the recently developed real-time Diagrammatic Monte Carlo method, in its hybridization expansion formulation, to the full Kadanoff-Baym-Keldysh contour. This allows us to study real-time dynamics in correlated impurity models…
Integer programming (IP) is an NP-hard combinatorial optimization problem that is widely used to represent a diverse set of real-world problems spanning multiple fields, such as finance, engineering, logistics, and operations research. It…
Quantum computing is a technology that promises to offer significant advantages during the coming decades. Though the technology is still in a prototype stage, the last few years have seen many of these prototype devices become accessible…
We apply the tensor cross interpolation (TCI) algorithm to solve equilibrium quantum impurity problems with high precision based on the weak-coupling expansion. The TCI algorithm, a kind of active learning method, factorizes…
We present a quantum impurity solver based on a pseudo-particle framework, which combines diagrammatic resummations for a three-point vertex with diagrammatic Monte Carlo sampling of a four-point vertex. This recently proposed approach [A.…
Quantum computing is advancing rapidly in hardware and algorithms, but broad accessibility demands a comprehensive, efficient, unified software stack. Such a stack must flexibly span diverse hardware and evolving algorithms, expose usable…
The diagramatic Monte Carlo method has so far been primarily used in connection with the weak coupling expansion. Here we show that the strong coupling expansion offers a significant advantage: it can be efficiently implemented on both the…
Noisy intermediate-scale quantum computing devices are an exciting platform for the exploration of the power of near-term quantum applications. Performing nontrivial tasks in such devices requires a fundamentally different approach than…
We present Qiskit Machine Learning (ML), a high-level Python library that combines elements of quantum computing with traditional machine learning. The API abstracts Qiskit's primitives to facilitate interactions with classical simulators…
This tutorial paper introduces quantum approaches to Monte Carlo computation with applications in computational finance. We outline the basics of quantum computing using Grover's algorithm for unstructured search to build intuition. We then…
In the era of gravitational-wave astronomy, general-relativistic simulations of compact objects play a role of paramount importance. These calculations can be performed with the Einstein Toolkit, an open-source and community-supported…
An acceleration of continuous time quantum Monte Carlo (CTQMC) methods is a potentially interesting branch of work as they are matchless as impurity solvers of a density functional theory in combination with a dynamical mean field theory…
A universal fault-tolerant quantum computer that can solve efficiently problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental…
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…
A versatile and efficient variational approach is developed to solve in- and out-of-equilibrium problems of generic quantum spin-impurity systems. Employing the discrete symmetry hidden in spin-impurity models, we present a new canonical…
This Perspective focuses on the several overlaps between quantum algorithms and Monte Carlo methods in the domains of physics and chemistry. We will analyze the challenges and possibilities of integrating established quantum Monte Carlo…
Monte Carlo integration approximates an integral of a black-box function by taking the average of many evaluations (i.e., samples) of the function (integrand). For $N$ queries of the integrand, Monte Carlo integration achieves the…
We explore two complementary modifications of the hybridization-expansion continuous-time Monte Carlo method, aiming at large multi-orbital quantum impurity problems. One idea is to compute the imaginary-time propagation using a matrix…
Quantum information science and engineering (QISE) is a rapidly developing field that leverages the skills of experts from many disciplines to utilize the potential of quantum systems in a variety of applications. It requires talent from a…
We present ComCTQMC, a GPU accelerated quantum impurity solver. It uses the continuous-time quantum Monte Carlo (CTQMC) algorithm wherein the partition function is expanded in terms of the hybridisation function (CT-HYB). ComCTQMC supports…