Feature Selection for Recommender Systems with Quantum Computing
- URL: http://arxiv.org/abs/2110.05089v1
- Date: Mon, 11 Oct 2021 08:52:50 GMT
- Title: Feature Selection for Recommender Systems with Quantum Computing
- Authors: Riccardo Nembrini, Maurizio Ferrari Dacrema, Paolo Cremonesi
- Abstract summary: Small but functional quantum computers have become available to the broader research community.
One of the tasks that most naturally fits in this mathematical formulation is feature selection.
We represent the feature selection as an optimization problem and solve it on a real quantum computer, provided by D-Wave.
- Score: 7.8851236034886645
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: 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 computer has confined this discussion mostly to
theoretical algorithmic papers. It was only in the last few years that small
but functional quantum computers have become available to the broader research
community. One paradigm in particular, quantum annealing, can be used to sample
optimal solutions for a number of NP-hard optimization problems represented
with classical operations research tools, providing an easy access to the
potential of this emerging technology. One of the tasks that most naturally
fits in this mathematical formulation is feature selection. In this paper, we
investigate how to design a hybrid feature selection algorithm for recommender
systems that leverages the domain knowledge and behavior hidden in the user
interactions data. We represent the feature selection as an optimization
problem and solve it on a real quantum computer, provided by D-Wave. The
results indicate that the proposed approach is effective in selecting a limited
set of important features and that quantum computers are becoming powerful
enough to enter the wider realm of applied science.
Related papers
- Quantum Computing for Discrete Optimization: A Highlight of Three Technologies [0.0]
This paper focuses on interdisciplinary research between the Operations Research (OR) and Quantum Computing communities.
We consider three quantum-powered optimization approaches that make use of different types of quantum hardware available on the market.
We illustrate these approaches with experiments on three types of quantum computers: a neutral atom machine from QuEra, a quantum annealer from D-Wave, and a gate-based device from IBM.
arXiv Detail & Related papers (2024-09-02T17:04:47Z) - Variational Quantum Algorithms for Combinatorial Optimization [0.571097144710995]
Variational Algorithms (VQA) have emerged as one of the strongest candidates towards reaching practical applicability of NISQ systems.
This paper explores the current state and recent developments of VQAs, emphasizing their applicability to Approximate optimization.
We implement QAOA circuits with varying depths to solve the MaxCut problem on graphs with 10 and 20 nodes.
arXiv Detail & Related papers (2024-07-08T22:02:39Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - A Practitioner's Guide to Quantum Algorithms for Optimisation Problems [0.0]
NP-hard optimisation problems are common in industrial areas such as logistics and finance.
This paper aims to provide a comprehensive overview of the theory of quantum optimisation techniques.
It focuses on their near-term potential for noisy intermediate scale quantum devices.
arXiv Detail & Related papers (2023-05-12T08:57:36Z) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - Quantum Machine Learning: from physics to software engineering [58.720142291102135]
We show how classical machine learning approach can help improve the facilities of quantum computers.
We discuss how quantum algorithms and quantum computers may be useful for solving classical machine learning tasks.
arXiv Detail & Related papers (2023-01-04T23:37:45Z) - Towards Feature Selection for Ranking and Classification Exploiting
Quantum Annealers [14.519254230787993]
This paper explores the feasibility of using currently available quantum computing architectures to solve some quadratic feature selection algorithms for both ranking and classification.
The effectiveness obtained with quantum computing hardware is comparable to that of classical solvers, indicating that quantum computers are now reliable enough to tackle interesting problems.
arXiv Detail & Related papers (2022-05-09T14:46:38Z) - Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time.
As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware.
We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
arXiv Detail & Related papers (2022-02-17T18:59:20Z) - Quantum Computing for Location Determination [6.141741864834815]
We introduce an example for the expected gain of using quantum algorithms for location determination research.
The proposed quantum algorithm has a complexity that is exponentially better than its classical algorithm version, both in space and running time.
We discuss both software and hardware research challenges and opportunities that researchers can build on to explore this exciting new domain.
arXiv Detail & Related papers (2021-06-11T15:39:35Z) - Electronic structure with direct diagonalization on a D-Wave quantum
annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer.
We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z) - An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem.
The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z)
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.