Toward Generative Quantum Utility via Correlation-Complexity Map
Chen-Yu Liu, Leonardo Placidi, Eric Brunner, Enrico Rinaldi

TL;DR
This paper introduces a diagnostic tool to predict the suitability of datasets for quantum generative models, specifically IQP circuits, and demonstrates its effectiveness on turbulence data with a low-data, low-parameter quantum approach.
Contribution
The authors develop a Correlation-Complexity Map to assess dataset compatibility with quantum models and apply it to identify promising data for quantum generative learning.
Findings
Correlation-Complexity Map effectively predicts dataset suitability for IQP-based quantum models.
Turbulence data identified as promising for quantum generative modeling.
Quantum approach shows competitive performance in low-data, low-parameter settings.
Abstract
We study a practical question in generative quantum machine learning: given a classical dataset, can we determine, before training, whether it is well suited to a quantum generative model? We focus on a class of quantum circuits known as instantaneous quantum polynomial-time (IQP) circuits, whose output distributions are widely believed to be difficult to sample from using classical methods. These circuits are used to build our quantum generative models. We introduce a Correlation-Complexity Map, a simple diagnostic built from two quantities computed from data samples. The first measures how closely the dataset's spectral correlation patterns resemble those naturally produced by IQP circuits, while the second quantifies how much of the dataset's structural correlation cannot be captured by simple pairwise models. In other words, we can estimate beforehand how well a dataset can be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
