Related papers: Quantum Algorithm for Green's Functions Measuremen…
We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-local qubit Hamiltonians with a small set of physically…
We present an algorithm to evaluate Matsubara sums for Feynman diagrams comprised of bare Green's functions with single-band dispersions with local U Hubbard interaction vertices. The algorithm provides an exact construction of the analytic…
The physics of high-energy colliders relies on the knowledge of different non-perturbative parton correlators, such as parton distribution functions, that encode the information on universal hadron structure and are thus the main building…
We propose a quantum-classical hybrid scheme for implementing the nonunitary Gutzwiller factor using a discrete Hubbard-Stratonovich transformation, which allows us to express the Gutzwiller factor as a linear combination of unitary…
Quantum algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…
We introduce novel algorithms for the quantum simulation of molecular systems which are asymptotically more efficient than those based on the Trotter-Suzuki decomposition. We present the first application of a recently developed technique…
This paper proposes a hybrid quantum-classical algorithm to solve a fundamental power system problem called unit commitment (UC). The UC problem is decomposed into a quadratic subproblem, a quadratic unconstrained binary optimization (QUBO)…
Simulating interactions between fermions and bosons is central to understanding correlated phenomena, yet these systems are inherently difficult to treat classically. Previous quantum algorithms for fermion-boson models exhibit computation…
We formulate a finite-temperature scheme of the variational cluster approximation (VCA) particularly suitable for an exact-diagonalization cluster solver. Based on the analytical properties of the single-particle Green's function matrices,…
Semidefinite programs are optimization methods with a wide array of applications, such as approximating difficult combinatorial problems. One such semidefinite program is the Goemans-Williamson algorithm, a popular integer relaxation…
Simulating response properties of molecules is crucial for interpreting experimental spectroscopies and accelerating materials design. However, it remains a long-standing computational challenge for electronic structure methods on classical…
We present a detailed study of the real-time dynamics and spectral properties of the one-dimensional fermionic Hubbard model at infinite temperature. Using tensor network simulations in Liouville space, we compute the single-particle…
Estimating the ground-state energy of Hamiltonians is a fundamental task for which it is believed that quantum computers can be helpful. Several approaches have been proposed toward this goal, including algorithms based on quantum phase…
The solving of linear systems provides a rich area to investigate the use of nearer-term, noisy, intermediate-scale quantum computers. In this work, we discuss hybrid quantum-classical algorithms for skewed linear systems for…
Quantum simulators have made a remarkable progress towards exploring the dynamics of many-body systems, many of which offer a formidable challenge to both theoretical and numerical methods. While state-of-the-art quantum simulators are in…
Many quantum algorithms, including recently proposed hybrid classical/quantum algorithms, make use of restricted tomography of the quantum state that measures the reduced density matrices, or marginals, of the full state. The most…
We present a numerically stable Quantum Monte Carlo algorithm to calculate zero-temperature imaginary-time Green functions $ G(\vec{r}, \tau) $ for Hubbard type models. We illustrate the efficiency of the algorithm by calculating the…
Typical fermion algorithms require the computation (or sampling) of the fermion determinant. We focus instead on cluster algorithms which do not involve the determinant and involve a more physically relevant sampling of the configuration…
An end-to-end strategy for hybrid quantum-classical computations of Green's functions in many-body systems is presented and applied to the pairing model. The scheme makes explicit use of the spectral representation of the Green's function,…
Interacting fermions on a lattice can develop strong quantum correlations, which lie at the heart of the classical intractability of many exotic phases of matter. Seminal efforts are underway in the control of artificial quantum systems,…