Abstract The Integrated Side Lobe Ratio (ISLR) problem the authors consider here consists in finding optimal sequences of phase shifts in order to minimise the mean squared cross‐correlation side lobes of a transmitted radar signal and a mismatched replica. Currently, ISLR does not seem to be easier than the general polynomial unconstrained binary problem, which is NP‐hard. In their work, the authors aim to take advantage of the scalability of quantum computing to find new optima, by solving the ISLR problem on a quantum annealer. This quantum device is designed to solve quadratic optimisation problems with binary variables (QUBO). After proposing suitable formulation for different instances of the ISLR, the authors discuss the performances and the scalability of their approach on the D‐Wave quantum computer. More broadly, their work enlightens the limits and potential of the adiabatic quantum computation for the solving of large instances of combinatorial optimisation problems.
Abstract The Integrated Side Lobe Ratio (ISLR) problem the authors consider here consists in finding optimal sequences of phase shifts in order to minimise the mean squared cross‐correlation side lobes of a transmitted radar signal and a mismatched replica. Currently, ISLR does not seem to be easier than the general polynomial unconstrained binary problem, which is NP‐hard. In their work, the authors aim to take advantage of the scalability of quantum computing to find new optima, by solving the ISLR problem on a quantum annealer. This quantum device is designed to solve quadratic optimisation problems with binary variables (QUBO). After proposing suitable formulation for different instances of the ISLR, the authors discuss the performances and the scalability of their approach on the D‐Wave quantum computer. More broadly, their work enlightens the limits and potential of the adiabatic quantum computation for the solving of large instances of combinatorial optimisation problems.
The Integrated Side Lobe Ratio (ISLR) problem we consider here consists in finding optimal sequences of phase shifts in order to minimize the mean squared cross-correlation sidelobes of a transmitted radar signal and a mismatched replica. Given a finite set of quantized phase shifts, the exponentially increasing number of possible sequences leads to long-time processing and approximated results. Currently, ISLR does not seem to be easier than the general polynomial unconstrained binary problem, which is NP-hard. Our contribution is to implement this problem on a Quantum Annealer, a kind of Quantum Computer designed to solve quadratic optimization problems with binary variables. We cast the problem in a suitable formulation to be run on the available DWave quantum device and discuss the performances. Our work shows two limiting factors for scalability: A hardware related one and constraint implementation in the QUBO formulation. More broadly, this study enlightens the limits and the potential of Adiabatic Quantum Computation in terms of speedup and high-scaled resolution of a class of combinatory optimization problems.
Abstract In image processing, image segmentation is the process of partitioning a digital image into multiple image segments. Among state‐of‐the‐art methods, Markov random fields can be used to model dependencies between pixels and achieve a segmentation by minimising an associated cost function. Currently, finding the optimal set of segments for a given image modelled as a Markov random fields appears to be NP‐hard. The authors aim to take advantage of the exponential scalability of quantum computing to speed up the segmentation of synthetic aperture radar images. For that purpose, the authors propose a hybrid quantum annealing classical optimisation expectation maximisation algorithm to obtain optimal sets of segments. After proposing suitable formulations, the authors discuss the performances and the scalability of authors’ approach on the D‐Wave quantum computer. The authors also propose a short study of optimal computation parameters to enlighten the limits and potential of the adiabatic quantum computation to solve large instances of combinatorial optimisation problems.
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 ∑ x i = k for binary variables x i. Our approach is scalable to any number of variables and uses a linear number of ancillary variables for a fixed k.
Quantum annealers such as the D-Wave 2X computer are designed to natively solve Quadratic Unconstrained Binary Optimization (QUBO) problems to optimality or near optimality. Most NP-hard problems, which are hard for classical computers, can be naturally described as quadratic binary problems that contain a quadratic binary objective function and one or more constraints. Since a QUBO cannot have constraints, each such constraint has to be added to the objective function as a penalty, in order to solve on D-Wave. For a minimization problem, for instance, such penalty can be a quadratic term that gets a value zero, if the constraint is satisfied, and a large value, if it is not. In many cases, however, the penalty can significantly increase the number of quadratic terms in the resulting QUBO and make it too large to embed into the D-Wave hardware. In this paper, we develop an alternative method for formulating and embedding constraints of the type Σi=1sxi=1, which is much more scalable than the existing ones, and analyze the properties of the resulting embeddings.
Quantum annealing device has shown a great potential in solving discrete problems that are theoretically and empirically hard. Boolean Satisfiability (SAT) problem, determining if there is an assignment of variables that satisfies a given Boolean function, is the first proven NP-complete problem widely used in various domains. Here, we present a novel mapping of the SAT problem to the quadratic unconstrained binary optimization problem (QUBO), and further develop a tool flow embedding the proposed QUBO to the architecture of the commercialized quantum computer D-Wave. By leveraging electronic design automation techniques including synthesis, placement and routing, this is not only the first work providing the detail flow that embeds the QUBO, but also a technique scalable for real world applications and some hard SAT problems with over 6000 variables in QUBO. Based on our results, we discuss the challenges in solving SAT using the current generation of annealing device, and explore the problem solving capability of future quantum annealing computers.
Abstract Quantum computers have strict requirements for the problems that they can efficiently solve. One of the principal limiting factor for the performances of noisy intermediate-scale quantum (NISQ) devices is the number of qubits required by the running algorithm. Several combinatorial optimization problems can be solved with NISQ devices once that a corresponding quadratic unconstrained binary optimization (QUBO) form is derived. Numerous techniques have been proposed to achieve such reformulations and, depending on the method chosen, the number of binary variables required, and therefore of qubits, can vary considerably. The aim of this work is to drastically reduce the variables needed for these QUBO reformulations in order to unlock the possibility to efficiently obtain optimal solutions for a class of optimization problems with NISQ devices. This goal is achieved by introducing novel tools that allow an efficient use of slack variables, even for problems with non-linear constraints, without the need to approximate the starting problem. We divide our new techniques in two independent parts, called the iterative quadratic polynomial and the master-satellite methods. Hence, we show how to apply our techniques in case of an NP-hard optimization problem inspired by a real-world financial scenario called Max-Profit Balance Settlement . We follow by submitting several instances of this problem to two D-wave quantum annealers, comparing the performances of our novel approach with the standard methods used in these scenarios. Moreover, this study allows to appreciate several performance differences between the D-wave Advantage and next-generation Advantage2 quantum annealers. We show that the adoption of our techniques in this context allows to obtain QUBO formulations with significantly fewer slack variables, i.e. around 90% less, and D-wave annealers provide considerably higher correct solution rates, which moreover do not decrease with the input size as fast as when adopting standard techniques.