Adiabatic quantum optimization for associative memory recall

被引:14
作者
Seddiqi, Hadayat [1 ]
Humble, Travis S. [1 ]
机构
[1] Quantum Comp Inst, Oak Ridge Natl Lab, Oak Ridge, TN 37831 USA
关键词
quantum computing; adiabatic quantum optimization; associative memory; content-addressable memory; Hopfield networks;
D O I
10.3389/fphy.2014.00079
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Hopfield networks are a variant of associative memory that recall patterns stored in the couplings of an Ising model. Stored memories are conventionally accessed as fixed points in the network dynamics that correspond to energetic minima of the spin state. We show that memories stored in a Hopfield network may also be recalled by energy minimization using adiabatic quantum optimization (AQO). Numerical simulations of the underlying quantum dynamics allow us to quantify AQO recall accuracy with respect to the number of stored memories and noise in the input key. We investigate AQO performance with respect to how memories are stored in the Ising model according to different learning rules. Our results demonstrate that AQO recall accuracy varies strongly with learning rule, a behavior that is attributed to differences in energy landscapes. Consequently, learning rules offer a family of methods for programming adiabatic quantum optimization that we expect to be useful for characterizing AQO performance.
引用
收藏
页码:1 / 12
页数:12
相关论文
共 33 条
[1]   COMPUTING THE ACTION OF THE MATRIX EXPONENTIAL, WITH AN APPLICATION TO EXPONENTIAL INTEGRATORS [J].
Al-Mohy, Awad H. ;
Higham, Nicholas J. .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2011, 33 (02) :488-511
[2]   SPIN-GLASS MODELS OF NEURAL NETWORKS [J].
AMIT, DJ ;
GUTFREUND, H .
PHYSICAL REVIEW A, 1985, 32 (02) :1007-1018
[3]   Experimental Determination of Ramsey Numbers [J].
Bian, Zhengbing ;
Chudak, Fabian ;
Macready, William G. ;
Clark, Lane ;
Gaitan, Frank .
PHYSICAL REVIEW LETTERS, 2013, 111 (13)
[4]  
Boixo S, 2012, ARXIV12121739QUANTPH
[5]   A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem [J].
Farhi, E ;
Goldstone, J ;
Gutmann, S ;
Lapan, J ;
Lundgren, A ;
Preda, D .
SCIENCE, 2001, 292 (5516) :472-476
[6]  
Farhi E., 2000, QUANTPH0001106 ARXIV
[7]   Graph isomorphism and adiabatic quantum computing [J].
Gaitan, Frank ;
Clark, Lane .
PHYSICAL REVIEW A, 2014, 89 (02)
[8]   Solving the graph-isomorphism problem with a quantum annealer [J].
Hen, Itay ;
Young, A. P. .
PHYSICAL REVIEW A, 2012, 86 (04)
[9]  
Higham NJ, 2010, ACTA NUMER, V19, P159, DOI 10.1017/S0962492910000036
[10]   COMPUTING WITH NEURAL CIRCUITS - A MODEL [J].
HOPFIELD, JJ ;
TANK, DW .
SCIENCE, 1986, 233 (4764) :625-633