Related papers: Quantum algorithm for imaginary-time Green's funct…
Quantum phase estimation is at the heart of most quantum algorithms with exponential speedup. In this letter we demonstrate how to utilize it to compute the dynamical response functions of many-body quantum systems. Specifically, we design…
Variational representations of quantum states abound and have successfully been used to guess ground-state properties of quantum many-body systems. Some are based on partial physical insight (Jastrow, Gutzwiller projected, and fractional…
Although a universal quantum computer is still far from reach, the tremendous advances in controllable quantum devices, in particular with solid-state systems, make it possible to physically implement "quantum simulators". Quantum…
We present a quantum Monte-Carlo algorithm for computing the perturbative expansion in power of the coupling constant $U$ of the out-of-equilibrium Green's functions of interacting Hamiltonians of fermions. The algorithm extends the one…
We consider the cumulant expansion of the PAM employing the hybridization as perturbation (Phys. Rev. B 50, 17933 (1994)), and we obtain formally exact one-electron Green's functions (GF). These GF contain effective cumulants that are as…
A hybrid quantum-classical algorithm is a computational scheme in which quantum circuits are used to extract information that is then processed by a classical routine to guide subsequent quantum operations. These algorithms are especially…
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…
Green's functions in Physics have proven to be a valuable tool for understanding fundamental concepts in different branches, such as electrodynamics, solid-state and many -body problems. In quantum mechanics advanced courses, Green's…
We present a hybrid quantum-classical algorithm to simulate thermal states of a classical Hamiltonians on a quantum computer. Our scheme employs a sequence of locally controlled rotations, building up the desired state by adding qubits one…
Hybrid spectral-spatial representations are introduced to rapidly calculate periodic scalar and dyadic Green's functions of the Helmholtz equation for 2D and 3D configurations with a 1D (linear) periodicity. The presented schemes work…
We compute the Green's function for the Hodge Laplacian on the symmetric spaces M\times\Sigma, where M is a simply connected n-dimensional Riemannian or Lorentzian manifold of constant curvature and \Sigma is a simply connected Riemannian…
We present a hybrid Path Integral Monte Carlo (hPIMC) algorithm to calculate real-time quantum thermal correlation functions and demonstrate its application to open quantum systems. The hPIMC algorithm leverages the successes of classical…
The single particle Green's function provides valuable information on the momentum and energy-resolved spectral properties for a strongly correlated system. In large-scale numerical calculations using quantum Monte Carlo (QMC), dynamical…
Recent improvements in control of quantum systems make it seem feasible to finally build a quantum computer within a decade. While it has been shown that such a quantum computer can in principle solve certain small electronic structure…
We introduce a variational hybrid classical-quantum algorithm to simulate the Lindblad master equation and its adjoint for time-evolving Markovian open quantum systems and quantum observables. Our method is based on a direct representation…
We derive a method to efficiently compute the Green function of on arbitrary Hamiltonians defined on semi-infinite and periodic quasi-one-dimensional lattices. Computing the Green function is the backbone of quantum transport, electronic…
A method based on separated integration to estimate anharmonic corrections to energy and vibration of molecules in a second-order diagrammatic vibrational many-body Green's function formalism has already been presented. A severe bottleneck…
Feynman's prescription for a quantum simulator was to find a hamitonian for a system that could serve as a computer. P\'olya and Hilbert conjecture was to demonstrate Riemann's hypothesis through the spectral decomposition of hermitian…
We report an experimental demonstration of a one-way implementation of a quantum algorithm solving Simon's Problem - a black box period-finding problem which has an exponential gap between the classical and quantum runtime. Using an…
A flagship application of quantum computers is the simulation of other quantum systems, including quantum field theories. In this article, we show how quantum computers can be employed to naturally calculate Feynman diagrams and their…