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

Chinese Journal of Quantum Electronics

Quantum associative memory based on entanglement

YU Xiao-min

Published Jan 1, 2005• 1 citation
OpenAlex

Abstract

An approach to constructing an artificial quantum associative memory based on entanglement (QuEAM) is discussed. The QuEAM is an exponential increase in the capacity of the memory when compared to classical associative memories such as the Hopfield network. According to the characteristics of amount of entanglement, the study algorithm based on Grover's well-known algorithm is locally magnified the probability amplitude for the qubit. The basic principle of entangled states is discussed. Concrete examples illustrating the properties of the proposed model are also presented.

Related papers

Artificial Associative Memory Using Quantum Processes

Dan A. Ventura

Abstract This paper discusses an approach to constructing an artificial quantum associative memory (QuAM). The QuAM makes use of two quantum computational algorithms, one for pattern storage and the other for pattern recall. The result is an exponential increase in the capacity of the memory when compared to traditional associative memories such as the Hopfield network. Further, the paper argues for considering pattern recall as a non-unitary process and demonstrates the utility of non-unitary operators for improving the pattern recall performance of the QuAM. 1.

•Jan 1, 1998•12 citations

Implementing associative memory with quantum neural networks

Jieyu Zhao

In this paper an attempt is made to implement associative memory with quantum neural networks. The quantum algorithms for the storage of pattern and the retrieval of information are presented. It is shown that the capacity and the processing speed of the quantum neural network increase exponentially compared to the conventional model. The neural computing method for the calculation of quantum entanglement is also discussed.

International Conference on Machine Learning and Cybernetics•Apr 12, 2005•2 citations

IMPLEMENTING ASSOCIATIVE MEMORY WITH QUANTUM NEURAL NETWORKS

Jie-W Zhao

a Abstract: 1 In this paper an attempt is made to implement associative memory with quantum neural networks. The quantum algorithms for the storage of pattern and the retrieval of information are presented. It is shown that the capacity and the processing speed of the quantum neural network increase exponentially compared to the conventional model. The neural computing method for the calculation of quantum entanglement is also discussed.

•Jan 1, 2004•0 citations

Quantum Associative Memory with Quantum Neural Network via Adiabatic Hamiltonian Evolution

Yoshihiro Osakabe, Hisanao Akima, Masao Sakuraba +2 more

There is increasing interest in quantum computing, because of its enormous computing potential. A small number of powerful quantum algorithms have been proposed to date; however, the development of new quantum algorithms for practical use remains essential. Parallel computing with a neural network has successfully realized certain unique functions such as learning and recognition; therefore, the introduction of certain neural computing techniques into quantum computing to enlarge the quantum computing application field is worthwhile. In this paper, a novel quantum associative memory (QuAM) is proposed, which is achieved with a quantum neural network by employing adiabatic Hamiltonian evolution. The memorization and retrieval procedures are inspired by the concept of associative memory realized with an artificial neural network. To study the detailed dynamics of our QuAM, we examine two types of Hamiltonians for pattern memorization. The first is a Hamiltonian having diagonal elements, which is known as an Ising Hamiltonian and which is similar to the cost function of a Hopfield network. The second is a Hamiltonian having non-diagonal elements, which is known as a neuro-inspired Hamiltonian and which is based on interactions between qubits. Numerical simulations indicate that the proposed methods for pattern memorization and retrieval work well with both types of Hamiltonians. Further, both Hamiltonians yield almost identical performance, although their retrieval properties differ. The QuAM exhibits new and unique features, such as a large memory capacity, which differs from a conventional neural associative memory.

IEICE Transactions on Information and Systems•Jan 1, 2017•3 citations

Associative Memory for Quantum Entangled States

Qiyuan Hu, Kartiek Agarwal, Ivar Martin

We generalize the canonical Hopfield model of associative memory, which stores classical states of individual spins, to store entangled quantum states. The construction is based on truncated projector-sum Hamiltonian, and we explicitly consider a special case that stores dimer singlet coverings of a spin-1/2 system. We analyze the stability of the stored memories and find that the capacity -- the number of stable patterns -- scales faster with the system size than one would expect from a naive analogy with the standard Hopfield model, suggesting a possible quantum advantage.

quant-pharXiv:2609.28726•Sep 25, 2026•0 citations

High-Capacity Quantum Associative Memories

M. C. Diamantini, Carlo A. Trugenberger

We review our models of quantum associative memories that represent the “quantization” of fully coupled neural networks like the Hopfield model. The idea is to replace the classical irreversible attractor dynamics driven by an Ising model with pattern-dependent weights by the reversible rotation of an input quantum state onto an output quantum state consisting of a linear superposition with probability amplitudes peaked on the stored pattern closest to the input in Hamming distance, resulting in a high probability of measuring a memory pattern very similar to the input. The unitary operator implementing this transformation can be formulated as a sequence of one-qubit and two-qubit elementary quantum gates and is thus the exponential of an ordered quantum Ising model with sequential operations and with pattern-dependent interactions, exactly as in the classical case. Probabilistic quantum memories, that make use of postselection of the measurement result of control qubits, overcome the famed linear storage limitation of their classical counterparts because they permit to completely eliminate crosstalk and spurious memories. The number of control qubits plays the role of an inverse fictitious temperature. The accuracy of pattern retrieval can be tuned by lowering the fictitious temperature under a critical value for quantum content association while the complexity of the retrieval algorithm remains polynomial for any number of patterns polynomial in the number of qubits. These models thus solve the capacity shortage problem of classical associative memories, providing a polynomial improvement in capacity. The price to pay is the probabilistic nature of information retrieval.

arXiv:1506.01231•Journal of Applied Mathematics and Physics•Jan 1, 2016•8 citations
An approach to constructing an artificial quantum associative memory based on entanglement (QuEAM) is discussed. The QuEAM is an exponential increase in the capacity of the memory when compared to classical associative memories such as the Hopfield network. According to the characteristics of amount of entanglement, the study algorithm based on Grover's well-known algorithm is locally magnified the probability amplitude for the qubit. The basic principle of entangled states is discussed. Concrete examples illustrating the properties of the proposed model are also presented.
Abstract This paper discusses an approach to constructing an artificial quantum associative memory (QuAM). The QuAM makes use of two quantum computational algorithms, one for pattern storage and the other for pattern recall. The result is an exponential increase in the capacity of the memory when compared to traditional associative memories such as the Hopfield network. Further, the paper argues for considering pattern recall as a non-unitary process and demonstrates the utility of non-unitary operators for improving the pattern recall performance of the QuAM. 1.
There is increasing interest in quantum computing, because of its enormous computing potential. A small number of powerful quantum algorithms have been proposed to date; however, the development of new quantum algorithms for practical use remains essential. Parallel computing with a neural network has successfully realized certain unique functions such as learning and recognition; therefore, the introduction of certain neural computing techniques into quantum computing to enlarge the quantum computing application field is worthwhile. In this paper, a novel quantum associative memory (QuAM) is proposed, which is achieved with a quantum neural network by employing adiabatic Hamiltonian evolution. The memorization and retrieval procedures are inspired by the concept of associative memory realized with an artificial neural network. To study the detailed dynamics of our QuAM, we examine two types of Hamiltonians for pattern memorization. The first is a Hamiltonian having diagonal elements, which is known as an Ising Hamiltonian and which is similar to the cost function of a Hopfield network. The second is a Hamiltonian having non-diagonal elements, which is known as a neuro-inspired Hamiltonian and which is based on interactions between qubits. Numerical simulations indicate that the proposed methods for pattern memorization and retrieval work well with both types of Hamiltonians. Further, both Hamiltonians yield almost identical performance, although their retrieval properties differ. The QuAM exhibits new and unique features, such as a large memory capacity, which differs from a conventional neural associative memory.
We generalize the canonical Hopfield model of associative memory, which stores classical states of individual spins, to store entangled quantum states. The construction is based on truncated projector-sum Hamiltonian, and we explicitly consider a special case that stores dimer singlet coverings of a spin-1/2 system. We analyze the stability of the stored memories and find that the capacity -- the number of stable patterns -- scales faster with the system size than one would expect from a naive analogy with the standard Hopfield model, suggesting a possible quantum advantage.
We review our models of quantum associative memories that represent the “quantization” of fully coupled neural networks like the Hopfield model. The idea is to replace the classical irreversible attractor dynamics driven by an Ising model with pattern-dependent weights by the reversible rotation of an input quantum state onto an output quantum state consisting of a linear superposition with probability amplitudes peaked on the stored pattern closest to the input in Hamming distance, resulting in a high probability of measuring a memory pattern very similar to the input. The unitary operator implementing this transformation can be formulated as a sequence of one-qubit and two-qubit elementary quantum gates and is thus the exponential of an ordered quantum Ising model with sequential operations and with pattern-dependent interactions, exactly as in the classical case. Probabilistic quantum memories, that make use of postselection of the measurement result of control qubits, overcome the famed linear storage limitation of their classical counterparts because they permit to completely eliminate crosstalk and spurious memories. The number of control qubits plays the role of an inverse fictitious temperature. The accuracy of pattern retrieval can be tuned by lowering the fictitious temperature under a critical value for quantum content association while the complexity of the retrieval algorithm remains polynomial for any number of patterns polynomial in the number of qubits. These models thus solve the capacity shortage problem of classical associative memories, providing a polynomial improvement in capacity. The price to pay is the probabilistic nature of information retrieval.