Paper: arXiv 2309.01363
Authors: Mingyu Lee, Myeongjin Shin, Junseo Lee, Kabgyun Jeong
Abstract
One of the most promising applications in the era of Noisy Intermediate-Scale Quantum (NISQ) computing is quantum generative adversarial networks (QGANs), which offer significant quantum advantages over classical machine learning in various domains. However, QGANs suffer from mode collapse and lack explicit control over the features of generated outputs. To overcome these limitations, we propose InfoQGAN, a novel quantum-classical hybrid generative adversarial network that integrates the principles of InfoGAN with a QGAN architecture. Our approach employs a variational quantum circuit for data generation, a classical discriminator, and a Mutual Information Neural Estimator (MINE) to explicitly optimize the mutual information between latent codes and generated samples. Numerical simulations on synthetic 2D distributions and Iris dataset augmentation demonstrate that InfoQGAN effectively mitigates mode collapse while achieving robust feature disentanglement in the quantum generator. By leveraging these advantages, InfoQGAN not only enhances training stability but also improves data augmentation performance through controlled feature generation. These results highlight the potential of InfoQGAN as a foundational approach for advancing quantum generative modeling in the NISQ era.
Complexity vs Empirical Score
- Math Complexity: 8.5/10
- Empirical Rigor: 2.0/10
- Quadrant: Lab Rats — high math complexity, limited empirical testing
Why this score: The paper is dense with advanced mathematics including variational quantum circuits, mutual information estimation via MINE, and complex optimization, but it relies solely on numerical simulations using synthetic and standard toy datasets without any backtesting or real-world implementation details.
Research Flowchart
flowchart TD
A["Research Goal: <br>Improve QGAN stability <br>& feature control"] --> B["Propose InfoQGAN <br>Hybrid Architecture"]
subgraph B ["Proposed InfoQGAN Architecture"]
B1["Variational Quantum Circuit <br>(Generator)"]
B2["Classical Discriminator"]
B3["Mutual Information Neural Estimator <br>(MINE)"]
B1 --> B3
B3 --> B1
end
B --> C["Data Inputs"]
subgraph C ["Data & Latent Codes"]
C1["Synthetic 2D Distributions"]
C2["Iris Dataset"]
C3["Latent Codes c"]
end
C --> D["Computational Process"]
subgraph D ["Training Loop"]
D1["Generator Gz produces samples"]
D2["Discriminator distinguishes real/fake"]
D3["MINE optimizes I(c; Gz)"]
D1 --> D2
D2 --> D1
D3 --> D1
end
D --> E["Key Findings / Outcomes"]
subgraph E ["Results"]
E1["Mitigated Mode Collapse"]
E2["Robust Feature Disentanglement"]
E3["Enhanced Training Stability"]
E4["Improved Data Augmentation"]
end
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes InfoQGAN, a quantum‑classical hybrid generative adversarial network that combines a variational quantum generator, a classical discriminator, and a Mutual Information Neural Estimator (MINE) to maximize mutual information between latent codes and generated samples.
Source sentence
To overcome these limitations, we propose InfoQGAN, a novel quantum-classical hybrid generative adversarial network that integrates the principles of InfoGAN with a QGAN architecture. Our approach employs a variational quantum circuit for data generation, a classical discriminator, and a Mutual Information Neural Estimator (MINE) to explicitly optimize the mutual information between latent codes and generated
Assumes 2
- Training and evaluation are performed on an ideal quantum simulator (and optionally a noisy Qiskit GenericBackendV2 simulator). model
Source sentence
2-dimensional data generation All training was conducted on an ideal simulator, and for InfoQGAN and QGAN, we also compared results obtained using the Qiskit GenericBackendV2 simulator (hereafter referred to as the noisy environment).
- The quantum generator architecture (number of qubits, layers, and parameters) is identical for InfoQGAN and the baseline QGAN. model
Source sentence
To ensure a fair comparison, the generators in InfoQGAN and QGAN share the same architecture 3/11 and number of parameters. The generator circuit structure is identical for both InfoQGAN and QGAN.
Data
- Synthetic 2‑dimensional uniform diamond‑shaped distribution synthetic public
Source sentence
The predefined target 2D distribution is a uniform, diamond-shaped region within the [0,1] domain, centered at (0.6,0.6) with a side length of 0.4. We used a quantum generator with 5 qubits and 10 layers, resulting in 50 trainable parameters.
- Extended IRIS dataset benchmark public
Source sentence
Iris dataset augmentation The IRIS dataset was first introduced in a seminal paper by R.A. Fisher26. To address this, we used the extended IRIS dataset29, which includes additional dimensions and comprises 1,200 samples.
Costs
Not applicable
Finds 3
- InfoQGAN significantly mitigates mode collapse compared to QGAN, as evidenced by more diverse generated samples and improved training stability. performance
Source sentence
In the outputs generated by QGAN across different epochs, samples tend to cluster in specific regions, suggesting that the model captures only a subset of the target distribution. Furthermore, the model frequently oscillates between these modes, leading to reduced training stability.
- InfoQGAN achieves robust feature disentanglement, enabling controlled generation of arbitrary target distributions that QGAN cannot produce. performance
Source sentence
As you can see, InfoQGAN could generate the arbitrary distributions we designed, but this was not possible in QGAN because the latent code has no meaning. This approach works because InfoQGAN does not cause mode collapse and allows for feature disentanglement.
- When used for data augmentation on the IRIS dataset, InfoQGAN improves classification accuracy by 1.43, 2.00, and 2.88 percentage points for Decision Tree, Logistic Regression, and k‑Nearest Neighbors respectively. performance
Source sentence
Augmenting the dataset with InfoQGAN led to performance improvements of 1.43pp, 2.00pp, and 2.88pp across the three classification models.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 16 related papers). Coverage is partial, so this is neither replication nor refutation.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.