Generative Quantum Data Embeddings for Supervised Learning

• URL: http://arxiv.org/abs/2605.30866v1
• Date: Fri, 29 May 2026 05:48:04 GMT
• Title: Generative Quantum Data Embeddings for Supervised Learning
• Abstract summary: We propose an energy-based generative learning framework that synthesizes gate sequences to optimize embedding structures.<n> Empirically, the method improves classification performance across diverse settings.<n>The results establish a practically useful and theoretically motivated framework for searching effective quantum data embeddings.
• Score: 0.21485350418225238
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many practically relevant applications of quantum machine learning involve classical data, for which performance depends critically on how inputs are embedded into quantum states. Yet the use of a fixed embedding circuit ansatz remains standard practice. We propose an energy-based generative learning framework that synthesizes gate sequences to optimize embedding structures and refine data-tailored parameters, using a fidelity-based surrogate objective to guide the search toward improved class distinguishability. Empirically, the method improves classification performance across diverse settings, while also revealing datasets where architecture search within the present embedding family yields only limited additional gains. We explain this saturation by deriving bounds on the achievable empirical risk in terms of the Wasserstein distance in the input space, showing that classical data geometry provides an \emph{a priori} diagnostic for regimes in which substantial gains from embedding optimization are unlikely. The results establish a practically useful and theoretically motivated framework for searching effective quantum data embeddings through generative optimization, with the attainable gains diagnosed through the geometry of the underlying classical data.

Related papers

• 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)
• Deep Unfolding: Recent Developments, Theory, and Design Guidelines [99.63555420898554]
  This article provides a tutorial-style overview of deep unfolding, a framework that transforms optimization algorithms into structured, trainable ML architectures.<n>We review the foundations of optimization for inference and for learning, introduce four representative design paradigms for deep unfolding, and discuss the distinctive training schemes that arise from their iterative nature.
  arXiv  Detail & Related papers  (2025-12-03T13:16:35Z)
• From Data to Rewards: a Bilevel Optimization Perspective on Maximum Likelihood Estimation [11.440362964307958]
  Generative models form the backbone of modern machine learning, underpinning state-of-the-art systems in text, vision, and multimodal applications.<n>These approaches depend on explicit reward signals, which are often unavailable in practice, leaving open the problem of how to align generative models when only high-quality datasets are accessible.<n>We address this challenge via a Bilevel Optimization framework, where the reward function is treated as the optimization variable of an outer-level problem, while a policy gradient objective defines the inner-level.
  arXiv  Detail & Related papers  (2025-10-08T23:45:37Z)
• Deepfake Detection that Generalizes Across Benchmarks [48.85953407706351]
  The generalization of deepfake detectors to unseen manipulation techniques remains a challenge for practical deployment.<n>This work demonstrates that robust generalization is achievable through a parameter-efficient adaptation of one of the foundational pre-trained vision encoders.<n>The proposed method achieves state-of-the-art performance, outperforming more complex, recent approaches in average cross-dataset AUROC.
  arXiv  Detail & Related papers  (2025-08-08T12:03:56Z)
• Equation discovery framework EPDE: Towards a better equation discovery [50.79602839359522]
  We enhance the EPDE algorithm -- an evolutionary optimization-based discovery framework.<n>Our approach generates terms using fundamental building blocks such as elementary functions and individual differentials.<n>We validate our algorithm's noise resilience and overall performance by comparing its results with those from the state-of-the-art equation discovery framework SINDy.
  arXiv  Detail & Related papers  (2024-12-28T15:58:44Z)
• Benchmarking quantum machine learning kernel training for classification tasks [0.0]
  This study focuses on quantum kernel methods in the context of classification tasks.<n>It examines the performance of Quantum Kernel Estimation (QKE) and Quantum Kernel Training (QKT) in connection with two quantum feature mappings.<n> Experimental results indicate that quantum methods exhibit varying performance across different datasets.
  arXiv  Detail & Related papers  (2024-08-17T10:53:06Z)
• Implicitly Guided Design with PropEn: Match your Data to Follow the Gradient [52.2669490431145]
  PropEn is inspired by'matching', which enables implicit guidance without training a discriminator. We show that training with a matched dataset approximates the gradient of the property of interest while remaining within the data distribution.
  arXiv  Detail & Related papers  (2024-05-28T11:30:19Z)
• Strategic Data Re-Uploads: A Pathway to Improved Quantum Classification Data Re-Uploading Strategies for Improved Quantum Classifier Performance [0.0]
  Re-uploading classical information into quantum states multiple times can enhance the accuracy of quantum classifiers. We demonstrate our approach to two classification patterns: a linear classification pattern (LCP) and a non-linear classification pattern (NLCP)
  arXiv  Detail & Related papers  (2024-05-15T14:28:00Z)
• Quantum Data Encoding: A Comparative Analysis of Classical-to-Quantum Mapping Techniques and Their Impact on Machine Learning Accuracy [0.0]
  This research explores the integration of quantum data embedding techniques into classical machine learning (ML) algorithms. Our findings reveal that quantum data embedding contributes to improved classification accuracy and F1 scores.
  arXiv  Detail & Related papers  (2023-11-17T08:00:08Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• HyperImpute: Generalized Iterative Imputation with Automatic Model Selection [77.86861638371926]
  We propose a generalized iterative imputation framework for adaptively and automatically configuring column-wise models. We provide a concrete implementation with out-of-the-box learners, simulators, and interfaces.
  arXiv  Detail & Related papers  (2022-06-15T19:10:35Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• Quantum Embedding Search for Quantum Machine Learning [2.7612093695074456]
  We introduce a novel quantum embedding search algorithm (QES), pronounced as "quest" We establish the connection between the structures of quantum embedding and the representations of directed multi-graphs, enabling a well-defined search space. We demonstrate the feasibility of our proposed approach on synthesis and Iris datasets, which empirically shows that quantum embedding architecture by QES outperforms manual designs.
  arXiv  Detail & Related papers  (2021-05-25T11:50:57Z)

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.