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

arXiv:2610.29190

Alignment of the amplitudes of stored states for solving the associative memory problem using quantum annealing

Vladimir E. Zobov, Ivan S. Pichkovskiy

quant-phSubmitted Oct 21, 2026• Announced Oct 22, 2026• 0 citations
arXivHTMLPDF

Abstract

The solution of combinatorial optimization problems by means of quantum annealing is based on the preparation of an equally superposition state. Such superposition is crucial to the associative memory problem of correctly recalling patterns. In this paper, we study the alignment of the amplitudes of stored states in memory using the proposed auxiliary Hamiltonian, which is switched off at the end of evolution. The results of the algorithm execution were obtained both by numerical modeling and by the perturbation theory method, which made it possible to obtain the dependences on physical parameters in explicit form. As examples, systems of two and three qutrits, represented by spins S=1, are considered. Since the Hamiltonian is expressed in a univer-sal form through projectors onto states stored in memory, it can be used for other quantum sys-tems (platforms).

AI Summary

The paper addresses how to align the amplitudes of stored patterns in a quantum-annealing approach to associative memory. The motivation is that an equal-amplitude superposition of stored states is important for recalling patterns; the question is how to obtain this amplitude balance during annealing. The proposed method adds an auxiliary Hamiltonian that is switched off at the end of the evolution. This Hamiltonian is expressed using projectors onto the states stored in memory. The study examines its effect through numerical simulation and perturbation theory, with the latter yielding explicit expressions for dependence on physical parameters. The examples considered are systems of two and three qutrits, represented as spins with $S=1$; their full Hilbert-space dimensions are therefore $9$ and $27$, respectively. The abstract reports results on amplitude alignment but gives no quantitative alignment errors, recall-success probabilities, annealing-time requirements, or scaling bounds. The projector-based formulation is presented as applicable to quantum platforms beyond the spin systems used in the examples. However, the abstract provides no larger-system demonstrations or experimental implementation. Because the full text is unavailable, the precise auxiliary Hamiltonian, assumptions behind the perturbative treatment, conditions for successful alignment, and any limitations stated beyond the small examples cannot be assessed from the supplied material.

No sign of AI-generated textIncrementalUnclear noveltyMissing comparison

Written by gpt-6.1-sol from the abstract only. Automated: it can be wrong.

Related papers

Ising formulation of associative memory models and quantum annealing recall

Siddhartha Santra, Omar Shehab, Radhakrishnan Balu

Associative memory models, in theoretical neuro- and computer sciences, can generally store at most a linear number of memories. Recalling memories in these models can be understood as retrieval of the energy minimizing configuration of classical Ising spins, closest in Hamming distance to an imperfect input memory, where the energy landscape is determined by the set of stored memories. We present an Ising formulation for associative memory models and consider the problem of memory recall using quantum annealing. We show that allowing for input-dependent energy landscapes allows storage of up to an exponential number of memories (in terms of the number of neurons). Further, we show how quantum annealing may naturally be used for recall tasks in such input-dependent energy landscapes, although the recall time may increase with the number of stored memories. Theoretically, we obtain the radius of attractor basins $R(N)$ and the capacity $C(N)$ of such a scheme and their tradeoffs. Our calculations establish that for randomly chosen memories the capacity of our model using the Hebbian learning rule as a function of problem size can be expressed as $C(N)=O({e}^{{C}_{1}N})$, ${C}_{1}\ensuremath{\ge}0$, and succeeds on randomly chosen memory sets with a probability of $(1\ensuremath{-}{e}^{\ensuremath{-}{C}_{2}N})$, ${C}_{2}\ensuremath{\ge}0$ with ${C}_{1}+{C}_{2}={(0.5\ensuremath{-}f)}^{2}/(1\ensuremath{-}f)$, where $f=R(N)/N$, $0\ensuremath{\le}f\ensuremath{\le}0.5$, is the radius of attraction in terms of the Hamming distance of an input probe from a stored memory as a fraction of the problem size. We demonstrate the application of this scheme on a programmable quantum annealing device, the D-wave processor.

arXiv:1602.08149•Physical Review A•Dec 27, 2017•17 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

Quantum Annealing-Based Combinatorial Optimization Algorithm

Jincheng Zhang

This paper investigates the application of quantum annealing for solving complex combinatorial optimization problems. The core claim is that quantum annealing leverages its global search capabilities to efficiently address such problems. The proposed mechanism involves formulating the combinatorial optimization problem as a quantum annealing problem and utilizing the simulated annealing process within quantum annealing to conduct a search for the optimal solution. This research explores the potential of quantum annealing in practical applications, acknowledging that its application in combinatorial optimization is still in its exploratory phase. The algorithm is designed to minimize the energy of a system described by a Hamiltonian, which evolves over time according to the time-dependent Schrödinger equation. The core of the algorithm lies in mapping the problem's constraints and objective function into this Hamiltonian. The search process is governed by quantum fluctuations, represented by the operator $\hat{H}$, which encourages transitions to lower energy states, effectively navigating the solution space. The effectiveness of the algorithm is evaluated based on the quality of the solution found and the computational resources required. This work provides a foundational exploration of quantum annealing's potential within the field of combinatorial optimization.

•Sep 3, 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•9 citations

Quantum Annealing-based Solution for Combinatorial Optimization Problems

Jincheng Zhang

This paper explores the application of quantum annealing to solve combinatorial optimization problems. The core idea centers around mapping these problems onto a quantum annealing platform and utilizing the quantum effects to find optimal or near-optimal solutions. Specifically, we investigate the potential of improved parameter tuning and algorithmic modifications to enhance the effectiveness of quantum annealing for problems such as the Traveling Salesperson Problem (TSP) and the Knapsack Problem. While quantum annealing has shown promise, its practical performance remains limited, and this work aims to address this limitation through targeted algorithmic and parameter optimization. The central focus is on demonstrating a method for translating a classical combinatorial problem into a suitable form for quantum annealing, followed by a strategic approach to controlling the annealing process to guide the system toward a desired solution. The efficacy of this approach is evaluated conceptually, with a focus on outlining the necessary steps and considerations for successful implementation.

•Sep 6, 2026•0 citations

Optimal storage capacity of quantum Hopfield neural networks

Lukas Bödeker, Eliana Fiorelli, Markus Müller

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.

arXiv:2210.07894•Physical Review Research•May 1, 2023•13 citations
The solution of combinatorial optimization problems by means of quantum annealing is based on the preparation of an equally superposition state. Such superposition is crucial to the associative memory problem of correctly recalling patterns. In this paper, we study the alignment of the amplitudes of stored states in memory using the proposed auxiliary Hamiltonian, which is switched off at the end of evolution. The results of the algorithm execution were obtained both by numerical modeling and by the perturbation theory method, which made it possible to obtain the dependences on physical parameters in explicit form. As examples, systems of two and three qutrits, represented by spins S=1, are considered. Since the Hamiltonian is expressed in a univer-sal form through projectors onto states stored in memory, it can be used for other quantum sys-tems (platforms).
The paper addresses how to align the amplitudes of stored patterns in a quantum-annealing approach to associative memory. The motivation is that an equal-amplitude superposition of stored states is important for recalling patterns; the question is how to obtain this amplitude balance during annealing.
The proposed method adds an auxiliary Hamiltonian that is switched off at the end of the evolution. This Hamiltonian is expressed using projectors onto the states stored in memory. The study examines its effect through numerical simulation and perturbation theory, with the latter yielding explicit expressions for dependence on physical parameters. The examples considered are systems of two and three qutrits, represented as spins with S=1S=1S=1; their full Hilbert-space dimensions are therefore 999 and 272727, respectively. The abstract reports results on amplitude alignment but gives no quantitative alignment errors, recall-success probabilities, annealing-time requirements, or scaling bounds.
The projector-based formulation is presented as applicable to quantum platforms beyond the spin systems used in the examples. However, the abstract provides no larger-system demonstrations or experimental implementation. Because the full text is unavailable, the precise auxiliary Hamiltonian, assumptions behind the perturbative treatment, conditions for successful alignment, and any limitations stated beyond the small examples cannot be assessed from the supplied material.
Associative memory models, in theoretical neuro- and computer sciences, can generally store at most a linear number of memories. Recalling memories in these models can be understood as retrieval of the energy minimizing configuration of classical Ising spins, closest in Hamming distance to an imperfect input memory, where the energy landscape is determined by the set of stored memories. We present an Ising formulation for associative memory models and consider the problem of memory recall using quantum annealing. We show that allowing for input-dependent energy landscapes allows storage of up to an exponential number of memories (in terms of the number of neurons). Further, we show how quantum annealing may naturally be used for recall tasks in such input-dependent energy landscapes, although the recall time may increase with the number of stored memories. Theoretically, we obtain the radius of attractor basins R(N)R(N)R(N) and the capacity C(N)C(N)C(N) of such a scheme and their tradeoffs. Our calculations establish that for randomly chosen memories the capacity of our model using the Hebbian learning rule as a function of problem size can be expressed as C(N)=O(eC1N)C(N)=O({e}^{{C}_{1}N})C(N)=O(eC1​N), ${C}_{1}\ensuremath{\ge}0$, and succeeds on randomly chosen memory sets with a probability of $(1\ensuremath{-}{e}^{\ensuremath{-}{C}_{2}N})$, ${C}_{2}\ensuremath{\ge}0$ with ${C}_{1}+{C}_{2}={(0.5\ensuremath{-}f)}^{2}/(1\ensuremath{-}f)$, where f=R(N)/Nf=R(N)/Nf=R(N)/N, $0\ensuremath{\le}f\ensuremath{\le}0.5$, is the radius of attraction in terms of the Hamming distance of an input probe from a stored memory as a fraction of the problem size. We demonstrate the application of this scheme on a programmable quantum annealing device, the D-wave processor.
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.
This paper investigates the application of quantum annealing for solving complex combinatorial optimization problems. The core claim is that quantum annealing leverages its global search capabilities to efficiently address such problems. The proposed mechanism involves formulating the combinatorial optimization problem as a quantum annealing problem and utilizing the simulated annealing process within quantum annealing to conduct a search for the optimal solution. This research explores the potential of quantum annealing in practical applications, acknowledging that its application in combinatorial optimization is still in its exploratory phase. The algorithm is designed to minimize the energy of a system described by a Hamiltonian, which evolves over time according to the time-dependent Schrödinger equation. The core of the algorithm lies in mapping the problem's constraints and objective function into this Hamiltonian. The search process is governed by quantum fluctuations, represented by the operator H^\hat{H}H^, which encourages transitions to lower energy states, effectively navigating the solution space. The effectiveness of the algorithm is evaluated based on the quality of the solution found and the computational resources required. This work provides a foundational exploration of quantum annealing's potential within the field of combinatorial optimization.
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.
This paper explores the application of quantum annealing to solve combinatorial optimization problems. The core idea centers around mapping these problems onto a quantum annealing platform and utilizing the quantum effects to find optimal or near-optimal solutions. Specifically, we investigate the potential of improved parameter tuning and algorithmic modifications to enhance the effectiveness of quantum annealing for problems such as the Traveling Salesperson Problem (TSP) and the Knapsack Problem. While quantum annealing has shown promise, its practical performance remains limited, and this work aims to address this limitation through targeted algorithmic and parameter optimization. The central focus is on demonstrating a method for translating a classical combinatorial problem into a suitable form for quantum annealing, followed by a strategic approach to controlling the annealing process to guide the system toward a desired solution. The efficacy of this approach is evaluated conceptually, with a focus on outlining the necessary steps and considerations for successful implementation.
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.