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).
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(eC1N), ${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.
Recently, it was demonstrated1 that the clustering considered in this articlec, which consists in partitioning a set of data points into subsets depending on the proximity of some properties, can be performed using quantum annealing on a system of two-level quantum elements - qubits. In previous work2, we proposed to pass from qubits to qutrits - three-level quantum elements showed the advantages of such a replacement and obtained a time-dependent effective Hamiltonian. In the present paper, we have found a sequence of selective rotation operators that allows one to realize adiabatic evolution with this effective Hamiltonian in the discrete-time approximation. On five qutrits, represented by spins S = 1, we performed a simulation of clustering a set of six points on a plane into three groups by means of quantum annealing.