Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Barenco, A.: Quantum Physics and Computers, Contemporary Physics vol. 37 no. 5, pp. 375–389, 1996.
Biron, D., O. Biham, E. Biham, M. Grassl and D. A. Lidar: Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution, to appear in the Proceedings of the 1st NASA International Conference on Quantum Computation and Quantum Communications February 1998.
Boyer, M., G. Brassard, P. HOyer and A. Tapp: Tight Bounds on Quantum Searching, Workshop on Physics and Computation pp. 36–43, November 1996.
Chuang, I., N. Gershenfeld and M. Kubinec: Experimental Implementation of Fast Quantum Searching, Physical Review Letters vol. 80 no. 15, pp. 3408–3411, April 13, 1998.
Deutsch, D. and R. Jozsa: Rapid Solution of Problems by Quantum Computation, Proceedings of the Royal Society, London A vol. 439, pp. 553–558, 1992.
Deutsch, D.: Quantum Theory, The Church-Turing Principle and the Universal Quantum Computer, Proceedings of the Royal Society London A, vol. 400, pp. 97–117, 1985.
Feynman, R. P., R. B. Leighton and M. Sands: The Feynman Lectures on Physics vol. 3, Addison-Wesley Publishing Company, Reading Massachusetts, 1965.
Grover, L. K.: Quantum Search on Structured Problems, to appear in the Proceedings of the 1st NASA International Conference on Quantum Computation and Quantum Communications February 1998.
Grover, L. K.: A Fast Quantum Mechanical Algorithm for Database Search, Proceedings of the 28th Annual ACM Symposium on the Theory of Computing ACM, New York, pp. 212–219, 1996.
Hopfield, J. J.: Neural Networks and Physical Systems with Emergent Collective Computational Abilities, Proceedings of the National Academy of Scientists vol. 79, pp. 2554–2558, 1982.
Kosko, B.: Bidirectional Associative Memories, IEEE Transactions on Systems, Man, and Cybernetics vol. 18, pp. 49–60, 1988.
Perus, M.: Neuro-Quantum Parallelism in Brain-Mind and Computers, Informatica vol. 20, pp. 173–183, 1996.
Shor, P.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal of Computing vol. 26 no. 5, pp. 1484–1509, 1997.
Simon, D.: On the Power of Quantum Computation, SIAM Journal of Computation vol. 26 no. 5, pp. 1474–1483, 1997.
Ventura, D. and T. Martinez: Quantum Associative Memory with Exponential Capacity, Proceedings of the International Joint Conference on Neural Networks pp. 509–513, May 1998.
Ventura, D. and T. Martinez: Initializing a Quantum State’s Amplitude Distribution, submitted to Physical Review Letters June 18, 1998.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Wien
About this paper
Cite this paper
Ventura, D., Martinez, T. (1999). A Quantum Associative Memory Based on Grover’s Algorithm. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6384-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6384-9_5
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83364-3
Online ISBN: 978-3-7091-6384-9
eBook Packages: Springer Book Archive