Quantum neural network: Difference between revisions

Revision as of 23:11, 12 August 2023

Revision as of 05:11, 6 October 2023

Line 21:

=== Quantum associative memory ===

The first quantum associative memory algorithm was introduced by Dan Ventura and Tony Martinez in 1999.<ref>{{cite journalbook |first1=D. |last1=Ventura |first2=T. |last2=Martinez |title=Artificial Neural Nets and Genetic Algorithms |chapter=A Quantum Associative Memory Based on Grover's Algorithm |chapter-url=https://pdfs.semanticscholar.org/d46f/e04b57b75a7f9c57f25d03d1c56b480ab755.pdf |archive-url=https://web.archive.org/web/20170911115617/https://pdfs.semanticscholar.org/d46f/e04b57b75a7f9c57f25d03d1c56b480ab755.pdf |url-status=dead |archive-date=2017-09-11 |title=A quantum associative memory based on Grover's algorithm |journal=Proceedings of the International Conference on Artificial Neural Networks and Genetics Algorithms |pages=22–27 |year=1999 |doi=10.1007/978-3-7091-6384-9_5 |isbn=978-3-211-83364-3 |s2cid=3258510 }}</ref> The authors do not attempt to translate the structure of artificial neural network models into quantum theory, but propose an algorithm for a [[quantum circuit|circuit-based quantum computer]] that simulates [[associative memory (psychology)|associative memory]]. The memory states (in [[Hopfield neural network]]s saved in the weights of the neural connections) are written into a superposition, and a [[Grover search algorithm|Grover-like quantum search algorithm]] retrieves the memory state closest to a given input. As such, this is not a fully content-addressable memory, since only incomplete patterns can be retrieved.

The first truly content-addressable quantum memory, which can retrieve patterns also from corrupted inputs, was proposed by Carlo A. Trugenberger.<ref>{{Cite journal |last=Trugenberger |first=C. A. |date=2001-07-18 |title=Probabilistic Quantum Memories |url=http://dx.doi.org/10.1103/physrevlett.87.067901 |journal=Physical Review Letters |volume=87 |issue=6 |page=067901 |doi=10.1103/physrevlett.87.067901 |pmid=11497863 |issn=0031-9007|arxiv=quant-ph/0012100 |bibcode=2001PhRvL..87f7901T |s2cid=23325931 }}</ref><ref name=":2">{{Cite journal |last=Trugenberger |first=Carlo A. |date=2002 |title=Quantum Pattern Recognition |journal=Quantum Information Processing |volume=1 |issue=6 |pages=471–493|doi=10.1023/A:1024022632303 |s2cid=1928001 }}</ref><ref>{{Cite journal |last=Trugenberger |first=C. A. |date=2002-12-19 |title=Phase Transitions in Quantum Pattern Recognition |url=http://dx.doi.org/10.1103/physrevlett.89.277903 |journal=Physical Review Letters |volume=89 |issue=27 |page=277903 |doi=10.1103/physrevlett.89.277903 |pmid=12513243 |issn=0031-9007|arxiv=quant-ph/0204115 |bibcode=2002PhRvL..89A7903T |s2cid=33065081 }}</ref> Both memories can store an exponential (in terms of n qubits) number of patterns but can be used only once due to the no-cloning theorem and their destruction upon measurement.

Trugenberger,<ref name=":2" /> however, has shown that his proababilistic model of quantum associative memory can be efficiently implemented and re-used multiples times for any polynomial number of stored patterns, a large advantage with respect to classical associative memories.