On the hardness of quadratic unconstrained binary optimization problems

@inproceedings{Mehta2022OnTH,
  title={On the hardness of quadratic unconstrained binary optimization problems},
  author={Vrinda Mehta and Fengping Jin and Kristel Michielsen and Hans De Raedt},
  booktitle={Frontiers in Physics},
  year={2022}
}
We use exact enumeration to characterize the solutions of quadratic unconstrained binary optimization problems of less than 21 variables in terms of their distributions of Hamming distances to close-by solutions. We also perform experiments with the D-Wave Advantage 5.1 quantum annealer, solving many instances of up to 170-variable, quadratic unconstrained binary optimization problems. Our results demonstrate that the exponents characterizing the success probability of a D-Wave annealer to… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 17 REFERENCES

Monte Carlo Search for Very Hard KSAT Realizations for Use in Quantum Annealing

Using powerful Multicanonical Ensemble Monte Carlo methods from statistical physics we explore the realization space of random K satisfiability (KSAT) in search for computational hard problems, most

Quantum annealing for hard 2-satisfiability problems: Distribution and scaling of minimum energy gap and success probability

Vrinda Mehta, 2 Fengping Jin, Hans De Raedt, 3 and Kristel Michielsen 2, 4, ∗ Institute for Advanced Simulation, Jülich Supercomputing Centre, Forschungszentrum Jülich, D-52425 Jülich, Germany RWTH

JUWELS Cluster and Booster: Exascale Pathfinder with Modular Supercomputing Architecture at Juelich Supercomputing Centre

  • Damián Alvarez
  • Computer Science
    Journal of large-scale research facilities JLSRF
  • 2021
TLDR
The architecture of the JUWELS system is described in detail from a users perspective, and further insights into the administrative infrastructure used to operate the supercomputer are provided.

Quantum annealing with trigger Hamiltonians: Application to 2-satisfiability and nonstoquastic problems

Vrinda Mehta, 2 Fengping Jin, Hans De Raedt, 3 and Kristel Michielsen 2, 4, ∗ Institute for Advanced Simulation, Jülich Supercomputing Centre, Forschungszentrum Jülich, D-52425 Jülich, Germany. RWTH

The D-Wave Advantage System : An Overview

  • Business
  • 2020
This report presents a high-level overview of the D-Wave AdvantageTM quantum computer, with a comparison to its predecessor, the D-Wave 2000QTM system. The Advantage quantum processing unit (QPU) can

Beweis des Adiabatensatzes

ZusammenfassungDer Adiabatensatz in der neuen Quantenmechanik wird für den Fall des Punktspektrums in mathematisch strenger Weise bewiesen, wobei er sich auch bei einer vorübergehenden Entartung des

On the computational complexity of Ising spin glass models

TLDR
In a spin glass with Ising spins, the problems of computing the magnetic partition function and finding a ground state are studied and are shown to belong to the class of NP-hard problems, both in the two-dimensional case within a magnetic field, and in the three-dimensional cases.

Quantum annealing with manufactured spins

TLDR
This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples, and may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effective approaches to solving certain classes of hard combinatorial optimization problems.

Quantum annealing in the transverse Ising model

We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between