LSTM-QGAN: Scalable NISQ Generative Adversarial Network
Not on the map. Why?
Abstract (arXiv)
Current quantum generative adversarial networks (QGANs) still struggle with practical-sized data. First, many QGANs use principal component analysis (PCA) for dimension reduction, which, as our studies reveal, can diminish the QGAN's effectiveness. Second, methods that segment inputs into smaller patches processed by multiple generators face scalability issues. In this work, we propose LSTM-QGAN, a QGAN architecture that eliminates PCA preprocessing and integrates quantum long short-term memory (QLSTM) to ensure scalable performance. Our experiments show that LSTM-QGAN significantly enhances both performance and scalability over state-of-the-art QGAN models, with visual data improvements, reduced Frechet Inception Distance scores, and reductions of 5x in qubit counts, 5x in single-qubit gates, and 12x in two-qubit gates.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 3 Sep 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2025Quantum Long Short-term Memory with Differentiable Architecture Searchcited by 4
- 2026Recursive QLSTM with Dynamic Variational Quantum Circuit Adaptationcited by 2
- 2026Self-Modulating Quantum Fast-Weight Programmers for Efficient Adaptive Sequential Learningcited by 2
- 2025On the Generalization Limits of Quantum Generative Adversarial Networks with Pure State Generatorscited by 0
- 2026Self-Modulating Quantum Fast-Weight Programmers for Efficient Adaptive Sequential Learning22 Jun 2026
- 2026Recursive QLSTM with Dynamic Variational Quantum Circuit Adaptation22 Jun 2026
- 2025Quantum Long Short-term Memory with Differentiable Architecture Search20 Aug 2025
- 2025On the Generalization Limits of Quantum Generative Adversarial Networks with Pure State Generators13 Aug 2025