Computing Green's functions and improving ground state energy estimation on quantum computers with Liouvillian recursion

• URL: http://arxiv.org/abs/2603.05349v1
• Date: Thu, 05 Mar 2026 16:28:48 GMT
• Title: Computing Green's functions and improving ground state energy estimation on quantum computers with Liouvillian recursion
• Authors: Jérôme Leblanc, Olivier Nahman-Lévesque, Julien Forget, Thomas Lepage-Lévesque, Simon Verret, Alexandre Foley,
• Abstract summary: We present a quantum-classical hybrid implementation of the Liouvillian recursion method compute many-body Green functions using a quantum computer.<n>From an approximate ground state preparation circuit, this algorithm produces the local ($r=r'$) and inter-site ($rneq r'$) Green's functions.
• Score: 35.18016233072556
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a quantum-classical hybrid implementation of the Liouvillian recursion method to compute many-body Green's functions using a quantum computer. From an approximate ground state preparation circuit, this algorithm produces the local ($r=r'$) and inter-site ($r\neq r'$) Green's functions $G_{rr'}(ω)$ by measuring observables generated recursively. We demonstrate the approach on a superconducting quantum processor for the open-boundary four-site Hubbard model. We then use the computed Green's functions as input to the Galitskii-Migdal formula to produce better ground state energy estimation than the expectation value of the Hamiltonian for the approximate circuit. Empirical results indicate exponential convergence in the number of iterations, yielding a computational complexity polynomial in the Green's-function accuracy, as measured with the Wasserstein distance. Our results also indicate significant robustness to noise and to inaccuracies of the ground state preparation, providing evidence that Liouvillian recursion is well adapted to the constraints of near-term quantum computing.

Related papers

• Special Issue: Commemorating the 110th Anniversary of TANG Au-chin's Birthday Calculation of the Green's function on near-term quantum computers via Cartan decomposition [7.389215400072566]
  We introduce an efficient algorithm for computing Green's functions via Cartan decomposition.<n>The new algorithm is applied to simulate long-time Green's functions for the Fermi-Hubbard and transverse-field Ising models.
  arXiv  Detail & Related papers  (2025-09-11T08:33:12Z)
• Quantum Computed Green's Functions using a Cumulant Expansion of the Lanczos Method [0.0]
  We present a quantum computational method to calculate the many-body Green's function matrix in a spin orbital basis. We demonstrate the calculation of Green's functions on Quantinuum's H1-1 trapped-ion quantum computer.
  arXiv  Detail & Related papers  (2023-09-18T11:45:04Z)
• Computation of Green's function by local variational quantum compilation [0.0]
  We propose an efficient method to compute the real-time Green's function based on the local variational quantum compilation algorithm. Our method requires shallow quantum circuits to calculate the Green's function and can be utilized on both near-term noisy intermediate-scale and long-term fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2023-03-28T01:23:15Z)
• Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods [44.99833362998488]
  We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices. We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain.
  arXiv  Detail & Related papers  (2022-06-20T16:33:23Z)
• Effective calculation of the Green's function in the time domain on near-term quantum processors [0.0]
  We show that it is possible to obtain the exact time propagation of the $|Npm 1rangle$ states by exponentiating one single Pauli component of the Hamiltonian. We perform the calculations on an actual superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-03-23T12:47:04Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Lanczos recursion on a quantum computer for the Green's function and ground state [0.0]
  A state-preserving quantum counting algorithm is used to obtain coefficients of a Lanczos recursion from a single ground state wavefunction on the quantum computer. This is used to compute the continued fraction representation of an interacting Green's function for use in condensed matter, particle physics, and other areas.
  arXiv  Detail & Related papers  (2020-08-12T22:50:47Z)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)
• Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with an artificial neural-network correlator ansatz [62.997667081978825]
  We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei. We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
  arXiv  Detail & Related papers  (2020-07-28T14:52:28Z)
• Method of spectral Green functions in driven open quantum dynamics [77.34726150561087]
  A novel method based on spectral Green functions is presented for the simulation of driven open quantum dynamics. The formalism shows remarkable analogies to the use of Green functions in quantum field theory. The method dramatically reduces computational cost compared with simulations based on solving the full master equation.
  arXiv  Detail & Related papers  (2020-06-04T09:41:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.