A charge selection rule fixes what a squeezed-light reservoir computer can compute and afford

[2608.19668] A charge selection rule fixes what a squeezed-light reservoir computer can compute and afford Skip to main content Search Submit Donate Log in Quantum Physics arXiv:2608.19668 (quant-ph) [Submitted on 20 Aug 2026 ( v1 ), last revised 27 Aug 2026 (this version, v2)] Title: A charge selection rule fixes what a squeezed-light reservoir computer can compute and afford Authors: Daniel Soh View PDF HTML (experimental) Abstract: Reading an optical quantum reservoir costs repetitions growing super-exponentially with feature order: what it can afford is set by its detector, not its optics. For reservoirs encoding data in a parametric pump's phase, one conservation law fixes what is readable and what it costs. Pairwise photon exchange conserves an integer phase charge: across an ensemble of input masks, order-D readout reaches exactly the assemblies of at most D unit-charge kernels; degree-one homodyne readout is universal for fading-memory functionals along weak-squeezing families, at shot cost polynomial in accuracy; and at fixed squeezing no finite degree reaches every sector, at a computable distance. Nonlinearity sits in the optics, not the detector, whose per-shot variance is fixed at every order. In a hardware-faithful digital twin-no device was built-the rule is visible: on an open RF corpus a displacement-encoded control at identical photon number loses 17.7 accuracy points, as the charge algebra predicts. Subjects: Quantum Physics (quant-ph) ; Mathematical Physics (math-ph) Cite as: arXiv:2608.19668 [quant-ph] (or arXiv:2608.19668v2 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2608.19668 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Daniel Soh [ view email ] [v1] Thu, 20 Aug 2026 06:03:09 UTC (5,350 KB) [v2] Thu, 27 Aug 2026 23:46:15 UTC (5,350 KB) Full-text links: Access Paper: View PDF HTML (experimental) TeX Source view license Current browse context: quant-ph < prev | next > new | recent | 2026-08 Change to browse by: math math-ph math.MP References & Citations INSPIRE HEP SciX Google Scholar Semantic Scholar export BibTeX citation 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? ) We gratefully acknowledge support from our major funders , member institutions , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)

Related documents

• A charge selection rule fixes what a squeezed-light reservoir computer can compute and afford#682823
• Establishing a New Link between Fuzzy Logic, Neuroscience, and Quantum Mechanics through Bayesian Probability: Perspectives in Artificial Intelligence and Unconventional Computing#203233
• Q-learning#7267
• Homogeneous reservoir computing system based on CMOS-compatible optoelectronic synapses and memristors.#975563
• Non-Markovian Charging of a Micromaser Quantum Battery#1062238