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

Radioelectronics Nanosystems Information Technologies

Capabilities of an adiabatic quantum computer for pattern recognition

Московский технический университет связи и информатики, E. V. Burlakov

Published Apr 15, 2025• 2 citations
Publisher

Abstract

This study compares three discrete-variable models: the fully connected Ising model, the quadratic unconstrained binary optimization model, and the Hopfield neural network. The analysis evaluates their potential interchangeability in solving optimization and pattern recognition tasks, as well as their applicability to quantum computing. A novel method for pattern storage and recognition is proposed, based on the dynamics of forward and reverse quantum annealing. This method has been successfully tested on a D-Wave adiabatic quantum computer. An optimal annealing parameter was empirically determined, maximizing recognition accuracy while minimizing annealing time. The study also highlights limitations related to the size and noise levels of the patterns, imposed by the quantum processor's architectural constraints. Finally, conclusions are drawn regarding the effectiveness implications of the proposed approach.

DOI
10.17725/j.rensit.2025.17.201

Related papers

Application of a Quantum Annealer for Pattern Recognition

E. V. Burlakov

Adiabatic quantum computing is successfully used to solve discrete optimization problems. The classical Hopfield neural network can also be applied to such problems but is primarily used for pattern recognition and reconstruction. Since its dynamics are deterministic, this can adversely affect its performance: the network sometimes gets trapped in local energy minima. This paper proposes a novel approach in which the Hopfield neural network learning rule (Hebbian rule) is combined with forward and reverse quantum annealing. This enables the use of adiabatic quantum annealers for pattern recognition, providing an alternative to traditional approaches.

Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)•May 12, 2025•1 citation

Quantum Hopfield Neural Network and Image Recognition

Ding Qiu-lin

The storage capacity of the conventional Hopfield network is the 0.14 times of the number of neurons(P=0.14N). Because of the huge difficulty in recognizing a large number of images or patterns, researchers are looking for new methods at all times. Quantum neural network (QNN) is a young and outlying science built upon the combination of classical neural network and quantum computing. A Quantum Hopfield neural network (QHNN) whose elements of the storage matrix are distributed in a probability way on the base of quantum linear superposition is presented for speeding up the images recognition and increasing the number of the images recognition. Contrasting to the conventional Hopfield neural network, the storage capacity of the QHNN is increased by a factor of 2N, where N is the number of neurons. Besides, the case analysis and simulation tests have been carried out for the recognition of images in this paper. The result indicates that QHNN can recognize the images or patterns effectively and its working process accords with quantum evolvement process.

•Jan 1, 2008•0 citations

An experimental study on binary optimization using quantum annealing in D-Wave

Nongmeikapam Brajabidhu Singh, Gopal Krishna, Arnab Roy +2 more

Quantum annealing is a field of quantum computing to solve complex optimization problems. NP problems are hard to obtain the optimal result in polynomial time, and quantum annealing is able to fasten the process of computation. This article proceeds through a brief introduction to quantum annealing and then performs an experimental study on unconstrained binary optimization. Two mathematical models, namely, QUBO and Ising, are used for the design of the optimization to experiment with a quantum computer architecture named D-Wave. Ising model maps the problem statement for realization into a time-dependent Hamiltonian. The obtained results are finally analyzed and explained.

International Conference on Informatics and Computing (ICIC)•Dec 8, 2022•3 citations

Quantum Annealing Formulation for Binary Neural Networks

Michele Sasdelli, Tat-Jun Chin

Quantum annealing is a promising paradigm for building practical quantum computers. Compared to other approaches, quantum annealing technology has been scaled up to a larger number of qubits. On the other hand, deep learning has been profoundly successful in pushing the boundaries of AI. It is thus natural to investigate potentially game changing technologies such as quantum annealers to augment the capabilities of deep learning. In this work, we explore binary neural networks, which are lightweight yet powerful models typically intended for resource constrained devices. Departing from current training regimes for binary networks that smooth/approximate the activation functions to make the network differentiable, we devise a quadratic unconstrained binary optimization formulation for the training problem. While the problem is intractable, i.e., the cost to estimate the binary weights scales exponentially with network size, we show how the problem can be optimized directly on a quantum annealer, thereby opening up to the potential gains of quantum computing. We experimentally validated our formulation via simulation and testing on an actual quantum annealer (D-Wave Advantage), the latter to the extent allowable by the capacity of current technology.

arXiv:2107.02751•International Conference on Digital Image Computing: Techniques and Applications (DICTA)•Nov 1, 2021•18 citations

Quantum annealing: next-generation computation and how to implement it when information is missing

Masayuki Ohzeki, Chako Takahashi, Shuntaro Okada +3 more

Recently, several powerful machines dedicated to solving combinatorial optimization problems through the Ising-model formulation have appeared. The trigger for the paradigm shift to a specialized machine for solving optimization problems was the D-Wave machine, which implements quantum annealing. Quantum annealing employs quantum fluctuations to find an optimal solution to an optimization problem with discrete variables. In particular, we input the optimization problem in the form of the Ising Hamiltonian, which is a specialized form of the quadratic unconstrained binary optimization problem. However, when we employ quantum annealing for a practical optimization problem, there are several issues. One typical issue is absence of the detailed form of the cost function, which characterizes the optimization problem. To input problems into specialized machines for solving an optimization problem, it is necessary to determine the unknown parameters within the Ising model. We propose a method to estimate the unknown parameters in the Ising Hamiltonian using compressed sensing. Furthermore, we analyze the theoretical limitations of our proposed method by employing the replica method, which is a sophisticated tool in statistical mechanics.

Nonlinear Theory and Its Applications IEICE•Jan 1, 2018•15 citations

Solving Portfolio Optimization Problems using Adiabatic Quantum Computing

Bartlomiej Kolodziejczyk

Abstract This study explores the application of adiabatic quantum computing to portfolio optimization, a critical problem in finance. By formulating the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model, the study integrates constraints such as expected return, transaction cost, and Environmental, Social, and Governance (ESG) scores. Simulations using D-Wave’s quantum annealer demonstrate the feasibility of optimizing portfolios comprising hundreds of assets with reduced computational time compared to classical methods. While current quantum devices face limitations in precision, this work lays the foundation for leveraging quantum technologies in financial optimization.

•Jul 30, 2025•0 citations
This study compares three discrete-variable models: the fully connected Ising model, the quadratic unconstrained binary optimization model, and the Hopfield neural network. The analysis evaluates their potential interchangeability in solving optimization and pattern recognition tasks, as well as their applicability to quantum computing. A novel method for pattern storage and recognition is proposed, based on the dynamics of forward and reverse quantum annealing. This method has been successfully tested on a D-Wave adiabatic quantum computer. An optimal annealing parameter was empirically determined, maximizing recognition accuracy while minimizing annealing time. The study also highlights limitations related to the size and noise levels of the patterns, imposed by the quantum processor's architectural constraints. Finally, conclusions are drawn regarding the effectiveness implications of the proposed approach.
Adiabatic quantum computing is successfully used to solve discrete optimization problems. The classical Hopfield neural network can also be applied to such problems but is primarily used for pattern recognition and reconstruction. Since its dynamics are deterministic, this can adversely affect its performance: the network sometimes gets trapped in local energy minima. This paper proposes a novel approach in which the Hopfield neural network learning rule (Hebbian rule) is combined with forward and reverse quantum annealing. This enables the use of adiabatic quantum annealers for pattern recognition, providing an alternative to traditional approaches.
The storage capacity of the conventional Hopfield network is the 0.14 times of the number of neurons(P=0.14N). Because of the huge difficulty in recognizing a large number of images or patterns, researchers are looking for new methods at all times. Quantum neural network (QNN) is a young and outlying science built upon the combination of classical neural network and quantum computing. A Quantum Hopfield neural network (QHNN) whose elements of the storage matrix are distributed in a probability way on the base of quantum linear superposition is presented for speeding up the images recognition and increasing the number of the images recognition. Contrasting to the conventional Hopfield neural network, the storage capacity of the QHNN is increased by a factor of 2N, where N is the number of neurons. Besides, the case analysis and simulation tests have been carried out for the recognition of images in this paper. The result indicates that QHNN can recognize the images or patterns effectively and its working process accords with quantum evolvement process.
Quantum annealing is a field of quantum computing to solve complex optimization problems. NP problems are hard to obtain the optimal result in polynomial time, and quantum annealing is able to fasten the process of computation. This article proceeds through a brief introduction to quantum annealing and then performs an experimental study on unconstrained binary optimization. Two mathematical models, namely, QUBO and Ising, are used for the design of the optimization to experiment with a quantum computer architecture named D-Wave. Ising model maps the problem statement for realization into a time-dependent Hamiltonian. The obtained results are finally analyzed and explained.
Quantum annealing is a promising paradigm for building practical quantum computers. Compared to other approaches, quantum annealing technology has been scaled up to a larger number of qubits. On the other hand, deep learning has been profoundly successful in pushing the boundaries of AI. It is thus natural to investigate potentially game changing technologies such as quantum annealers to augment the capabilities of deep learning. In this work, we explore binary neural networks, which are lightweight yet powerful models typically intended for resource constrained devices. Departing from current training regimes for binary networks that smooth/approximate the activation functions to make the network differentiable, we devise a quadratic unconstrained binary optimization formulation for the training problem. While the problem is intractable, i.e., the cost to estimate the binary weights scales exponentially with network size, we show how the problem can be optimized directly on a quantum annealer, thereby opening up to the potential gains of quantum computing. We experimentally validated our formulation via simulation and testing on an actual quantum annealer (D-Wave Advantage), the latter to the extent allowable by the capacity of current technology.
Recently, several powerful machines dedicated to solving combinatorial optimization problems through the Ising-model formulation have appeared. The trigger for the paradigm shift to a specialized machine for solving optimization problems was the D-Wave machine, which implements quantum annealing. Quantum annealing employs quantum fluctuations to find an optimal solution to an optimization problem with discrete variables. In particular, we input the optimization problem in the form of the Ising Hamiltonian, which is a specialized form of the quadratic unconstrained binary optimization problem. However, when we employ quantum annealing for a practical optimization problem, there are several issues. One typical issue is absence of the detailed form of the cost function, which characterizes the optimization problem. To input problems into specialized machines for solving an optimization problem, it is necessary to determine the unknown parameters within the Ising model. We propose a method to estimate the unknown parameters in the Ising Hamiltonian using compressed sensing. Furthermore, we analyze the theoretical limitations of our proposed method by employing the replica method, which is a sophisticated tool in statistical mechanics.
Abstract This study explores the application of adiabatic quantum computing to portfolio optimization, a critical problem in finance. By formulating the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model, the study integrates constraints such as expected return, transaction cost, and Environmental, Social, and Governance (ESG) scores. Simulations using D-Wave’s quantum annealer demonstrate the feasibility of optimizing portfolios comprising hundreds of assets with reduced computational time compared to classical methods. While current quantum devices face limitations in precision, this work lays the foundation for leveraging quantum technologies in financial optimization.