QUBO transformation using Eigenvalue Decomposition

06/19/2021
by   Amit Verma, et al.
7

Quadratic Unconstrained Binary Optimization (QUBO) is a general-purpose modeling framework for combinatorial optimization problems and is a requirement for quantum annealers. This paper utilizes the eigenvalue decomposition of the underlying Q matrix to alter and improve the search process by extracting the information from dominant eigenvalues and eigenvectors to implicitly guide the search towards promising areas of the solution landscape. Computational results on benchmark datasets illustrate the efficacy of our routine demonstrating significant performance improvements on problems with dominant eigenvalues.

READ FULL TEXT
research
04/04/2021

Constraint Programming to Discover One-Flip Local Optima of Quadratic Unconstrained Binary Optimization Problems

The broad applicability of Quadratic Unconstrained Binary Optimization (...
research
10/31/2022

New Power Method for Solving Eigenvalue Problems

We present a new power method to obtain solutions of eigenvalue problems...
research
03/22/2021

Approximating matrix eigenvalues by randomized subspace iteration

Traditional numerical methods for calculating matrix eigenvalues are pro...
research
10/28/2020

Quantum algorithms for the polynomial eigenvalue problems

Polynomial eigenvalue problems (PEPs) arise in a variety of science and ...
research
10/10/2020

Unsupervised Neural Networks for Quantum Eigenvalue Problems

Eigenvalue problems are critical to several fields of science and engine...
research
07/19/2021

Eigenvector Centrality and Uniform Dominant Eigenvalue of Graph Components

Eigenvector centrality is one of the outstanding measures of central ten...
research
06/17/2020

A simple extrapolation method for clustered eigenvalues

This paper introduces a simple variant of the power method. It is shown ...

Please sign up or login with your details

Forgot password? Click here to reset