|Title:||Quantum Set INtersection with Application to Associative Memory
|Authors:||T. Salman, K. Even, and Y. Baram
|Abstract:||We present a quantum algorithm for computing the intersection between two subsets on n-bit patterns using Glover's quantum search algorithm. We apply this algorithm to implement a model of associative memory with pattern completion and error correction abilities. We introduce the notion of memory as a quantum operator and prove that the storage capacity is exponential in n, while the time complexity of operations is sub-exponential.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2009/CIS/CIS-2009-17), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CIS technical reports of 2009
To the main CS technical reports page
Computer science department, Technion