Back to News
quantum-computing

Spin-Network Quantum Reservoir Computing with Distributed Inputs: The Role of Entanglement

Sareh Askari, Youssef Kora, Christoph Simon
Loading...
4 min read
0 likes
⚡ Quantum Brief
Researchers found that moderate entanglement in spin-network quantum reservoirs significantly boosts short-term memory performance for distributed input tasks. The study, published November 2025, reveals optimal memory capacity occurs at low coupling strengths, contrasting with peak entanglement at higher strengths. The team analyzed bilinear memory tasks requiring input product calculations, showing the strongest entanglement between input qubits directly correlates with task success. Logarithmic negativity measurements confirmed bipartite entanglement’s critical role in performance. At low coupling strengths where memory capacity peaks, the reservoir maintains extended performance over time—a phenomenon called the "memory tail." This suggests sustained information retention under specific conditions. A performance dip at zero time delay across frequencies indicates information requires finite propagation time through the reservoir before effective recall. This challenges assumptions about instantaneous quantum information processing. The findings highlight that localized, moderate entanglement—particularly between input qubits—drives efficiency, offering insights for optimizing quantum neuromorphic systems.
AI Audio Summary
0:00 / 0:00
Click to play
Quantum computing technology
Unsplash · Validated Fallback

Quantum Physics arXiv:2511.04900 (quant-ph) [Submitted on 7 Nov 2025] Title:Spin-Network Quantum Reservoir Computing with Distributed Inputs: The Role of Entanglement Authors:Sareh Askari, Youssef Kora, Christoph Simon View a PDF of the paper titled Spin-Network Quantum Reservoir Computing with Distributed Inputs: The Role of Entanglement, by Sareh Askari and 2 other authors View PDF HTML (experimental) Abstract:Reservoir computing is a promising neuromorphic paradigm, and its quantum implementation using spin networks has shown some advantage when entanglement is present. Here, we consider a distributed scenario in which two distinct input time series are injected into separate qubits of a spin-network reservoir. We investigate how the overall entanglement, as well as its localization in the system, influence the performance of the reservoir. Focusing on bilinear memory tasks that require computing the product of the two inputs, we evaluate the short-term memory capacity and correlate it with logarithmic negativity as a measure of bipartite entanglement. We find that short-term memory capacity reaches its maximum at relatively small coupling strengths. In contrast, average entanglement peaks at larger couplings. Analyzing entanglement across all bipartitions, we find that the entanglement between the two input qubits is consistently the strongest and most relevant for task performance. In the small coupling strength regime where the short-term memory capacity is maximized, the reservoir exhibits an extended memory tail: performance remains high for a long time. Finally, a pronounced dip in performance at zero time delay, observed across frequencies, indicates that information requires a finite propagation time through the reservoir before it can be effectively recalled. In summary, our results show that moderate entanglement, particularly between the two input qubits, plays a key role in enhancing short-term memory performance. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2511.04900 [quant-ph] (or arXiv:2511.04900v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2511.04900 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Sareh Askari [view email] [v1] Fri, 7 Nov 2025 01:02:46 UTC (924 KB) Full-text links: Access Paper: View a PDF of the paper titled Spin-Network Quantum Reservoir Computing with Distributed Inputs: The Role of Entanglement, by Sareh Askari and 2 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2025-11 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-algorithms
quantum-hardware
quantum-investment

Source Information

Source: arXiv Quantum Physics

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.