Practical integer-to-binary mapping for quantum annealers

Recent advancements in quantum annealing hardware and numerous studies in this area suggest that quantum annealers have the potential to be effective in solving unconstrained binary quadratic programming problems. Naturally, one may desire to expand the application domain of these machines to proble...

Full description

Saved in:
Bibliographic Details
Published in:Quantum information processing Vol. 18; no. 4; pp. 1 - 24
Main Authors: Karimi, Sahar, Ronagh, Pooya
Format: Journal Article
Language:English
Published: New York Springer US 01.04.2019
Springer Nature B.V
Subjects:
Algorithms
Coding
Coefficients
Data Structures and Information Theory
Integer programming
Integers
Mapping
Mathematical Physics
Mathematical programming
Physics
Physics and Astronomy
Quadratic programming
Quantum Computing
Quantum Information Technology
Quantum Physics
Spintronics
Upper bounds
Integer programming
Integer encoding
Bounded-coefficient encoding
Adiabatic quantum computation
Simulated quantum annealing
ISSN:1570-0755, 1573-1332
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Recent advancements in quantum annealing hardware and numerous studies in this area suggest that quantum annealers have the potential to be effective in solving unconstrained binary quadratic programming problems. Naturally, one may desire to expand the application domain of these machines to problems with general discrete variables. In this paper, we explore the possibility of employing quantum annealers to solve unconstrained quadratic programming problems over a bounded integer domain. We present an approach for encoding integer variables into binary ones, thereby representing unconstrained integer quadratic programming problems as unconstrained binary quadratic programming problems. To respect some of the limitations of the currently developed quantum annealers, we propose an integer encoding, named bounded-coefficient encoding , in which we limit the size of the coefficients that appear in the encoding. Furthermore, we propose an algorithm for finding the upper bound on the coefficients of the encoding using the precision of the machine and the coefficients of the original integer problem. We experimentally show that this approach is far more resilient to the noise of the quantum annealers compared to traditional approaches for the encoding of integers in base two. In addition, we perform time-to-solution analysis of various integer encoding strategies with respect to the size of integer programming problems and observe favorable performance from the bounded-coefficient encoding relative to that of the unary and binary encodings.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1570-0755
1573-1332
DOI:10.1007/s11128-019-2213-x