SyncAI.news, a Varaisys broadcasting
Quantum Annealing with a Quantum Neural Network: Width of Annealing Matters
MA

Mojtaba Asadollahi, Danial Khajehzadeh, Abolfazl Ramezanpour

· 1 min read

ResearcharXiv cs.LG

Quantum Annealing with a Quantum Neural Network: Width of Annealing Matters

arXiv:2611.24089v1 Announce Type: cross 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.

Original source

This story was published by arXiv cs.LG and written by Mojtaba Asadollahi, Danial Khajehzadeh, Abolfazl Ramezanpour. SyncAI.news shows a preview; the complete article is on the publisher's site.

Read the full story on arxiv.org

Similar News