Quantum Annealing with a Quantum Neural Network: Width of Annealing Matters
Organizations: Department of Physics, College of Science, Shiraz University, Shiraz 71454, Iran · Leiden Academic Centre for Drug Research, Faculty of Mathematics and Natural Sciences, Leiden University, PO Box 9500-2300 RA Leiden, The Netherlands
Abstract
Quantum annealing is a promising quantum algorithm for dealing with computationally hard optimization problems. Currently available hardware can implement the algorithm for a significant class of Hamiltonian problems. However, its performance is especially limited in discontinuous quantum phase transitions, where the energy gap shrinks exponentially with system size. In this paper, we introduce an extension of quantum annealing to a quantum neural network and study its performance in a number of prototypical optimization problems. In particular, we observe that already a random quantum annealing network of width W = 2 can exponentially reduce the number of evolution layers or depth of the annealing process in the quantum search problem. By tuning the network parameters the search problem can be solved with exponentially small errors by a quantum perceptron of depth L = 1 and width W = 2. The findings show that width of a quantum annealing network is critical to enhance the success probability of the algorithm by providing a larger and learnable evolution space for the annealing process.
Figures & tables
| 0.956 | -0.934 | 0.169 | -0.962 | 0.829 | 0.843 | |
| 0.977 | -0.979 | 0.707 | -0.805 | -0.931 | -0.931 | |
| -0.828 | 0.828 | -0.659 | 0.624 | -0.739 | -0.739 |
Quantum Annealing
Quantum annealing uses quantum processors to search for low-energy solutions to optimization and sampling problems.
See all 15 papers