arXiv:2412.17772 · Physical Review Research

Toward structure-preserving quantum encodings

Arthur J. Parzygnat, Tai-Danae Bradley, Andrew Vlasic, Anh Pham

Published Oct 21, 2025• 0 citations

Abstract

Harnessing the potential computational advantage of quantum computers for machine learning tasks relies on the uploading of classical data onto quantum computers through what are commonly referred to as quantum encodings. The choice of such encodings may vary substantially from one task to another, and there exist only a few cases where structure has provided insight into their design and implementation, such as symmetry in geometric quantum learning. Here, we propose the perspective that category theory offers a natural mathematical framework for analyzing encodings that respect structure inherent in datasets and learning tasks. We illustrate this with pedagogical examples, which include geometric quantum machine learning, quantum metric learning, topological data analysis, and more. Moreover, such a perspective provides a language in which to ask meaningful and mathematically precise questions for the design of quantum encodings and circuits for quantum machine learning tasks.

DOI: 10.1103/rph8-g15q

Related papers

Data encodings and algorithms for quantum embedding of data

Shivansh Mishra

Encoding classical data into a quantum is some of the most crucial steps to get to a fully functioning quantum computer but to this day there is no data encoding which is optimal for every use case this paper tries to show different data encodings for different use cases with their advantages and disadvantages the paper also shows algorithms that are used to implement those encodings in reality the paper divides the encoding in two different categories fixed and trainable encodings we discuss both the encoding in detail along with their respective use cases we also discuss about data encoding on NISQ(noisy intermediate quantum) computers the paper also discuss the machine learning approach to quantum embedding of data and its advantages along with its use cases in classification tasks and other machine learning tasks

Apr 23, 20230 citations

Quantum machine learning: a classical perspective

Carlo Ciliberto, Mark Herbster, Alessandro Davide Ialongo +4 more

Recently, increased computational power and data availability, as well as algorithmic advances, have led machine learning (ML) techniques to impressive results in regression, classification, data generation and reinforcement learning tasks. Despite these successes, the proximity to the physical limits of chip fabrication alongside the increasing size of datasets is motivating a growing number of researchers to explore the possibility of harnessing the power of quantum computation to speed up classical ML algorithms. Here we review the literature in quantum ML and discuss perspectives for a mixed readership of classical ML and quantum computation experts. Particular emphasis will be placed on clarifying the limitations of quantum algorithms, how they compare with their best classical counterparts and why quantum resources are expected to provide advantages for learning problems. Learning in the presence of noise and certain computationally hard problems in ML are identified as promising directions for the field. Practical questions, such as how to upload classical data into quantum form, will also be addressed.

arXiv:1707.08561Proceedings of the Royal Society A Mathematical Physical and Engineering SciencesJan 1, 2018518 citations

Group-Invariant Quantum Machine Learning

Martín Larocca, Frédéric Sauvage, Faris M. Sbahi +3 more

Quantum machine learning (QML) models are aimed at learning from data encoded in quantum states.Recently, it has been shown that models with little to no inductive biases (i.e., with no assumptions about the problem embedded in the model) are likely to have trainability and generalization issues, especially for large problem sizes.As such, it is fundamental to develop schemes that encode as much information as available about the problem at hand.In this work we present a simple, yet powerful, framework where the underlying invariances in the data are used to build QML models that, by construction, respect those symmetries.These so-called group-invariant models produce outputs that remain invariant under the action of any element of the symmetry group G associated with the dataset.We present theoretical results underpinning the design of G-invariant models, and exemplify their application through several paradigmatic QML classification tasks, including cases when G is a continuous Lie group and also when it is a discrete symmetry group.Notably, our framework allows us to recover, in an elegant way, several well-known algorithms for the literature, as well as to discover new ones.Taken together, we expect that our results will help pave the way towards a more geometric and group-theoretic approach to QML model design.

arXiv:2205.02261PRX QuantumSep 19, 2022147 citations

A framework to study the relationship between classical data and quantum characteristics in quantum machine learning

Iraitz Montalban, Elías F. Combarro, José Ranilla

Abstract Quantum Machine Learning (QML) holds the promise of improving conventional machine learning, but the conditions under which an advantage can be obtained are still unclear. Although many studies have been conducted in the literature, there is no conclusive evidence that allows us to determine which types of classical datasets or which problem complexities benefit from the use of quantum techniques. Moreover, there have been contradicting findings when dealing with small or unbalanced datasets. In order to systematically approach this challenge and clarify the need for quantum properties in specific tasks, we propose the adoption of a framework capable of exploring the solution space of quantum feature maps and providing solid evidence of their potential advantages. Our framework comprises three main components: (a) the construction of datasets designed to highlight the specific characteristics that are expected to be relevant in quantum machine learning tasks; (b) the definition of metrics that serve as proxies for quantum kernels with desirable properties; and (c) an evolutionary-guided search for quantum feature maps maximizing those metrics. When using this framework with sensible parameter choices, we obtain results suggesting that some previous studies may have reported overfitted outcomes. This shows that justifying the need for quantum mechanical properties might be beyond the actual scope of conventional classical tasks, since there is no clear quantum feature that contributes to the gain shown by some of the QML techniques most commonly applied in the literature.

The Journal of SupercomputingMar 10, 20261 citation

Quantum machine learning models for graphs

Frédéric Sauvage, Pranav Kalidindi, Frederic Rapp +1 more

Geometric Machine Learning (GML) successes have been achieved through the thorough study and design of new equivariant neural networks. In comparison, geometric quantum machine learning (GQML) models lack such a detailed understanding and, despite already several proposals, a unifying perspective on their design remains elusive. In this work, we focus on GQML models for graph problems that showcase a lot of structure and still remain frontier in machine learning. For the case when n-node graphs are encoded in n-qubit states, we provide a comprehensive characterization of their constituents. Taken together, these furnish us with a toolbox for the design of quantum graph models, and we further probe its benefits including the natural integration with classical models, generalization of known GQML models (sometimes extending their expressivity at virtually no cost), and straightforward classical pre-training strategies. The latter two features are demonstrated in dedicated numerical experiments.

quant-pharXiv:2607.00698Jul 2, 20260 citations

Representation Theory for Geometric Quantum Machine Learning

Michael Ragone, Paolo Braccia, Nguyen, Quynh T. +5 more

Recent advances in classical machine learning have shown that creating models with inductive biases encoding the symmetries of a problem can greatly improve performance. Importation of these ideas, combined with an existing rich body of work at the nexus of quantum theory and symmetry, has given rise to the field of Geometric Quantum Machine Learning (GQML). Following the success of its classical counterpart, it is reasonable to expect that GQML will play a crucial role in developing problem-specific and quantum-aware models capable of achieving a computational advantage. Despite the simplicity of the main idea of GQML -- create architectures respecting the symmetries of the data -- its practical implementation requires a significant amount of knowledge of group representation theory. We present an introduction to representation theory tools from the optics of quantum learning, driven by key examples involving discrete and continuous groups. These examples are sewn together by an exposition outlining the formal capture of GQML symmetries via "label invariance under the action of a group representation", a brief (but rigorous) tour through finite and compact Lie group representation theory, a reexamination of ubiquitous tools like Haar integration and twirling, and an overview of some successful strategies for detecting symmetries.

arXiv:2210.07980Oct 14, 202222 citations