A Quantum Associative Memory Based on Grover's Algorithm

Quantum computation uses microscopic quantum level effects to perform computational tasks and has produced results that in some cases are exponentially faster than their classical counterparts. The unique characteristics of quantum theory may also be used to create a quantum associative memory with a capacity exponential in the number of neurons. This paper combines two quantum computational algorithms to produce a quantum associative memory. The result is an exponential increase in the capacity of the memory when compared to traditional associative memories such as the Hopfield network. The paper covers necessary high-level quantum mechanical ideas and introduces a quantum associative memory, a small version of which should be physically realizable in the near future.

[1]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.

[2]  R. Leighton,et al.  Feynman Lectures on Physics , 1971 .

[3]  BART KOSKO,et al.  Bidirectional associative memories , 1988, IEEE Trans. Syst. Man Cybern..

[4]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[5]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[6]  Lov K. Grover.  Quantum Search on Structured Problems , 1998, QCQC.

[7]  Mitja Perus,et al.  Neuro-Quantum Parallelism in Brain-Mind and Computers , 1996, Informatica.

[8]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[9]  T. Martinez,et al.  Quantum associative memory with exponential capacity , 1998, 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227).

[10]  A. Barenco.  Quantum Physics and Computers , 1996, quant-ph/9612014.

[11]  Markus Grassl,et al.  Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution , 1998, QCQC.

[12]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[13]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[14]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[15]  N. Gershenfeld,et al.  Experimental Implementation of Fast Quantum Searching , 1998 .