Toward Generative Quantum Utility via Correlation-Complexity Map

• URL: http://arxiv.org/abs/2603.06440v1
• Date: Fri, 06 Mar 2026 16:25:17 GMT
• Title: Toward Generative Quantum Utility via Correlation-Complexity Map
• Abstract summary: Correlation-Complexity Map for determining when real-world data distributions are structurally aligned with IQP-type quantum generative models.<n>Characterized by two complementary indicators: (i) a Quantum Correlation-Likeness Indicator (QCLI), computed from the dataset's correlation-order (Walsh-Hadamard/Fourier) power spectrum aggregated by interaction order and quantified via Jensen-Shannon divergence from an i.i.d. binomial reference; and (ii) a Classical Correlation-Complexity Indicator (CCI), defined as the fraction of total correlation not captured by the optimal Chow-Liu tree
• Score: 10.037801594045519
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a Correlation-Complexity Map as a practical diagnostic tool for determining when real-world data distributions are structurally aligned with IQP-type quantum generative models. Characterized by two complementary indicators: (i) a Quantum Correlation-Likeness Indicator (QCLI), computed from the dataset's correlation-order (Walsh-Hadamard/Fourier) power spectrum aggregated by interaction order and quantified via Jensen-Shannon divergence from an i.i.d. binomial reference; and (ii) a Classical Correlation-Complexity Indicator (CCI), defined as the fraction of total correlation not captured by the optimal Chow-Liu tree approximation, normalized by total correlation. We provide theoretical support by relating QCLI to a support-mismatch mechanism, for fixed-architecture IQP families trained with an MMD objective, higher QCLI implies a smaller irreducible approximation floor. Using the map, we identify the classical turbulence data as both IQP-compatible and classically complex (high QCLI/high CCI). Guided by this placement, we use an invertible float-to-bitstring representation and a latent-parameter adaptation scheme that reuses a compact IQP circuit over a temporal sequence by learning and interpolating a low-dimensional latent trajectory. In comparative evaluations against classical models such as Restricted Boltzmann Machine (RBM) and Deep Convolutional Generative Adversarial Networks (DCGAN), the IQP approach achieves competitive distributional alignment while using substantially fewer training snapshots and a small latent block, supporting the use of QCLI/CCI as practical indicators for locating IQP-aligned domains and advancing generative quantum utility.

Related papers

• Image Classification Using CNN-QNN Hybrid Model with Optimized Correlated Features [5.4251532917943415]
  We propose a method to optimize the correlation among convolutional neural network (CNN) features that are used as inputs to quantum neural network (QNN)<n>We introduce correlated features that are more physically compatible with QNN.
  arXiv  Detail & Related papers  (2026-08-05T02:39:03Z)
• Parity Supervision as a Driver of Generalization in Quantum Generative Modeling [3.2007395340330898]
  Generalizing from finite samples to unseen valid states is central to discrete generative modeling.<n>We compare an IQP circuit Born machine trained by parity supervision with the same circuit trained by coordinate-wise mean-squared-error (MSE)<n>Parity supervision improves exact forward Kullback-Leibler (KL) fit and unseen high-value-state recovery over IQP-MSE, while the maximum-entropy control does not reproduce the full effect.
  arXiv  Detail & Related papers  (2026-05-11T09:24:12Z)
• Parameterized Quantum Circuits as Feature Maps: Representation Quality and Readout Effects in Multispectral Land-Cover Classification [0.0]
  We investigate variational quantum classifiers (VQCs) for land-cover classification from multispectral satellite imagery.<n>Our results show that, while VQCs with linear readout do not outperform strong classical baselines such as RBF-SVM, the same trained quantum feature map can significantly improve performance.
  arXiv  Detail & Related papers  (2026-04-29T13:47:18Z)
• The Impact of Qubit Connectivity on Quantum Advantage in Noisy IQP Circuits [12.732381296045054]
  Instantaneous Quantum Polynomial-time (IQP) circuits are a candidate for demonstrating near-term quantum advantage.<n>We show that qubit connectivity is a key parameter in this transition, since sparse architectures require additional routing to implement long-range interactions.<n>We quantify this architecture-dependent shift using the compiled depth overhead and the corresponding simulatability margin.
  arXiv  Detail & Related papers  (2026-04-14T12:06:48Z)
• Domain-Aware Hybrid Quantum Learning via Correlation-Guided Circuit Design for Crime Pattern Analytics [54.3410887955176]
  Crime pattern analysis is critical for law enforcement and predictive policing.<n>The surge in criminal activities from rapid urbanization creates high-dimensional, imbalanced datasets.<n>This study presents a quantum-classical comparison framework for crime analytics.
  arXiv  Detail & Related papers  (2026-04-08T06:05:25Z)
• Extending the Handover-Iterative VQE to Challenging Strongly Correlated Systems: $N_2$ and Fe-S Cluster [2.467148411642925]
  We introduce the Handover-Iterative Variational Quantum Eigensolver (HI-VQE) as a practical quantum computing algorithm with an iterative "handover" mechanism.<n>We benchmark two strongly correlated systems, the nitrogen molecule $N$ and iron-sulfur (Fe-S) cluster, which serve as stringent tests for both classical and quantum electronic-structure methods.
  arXiv  Detail & Related papers  (2026-01-11T14:51:51Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Scalable Quantum Walk-Based Heuristics for the Minimum Vertex Cover Problem [0.0]
  We propose a novel quantum algorithm for the Minimum Vertex Cover (MVC) problem based on continuous-time quantum walks (CTQWs)<n>In this framework, the coherent propagation of a quantum walker over a graph encodes its structural properties into state amplitudes.<n>We show that the CTQW-based algorithm consistently achieves superior approximation ratios and exhibits remarkable robustness with respect to network topology.
  arXiv  Detail & Related papers  (2025-12-02T17:04:57Z)
• Correlation hypergraph: a new representation of a quantum marginal independence pattern [0.0]
  We introduce a new representation of the patterns of marginal independence based on certain correlation hypergraphs.<n>We show that these correlation hypergraphs generalize to arbitrary quantum systems.<n>In the context of holography, we apply these techniques to derive a necessary condition for the realizability of entropy vectors.
  arXiv  Detail & Related papers  (2024-12-23T22:29:14Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Pointer Networks with Q-Learning for Combinatorial Optimization [55.2480439325792]
  We introduce the Pointer Q-Network (PQN), a hybrid neural architecture that integrates model-free Q-value policy approximation with Pointer Networks (Ptr-Nets) Our empirical results demonstrate the efficacy of this approach, also testing the model in unstable environments.
  arXiv  Detail & Related papers  (2023-11-05T12:03:58Z)
• IPCC-TP: Utilizing Incremental Pearson Correlation Coefficient for Joint Multi-Agent Trajectory Prediction [73.25645602768158]
  IPCC-TP is a novel relevance-aware module based on Incremental Pearson Correlation Coefficient to improve multi-agent interaction modeling. Our module can be conveniently embedded into existing multi-agent prediction methods to extend original motion distribution decoders.
  arXiv  Detail & Related papers  (2023-03-01T15:16:56Z)
• Problem-Dependent Power of Quantum Neural Networks on Multi-Class Classification [83.20479832949069]
  Quantum neural networks (QNNs) have become an important tool for understanding the physical world, but their advantages and limitations are not fully understood. Here we investigate the problem-dependent power of QCs on multi-class classification tasks. Our work sheds light on the problem-dependent power of QNNs and offers a practical tool for evaluating their potential merit.
  arXiv  Detail & Related papers  (2022-12-29T10:46:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.