7 papers
Pre-optimization of quantum circuits, barren plateaus and classical simulability: tensor networks to unlock the variational quantum eigensolver
Baptiste Anselme Martin, Thomas Ayral
Variational quantum algorithms are practical approaches to prepare ground states, but their potential for quantum advantage remains unclear. Here, we use differentiable 2D tensor n…
Calculating Feynman diagrams with matrix product states
Xavier Waintal
This text reviews, hopefully in a pedagogical manner, a series of work on the automatic calculations of Feynman diagrams in the context of quantum nanoelectronics (Keldysh formalis…
Many-body Quantum Score: a scalable benchmark for digital and analog quantum processors and first test on a commercial neutral atom device
Harold Erbin, Pierre-Louis Burdeau, Corentin Bertrand +2
We propose the Many-body Quantum Score (MBQS), a practical and scalable application-level benchmark protocol designed to evaluate the capabilities of quantum processing units (QPUs…
Approximate combinatorial optimization with Rydberg atoms: the barrier of interpretability
Christian de Correc, Thomas Ayral, Corentin Bertrand
Analog quantum computing with Rydberg atoms is seen as an avenue to solve hard graph optimization problems, because they naturally encode the Maximum Independent Set (MIS) problem…
Hybrid quantum-classical analog simulation of two-dimensional Fermi-Hubbard models with neutral atoms
Sergi Julià -Farré, Antoine Michel, Christophe Domain +11
We experimentally study the two-dimensional Fermi-Hubbard model using a Rydberg-based quantum processing unit in the analog mode. Our approach avoids encoding directly the original…
Dynamical mean field theory with quantum computing
Thomas Ayral
Near-term quantum processors are limited in terms of the number of qubits and gates they can afford. They nevertheless give unprecedented access to programmable quantum systems tha…