Quantum Pattern Recognition

AbstractI review and expand the model of quantum associative memory that I have recently proposed. In this model binary patterns of n bits are stored in the quantum superposition of the appropriate subset of the computational basis of n qbits. Information can be retrieved by performing an input-dependent rotation of the memory quantum state within this subset and measuring the resulting state. The amplitudes of this rotated memory state are peaked on those stored patterns which are closest in Hamming distance to the input, resulting in a high probability of measuring a memory pattern very similar to it. The accuracy of pattern recall can be tuned by adjusting a parameter playing the role of an effective temperature. This model solves the well-known capacity shortage problem of classical associative memories, providing a large improvement in capacity. PACS: 03.67.-a

[1]  Buzek,et al.  Quantum copying: Beyond the no-cloning theorem. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[2]  D Saad,et al.  Cryptographical properties of Ising spin systems. , 2000, Physical review letters.

[3]  A. Carlini,et al.  Quantum template matching , 2001 .

[4]  G. Long Grover algorithm with zero theoretical failure rate , 2001, quant-ph/0106071.

[5]  M. Mézard,et al.  Spin Glass Theory and Beyond , 1987 .

[6]  Stephen M. Barnett,et al.  Strategies and networks for state-dependent quantum cloning , 1999 .

[7]  W. Wootters,et al.  A single quantum cannot be cloned , 1982, Nature.

[8]  Nicolas Sourlas,et al.  Spin-glass models as error-correcting codes , 1989, Nature.

[9]  G. Guo,et al.  Probabilistic Cloning and Identification of Linearly Independent Quantum States , 1998, quant-ph/9804064.

[10]  Mohamad H. Hassoun,et al.  Associative neural memories , 1993 .

[11]  S. Massar,et al.  Optimal Quantum Cloning Machines , 1997, quant-ph/9705046.

[12]  C. Trugenberger Probabilistic quantum memories. , 2000, Physical review letters.

[13]  E B Baum,et al.  Building an associative memory vastly larger than the brain. , 1995, Science.

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

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

[16]  Teuvo Kohonen,et al.  Self-Organization and Associative Memory , 1988 .

[17]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[18]  Alexander J. Smola,et al.  Neural Information Processing Systems , 1997, NIPS 1997.

[19]  Lov K. Grover Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.