Embedding Equality Constraints of Optimization Problems into a Quantum Annealer
Quantum annealers such as D-Wave machines are designed to propose solutions for quadratic unconstrained binary optimization (QUBO) problems by mapping them onto the quantum processing unit, which tries to find a solution by measuring the parameters of a minimum-energy state of the quantum system. While many NP-hard problems can be easily formulated as binary quadratic optimization problems, such formulations almost always contain one or more constraints, which are not allowed in a QUBO. Embedding such constraints as quadratic penalties is the standard approach for addressing this issue, but it has drawbacks such as the introduction of large coefficients and using too many additional qubits. In this paper, we propose an alternative approach for implementing constraints based on a combinatorial design and solving mixed-integer linear programming (MILP) problems in order to find better embeddings of constraints of the type Σ xi = k for binary variables xi. Our approach is scalable to any number of variables and uses a linear number of ancillary variables for a fixed k.
- Research Organization:
- Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA); USDOE Laboratory Directed Research and Development (LDRD) Program
- Grant/Contract Number:
- 89233218CNA000001
- OSTI ID:
- 1544690
- Report Number(s):
- LA-UR-19-20224; ALGOCH
- Journal Information:
- Algorithms, Vol. 12, Issue 4; ISSN 1999-4893
- Publisher:
- MDPICopyright Statement
- Country of Publication:
- United States
- Language:
- English
A QUBO Model for the Traveling Salesman Problem with Time Windows
|
journal | October 2019 |
Similar Records
Quantum Annealing with Inequality Constraints: The Set Cover Problem
Balanced k-means clustering on an adiabatic quantum computer