• Corpus ID: 239049662

Diversity measure for discrete optimization: Sampling rare solutions via algorithmic quantum annealing

  title={Diversity measure for discrete optimization: Sampling rare solutions via algorithmic quantum annealing},
  author={Masoud Mohseni and Marek M. Rams and Sergei V. Isakov and Daniel Eppens and Susanne Pielawa and Johan Strumpfer and Sergio Boixo and Hartmut Neven},
Sampling a diverse set of high-quality solutions for hard optimization problems is of great practical relevance in many scientific disciplines and applications, such as artificial intelligence and operations research. One of the main open problems is the lack of ergodicity, or mode collapse, for typical stochastic solvers based on Monte Carlo techniques leading to poor generalization or lack of robustness to uncertainties. Currently, there is no universal metric to quantify such performance… 

Figures from this paper


Diversity metric for evaluation of quantum annealing
Solving discrete NP-hard problems is an important part of scientific discoveries and operations research as well as many commercial applications. A commonly used metric to compare metaheuristic
Fair sampling of ground-state configurations of binary optimization problems.
An approach to sample ground-state (or low-energy) configurations for binary optimization problems and a simple heuristic to approximate the number of solutions of a degenerate problem is introduced.
Approximate optimization, sampling, and spin-glass droplet discovery with tensor networks.
A deterministic algorithm to efficiently sample high-quality solutions of certain spin-glass systems that encode hard optimization problems and a gradient-free approach that could provide new insight into the structure of disordered spin- glass complexes, with ramifications both for machine learning and noisy intermediate-scale quantum devices.
Quality Diversity: A New Frontier for Evolutionary Computation
A new approach is investigated that hybridizes multiple views of behaviors (called behavior characterizations) in the same run, which succeeds in overcoming some of the challenges associated with searching for QD with respect to a behavior characterization that is not necessarily sufficient for generating both quality and diversity at the same time.
Efficiency of Local Search with Multiple Local Optima
The aim of the paper consists of the estimation of the number N of local optima and the distributions of the sizes of their attraction basins, and the efficiency of this methodology for guiding the choice of modification operators, eventually leading to the design of problem-dependent optimization heuristics.
Defining and detecting quantum speedup
Here, it is shown how to define and measure quantum speedup and how to avoid pitfalls that might mask or fake such a speedup, and the subtle nature of the quantum speed up question is illustrated.
Inhomogeneous driving in quantum annealers can result in orders-of-magnitude improvements in performance
Quantum annealers are special-purpose quantum computers that primarily target solving Ising optimization problems. Theoretical work has predicted that the probability of a quantum annealer ending in
Strong disorder RG approach of random systems
Abstract There is a large variety of quantum and classical systems in which the quenched disorder plays a dominant role over quantum, thermal, or stochastic fluctuations: these systems display strong
Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension.
This work presents a cluster algorithm for Ising spin glasses that works in any space dimension and speeds up thermalization by at least one order of magnitude at temperatures where thermalization is typically difficult.
Unifying time evolution and optimization with matrix product states
We show that the time-dependent variational principle provides a unifying framework for time-evolution methods and optimization methods in the context of matrix product states. In particular, we