AI & ML
Complexity and precision in quantum associative retrieval
arXiv cs.IR0 views
arXiv:2611.21941v1 Announce Type: cross 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.
Source:https://arxiv.org/abs/2611.21941PreviousUrban Representation Learning for Identifying Potential Disparities in Crime ReportingNextRICoT: Recurrent Interleaved Chain-of-Thought for Page Stream Segmentation
Related posts
Wine Merges Remote OpenGL Swapchain Image Presentation, CEF Now Works With Wayland
0Phoronix

I lied to ChatGPT and Gemini and pretended to be an expert
0TechRadar

The overlooked technology that could determine the ROI of enterprise AI
0TechRadar

Microsoft is giving agents their own Cloud PC capabilities to help you with crucial tasks
0TechRadar

The Shure MV360 is an affordable mic for spatial audio capture
0TechRadar

Chief AI Officers are now a common sight in businesses — but new study finds they often don't really have any power
0TechRadar