Discrete optimization using quantum annealing on sparse Ising models

This paper discusses techniques for solving discrete optimization problems using quantumannealing. Practical issues likely to affect the computation include precision limitations, finitetemperature, bounded energy range, sparse connectivity, and small numbers of qubits. Toaddress these concerns we p...

Full description

Saved in:
Bibliographic Details
Published inFrontiers in physics Vol. 2
Main Authors Bian, Zhengbing, Chudak, Fabian, Israel, Robert, Lackey, Brad, Macready, William G., Roy, Aidan
Format Journal Article
LanguageEnglish
Published Frontiers Media S.A 18.09.2014
Subjects
constraint satisfaction
discrete optimization
Ising Model
penalty functions
Quantum Annealing
Online AccessGet full text

Cover

More Information
Summary:This paper discusses techniques for solving discrete optimization problems using quantumannealing. Practical issues likely to affect the computation include precision limitations, finitetemperature, bounded energy range, sparse connectivity, and small numbers of qubits. Toaddress these concerns we propose a way of finding energy representations with large classicalgaps between ground and first excited states, efficient algorithms for mapping non-compatibleIsing models into the hardware, and the use of decomposition methods for problems that aretoo large to fit in hardware. We validate the approach by describing experiments with D-Wavequantum hardware for low density parity check decoding with up to 1000 variables.
ISSN:2296-424X
2296-424X
DOI:10.3389/fphy.2014.00056