Titans-QFWP is a hybrid reinforcement learning architecture that combines a Quantum Fast Weight Programmer with a Titans-style memory system (Persistence, Surprise, and Forgetting) for adaptive portfolio optimization. It employs an enhanced A3C² framework with Hungarian-aligned K‑means clustering and scaled log‑return rewards to handle high‑dimensional market features. Tested on 468 S&P 500 stocks with about 3,000 trainable parameters, the model achieves strong performance metrics (median ARR 0.4260, Calmar 8.5504, IR 0.8427) and demonstrates that quantum gating reshapes memory roles to support drawdown control, return generation, and stabilization.
arXiv:2606. 10448v1 Announce Type: cross Abstract: The financial market is a typical low signal-to-noise ratio (SNR) setting, which often destabilizes off-policy maximum-entropy methods like Soft Actor-Critic (SAC).
arXiv:2605. 06734v2 Announce Type: replace-cross Abstract: Fast Weight Programmers (FWPs) encode temporal dependencies through dynamically updated parameters rather than recurrent hidden states.
arXiv:2607. 27945v1 Announce Type: cross Abstract: Sequence models must decide what to write into memory and what to retain.
arXiv:2607. 29491v1 Announce Type: cross Abstract: Reinforcement-learning-based quantum architecture search (RL-QAS) repeatedly optimizes a variational quantum eigensolver (VQE) after extending a circuit, although circuit construction and action legality are deterministic and known.
arXiv:2606. 18503v1 Announce Type: new Abstract: Remaining useful life (RUL) estimation is central to predictive maintenance, where an unplanned failure can cost far more than the asset itself.
arXiv:2606. 27821v1 Announce Type: cross Abstract: Traffic matrices (TMs) capture network-wide origin-destination demand and are central to traffic engineering, yet accurate whole-matrix forecasting remains challenging when prediction must be performed under the memory, update, and training-budget constraints of online network control.
arXiv:2607. 19506v1 Announce Type: cross Abstract: Quantum reservoir computing (QRC) uses fixed quantum dynamics as a high-dimensional temporal feature map and trains only a lightweight classical readout.
arXiv:2607. 01080v1 Announce Type: new Abstract: We investigate Gaussian process (GP) bandit optimization with quantum kernels, assuming the mean reward function lies in the reproducing kernel Hilbert space (RKHS) induced by the quantum kernel.
arXiv:2607. 02292v1 Announce Type: new Abstract: Neural quantum states (NQS) provide a flexible and scalable framework for approximating quantum many-body wavefunctions.
Neural quantum states (NQS) provide a flexible and scalable framework for approximating quantum many-body wavefunctions. Among NQS parameterizations, autoregressive models are especially attractive because they enable exact, independent sampling from the Born distribution, avoiding the autocorrelation and mixing issues of Markov chain methods.
arXiv:2603. 10289v2 Announce Type: replace-cross Abstract: Whether uniquely quantum resources confer advantages in fully classical, competitive environments remains an open question.
The paper introduces GenQAS, a tensor network‑guided reinforcement learning framework that uses a learned local transition model to generate synthetic circuit transitions for prioritized generative replay. By mixing these synthetic transitions with real experience during Double Deep Q‑Network updates, GenQAS addresses sample starvation in quantum architecture search. Across benchmarks ranging from 6 to 15 qubits, the method improves success probabilities, identifies compact circuits, and reduces steps to chemical accuracy by up to 92.7%.