Optimal Sufficient Requirements on the Embedded Ising Problem in Polynomial Time

02/08/2023
by   Elisabeth Lobe, et al.
0

One of the central applications for quantum annealers is to find the solutions of Ising problems. Suitable Ising problems, however, need to be formulated such that they, on the one hand, respect the specific restrictions of the hardware and, on the other hand, represent the original problems which shall actually be solved. We evaluate sufficient requirements on such an embedded Ising problem analytically and transform them into a linear optimization problem. With an objective function aiming to minimize the maximal absolute problem parameter, the precision issues of the annealers are addressed. Due to the redundancy of several constraints, we can show that the formally exponentially large optimization problem can be reduced and finally solved in polynomial time for the standard embedding setting where the embedded vertices induce trees. This allows to formulate provably equivalent embedded Ising problems in a practical setup.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2017

Clustering with Local Restrictions

We study a family of graph clustering problems where each cluster has to...
research
10/02/2018

A Novel Algebraic Geometry Compiling Framework for Adiabatic Quantum Computations

Adiabatic Quantum Computing (AQC) is an attractive paradigm for solving ...
research
01/12/2018

A Linear Complementarity Theorem to solve any Satisfiability Problem in conjunctive normal form in polynomial time

Any satisfiability problem in conjunctive normal form can be solved in p...
research
10/01/2017

The Width and Integer Optimization on Simplices With Bounded Minors of the Constraint Matrices

In this paper, we will show that the width of simplices defined by syste...
research
09/23/2019

Computations with Greater Quantum Depth Are Strictly More Powerful (Relative to an Oracle)

A conjecture of Jozsa states that any polynomial-time quantum computatio...
research
04/29/2011

Limits of Preprocessing

We present a first theoretical analysis of the power of polynomial-time ...

Please sign up or login with your details

Forgot password? Click here to reset