Chapter 07 / Concept 26 of 48

Quantum circuit GANs

A quantum generator can be trained adversarially against a classical or quantum discriminator.

Input / assumptions→ Quantum or learning model→ Measurement / inference→ Validation

Core idea

A quantum generator can be trained adversarially against a classical or quantum discriminator. The central design question is what information the representation retains, which operations are physically implementable, and how prediction quality and total resource cost are measured. In QML, a mathematical formulation must be paired with an explicit data-access model and a reproducible evaluation protocol.

$$\min_G\max_D\;\mathbb E_{x\sim p_d}\log D(x)+\mathbb E_{z}\log(1-D(G(z)))$$

Worked example

Use a two-qubit generator and classical discriminator to match a toy discrete distribution.

How to study or implement it

Start with a minimal analytic case that can be checked by hand. Build a noiseless simulation, inspect intermediate states or predictions, and then repeat with finite sampling. Compare against a suitable classical reference using the same dataset, preprocessing, and evaluation split. Record circuit depth, qubit count, optimization steps, and measurement budget.

Interpretation and limitations

Adversarial optimization can be unstable even without quantum hardware noise. When evaluating experimental claims, separate theoretical asymptotic statements from measured end-to-end performance. Include preprocessing, state preparation, parameter tuning and output extraction in the comparison.

Further exploration

See the chapter overview, interactive lab, guided learning path, and curated sources.

◈ QuantumVerse Hub