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

Brazilian Conference on Intelligent Systems

Non-unitary Quantum Associative Memory

Fernando M. de Paula Neto, Adenilton José da Silva, Wilson Rosa de Oliveira, Teresa B. Ludermir

Published Oct 1, 2017• 1 citation
Publisher

Abstract

Quantum associative memories (QAM) have storage capacity exponentially larger than classical associative memories. Given an input with n bits, the QAM can load all of 2n binary patterns. In this paper we propose a nonunitary quantum memory retrieval algorithm. The proposed method is used to recover incomplete input information and also in pattern classification task as an ensemble of memories. The advantages of the proposed method are the simplicity of recovery procedure in a unique iteration and the fact the circuit has linear complexity in function of the input length with deterministic output.

DOI
10.1109/bracis.2017.36

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

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

Theoretical framework for quantum associative memories

Adrià Labay-Mora, Eliana Fiorelli, Roberta Zambrini +1 more

Abstract Associative memory (AM) refers to the ability to relate a memory with an input and targets the restoration of corrupted patterns. It has been intensively studied in classical physical systems, as in neural networks where an attractor dynamics settles on stable solutions. Several extensions to the quantum domain have been recently reported, displaying different features. In this work, we develop a comprehensive framework for a quantum AM (QAM) based on open quantum system dynamics, which allows us to compare existing models, identify the theoretical prerequisites for performing AM tasks, and extend it in different forms. The map that achieves an exponential increase in the number of stored patterns with respect to classical systems is derived. We establish the crucial role of symmetries and dissipation in the operation of QAM. Our theoretical analysis demonstrates the feasibility of addressing both quantum and classical patterns, orthogonal and non-orthogonal memories, stationary and metastable operating regimes, and measurement-based outputs. Finally, this opens up new avenues for practical applications in quantum computing and machine learning, such as quantum error correction or quantum memories.

arXiv:2408.14272•Quantum Science and Technology•Jun 5, 2025•3 citations

Probabilistic Quantum Memories

Carlo A. Trugenberger

Typical address-oriented computer memories cannot recognize incomplete or noisy information. Associative (content-addressable) memories solve this problem but suffer from severe capacity shortages. I propose a model of a quantum memory that solves both problems. The storage capacity is exponential in the number of qbits and thus optimal. The retrieval mechanism for incomplete or noisy inputs is probabilistic, with postselection of the measurement result. The output is determined by a probability distribution on the memory which is peaked around the stored patterns closest in Hamming distance to the input.

arXiv:quant-ph/0012100•Physical Review Letters•Jul 18, 2001•136 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
Quantum associative memories (QAM) have storage capacity exponentially larger than classical associative memories. Given an input with n bits, the QAM can load all of 2n binary patterns. In this paper we propose a nonunitary quantum memory retrieval algorithm. The proposed method is used to recover incomplete input information and also in pattern classification task as an ensemble of memories. The advantages of the proposed method are the simplicity of recovery procedure in a unique iteration and the fact the circuit has linear complexity in function of the input length with deterministic output.
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.
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.
Abstract Associative memory (AM) refers to the ability to relate a memory with an input and targets the restoration of corrupted patterns. It has been intensively studied in classical physical systems, as in neural networks where an attractor dynamics settles on stable solutions. Several extensions to the quantum domain have been recently reported, displaying different features. In this work, we develop a comprehensive framework for a quantum AM (QAM) based on open quantum system dynamics, which allows us to compare existing models, identify the theoretical prerequisites for performing AM tasks, and extend it in different forms. The map that achieves an exponential increase in the number of stored patterns with respect to classical systems is derived. We establish the crucial role of symmetries and dissipation in the operation of QAM. Our theoretical analysis demonstrates the feasibility of addressing both quantum and classical patterns, orthogonal and non-orthogonal memories, stationary and metastable operating regimes, and measurement-based outputs. Finally, this opens up new avenues for practical applications in quantum computing and machine learning, such as quantum error correction or quantum memories.
Typical address-oriented computer memories cannot recognize incomplete or noisy information. Associative (content-addressable) memories solve this problem but suffer from severe capacity shortages. I propose a model of a quantum memory that solves both problems. The storage capacity is exponential in the number of qbits and thus optimal. The retrieval mechanism for incomplete or noisy inputs is probabilistic, with postselection of the measurement result. The output is determined by a probability distribution on the memory which is peaked around the stored patterns closest in Hamming distance to the input.
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.