Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer

10/24/2022
by   Chen-Yu Liu, et al.
0

Factorization Machine (FM) is the most commonly used model to build a recommendation system since it can incorporate side information to improve performance. However, producing item suggestions for a given user with a trained FM is time-consuming. It requires a run-time of O((N_m log N_m)^2), where N_m is the number of items in the dataset. To address this problem, we propose a quadratic unconstrained binary optimization (QUBO) scheme to combine with FM and apply quantum annealing (QA) computation. Compared to classical methods, this hybrid algorithm provides a faster than quadratic speedup in finding good user suggestions. We then demonstrate the aforementioned computational advantage on current NISQ hardware by experimenting with a real example on a D-Wave annealer.

READ FULL TEXT
research
05/05/2020

Breaking RSA Security With A Low Noise D-Wave 2000Q Quantum Annealer: Computational Times, Limitations And Prospects

The RSA cryptosystem could be easily broken with large scale general pur...
research
03/23/2022

Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization

We present a hybrid classical-quantum framework based on the Frank-Wolfe...
research
04/05/2017

Nonnegative/binary matrix factorization with a D-Wave quantum annealer

D-Wave quantum annealers represent a novel computational architecture an...
research
11/23/2021

Quantum Advantage for All

We show how to translate a subset of RISC-V machine code compiled from a...
research
09/10/2019

Faster quantum and classical SDP approximations for quadratic binary optimization

We give a quantum speedup for solving the canonical semidefinite program...
research
11/17/2021

Quantum-Assisted Support Vector Regression for Detecting Facial Landmarks

The classical machine-learning model for support vector regression (SVR)...
research
05/06/2021

Q-Match: Iterative Shape Matching via Quantum Annealing

Finding shape correspondences can be formulated as an NP-hard quadratic ...

Please sign up or login with your details

Forgot password? Click here to reset