Back to News
quantum-computing

Computational Superiority of Non-Markovian Kerr Feedback in Continuous-Variable Quantum Reservoir Computing

arXiv Quantum Physics
Loading...
4 min read
0 likes
⚡ Quantum Brief
A June 2026 study reveals a breakthrough in quantum reservoir computing (QRC) by introducing a single Kerr nonlinear element in a feedback loop, overcoming fundamental limits of linear optical systems. Linear QRCs lack true cross-time nonlinearity, forcing exponential measurement complexity. The Kerr effect enables real-time intensity-dependent phase shifts, creating genuine multiplicative interactions within the reservoir. The research proves a single nonlinear mode with feedback depth D outperforms N-mode linear reservoirs, achieving nonlinear rank D versus 2N, offering exponential efficiency gains in temporal computations. Counterintuitively, optical loss enhances performance by creating unique "fingerprints" for each feedback pass, preventing redundancy and enabling deeper temporal processing. Experimental simulations confirm the approach works on integrated platforms, with achievable feedback depths of 30-230, potentially replacing ~100 linear modes with one nonlinear element.
Computational Superiority of Non-Markovian Kerr Feedback in Continuous-Variable Quantum Reservoir Computing

Summarize this article with:

Quantum Physics arXiv:2606.06689 (quant-ph) [Submitted on 4 Jun 2026] Title:Computational Superiority of Non-Markovian Kerr Feedback in Continuous-Variable Quantum Reservoir Computing Authors:Daniel Soh View a PDF of the paper titled Computational Superiority of Non-Markovian Kerr Feedback in Continuous-Variable Quantum Reservoir Computing, by Daniel Soh View PDF HTML (experimental) Abstract:A linear optical medium can delay, mix, and superpose light, but never make two pulses multiply: multiplication is nonlinear, and a linear system has no such operation. This roots a sharp limit on continuous-variable quantum reservoir computers (QRCs) built from Gaussian optics. Within the reservoir they cannot form genuine products of the input at different past times, the cross-time nonlinear correlations many temporal computations require; they can only fake them by storing each past input separately and multiplying in the readout, forcing an exponentially harder high-order measurement. We show that a single Kerr (intensity-dependent phase) element in a time-delayed feedback loop removes this limit. The Kerr effect makes phase depend on intensity, a true multiplication inside the medium; feedback makes the light revisit that element repeatedly, so one mode mixes its own history against itself once per round-trip. Feedback turns time into space: D passes through one nonlinear mode replace D parallel linear modes. We prove an unbounded resource separation (Theorem 3, Corollary 2): an N-mode Gaussian reservoir reaches cross-time nonlinear rank at most 2N, a hardware ceiling, while a single Kerr mode reaches rank equal to its feedback depth D, costing no extra modes. For every N, one Kerr mode performs a computation no N-mode linear reservoir can. Loss is the counterintuitive ingredient: each round-trip dims the light, so the nonlinear phase differs pass to pass, giving every echo its own fingerprint; without loss the passes would be redundant. We confirm activation on an exact open-system simulation and ground the separation in nonlinear channel equalization. Achievable D is 30 to 230 on integrated platforms, so one nonlinear mode replaces up to about 100 linear ones, at the price of measurement time. Subjects: Quantum Physics (quant-ph); Mathematical Physics (math-ph) Cite as: arXiv:2606.06689 [quant-ph] (or arXiv:2606.06689v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2606.06689 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Daniel Soh [view email] [v1] Thu, 4 Jun 2026 20:12:15 UTC (389 KB) Full-text links: Access Paper: View a PDF of the paper titled Computational Superiority of Non-Markovian Kerr Feedback in Continuous-Variable Quantum Reservoir Computing, by Daniel SohView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-06 Change to browse by: math math-ph math.MP 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?) 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

photonic-quantum
quantum-investment

Source Information

Source: arXiv Quantum Physics