Deep Unfolded Local Quantum Annealing
arXiv:2408.03026 · doi:10.1103/PhysRevResearch.6.043325
Abstract
Local quantum annealing (LQA), an iterative algorithm, is designed to solve combinatorial optimization problems. It draws inspiration from QA, which utilizes adiabatic time evolution to determine the global minimum of a given objective function. In the original LQA, the classical Hamiltonian is minimized via gradient descent. The performance of LQA depends on the choice of the parameters. Owing to the non-convex nature of the original cost function, LQA often becomes trapped in local minima, limiting its effectiveness. To address this challenge, we combine LQA with a deep unfolding scheme, which enables us to tune the parameters from the training data via back-propagation. {As a demonstration, we apply the deep unfolded LQA to the Sherrington-Kirkpatrick model, which is a fundamental {model} in statistical physics.} Our findings exhibit that deep unfolded LQA outperforms the original LQA, exhibiting remarkable convergence speed and performance improvement. As the trained parameters can be generalized to unknown instances and different system sizes, our results have significant practical implications and provide valuable insights for real-world applications.
10 pages, 7 figures
References in corpus (23)
- Massive MIMO for Next Generation Wireless Systems
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Adiabatic Quantum Computing
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Quantum Annealing and Analog Quantum Computation
- Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
- Training variational quantum algorithms is NP-hard
- Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
- The Quantum Approximate Optimization Algorithm and the Sherrington-Kirkpatrick Model at Infinite Size
- A scalable control system for a superconducting adiabatic quantum optimization processor
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Quantum annealing with antiferromagnetic fluctuations
- Optimal Protocols in Quantum Annealing and QAOA Problems
- A scalable readout system for a superconducting adiabatic quantum optimization system
- Reverse annealing for the fully connected -spin model
- Tunneling and speedup in quantum optimization for permutation-symmetric problems
- Dynamics of reverse annealing for the fully-connected -spin model
- Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization
- 3-Regular 3-XORSAT Planted Solutions Benchmark of Classical and Quantum Heuristic Optimizers
- Mean field analysis of reverse annealing for code-division multiple-access multiuser detection
- Mean-Field Approximate Optimization Algorithm
- Hubbard-Stratonovich Detector for Simple Trainable MIMO Signal Detection
- Convergence Acceleration of Markov Chain Monte Carlo-based Gradient Descent by Deep Unfolding