Biologically plausible learning rules for neural networks and quantum computing

Abstract Hebb's rule is assumed to be closely associated with biological learning. It has not been so far a source of powerful learning algorithms for artificial neural networks. We point to the fact that Hebb’s rule implemented in a quantum algorithm leads to learning algorithm converging much faster. The origin of the difference is “quantum entanglement”. Quantum entanglement may have a neuronal equivalent, which may be the reason why biological learning uses rules which are difficult to implement on a computer.

[1]  Richard Phillips Feynman,et al.  Quantum mechanical computers , 1984, Feynman Lectures on Computation.

[2]  S. Pinker How the Mind Works , 1999, Philosophy after Darwin.

[3]  Michael I. Jordan,et al.  A more biologically plausible learning rule for neural networks. , 1991, Proceedings of the National Academy of Sciences of the United States of America.

[4]  Edward Farhi,et al.  Analog analogue of a digital quantum computation , 1996 .

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

[6]  R. Jozsa,et al.  Quantum Computation and Shor's Factoring Algorithm , 1996 .

[7]  Francis Crick,et al.  The recent excitement about neural networks , 1989, Nature.

[8]  R. D. Wolf Quantum Computation and Shor's Factoring Algorithm , 1999 .