51 citations · 97 across the 2 of their papers we have counts for
5 papers
Minor Embedding for Quantum Annealing with Reinforcement Learning
Riccardo Nembrini, Maurizio Ferrari Dacrema, Paolo Cremonesi
Quantum Annealing (QA) is a quantum computing paradigm for solving combinatorial optimization problems formulated as Quadratic Unconstrained Binary Optimization (QUBO) problems. An…
Separating Ansatz Discovery from Deployment on Larger Problems: Reinforcement Learning for Modular Circuit Design
Gloria Turati, Simone Foderà, Riccardo Nembrini +2
As quantum computing continues to gain attention, there is growing interest in how classical machine learning can assist quantum workflows in practice. Automated circuit design, so…
Reinforcement Learning for Variational Quantum Circuits Design
Simone Foderà, Gloria Turati, Riccardo Nembrini +2
Variational Quantum Algorithms have emerged as promising tools for solving optimization problems on quantum computers. These algorithms leverage a parametric quantum circuit called…
Towards Feature Selection for Ranking and Classification Exploiting Quantum Annealers
Maurizio Ferrari Dacrema, Fabio Moroni, Riccardo Nembrini +3
Feature selection is a common step in many ranking, classification, or prediction tasks and serves many purposes. By removing redundant or noisy features, the accuracy of ranking o…
Feature Selection for Recommender Systems with Quantum Computing
Riccardo Nembrini, Maurizio Ferrari Dacrema, Paolo Cremonesi
The promise of quantum computing to open new unexplored possibilities in several scientific fields has been long discussed, but until recently the lack of a functional quantum comp…