Associative memory, the ability to reconstruct complete information from partial or noisy cues, is a defining feature of human cognition and an enduring objective in artificial intelligence. Classical neural models such as Hopfield networks have long provided insight into distributed storage and retrieval mechanisms, yet they remain constrained by limited storage capacity and susceptibility to noise. Recent developments in quantum computing have motivated investigation of hybrid quantum-classical architectures as alternative approaches to memory representation and retrieval. This study examines how effectively hybrid quantum-classical models can reproduce associative memory functions compared to Hopfield networks, with a particular focus on recall accuracy under varying noise levels, storage capacity, and computational efficiency. Through small-scale experiments using binary patterns and hybrid quantum circuits, we evaluate potential quantum advantages and practical trade-offs. The findings contribute to ongoing discourse in quantum machine learning and cognitive modeling, underscoring both the promise and current limitations of quantum-inspired associative memory systems. Our guiding research question is: To what extent can hybrid quantum–classical models replicate associative memory functions more effectively than classical neural memory models, particularly in terms of recall accuracy under noise and storage capacity?
Associative memory, the ability to reconstruct complete information from partial or noisy cues, is a defining feature of human cognition and an enduring objective in artificial intelligence. Classical neural models such as Hopfield networks have long provided insight into distributed storage and retrieval mechanisms, yet they remain constrained by limited storage capacity and susceptibility to noise. Recent developments in quantum computing have motivated investigation of hybrid quantum-classical architectures as alternative approaches to memory representation and retrieval. This study examines how effectively hybrid quantum-classical models can reproduce associative memory functions compared to Hopfield networks, with a particular focus on recall accuracy under varying noise levels, storage capacity, and computational efficiency. Through small-scale experiments using binary patterns and hybrid quantum circuits, we evaluate potential quantum advantages and practical trade-offs. The findings contribute to ongoing discourse in quantum machine learning and cognitive modeling, underscoring both the promise and current limitations of quantum-inspired associative memory systems. Our guiding research question is: To what extent can hybrid quantum–classical models replicate associative memory functions more effectively than classical neural memory models, particularly in terms of recall accuracy under noise and storage capacity?
Quantum neural networks form one pillar of the emergent field of quantum machine learning. Here quantum generalizations of classical networks realizing associative memories---capable of retrieving patterns, or memories, from corrupted initial states---have been proposed. It is a challenging open problem to analyze quantum associative memories with an extensive number of patterns and to determine the maximal number of patterns the quantum networks can reliably store, i.e., their storage capacity. In this work, we propose and explore a general method for evaluating the maximal storage capacity of quantum neural network models. By generalizing what is known as Gardner's approach in the classical realm, we exploit the theory of classical spin glasses for deriving the optimal storage capacity of quantum networks with quenched pattern variables. As an example, we apply our method to an open-system quantum associative memory formed of interacting spin-1/2 particles realizing coupled artificial neurons. The system undergoes a Markovian time evolution resulting from a dissipative retrieval dynamics that competes with a coherent quantum dynamics. We map out the nonequilibrium phase diagram and study the effect of temperature and Hamiltonian dynamics on the storage capacity. Our method opens an avenue for a systematic characterization of the storage capacity of quantum associative memories.
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.
Quantum Machine Learning (QML) has recently emerged as a highly promising research frontier. Within this domain, Quantum Neural Networks (QNNs),characterized by Variational Quantum Circuits (VQCs) at their core and featuring layers of quantum gates optimized by classical algorithms, have garnered significant attention. However, a rigorous and exhaustive evaluation of their practical performance remains largely incomplete. In this study, we conduct a comprehensive comparative analysis of three prominent hybrid classical-quantum architectures: Quantum Convolutional Neural Networks (QCNN), Quantum Recurrent Neural Networks (QRNN), and Quantum Vision Transformers (QViT), focusing on the critical dimensions of generalization, accuracy, and robustness. Our findings provide novel insights that address previous evaluative gaps. Notably, while these models exhibit exceptional performance on low-feature datasets such as MNIST, their learning efficacy degrades significantly when transitioned to high-feature datasets. Furthermore, convolutional-based models like QCNN appear less effective on high-dimensional data than other machine learning architectures. Additionally, while all models are susceptible to adversarial noise, traditional architectures, such as recurrent and convolutional networks, demonstrate superior resilience. Conversely, in the presence of quantum noise, the transformer-based architecture proves its strength by maintaining high robustness against measurement noise, channel noise, and finite-shot effects, whereas other architectures suffer marked performance declines. These results provide a granular perspective on the current state of the field and underscore the critical importance of tailoring model selection to the constraints of contemporary Noisy Intermediate-Scale Quantum (NISQ) environments.
Introduction This study investigates integrating quantum-inspired learning models with traditional Hebbian learning within neural networks, comparing their performance in learning efficiency, generalization, stability, and robustness. Traditional Hebbian models are biologically plausible but often struggle with stability, scalability, and adaptability. In contrast, quantum-inspired models leverage quantum mechanics principles like superposition and entanglement to enhance neural network performance potentially. Methods The simulations were conducted using a neural network comprising 1,000 neurons and 100 patterns across 10 instances. The key parameters included a fixed decay rate of 0.005, 80% excitatory neurons, and 10% fixed connectivity. The study varied learning rates (0.01, 0.05, 0.1) and thresholds (0.3, 0.5, 0.7) to assess different parameter settings. The performance metrics evaluated included accuracy, precision, recall, and F1-Score. Results The results showed that quantum-inspired models achieved significantly higher accuracy and precision, enhancing their reliability in class prediction and reducing false positives. Conversely, Hebbian models excelled in recall and F1-Score, effectively identifying positive cases and balancing precision and recall. Additionally, quantum-inspired models demonstrated greater stability, robustness, and consistent performance across varying parameters. Conclusion Quantum-inspired models offer notable improvements in learning efficiency, generalization, stability, and robustness, while Hebbian models perform better in recall and F1-Score. These findings suggest the potential for hybrid models that combine the strengths of both approaches, aiming for more balanced and efficient learning systems. Future research should explore these hybrid models to enhance performance across diverse artificial intelligence applications. Supplementary materials include the complete R code used, enabling replication and further investigation of the results.
Quantum-inspired computing is an emerging research area, which has significantly improved the capabilities of conventional algorithms. In general, quantum-inspired hopfield associative memory (QHAM) has demonstrated quantum information processing in neural structures. This has resulted in an exponential increase in storage capacity while explaining the extensive memory, and it has the potential to illustrate the dynamics of neurons in the human brain when viewed from quantum mechanics perspective although the application of QHAM is limited as an autoassociation. We introduce a quantum-inspired multidirectional associative memory (QMAM) with a one-shot learning model, and QMAM with a self-convergent iterative learning model (IQMAM) based on QHAM in this paper. The self-convergent iterative learning enables the network to progressively develop a resonance state, from inputs to outputs. The simulation experiments demonstrate the advantages of QMAM and IQMAM, especially the stability to recall reliability.
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.