{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:15:25Z","timestamp":1760242525683,"version":"build-2065373602"},"reference-count":44,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2017,9,15]],"date-time":"2017-09-15T00:00:00Z","timestamp":1505433600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>A content-addressable memory (CAM) stores key-value associations such that the key is recalled by providing its associated value. While CAM recall is traditionally performed using recurrent neural network models, we show how to solve this problem using adiabatic quantum optimization. Our approach maps the recurrent neural network to a commercially available quantum processing unit by taking advantage of the common underlying Ising spin model. We then assess the accuracy of the quantum processor to store key-value associations by quantifying recall performance against an ensemble of problem sets. We observe that different learning rules from the neural network community influence recall accuracy but performance appears to be limited by potential noise in the processor. The strong connection established between quantum processors and neural network problems supports the growing intersection of these two ideas.<\/jats:p>","DOI":"10.3390\/e19090500","type":"journal-article","created":{"date-parts":[[2017,9,15]],"date-time":"2017-09-15T10:22:10Z","timestamp":1505470930000},"page":"500","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Recall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization"],"prefix":"10.3390","volume":"19","author":[{"given":"Jonathan","family":"Schrock","sequence":"first","affiliation":[{"name":"Oak Ridge National Laboratory, Quantum Computing Institute, Oak Ridge, TN 37831, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"McCaskey","sequence":"additional","affiliation":[{"name":"Oak Ridge National Laboratory, Quantum Computing Institute, Oak Ridge, TN 37831, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6382-5665","authenticated-orcid":false,"given":"Kathleen","family":"Hamilton","sequence":"additional","affiliation":[{"name":"Oak Ridge National Laboratory, Quantum Computing Institute, Oak Ridge, TN 37831, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9449-0498","authenticated-orcid":false,"given":"Travis","family":"Humble","sequence":"additional","affiliation":[{"name":"Oak Ridge National Laboratory, Quantum Computing Institute, Oak Ridge, TN 37831, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Neena","family":"Imam","sequence":"additional","affiliation":[{"name":"Oak Ridge National Laboratory, Quantum Computing Institute, Oak Ridge, TN 37831, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2017,9,15]]},"reference":[{"key":"ref_1","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., and Sipser, M. (2000). Quantum computation by adiabatic evolution. arXiv."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1126\/science.1057726","article-title":"A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem","volume":"292","author":"Farhi","year":"2001","journal-title":"Science"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"024511","DOI":"10.1103\/PhysRevB.82.024511","article-title":"Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor","volume":"82","author":"Harris","year":"2010","journal-title":"Phys. Rev. B"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1038\/nature10012","article-title":"Quantum annealing with manufactured spins","volume":"473","author":"Johnson","year":"2011","journal-title":"Nature"},{"key":"ref_5","unstructured":"Albash, T., and Lidar, D.A. (2016). Adiabatic Quantum Computing. arXiv."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Lucas, A. (2014). Ising formulations of many NP problems. Front. Phys., 2.","DOI":"10.3389\/fphy.2014.00005"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","article-title":"Quantum annealing in the transverse Ising model","volume":"58","author":"Kadowaki","year":"1998","journal-title":"Phys. Rev. E"},{"key":"ref_8","first-page":"021041","article-title":"Entanglement in a quantum annealing processor","volume":"4","author":"Lanting","year":"2014","journal-title":"Phys. Rev. X"},{"key":"ref_9","unstructured":"Neven, H., Denchev, V.S., Rose, G., and Macready, W.G. (2016). Training a Binary Classifier with the Quantum Adiabatic Algorithm. arXiv."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"042321","DOI":"10.1103\/PhysRevA.79.042321","article-title":"Quantum pattern recognition with liquid-state nuclear magnetic resonance","volume":"79","author":"Neigovzen","year":"2009","journal-title":"Phys. Rev. A"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"012320","DOI":"10.1103\/PhysRevA.78.012320","article-title":"Construction of model Hamiltonians for adiabatic quantum computation and its application to finding low-energy conformations of lattice protein models","volume":"78","author":"Perdomo","year":"2008","journal-title":"Phys. Rev. A"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"042310","DOI":"10.1103\/PhysRevA.86.042310","article-title":"Solving the graph-isomorphism problem with a quantum annealer","volume":"86","author":"Hen","year":"2012","journal-title":"Phys. Rev. A"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"2027","DOI":"10.1007\/s11128-012-0506-4","article-title":"Quantum adiabatic machine learning","volume":"12","author":"Pudenz","year":"2013","journal-title":"Quantum Inf. Process."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1140\/epjst\/e2015-02347-y","article-title":"A quantum annealing approach for fault detection and diagnosis of graph-based systems","volume":"224","author":"Fluegemann","year":"2015","journal-title":"Eur. Phys. J. Spec. Top."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"022342","DOI":"10.1103\/PhysRevA.89.022342","article-title":"Graph isomorphism and adiabatic quantum computing","volume":"89","author":"Gaitan","year":"2014","journal-title":"Phys. Rev. A"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Parekh, O., Wendt, J., Shulenburger, L., Landahl, A., Moussa, J., and Aidun, J. (2016). Benchmarking adiabatic quantum optimization for complex network analysis. arXiv.","DOI":"10.2172\/1459086"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"33957","DOI":"10.1038\/srep33957","article-title":"Solving Set Cover with Pairs Problem using Quantum Annealing","volume":"6","author":"Cao","year":"2016","journal-title":"Sci. Rep."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Potok, T.E., Schuman, C., Young, S.R., Patton, R.M., Spedalieri, F., Liu, J., Yao, K.T., Rose, G., and Chakma, G. (2017). A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers. arXiv.","DOI":"10.1109\/MLHPC.2016.009"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"McGeoch, C.C., and Wang, C. (2013, January 14\u201316). Experimental evaluation of an adiabiatic quantum system for combinatorial optimization. Proceedings of the ACM International Conference on Computing Frontiers, Ischia, Italy.","DOI":"10.1145\/2482767.2482797"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1038\/nphys2900","article-title":"Evidence for quantum annealing with more than one hundred qubits","volume":"10","author":"Boixo","year":"2014","journal-title":"Nat. Phys."},{"key":"ref_21","first-page":"031015","article-title":"What is the Computational Value of Finite-Range Tunneling?","volume":"6","author":"Denchev","year":"2016","journal-title":"Phys. Rev. X"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1126\/science.1252319","article-title":"Defining and detecting quantum speedup","volume":"345","author":"Wang","year":"2014","journal-title":"Science"},{"key":"ref_23","first-page":"021008","article-title":"Glassy Chimeras Could Be Blind to Quantum Speedup: Designing Better Benchmarks for Quantum Annealing Machines","volume":"4","author":"Katzgraber","year":"2014","journal-title":"Phys. Rev. X"},{"key":"ref_24","unstructured":"King, J., Yarkoni, S., Nevisi, M.M., Hilton, J.P., and McGeoch, C.C. (2015). Benchmarking a quantum annealing processor with the time-to-target metric. arXiv."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"015006","DOI":"10.1088\/1749-4680\/7\/1\/015006","article-title":"An integrated programming and development environment for adiabatic quantum optimization","volume":"7","author":"Humble","year":"2014","journal-title":"Comput. Sci. Dis."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/3007651","article-title":"High-performance computing with quantum processing units","volume":"13","author":"Britt","year":"2017","journal-title":"JETC"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Humble, T.S., McCaskey, A.J., Schrock, J., Seddiqi, H., Britt, K.A., and Imam, N. (2016, January 23\u201327). Performance Models for Split-Execution Computing Systems. Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), Chicago, IL, USA.","DOI":"10.1109\/IPDPSW.2016.113"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"79","DOI":"10.3389\/fphy.2014.00079","article-title":"Adiabatic Quantum Optimization for Associative Memory Recall","volume":"2","author":"Seddiqi","year":"2014","journal-title":"Front. Phys."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","article-title":"Neural networks and physical systems with emergent collective computational abilities","volume":"79","author":"Hopfield","year":"1982","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/21.87054","article-title":"Bidirectional associative memories","volume":"18","author":"Kosko","year":"1988","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/JSSC.2005.864128","article-title":"Content-addressable memory (CAM) circuits and architectures: A tutorial and survey","volume":"41","author":"Pagiamtzis","year":"2006","journal-title":"IEEE J. Solid State Circ."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Rojas, R. (1996). Neural Networks: A Systematic Introduction, Springer.","DOI":"10.1007\/978-3-642-61068-4"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"3780","DOI":"10.1143\/JPSJ.65.3780","article-title":"Quantum Effects in Neural Networks","volume":"65","author":"Nishimori","year":"1996","journal-title":"J. Phys. Soc. Jpn."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Santra, S., Shehab, O., and Balu, R. (2016). Exponential capacity of associative memories under quantum annealing recall. arXiv.","DOI":"10.1103\/PhysRevA.96.062330"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1126\/science.3755256","article-title":"Computing with neural circuits-A model","volume":"233","author":"Hopfield","year":"1986","journal-title":"Science"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1109\/TIT.1987.1057328","article-title":"The Capacity of the Hopfield Associative Memory","volume":"33","author":"McEliece","year":"1987","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"4217","DOI":"10.1103\/PhysRevA.34.4217","article-title":"Collective computational properties of neural networks: New learning mechanisms","volume":"34","author":"Personnaz","year":"1986","journal-title":"Phys. Rev. A"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"12370","DOI":"10.1038\/ncomms12370","article-title":"Zero-temperature quantum annealing bottlenecks in the spin-glass phase","volume":"7","author":"Knysh","year":"2016","journal-title":"Nat. Commun."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s11128-008-0082-9","article-title":"Minor-embedding in adiabatic quantum computation: I. The parameter setting problem","volume":"7","author":"Choi","year":"2008","journal-title":"Quantum Inf. Process."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s11128-013-0683-9","article-title":"Adiabatic quantum programming: Minor embedding with hard faults","volume":"13","author":"Klymko","year":"2014","journal-title":"Quantum Inf. Process."},{"key":"ref_41","unstructured":"Cai, J., Macready, W.G., and Roy, A. (2014). A practical heuristic for finding graph minors. arXiv."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/s11128-016-1513-7","article-title":"Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets","volume":"16","author":"Hamilton","year":"2017","journal-title":"Quantum Inf. Process."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Goodrich, T.D., Sullivan, B.D., and Humble, T.S. (2017). Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework. arXiv.","DOI":"10.1007\/s11128-018-1863-4"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"065004","DOI":"10.1088\/0953-2048\/23\/6\/065004","article-title":"A scalable control system for a superconducting adiabatic quantum optimization processor","volume":"23","author":"Johnson","year":"2010","journal-title":"Supercond. Sci. Technol."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/9\/500\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:44:59Z","timestamp":1760208299000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/9\/500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,15]]},"references-count":44,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2017,9]]}},"alternative-id":["e19090500"],"URL":"https:\/\/doi.org\/10.3390\/e19090500","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2017,9,15]]}}}