Solving linear systems by quadratic unconstrained binary optimization on D-Wave quantum annealing device

Kyungtaek Jun, Rebecca Conley, Yecheng Huang, Hyunkyung Lim, Kwangmin Yu

Published Apr 9, 2021• 6 citations

Abstract

Many quantum computing algorithms are being developed with the advent of quantum computers. Solving linear systems is one of the most fundamental problems in almost all of science and engineering. HHL algorithm, a monumental quantum algorithm for solving linear systems on the gate model quantum computers, was invented and several advanced variations have been developed. However, HHL-based algorithms have a lot of limitations in spite of their importance. We address solving linear systems on a D-Wave quantum annealing device. To formulate a quadratic unconstrained binary optimization (QUBO) model for a linear system solving problem, we make use of a linear least-square problem with binary representation of the solution. We validate this QUBO model on the D-Wave system and discuss the results.

DOI: 10.1117/12.2591588

Related papers

Quantum optimization algorithm for solving elliptic boundary value problems on D-Wave quantum annealing device

Rebecca Conley, Deokkyu Choi, Gregory Medwig +4 more

The quantum annealing devices, which encode the solution to a computational problem in the ground state of a quantum Hamiltonian, are implemented in D-Wave systems with more than 2,000 qubits. However, quantum annealing can solve only a classical combinatorial optimization problem such as an Ising model, or equivalently, a quadratic unconstrained binary optimization (QUBO) problem. In this paper, we formulate the QUBO model to solve elliptic problems with Dirichlet and Neumann boundary conditions using the finite element method. In this formulation, we develop the objective function of quadratic binary variables represented by qubits and the system finds the binary string combination minimizing the objective function globally. Based on the QUBO formulation, we introduce an iterative algorithm to solve the elliptic problems. We discuss the validation of the modeling on the D-Wave quantum annealing system.

Quantum Computing, Communication, and SimulationMar 8, 20237 citations

QUBO formulations for numerical quantum computing

Kyungtaek Jun

With the advent of quantum computers, many quantum computing algorithms are being developed. Solving linear systems is one of the most fundamental problems in almost all science and engineering. The Harrow-Hassidim-Lloyd algorithm, a monumental quantum algorithm for solving linear systems on gate model quantum computers, was invented and several advanced variations have been developed. For a given n by n matrix A and a vector b, we will find unconstrained binary optimization (QUBO) models for a vector x that satisfies Ax=b. To formulate QUBO models for a linear system solving problem, we make use of a linear least-square problem with binary representation of the solution. We validate those QUBO models on the D-Wave system and discuss the results. For a simple system, we provide a Python code to calculate the matrix characterizing the relationship between the variables and to print the test code that can be used directly in the D-Wave system.

arXiv:2106.10819Jun 21, 20210 citations

QUBO formulations for a system of linear equations

Kyungtaek Jun

Abstract With the advent of quantum computers, many quantum computing algorithms are being developed. Solving linear systems is one of the most fundamental problems in almost all of science and engineering. Harrow-Hassidim-Lloyd algorithm, a monumental quantum algorithm for solving linear systems on the gate model quantum computers, was invented and several advanced variations have been developed. For a given square matrix A∈R(n×n) and a vector b∈R(n), we will find unconstrained binary optimization (QUBO) models for a vector x∈R(n) that satisfies Ax=b. To formulate QUBO models for a linear system solving problem, we make use of a linear least-square problem with binary representation of the solution. We validate those QUBO models on the D-Wave system and discuss the results. For a simple system, We provide a python code to calculate the matrix characterizing the relationship between the variables and to print the test code that can be used directly in D-Wave system.

Results in Control and OptimizationFeb 5, 202420 citations

Constraint Solving by Quantum Annealing

Philippe Codognet

We present experiments in solving combinatorial optimization and constraint satisfaction problems by means of Quantum Annealing. We describe how to model classic constraint problems such as N-queens and Magic Square as well as hard combinatorial problems such as the Costas Array Problem or the Quadratic Assignment Problem in terms of QUBO (Quadratic Unconstrained Binary Optimization). QUBO is the input language of quantum computers based on quantum annealing such as the D-Wave systems and of the ”quantum-inspired” but classical devices such as Fujitsu’s Digital Annealing Unit or Hitachi’s CMOS Annealing Machine. We present preliminary results for solving these combinatorial optimization and constraint satisfaction problems by implementation on the D-Wave quantum computer.

International Conference on Parallel Processing Workshops (ICPPW)Aug 9, 20218 citations

Quantum Optimization Computed Tomography Algorithm with Constraints

Hyunju Lee, Kyungtaek Jun

The emergence of quantum annealers has catalyzed the development of quantum optimization algorithms across various fields. The formulation of a quadratic unconstrained binary optimization (QUBO) model for quantum linear systems suggests that quantum optimization algorithms can play an important role in science and engineering. Recently, a QUBO model was developed by applying a quantum linear system to computed tomography (CT) image reconstruction to clearly show the internal structure of the sample. To date, ultra-clear CT images have not been reconstructed using quantum optimization algorithms owing to limitations in logical qubits. However, the quantum CT image reconstruction algorithm using a quantum linear system provides confidence in the accuracy of the CT image by leveraging the difference between the global and theoretical minimum energies. In this paper, we propose an algorithm that can use two or more QUBO models for CT image reconstruction. The proposed algorithm formulates several QUBO models from CT image reconstruction and verifies them using the hybrid solver of the D-Wave system. The proposed algorithm suggests that quantum-optimized CT algorithms can make greater progress in the future.

IEEE International Conference on Quantum Computing and Engineering (QCE)Sep 15, 20240 citations

HUBO formulations for solving the eigenvalue problem

Kyungtaek Jun, Hyunju Lee

Solving the eigenvalue problem is particularly important in almost all fields of science and engineering. With the development of quantum computers, multiple algorithms have been proposed for this purpose. However, such methods are usually only applicable to matrices of specific types, such as unitary or Hermitian matrices. The quantum annealer of the D-Wave, a quantum computer, returns the minimum value of the quadratic unconstrained binary optimization (QUBO) model. Thus, quantum annealers can be leveraged to solve arbitrary eigenvalue problems by formulating corresponding QUBO models. In this paper, we propose two higher-order unconstrained optimization (HUBO) formulations to solve eigenvalue problems involving n×n general matrices. In addition, we use a formula to reduce the order and convert the HUBO model into a QUBO model. Further, by using a quantum approximate optimization algorithm, this method can be extended to a gate-model quantum computer.

Results in Control and OptimizationMar 22, 20237 citations