Back to News
quantum-computing

Generative Quantum Data Embeddings for Supervised Learning

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
Researchers Jaewoong Heo and Daniel K. Park introduced a generative learning framework to optimize quantum data embeddings for classical data, addressing a key bottleneck in quantum machine learning performance. The method uses energy-based models to synthesize tailored gate sequences, improving class distinguishability via a fidelity-based objective, outperforming fixed embedding circuits in classification tasks. Empirical tests show significant gains across datasets, though some cases reveal diminishing returns, suggesting inherent limits within current embedding architectures. The study links achievable performance to classical data geometry, using Wasserstein distance bounds to predict when embedding optimization will yield minimal improvements. This work provides both a practical tool for embedding optimization and a theoretical diagnostic to assess potential gains before implementation.
Generative Quantum Data Embeddings for Supervised Learning

Summarize this article with:

Quantum Physics arXiv:2605.30866 (quant-ph) [Submitted on 29 May 2026] Title:Generative Quantum Data Embeddings for Supervised Learning Authors:Jaewoong Heo, Daniel K. Park View a PDF of the paper titled Generative Quantum Data Embeddings for Supervised Learning, by Jaewoong Heo and 1 other authors View PDF HTML (experimental) 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. Comments: Subjects: Quantum Physics (quant-ph); Machine Learning (cs.LG) Cite as: arXiv:2605.30866 [quant-ph] (or arXiv:2605.30866v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2605.30866 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Jaewoong Heo [view email] [v1] Fri, 29 May 2026 05:48:04 UTC (187 KB) Full-text links: Access Paper: View a PDF of the paper titled Generative Quantum Data Embeddings for Supervised Learning, by Jaewoong Heo and 1 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-05 Change to browse by: cs cs.LG References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-machine-learning
energy-climate
quantum-investment

Source Information

Source: arXiv Quantum Physics