Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models

  title={Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models},
  author={Fred W. Glover and Gary A. Kochenberger and Yu Du},
  journal={Ann. Oper. Res.},
The Quadratic Unconstrained Binary Optimization (QUBO) model has gained prominence in recent years with the discovery that it unifies a rich variety of combinatorial optimization problems. By its association with the Ising problem in physics, the QUBO model has emerged as an underpinning of the quantum computing area known as quantum annealing and has become a subject of study in neuromorphic computing. Through these connections, QUBO models lie at the heart of experimentation carried out with… 
Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange
It is shown how the modeling and solution capability for the AEP instance of QUBO-Plus models provides a framework for solving a broad range of problems arising in financial, industrial, scientific, and social settings.
Testing a QUBO Formulation of Core-periphery Partitioning on a Quantum Annealer
A new kernel that quantifies success for the task of computing a coreperiphery partition for an undirected network is proposed and a sparsified version of the original QUBO is developed which increases the available problem dimension for the quantum annealer.
Machine learning framework for quantum sampling of highly constrained, continuous optimization problems
This work developed a generic, machine learning-based framework for mapping continuous-space inverse design problems into surrogate quadratic unconstrained binary optimization (QUBO) problems by employing a binary variational autoencoder and a factorization machine.
Quantum Annealing Formulation for Binary Neural Networks
This work devise a quadratic unconstrained binary optimization formulation for the training problem of binary neural networks, and shows how the problem can be optimized directly on a quantum annealer, thereby opening up to the potential gains of quantum computing.
Domain-Specific Quantum Architecture Optimization
This paper provides performance guarantees by integrating architecture optimization with an optimal compiler, evaluates the impact of connectivity customization under a realistic crosstalk error model, and benchmarks on realistic circuits of near-term interest, such as the quantum approximate optimization algorithm (QAOA) and quantum convolutional neural network (QCNN).
Calculating Nash Equilibrium on Quantum Annealers
It is shown that adding penalty terms to the quadratic function formulation of Nash equilibrium gives a quadRatic unconstrained binary optimization (QUBO) formulation of this problem that can be executed on quantum annealers.
Characterization of QUBO Reformulations for the Maximum k-Colorable Subgraph Problem
Both adiabatic quantum computers, and algorithms for gate-based quantum computers are able to address the solution of quadratic unconstrained binary optimization (QUBO) problems. This allows the use
Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing
The implementation of the Hubbard-Stratonovich transformation carried out in this paper on a scheduling use case suggests that this approach could be investigated further and applied to a variety of real-life integer programming problems under multiple constraints to lower the cost of mapping to QUBO, a key step towards the near-term practical application of quantum computing.
The Useful Quantum Computing Techniques for Artificial Intelligence Engineers
Some useful quantum computing techniques for AI engineers such as Quadratic Unconstrained Binary Optimization (QUBO), Variational Quantum Eigensolver (VQE), Quantum Approximate Optimization Algorithm (QAOA), and Harrow-Hassidim-Lloyd (HHL) algorithm are introduced.
When to Build Quantum Software?
Design of an interactive advisor is presented, which augments users while deciding to invest into quantum software development as a plausible future option in their application context and business process modeling and natural language similarity analysis are applied to associated business context with computational problems.


The Quantum Approximation Optimization Algorithm for MaxCut: A Fermionic View
The parameter landscape is numerically investigated and it is shown that it is a simple one in the sense of having no local optima, which greatly simplifies numerical search for the optimal values of the parameters.
Reducing Binary Quadratic Forms for More Scalable Quantum Annealing
  • Georg Hahn, H. Djidjev
  • Computer Science
    2017 IEEE International Conference on Rebooting Computing (ICRC)
  • 2017
This paper investigates preprocessing methods for two important NP-hard graph problems, the computation of a maximum clique and a maximum cut in a graph, and shows that the identification of strong and weak persistencies for those two optimization problems are very instance-specific and can lead to substantial reductions in the number of variables.
Finding Maximum Cliques on the D-Wave Quantum Annealer
It is demonstrated that on random graphs that fit DW, no quantum speedup can be observed compared with the classical algorithms, and for instances specifically designed to fit well the DW qubit interconnection network, substantial speed-ups in computing time over classical approaches are observed.
Efficiently embedding QUBO problems on adiabatic quantum computers
This work proposes an efficient embedding algorithm, that lets us embed QUBO problems fast, uses less qubits and gets the objective function value close to the global minimum value, and compares the performance of the algorithm to that of D-Wave’s embedding algorithms.
Quadratic Unconstrained Binary Optimization (QUBO) on neuromorphic computing system
This paper implemented the NP-hard optimization problem called Quadratic Unconstrained Binary Optimization (QUBO) problem for the solution of graph problems on the IBM's Neurosynaptic TrueNorth System and is the important first step towards the solutions of QUBO on Neuromorphic computing systems.
Solving Large Maximum Clique Problems on a Quantum Annealer
This article investigates methods for decomposing larger problem instances into smaller ones, which can subsequently be solved on D-Wave, and prune as many generated subproblems that don’t contribute to the solution as possible in order to reduce the computational complexity.
Reexamination of the evidence for entanglement in a quantum annealer
A recent experiment [T. Lanting et al., Phys. Rev. X 4, 021041 (2014)] claimed to provide evidence of up to eight-qubit entanglement in a D-Wave quantum annealing device. However, entanglement was
Decoherence in adiabatic quantum computation
Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is
Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
An in-depth study of the performance of QAOA on MaxCut problems is provided by developing an efficient parameter-optimization procedure and revealing its ability to exploit non-adiabatic operations, illustrating that optimization will be important only for problem sizes beyond numerical simulations, but accessible on near-term devices.
Traffic Flow Optimization Using a Quantum Annealer
This paper shows how to map certain parts of the real-world traffic flow optimization problem to be suitable for quantum annealing, and shows that time-critical optimization tasks, such as continuous redistribution of position data for cars in dense road networks, are suitable candidates for quantum applications.