4 papers
Systematic improvement of the quantum approximate optimisation ansatz for combinatorial optimisation using quantum subspace expansion
Yann Beaujeault-Taudière
The quantum approximate optimisation ansatz (QAOA) is one of the flagship algorithms used to tackle combinatorial optimisation on graphs problems using a quantum computer, and is c…
Neutron-proton pairing correlations described on quantum computers
Jing Zhang, Denis Lacroix, Yann Beaujeault-Taudiere
The ADAPT-VQE approach is used to solve the neutron-proton pairing problem in atomic nuclei. This variational approach is considered today as one of the most powerful methods to it…
Solving the Lipkin model using quantum computers with two qubits only with a hybrid quantum-classical technique based on the Generator Coordinate Method
Yann Beaujeault-Taudiere, Denis Lacroix
The possibility of using the generator coordinate method (GCM) using hybrid quantum-classical algorithms with reduced quantum resources is discussed. The task of preparing the basi…
MOSAIC, acomparison framework for machine learning models
Mattéo Papin, Yann Beaujeault-Taudière, Frédéric Magniette
We introduce MOSAIC, a Python program for machine learning models. Our framework is developed with in mind accelerating machine learning studies through making implementing and tes…