- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper investigates whether a separate, compact memory module can architecturally separate sequence feature extraction from historical information storage. The authors propose Quantum Memory Units (QMUs), assigning a parameterized quantum circuit to each feature dimension. The episodic QMU compresses history, while the semantic QMU aggregates statistical information and combines it with classical features through Kalman-style fusion. Results are reported on function approximation, Mackey–Glass, PSMNIST, character trajectories, and copy-memory, primarily emphasizing early-stage learning performance with relatively few parameters. All quantum circuits are simulated on classical computers.
Critical strengths
-
Modularizing feature extraction and compact recurrent memory is a research question of some value; assigning memory modules to individual features also facilitates controlled analysis.
-
The paper attempts to evaluate continuous-history reconstruction, statistical aggregation, and exact symbolic recall separately, rather than evaluating the method on a single task.
-
The authors explicitly clarify that Hilbert-space dimensionality does not equal directly readable classical storage, disclose the high simulation cost, and do not claim practical quantum speedup or energy advantages.
Critical weaknesses
-
The main evaluation metrics are insufficiently defined, and their correspondence with the figures is unclear. Tab. 1 is described as reporting early-window averages, but the window ranges and aggregation methods are not specified for each task and model, and neither random seeds nor variance estimates are reported. In Fig. 4, the QMU curves extend only to approximately 230 steps, whereas the other models extend to approximately 1,600 steps, which is inconsistent with the claim of “complete convergence curves” in the contributions. Estimates from the plotted curves suggest that, on Trajectory, the tabulated QMU result is close to its average over approximately the first 230 steps, while some baseline results are close to their averages over the entire approximately 1,600-step range. Moreover, the values in the two episodic columns of Tab. 1 closely match the errors computed from the individual prediction curves in Fig. 3, which does not show training dynamics. Consequently, the claimed early-stage learning advantage cannot currently be evaluated reliably.
-
The baselines perform anomalously, limiting the informativeness of the comparisons. In Fig. 3(a), the errors of Mamba, LMU, LSTM, and Transformer are all higher than that of an always-zero predictor. On PSMNIST, Mamba and LMU achieve near-chance accuracy within the displayed training range, while LSTM and RC also achieve low accuracy (Fig. 4(a)); however, the paper does not establish whether these baseline configurations and training budgets provide an effective comparison. On MG, the QMU error estimated from the curves is of the same order as first-order persistence, but the paper does not report such simple baselines. On the copy task, QMU and several baselines remain at similarly low accuracy levels, without a memory-free reference, so these results do not establish that QMU provides long-term retention.
-
Key controls needed to attribute the results to QMU are missing. The paper does not compare three conditions under the same classical backbone: removing QMU, replacing it with a small classical recurrent module with a similar parameter count, and removing Kalman fusion. For the structure in Fig. 1(b), if a fresh input qubit independent of the previous memory is prepared at each step, discarded after the interaction, and only local expectation values of the memory qubits are read out, these local readouts can be computed exactly through a recurrence involving one three-dimensional Bloch vector per memory qubit—a very small classical recurrence. The authors need to explain what empirical benefit this structure provides over an inexpensive classical implementation. Furthermore, the feature extractor itself may be an LSTM, so the observed memory capability cannot be attributed directly to QMU.
-
The method is insufficiently specified for reproduction. Eq. 4 does not explain what state is retained for the next time step, how the input qubit is reset, or when the memory is initialized. Discarding the input qubit at each step generally produces a mixed state, which also requires reconciliation with the pure-state notation in the equation. Likewise, the paper does not explain how the covariance and observation matrices in Kalman fusion are specified, learned, or propagated.
-
The basis for the parameter-efficiency comparison is insufficient. The paper sets the classical models’ hidden size to 256 based on the Hilbert-space dimensionality of eight qubits, which does not ensure comparable parameter counts or effective state sizes. Some values in Tab. 2 are also difficult to reconcile with the stated configurations: for a standard, unprojected LSTM with hidden size 256 and fully trainable recurrent weights, the recurrent weights alone exceed the reported 208k parameters; if Mamba’s reported size of 256 refers to its model width, its 6k parameter count is inconsistent with the standard implementation. The paper needs to clarify the exact meaning of hidden size. Without a module-wise parameter breakdown or reasonably configured compact classical baselines, the claim of competitive performance with few parameters is difficult to assess.
-
The novelty relative to prior work is insufficiently established. Takaki et al. (PRA 2021) already employed a quantum recurrent structure in which some qubits retain history while the others are measured and reset at each step to encode new inputs. The paper needs to explain QMU’s specific additions in state updates, readout, or architecture. Furthermore, separating learning and memory has been explored extensively in classical approaches, including external-memory and retrieval-augmented models, but the paper does not discuss this literature.
Questions for authors
-
How exactly is each value in Tab. 1 computed, including the window, aggregation unit, and number of runs? Why do the QMU curves in Fig. 4 extend only to approximately 230 steps? Could you provide complete curves and final metrics under the same training budget, together with means and standard deviations over at least three random seeds?
-
Could you provide pseudocode for the step-by-step state updates, specifying the retained state, how the input qubit is reset, the observables read out, and when the memory is initialized?
-
Could you add the controls described in W3: removing QMU, replacing it with a classical recurrent module with a similar parameter count, implementing Fig. 1(b) through the exact Bloch recurrence, and removing Kalman fusion from the semantic model?
-
What are the inputs and outputs for function approximation and MG? For example, does MG involve next-step or 15-step prediction, and are ground-truth historical inputs used? Could you add constant-prediction, persistence, and linear AR baselines, and explain why Mamba and LMU remain near chance on PSMNIST?
-
Please provide the complete baseline configurations and module-wise parameter counts, explain values such as LSTM’s 208k and Mamba’s 6k parameters, and clarify the specific differences between QMU and Takaki et al. (2021).