Assessing Solution Quality of 3SAT on a Quantum Annealing Platform

02/13/2019
by   Thomas Gabor, et al.
0

When solving propositional logic satisfiability (specifically 3SAT) using quantum annealing, we analyze the effect the difficulty of different instances of the problem has on the quality of the answer returned by the quantum annealer. A high-quality response from the annealer in this case is defined by a high percentage of correct solutions among the returned answers. We show that the phase transition regarding the computational complexity of the problem, which is well-known to occur for 3SAT on classical machines (where it causes a detrimental increase in runtime), persists in some form (but possibly to a lesser extent) for quantum annealing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/18/2021

Statistical Analysis of Quantum Annealing

Quantum computers use quantum resources to carry out computational tasks...
research
08/17/2020

Adiabatic Quantum Optimization Fails to Solve the Knapsack Problem

In this work, we attempt to solve the integer-weight knapsack problem us...
research
01/12/2023

Heuristic for Diverse Kemeny Rank Aggregation based on Quantum Annealing

The Kemeny Rank Aggregation (KRA) problem is a well-studied problem in t...
research
06/25/2019

Computational Phase Transition Signature in Gibbs Sampling

Gibbs sampling is fundamental to a wide range of computer algorithms. Su...
research
02/25/2016

Exponential capacity of associative memories under quantum annealing recall

Associative memory models, in theoretical neuro- and computer sciences, ...
research
10/01/2020

Quantum Annealing Approaches to the Phase-Unwrapping Problem in Synthetic-Aperture Radar Imaging

The focus of this work is to explore the use of quantum annealing solver...
research
04/03/2019

Solving tiling puzzles with quantum annealing

To solve tiling puzzles, such as "pentomino" or "tetromino" puzzles, we ...

Please sign up or login with your details

Forgot password? Click here to reset