self-modulating-quantum-fast-weight

name	self-modulating-quantum-fast-weight
description	Stable Self-Modulating Quantum Fast-Weight Programmers with bounded memory gates. Quantum sequence modeling using dynamically programmed variational-circuit parameters with bounded old-state modulation for long-sequence stability. Activation: quantum fast weight, QFWP, quantum sequence modeling, quantum memory gates, quantum dynamics forecasting.

Self-Modulating Quantum Fast-Weight Programmers (QFWP)

Based on: arXiv:2607.02363 "Stable Self-Modulating Quantum Fast-Weight Programmers with Bounded Memory Gates" Authors: Kuo-Chung Peng, Jiun-Cheng Jiang, Chun-Hua Lin, Samuel Yen-Chi Chen et al. Date: 2026-07-02

Overview

Quantum Fast-Weight Programmers (QFWPs) store temporal information in dynamically programmed variational-circuit parameters rather than in nonlinear recurrent hidden states, offering a practical route to quantum sequence modeling. This methodology stabilizes QFWPs for long-sequence regimes using bounded old-state modulation.

Key Architecture

Standard QFWP

• Temporal information stored in variational-circuit parameters (not hidden states)
• Fast weights updated at each time step via input-dependent gates
• Suitable for quantum sequence modeling tasks

Self-Modulating QFWP (Original - Unbounded)

• Input-dependent gates for BOTH:
  • New fast-weight updates (additive)
  • Accumulated fast-weight state (multiplicative)
• Problem: Unbounded old-state multiplier diverges in long-sequence regimes

Bounded Self-Modulating QFWP (Proposed - Stable)

• Sign-preserving tanh gate applied ONLY to recurrent memory branch
• Additive update and new-update modulation left unchanged
• Removes long-sequence divergence while preserving improvement

Core Mechanism

h_t = tanh(α · h_{t-1}) + β · g_new(x_t)

Where:

• h_t = accumulated fast-weight state at time t
• α = old-state modulation coefficient
• β = new-update modulation coefficient
• g_new(x_t) = input-dependent new fast-weight update
• tanh = sign-preserving bounded gate on recurrent branch only

Design Principles

1. Separate Modulation Paths: Old-state (recurrent) vs new-update (input) modulation are independent
2. Bounded Recursion: Only the recurrent memory branch gets bounded (tanh), additive path stays linear
3. Sign Preservation: tanh gate preserves sign of accumulated state, preventing sign flipping artifacts
4. Ablation-Guided Design: Only-Old vs Only-New ablation reveals accumulated-memory modulation as key improvement source

Evaluation Results

Quantum Dynamics Forecasting (CUDA-Q)

• Old-state modulation: most consistent improvement over Standard QFWP
• Bounded gating: removes divergence, improves aggregate robustness
• Unbounded variant: diverges on long sequences

Telecommunication Forecasting (Milan SMS)

• Original unbounded SM-QFWP converges across tested grid
• Clearest gains at longer input windows
• Behavior close to Only-Old ablation

Implementation Pitfalls

Divergence in Long Sequences

Problem: Unbounded old-state multiplier grows without bound for sequences > ~100 steps Fix: Apply tanh gate only to recurrent memory branch: h_t = tanh(α · h_{t-1}) + β · g_new(x_t)

Over-Bounding All Paths

Problem: Bounding both old-state and new-update paths degrades performance Fix: Bound ONLY the recurrent branch; leave additive update and new-update modulation unchanged

Missing Ablation Analysis

Problem: Without Only-Old/Only-New ablations, cannot identify which modulation path drives improvement Fix: Always test 4 variants: Standard QFWP, Full SM-QFWP, Only-New, Only-Old

When to Use

• Quantum sequence modeling tasks (quantum dynamics forecasting, time series prediction)
• Tasks requiring long-sequence stability (>50 time steps)
• Variational quantum circuits needing temporal memory without recurrent hidden states
• Hybrid quantum-classical systems where parameter-based memory is preferred over state-based

When NOT to Use

• Very short sequences (< 10 steps) where Standard QFWP suffices
• Tasks requiring nonlinear recurrent dynamics (use quantum RNN instead)
• Systems with severe gate depth constraints (QFWP adds circuit overhead)

Related Methodologies

• quantum-reservoir-computing - Alternative quantum temporal processing
• quantum-neural-dynamics - Broader quantum neural network patterns
• spiking-transformer-unification - Classical analog of parameter-based temporal memory

References

• arXiv:2607.02363 "Stable Self-Modulating Quantum Fast-Weight Programmers with Bounded Memory Gates"
• CUDA-Q platform for quantum dynamics simulation