Related papers: TRIQS/CTHYB: A Continuous-Time Quantum Monte Carlo…
The protection of qubit coherence is an essential task in order to build a practical quantum computer able to manipulate, store and read quantum information with a high degree of fidelity. Recently, it has been proposed to increase the…
Hybrid quantum-classical optimization techniques, which incorporate the pre-optimization of Variational Quantum Algorithms (VQAs) using Tensor Networks (TNs), have been shown to allow for the reduction of quantum computational resources. In…
We derive equations of motion for Green's functions of the multi-orbital Anderson impurity model by differentiating symmetrically with respect to all time arguments. The resulting equations relate the one- and two-particle Green's function…
Computational physics problems often have a common set of aspects to them that any particular numerical code will have to address. Because these aspects are common to many problems, having a framework already designed and ready to use will…
This paper presents key enhancements to our previous work~\cite{naghmouchi2024mixed} on a hybrid Benders decomposition (HBD) framework for solving mixed integer linear programs (MILPs). In our approach, the master problem is reformulated as…
Quantum Computing is an emerging paradigm which is gathering a lot of popularity in the current scientific and technological community. Widely conceived as the next frontier of computation, Quantum Computing is still at the dawn of its…
Multi-orbital quantum impurity models with general interaction and hybridization terms appear in a wide range of applications including embedding, quantum transport, and nanoscience. However, most quantum impurity solvers are restricted to…
Quadratic Unconstrained Binary Optimization (QUBO) problems are prevalent in real-world applications, such as portfolio optimization, but pose significant computational challenges for large-scale instances. We propose a hybrid…
We introduce a novel Multi-Order Monte Carlo approach for uncertainty quantification in the context of multiscale time-dependent partial differential equations. The new framework leverages Implicit-Explicit Runge-Kutta time integrators to…
Noisy, intermediate-scale quantum (NISQ) computers are expected to execute quantum circuits of up to a few hundred qubits. The circuits have to conform to NISQ architectural constraints regarding qubit allocation and the execution of…
We present MISTIQS, a Multiplatform Software for Time-dependent Quantum Simulations. MISTIQS delivers end-to-end functionality for simulating the quantum many-body dynamics of systems governed by time-dependent Heisenberg Hamiltonians…
We propose a mixed-configuration approximation based on single-band impurity solvers to efficiently study nonequilibrium multi-orbital systems at moderate computational cost. In this work, we merge the approach with the so-called auxiliary…
With constant improvements of quantum hardware and quantum algorithms, quantum advantage comes within reach. Parallel to the development of the computer at the end of the twentieth century, quantum software development will now also rapidly…
QuYBE is an open-source algebraic compiler for the compression of quantum circuits. It has been applied for the efficient simulation of the Heisenberg Hamiltonian on quantum computers. Currently, it can simulate the time dynamics of…
Using quantum devices supported by classical computational resources is a promising approach to quantum-enabled computation. One example of such a hybrid quantum-classical approach is the variational quantum eigensolver (VQE) built to…
In model predictive control (MPC) for hybrid systems, solving optimization problems efficiently and with guarantees on worst-case computational complexity is critical to satisfy the real-time constraints in these applications. These…
The Grassmann time-evolving matrix product operator method has shown great potential as a general-purpose quantum impurity solver, as its numerical errors can be well-controlled and it is flexible to be applied on both the imaginary- and…
We present the first open release of the DCA++ project, a high-performance research software framework to solve quantum many-body problems with cutting edge quantum cluster algorithms. DCA++ implements the dynamical cluster approximation…
In this paper we introduce an open-source software package written in C++ for efficiently finding solutions to quadratic programming problems with linear complementarity constraints. These problems arise in a wide range of applications in…
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…