- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The authors show that the dynamics of diffusion models can be embedded into quantum Lindbladian evolution. This gives a natural generalization of diffusion models, namely, quantum open system dynamics. The authors then construct multiple quantum-inspired classical learning algorithms based on Lindbladian evolution. Finally, the authors evaluate the behavior of their quantum-inspired algorithms; for their SoP and SoT algorithms, they show qualitative differences in sentence generation. For their quantum-inspired remasking technique, the authors show that in various settings it can either improve or worsen the performance of standard pretrained diffusion models with different choices of hyperparameters.
Critical strengths
In my opinion, quantum-inspired classical learning algorithms are an underexplored area in machine learning algorithm design. The authors develop this in a relevant setting---diffusion modeling---and empirically show how these quantum-inspired methods can yield qualitatively different behavior than traditional methods.
Critical weaknesses
While the embedding of diffusion into Lindbladian dynamics is technically new to the best of my knowledge, it is not very surprising given Lindbladian dynamics can be used to describe, e.g., the general stochastic evolution of probability distributions. It is nice to see the exact correspondence written out, however, which mitigates this weakness.
To me, the biggest weakness of the work is the inefficiency of the introduced algorithms. Generally there seems no way to circumvent this as, in the end, the algorithms are based on simulating quantum Lindbladian evolution. The overhead the authors' generalized algorithms introduced might be fine in certain settings, but in my opinion the authors do not do enough to justify in which settings this overhead might be worth it; in fact, they barely discuss the complexity of their algorithms outside of a brief mention in the conclusion. One potential experiment the authors can do to address this weakness would be to perform a comparison between their approach and traditional approaches when the time complexity of each algorithm is fixed. This controls for the overhead induced by considering general Lindbladian evolution and gives more evidence that their algorithms are doing something beyond what existing methods can already achieve.
Unfortunately, I think the main weakness---the inefficiency of the authors' introduced algorithms, limiting the scope---does not do enough to overcome the strengths, and I therefore recommend weak rejection.
Questions for authors
If one fixes the computational complexity of the quantum-inspired approach compared with traditional approaches, do traditional approaches outperform the quantum-inspired approach?
Is there an interesting "middle ground" where the Lindbladian dynamics are generated by efficiently-simulable quantum processes, e.g., stoquastic dynamics or the like?
3 comments
We'd like to thank the authors for their comments and for answering my questions.
The authors' rebuttal to what I perceived as the main weakness of the work then runs into the weakness perceived by Reviewer nMAd; namely, if you are considering this restricted class of Lindbladian operators where this is efficient to classically implement, there is nothing really "quantum-inspired" about it at all (there is not even interference in these special cases). I agree with Reviewer nMAd that the statistics in this setting could be reproduced by other classical samplers. For this reason, I will keep my score.
Thank you for the follow-up. We would like to clarify two distinct points.
First, classical simulability does not preclude a method from being quantum-inspired. Our claim is that the Lindblad framework provides a way to design classical generation algorithms, not that their outputs are impossible to reproduce classically. The efficiently simulable “middle ground” raised in your earlier question is precisely the setting we aim to explore.
Second, the absence of coherence effects applies to our original zero-Hamiltonian construction, but not to the newly added Hamiltonian Prompt Mixing (HPM). In HPM, the Hamiltonian contribution satisfies , so off-diagonal coherences explicitly affect populations. For example, the states have identical component weights but yield different component-measurement probabilities after the rotation. A description retaining only those weights therefore cannot reproduce the dynamics. HPM remains efficiently simulable because each trajectory retains only a shared body and two amplitudes, including their relative phase—not because coherences are absent.
Appendix J derives this mechanism, and Figure 4 shows how adding the Hamiltonian changes the generated-text statistics. We hope this distinction clarifies why classical simulability does not negate either the quantum-inspired construction or the role of coherence in HPM, and ask that you reconsider your assessment in light of this addition.
We thank the reviewer for the thoughtful comments on computational cost and efficiently simulable dynamics. These questions helped us sharpen the discussion of the framework’s practical scope. The revised manuscript includes a comparison under approximately matched computational cost and Hamiltonian Prompt Mixing as an example of efficiently simulable dynamics in which coherence affects generation. We discuss these additions below.
The updated supplementary material includes a PDF of the revised manuscript with revisions highlighted in blue.
Critical Weaknesses
We thank the reviewer for raising this concern. Our methods exploit restricted state representations rather than simulating arbitrary Lindbladian dynamics. The revised manuscript adds HPM as a concrete example: coherences affect generation while each trajectory retains only a shared body and two prompt amplitudes (Appendix J). We also compare QIR with existing remasking methods under approximately matched generation-time budgets (Appendix H). QIR performs comparably to the WINO-style method, and both outperform ReMDM and no remasking. Together, these results demonstrate useful extensions within efficiently simulable dynamics and competitive performance after accounting for computational cost.
Questions for Authors
Question 1
To address this question, we have added a comparison under approximately matched computational cost (Appendix H). We match generation time by allocating more sampling steps to the less expensive ReMDM and no-remasking baselines. QIR and the WINO-style method achieve comparable Qwen preference scores, and both outperform ReMDM and no remasking. Thus, QIR remains competitive when computational cost is approximately matched.
Question 2
Yes. We have added an example of such a middle ground to the revised manuscript: Hamiltonian Prompt Mixing (HPM), in which coherences affect generation while the dynamics remain efficiently simulable on classical hardware. Its Hamiltonian mixes two prompt components while preserving their shared generated body, and the jump updates preserve this two-component representation. Each trajectory therefore requires only one body and two amplitudes, with two prompt-conditioned model evaluations per step. Figure 4 reports the resulting changes in generated text, and Appendix J gives the construction and implementation.