Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2505.16332 · Future Generation Computer Systems

Is quantum optimization ready? An effort towards neural network compression using adiabatic quantum computing

Zhehui Wang, Benjamin Chen Ming Choong, Tian Huang, Daniel Gerlinghoff, Rick Siow Mong Goh, Cheng Liu, Tao Luo

Published May 30, 2025• 9 citations
arXivHTMLPDF
DOI
10.1016/j.future.2025.107908

Related papers

Training neural networks with universal adiabatic quantum computing

Steven Adam Abel, Juan Carlos Criado, Michael Spannowsky

The training of neural networks (NNs) is a computationally intensive task requiring significant time and resources. This article presents a novel approach to NN training using adiabatic quantum computing (AQC), a paradigm that leverages the principles of adiabatic evolution to solve optimization problems. We propose a universal AQC method that can be implemented on gate quantum computers, allowing for a broad range of Hamiltonians and thus enabling the training of expressive neural networks. We apply this approach to various neural networks with continuous, discrete, and binary weights. The study results indicate that AQC can very efficiently evaluate the global minimum of the loss function, offering a promising alternative to classical training methods.

arXiv:2308.13028•Frontiers in Artificial Intelligence•Jun 21, 2024•6 citations

QUANTUM MACHINE LEARNING: INTEGRATING QUANTUM COMPUTING PRINCIPLES INTO NEURAL NETWORK OPTIMIZATION

Hammad Ahmad, Muhammad Shahzad, Qurban Ali Khoso, Mian Muhammad Danyal, Abdul Qadeer Khan

•Dec 17, 2025•0 citations

Speed-up of Neuromorphic Adiabatic Quantum Computation by Local Adiabatic Evolution

Mitsunaga Kinjo, Katsuhiko Shimabukuro

Farhi et al. have proposed an adiabatic quantum computation (AQC), which can be applied to NP-problems if one can know an appropriate Hamiltonian for a target problem. We have proposed a neuromorphic adiabatic quantum computation (NAQC) as the AQC with energy dissipation and an efficient method for designing a final Hamiltonian in consideration of the analogy with a neural network. The NAQC can be applied to optimization problems if its cost function can be expressed in a quadratic form. And successful operations have been confirmed by numerical simulations. In addition, local adiabatic evolution for quantum search have proposed by Roland et al. in order to speed-up the calculation time. In this paper, we show preliminary results for NAQC with local adiabatic evolution by numerical simulations.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 1, 2011•1 citation

Quantum Adiabatic Evolution Algorithm for a Quantum Neural Network

Mitsunaga Kinjo, Shigeo Sato, Koji Nakajima

Lecture notes in computer science•Jan 1, 2003•6 citations

Applications of Quantum Computation in Artificial Neural Network: Opportunities and Challenges

Pranab Dey

Springer eBooks•Jan 1, 2025•1 citation

A New Method of Image Compression Based on Quantum Neural Network

Huifang Li, Mo Li

In this paper we combine with quantum neural networks and image compression using Quantum Gates as the basic unit of quantum computing neuron model, and establish a three layer Quantum Back Propagation Network model, then the model is used for realizing image compression and reconstruction. Since the initial weights of neural networks were slow convergence, we use Genetic Algorithm (GA) to optimize the neural network weights, and present a mechanism called clamping to improve the genetic algorithm. Finally, we combined the Genetic Algorithm with quantum neural networks to finish image compression. Through an experiment we can see the superiority of the improved algorithm.

Information Science and Management Engineering•Aug 1, 2010•18 citations
The training of neural networks (NNs) is a computationally intensive task requiring significant time and resources. This article presents a novel approach to NN training using adiabatic quantum computing (AQC), a paradigm that leverages the principles of adiabatic evolution to solve optimization problems. We propose a universal AQC method that can be implemented on gate quantum computers, allowing for a broad range of Hamiltonians and thus enabling the training of expressive neural networks. We apply this approach to various neural networks with continuous, discrete, and binary weights. The study results indicate that AQC can very efficiently evaluate the global minimum of the loss function, offering a promising alternative to classical training methods.
Farhi et al. have proposed an adiabatic quantum computation (AQC), which can be applied to NP-problems if one can know an appropriate Hamiltonian for a target problem. We have proposed a neuromorphic adiabatic quantum computation (NAQC) as the AQC with energy dissipation and an efficient method for designing a final Hamiltonian in consideration of the analogy with a neural network. The NAQC can be applied to optimization problems if its cost function can be expressed in a quadratic form. And successful operations have been confirmed by numerical simulations. In addition, local adiabatic evolution for quantum search have proposed by Roland et al. in order to speed-up the calculation time. In this paper, we show preliminary results for NAQC with local adiabatic evolution by numerical simulations.
In this paper we combine with quantum neural networks and image compression using Quantum Gates as the basic unit of quantum computing neuron model, and establish a three layer Quantum Back Propagation Network model, then the model is used for realizing image compression and reconstruction. Since the initial weights of neural networks were slow convergence, we use Genetic Algorithm (GA) to optimize the neural network weights, and present a mechanism called clamping to improve the genetic algorithm. Finally, we combined the Genetic Algorithm with quantum neural networks to finish image compression. Through an experiment we can see the superiority of the improved algorithm.