DMFT-QE Symposium: November 24, 2025

Talk 1:

Can quantum computers outperform classical ones for solving impurity models?

Thomas Ayral, Eviden Quantum Lab

Quantum computers hold the promise to outperform classical ones for certain tasks, especially in many-body physics. On the other hand, very sophisticated classical algorithms have been designed over the years to solve impurity models, which are the numerical bottleneck of dynamical mean field theory. In this talk, I will explore the opportunities for quantum computers to give a leg up to classical ones for solving impurity models.

Talk 2:

A strategy for an Impurity solver on a quantum computer

François Jamet, Alice & Bob

In this talk, I will present a new quantum algorithm to compute the Green’s function of an Anderson impurity model using a hybrid approach integrating tensor network methods and quantum computing. A quantum algorithm to compute the Green function of the Anderson impurity model  typically involves a two-step process, where one first calculates the ground state of the Hamiltonian, and then computes its dynamical properties to obtain the Green’s function. Here we propose a hybrid classical/quantum algorithm where the first step is performed using a classical computer to obtain the tensor network ground state as well as its quantum circuit representation, and the second step is executed on the quantum computer to obtain the Green’s function. Our algorithm exploits the efficiency of tensor networks for preparing ground states on classical computers, and takes advantage of quantum processors for the evaluation of the time evolution, which can become intractable on classical computers.

November 24, 2025

November 24, 2025