arXiv · 2611.21941
Complexity and precision in quantum associative retrieval
Abstract
We show that efficient and high-precision quantum associative retrieval is possible with an exponential complexity advantage with respect to the classical brute force approach and with a polynomial capacity advantage with respect to classical neural network implementations for any number of patterns scaling polynomially in the number of qubits. Both classical neural and quantum associative memories store the patterns in a Hamiltonian; in the classical case the dynamics is irreversible relaxation toward attractors, in the quantum case it is unitary transformations generating an effective thermal distribution, followed by a measurement.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Carlo A. Trugenberger. 2026-11-16. Complexity and precision in quantum associative retrieval. https://doi.org/10.1007/s44464-026-00051-7. https://searcharxiv.com/abs/2611.21941
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.