Transfer Learning for Deep-Unfolded Combinatorial Optimization Solver with Quantum Annealer

Abstract

Quantum annealing (QA) has attracted research interest as a sampler and combinatorial optimization problem (COP) solver. A recently proposed sampling-based solver for QA significantly reduces the required number of qubits, being capable of large COPs. In relation to this, a trainable sampling-based COP solver has been proposed that optimizes its internal parameters from a dataset by using a deep learning technique called deep unfolding. Although learning the internal parameters accelerates the convergence speed, the sampler in the trainable solver is restricted to using a classical sampler owing to the training cost. In this study, to utilize QA in the trainable solver, we propose classical-quantum transfer learning, where parameters are trained classically, and the trained parameters are used in the solver with QA. The results of numerical experiments demonstrate that the trainable quantum COP solver using classical-quantum transfer learning improves convergence speed and execution time over the original solver.

8 pages, 6 figures

References in corpus (16)

• Theory of Quantum Annealing of an Ising Spin Glass
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Mathematical Foundation of Quantum Annealing
• What is the Computational Value of Finite Range Tunneling?
• Tensor network states and geometry
• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• Trainable ISTA for Sparse Signal Recovery
• Quantum versus Classical Annealing of Ising Spin Glasses
• Quantum Annealing Correction with Minor Embedding
• A Quantum Approach to Classical Statistical Mechanics
• Classical-to-quantum convolutional neural network transfer learning
• Simulated quantum annealing as a simulator of non-equilibrium quantum dynamics
• On the dynamics of Simulated Quantum Annealing in random Ising chains
• Hubbard-Stratonovich Detector for Simple Trainable MIMO Signal Detection
• Convergence Acceleration of Markov Chain Monte Carlo-based Gradient Descent by Deep Unfolding
• Deep Unfolded Local Quantum Annealing