Adiabatic Quantum Optimization for Associative Memory Recall
arXiv:1407.1904 · doi:10.3389/fphy.2014.00079
Abstract
Hopfield networks are a variant of associative memory that recall information stored in the couplings of an Ising model. Stored memories are fixed points for the network dynamics that correspond to energetic minima of the spin state. We formulate the recall of memories stored in a Hopfield network using energy minimization by adiabatic quantum optimization (AQO). Numerical simulations of the quantum dynamics allow us to quantify the AQO recall accuracy with respect to the number of stored memories and the noise in the input key. We also investigate AQO performance with respect to how memories are stored in the Ising model using different learning rules. Our results indicate that AQO performance varies strongly with learning rule due to the changes in the energy landscape. Consequently, learning rules offer indirect methods for investigating change to the computational complexity of the recall task and the computational efficiency of AQO.
22 pages, 11 figures. Updated for clarity and figures, to appear in Frontiers of Physics
References in corpus (23)
- Ising formulations of many NP problems
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Theory of Quantum Annealing of an Ising Spin Glass
- Quantum Search by Local Adiabatic Evolution
- Defining and detecting quantum speedup
- Quantum Computation by Adiabatic Evolution
- Experimental signature of programmable quantum annealing
- Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines
- Size dependence of the minimum excitation gap in the Quantum Adiabatic Algorithm
- On the construction of model Hamiltonians for adiabatic quantum computation and its application to finding low energy conformations of lattice protein models
- Quantum adiabatic machine learning
- The performance of the quantum adiabatic algorithm on random instances of two optimization problems on regular hypergraphs
- Experimental determination of Ramsey numbers
- Bayesian Network Structure Learning Using Quantum Annealing
- A Quantum Annealing Approach for Fault Detection and Diagnosis of Graph-Based Systems
- Training a Binary Classifier with the Quantum Adiabatic Algorithm
- Ramsey numbers and adiabatic quantum computing
- Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization
- A Near-Term Quantum Computing Approach for Hard Computational Problems in Space Exploration
- Quantum pattern recognition with liquid-state nuclear magnetic resonance
- Graph isomorphism and adiabatic quantum computing
- Solving the Graph Isomorphism Problem with a Quantum Annealer
- Hearing the Shape of the Ising Model with a Programmable Superconducting-Flux Annealer