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

PLoS ONE

The Quantum Binding Problem in the Context of Associative Memory

Andreas Wichert

Published Sep 7, 2016• 0 citations
Publisher

Abstract

We present a method to solve the binding problem by using a quantum algorithm for the retrieval of associations from associative memory during visual scene analysis. The problem is solved by mapping the information representing different objects into superposition by using entanglement and Grover's amplification algorithm.
DOI
10.1371/journal.pone.0162312

Related papers

Quantum set intersection and its application to associative memory

Tamer Salman, Yoram Baram

We describe a quantum algorithm for computing the intersection of two sets and its application to associative memory. The algorithm is based on a modification of Grover’s quantum search algorithm (Grover, 1996). We present algorithms for pattern retrieval, pattern completion, and pattern correction. We show that the quantum associative memory can store an exponential number of memories and retrieve them in sub-exponential time. We prove that this model has advantages over known classical associative memories as well as previously proposed quantum models.

Journal of Machine Learning Research•Jan 1, 2012•5 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

AN ASSOCIATIVE MODEL BASED ON QUANTUM SEARCH ALGORITHMS

Hiromi Miyajima, Noritaka Shigei Masataka Fujisaki

In this paper, an algorithm of quantum associative memory is proposed using quantum search algorithms. In the associative memory, the problem is to find the data or the nearest data in the meaning of hamming distance from designated data. If the search data in memorized dataset is contained, the problem becomes data search one. In associative memory, it is difficult to find the nearest data in hamming distance. For searching any item in an unsorted database with N items, a classical takes O(N) steps but Grover’s quantum searching algorithm takes only O( p N) steps on perfect graph. By generalizing the idea, Ventura has proposed the associative memory model, but it does not solve the problem of finding the nearest data. On the other hand, quantum search algorithm with O( p N) steps on hypercube is also proposed. Therefore, the idea in this paper is formalizing the problem as quantum search algorithm in hypercube but not in the conventional perfect graph. First, we perform quantum search algorithm by considering quantum walk on hypercube. Further, it is observed search data or the nearest data by using the conventional algorithm with high probability.

Digital Enterprise and Information Systems•Jan 1, 2013•0 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 based on entanglement

YU Xiao-min

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.

Chinese Journal of Quantum Electronics•Jan 1, 2005•1 citation

Quantum Entanglement Information Storage and Retrieval Algorithm

Jincheng Zhang

Quantum entanglement, a bizarre phenomenon in quantum mechanics, presents a potentially revolutionary approach to information storage and retrieval. This paper explores the development of a novel algorithm predicated on entanglement, aiming to achieve instantaneous correlations between entangled particles for efficient data storage and retrieval. We propose a "quantum entanglement storage" mechanism that leverages the inherent properties of entanglement to facilitate rapid association and retrieval of information. The algorithm's core principle centers around establishing and maintaining entangled pairs, enabling the exploration of complex data structures through instantaneous correlations. This paper outlines the design of this algorithm, detailing the underlying mathematical framework and potential applications within the context of quantum information theory.

•Sep 5, 2026•0 citations
We describe a quantum algorithm for computing the intersection of two sets and its application to associative memory. The algorithm is based on a modification of Grover’s quantum search algorithm (Grover, 1996). We present algorithms for pattern retrieval, pattern completion, and pattern correction. We show that the quantum associative memory can store an exponential number of memories and retrieve them in sub-exponential time. We prove that this model has advantages over known classical associative memories as well as previously proposed quantum models.
In this paper, an algorithm of quantum associative memory is proposed using quantum search algorithms. In the associative memory, the problem is to find the data or the nearest data in the meaning of hamming distance from designated data. If the search data in memorized dataset is contained, the problem becomes data search one. In associative memory, it is difficult to find the nearest data in hamming distance. For searching any item in an unsorted database with N items, a classical takes O(N) steps but Grover’s quantum searching algorithm takes only O( p N) steps on perfect graph. By generalizing the idea, Ventura has proposed the associative memory model, but it does not solve the problem of finding the nearest data. On the other hand, quantum search algorithm with O( p N) steps on hypercube is also proposed. Therefore, the idea in this paper is formalizing the problem as quantum search algorithm in hypercube but not in the conventional perfect graph. First, we perform quantum search algorithm by considering quantum walk on hypercube. Further, it is observed search data or the nearest data by using the conventional algorithm with high probability.
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.
Quantum entanglement, a bizarre phenomenon in quantum mechanics, presents a potentially revolutionary approach to information storage and retrieval. This paper explores the development of a novel algorithm predicated on entanglement, aiming to achieve instantaneous correlations between entangled particles for efficient data storage and retrieval. We propose a "quantum entanglement storage" mechanism that leverages the inherent properties of entanglement to facilitate rapid association and retrieval of information. The algorithm's core principle centers around establishing and maintaining entangled pairs, enabling the exploration of complex data structures through instantaneous correlations. This paper outlines the design of this algorithm, detailing the underlying mathematical framework and potential applications within the context of quantum information theory.