DeepAI AI Chat
Log In Sign Up

Breaking limitation of quantum annealer in solving optimization problems under constraints

by   Masayuki Ohzeki, et al.

Quantum annealing is a generic solver for optimization problems that uses fictitious quantum fluctuation. The most groundbreaking progress in the research field of quantum annealing is its hardware implementation, i.e., the so-called quantum annealer, using artificial spins. However, the connectivity between the artificial spins is sparse and limited on a special network known as the chimera graph. Several embedding techniques have been proposed, but the number of logical spins, which represents the optimization problems to be solved, is drastically reduced. In particular, an optimization problem including fully or even partly connected spins suffers from low embeddable size on the chimera graph. In the present study, we propose an alternative approach to solve a large-scale optimization problem on the chimera graph via a well-known method in statistical mechanics called the Hubbard-Stratonovich transformation or its variants. The proposed method can be used to deal with a fully connected Ising model without embedding on the chimera graph and leads to nontrivial results of the optimization problem. We tested the proposed method with a number of partition problems involving solving linear equations and the traffic flow optimization problem in Sendai and Kyoto cities in Japan.


page 1

page 10

page 11


Statistical Analysis of Quantum Annealing

Quantum computers use quantum resources to carry out computational tasks...

Petri Net Modeling for Ising Model Formulation in Quantum Annealing

Quantum annealing is an emerging new platform for combinatorial optimiza...

Combinatorial Optimization by Decomposition on Hybrid CPU--non-CPU Solver Architectures

The advent of new special-purpose hardware such as FPGA or ASIC-based an...

Physics-inspired optimization for constraint-satisfaction problems using a digital annealer

The Fujitsu Digital Annealer is designed to solve fully-connected quadra...

Quadratization in discrete optimization and quantum mechanics

A book about turning high-degree optimization problems into quadratic op...

Message-passing algorithm of quantum annealing with nonstoquastic Hamiltonian

Quantum annealing (QA) is a generic method for solving optimization prob...

Pegasus: The second connectivity graph for large-scale quantum annealing hardware

Pegasus is a graph which offers substantially increased connectivity bet...