REVIEW 2 cited by
Quantum Associative Memory
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
This paper combines quantum computation with classical neural network theory to produce a quantum computational learning algorithm. 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 such 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 and quantum computational ideas and introduces a quantum associative memory. Theoretical analysis proves the utility of the memory, and it is noted that a small version should be physically realizable in the near future.
Forward citations
Cited by 2 Pith papers
-
The Input Problem: A Permanent Bottleneck for Quantum Machine Learning
Preparing a generic classical data vector as a quantum state provably costs Θ(N) gates, so algorithms that claim O(polylog N) total time on classical data are dominated by their own input stage.
-
Collaborative Filtering using Variational Quantum Hopfield Associative Memory
The authors train a variational quantum Hopfield associative memory with an autoencoder and K-Means clustering to classify MovieLens 1M users, reporting ROC 0.9795 in ideal simulation and 0.9177 under noise.
Discussion (0). Continue with ORCID to comment.