- Perspective
- Open Access
Toward structure-preserving quantum encodings
Phys. Rev. Research 7, 041001 – Published 8 December, 2025
DOI: https://doi.org/10.1103/rph8-g15q
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.
Physics Subject Headings (PhySH)
Article Text
References (137)
- S. Aaronson, Read the fine print, Nat. Phys. 11, 291 (2015).
- S. Sim, P. D. Johnson, A. Aspuru-Guzik, Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms, Adv. Quantum Technol. 2, 1900070 (2019).
- H.-Y. Huang, M. Broughton, M. Mohseni, R. Babbush, S. Boixo, H. Neven, and J. R. McClean, Power of data in quantum machine learning, Nat. Commun. 12, 1 (2021).
- S. Thanasilp, S. Wang, M. Cerezo, and Z. Holmes, Exponential concentration in quantum Kernel methods, Nat. Commun. 15, 5200 (2024).
- J. Bowles, S. Ahmed, and M. Schuld, Better than classical? The subtle art of benchmarking quantum machine learning models, arXiv:2403.07059.
- M. A. Khan, M. N. Aman, B. Sikdar, Beyond bits: A review of quantum embedding techniques for efficient information processing, IEEE Access 12, 46118 (2024).
- S. M. Lane, Categories for the Working Mathematician (Springer Science & Business Media, New York, NY, 2013), Vol. 5.
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th Anniversary Edition (Cambridge University Press, Cambridge, UK, 2011).
- G. Benenti, G. Casati, D. Rossini, and G. Strini, Principles of Quantum Computation and Information: A Comprehensive Textbook (World Scientific, New Jersey, US, 2019).
- S. Jerbi, L. J. Fiderer, H. Poulsen Nautrup, J. M. Kübler, H. J. Briegel, and V. Dunjko, Quantum machine learning beyond kernel methods, Nat. Commun. 14, 517 (2023).
- M. Schuld, Supervised quantum machine learning models are kernel methods, arXiv:2101.11020.
- M. Benedetti, E. Lloyd, S. Sack, and M. Fiorentini, Parameterized quantum circuits as machine learning models, Quantum Sci. Technol. 4, 043001 (2019).
- J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, Barren plateaus in quantum neural network training landscapes, Nat. Commun. 9, 4812 (2018).
- M. Larocca, S. Thanasilp, S. Wang, K. Sharma, J. Biamonte, P. J. Coles, L. Cincio, J. R. McClean, Z. Holmes, and M. Cerezo, Barren plateaus in variational quantum computing, Nat. Rev. Phys. 7, 174 (2025).
- M. Ragone, B. N. Bakalov, F. Sauvage, A. F. Kemper, C. Ortiz Marrero, M. Larocca, and M. Cerezo, A Lie algebraic theory of barren plateaus for deep parameterized quantum circuits, Nat. Commun. 15, 7172 (2024).
- E. Fontana, D. Herman, S. Chakrabarti, N. Kumar, R. Yalovetzky, J. Heredge, S. H. Sureshbabu, and M. Pistoia, Characterizing barren plateaus in quantum ansätze with the adjoint representation, Nat. Commun. 15, 7171 (2024).
- M. Cerezo, M. Larocca, D. García-Martín, N. L. Diaz, P. Braccia, E. Fontana, M. S. Rudolph, P. Bermejo, A. Ijaz, S. Thanasilp, E. R. Anschuetz, and Z. Holmes, Does provable absence of barren plateaus imply classical simulability? Nat. Commun. 16, 7907 (2025).
- I. F. Araujo, D. K. Park, F. Petruccione, and A. J. da Silva, A divide-and-conquer algorithm for quantum state preparation, Sci. Rep. 11, 6329 (2021).
- M. Schuld, A. Bocharov, K. M. Svore, and N. Wiebe, Circuit-centric quantum classifiers, Phys. Rev. A 101, 032308 (2020).
- E. Tang, Quantum principal component analysis only achieves an exponential speedup because of its state preparation assumptions, Phys. Rev. Lett. 127, 060503 (2021).
- M. Schuld, R. Sweke, and J. J. Meyer, Effect of data encoding on the expressive power of variational quantum-machine-learning models, Phys. Rev. A 103, 032430 (2021).
- R. LaRose and B. Coyle, Robust data encodings for quantum classifiers, Phys. Rev. A 102, 032420 (2020).
- S. Lloyd, M. Schuld, A. Ijaz, J. Izaac, and N. Killoran, Quantum embeddings for machine learning, arXiv:2001.03622.
- M. Schuld and N. Killoran, Quantum machine learning in feature Hilbert spaces, Phys. Rev. Lett. 122, 040504 (2019).
- V. Havlíček, A. D. Córcoles, K. Temme, A. W. Harrow, A. Kandala, J. M. Chow, J. M. Gambetta, Supervised learning with quantum-enhanced feature spaces, Nature (London) 567, 209 (2019).
- T. Goto, Q. H. Tran, K. Nakajima, Universal approximation property of quantum machine learning models in quantum-enhanced feature spaces, Phys. Rev. Lett. 127, 090506 (2021).
- J. Kim and S. Bekiranov, Generalization performance of quantum metric learning classifiers, Biomolecules 12, 1576 (2022).
- S. Thanasilp, S. Wang, N. A. Nghiem, P. Coles, and M. Cerezo, Subtleties in the trainability of quantum machine learning models, Quantum Mach. Intell. 5, 21 (2023).
- M. Cerezo, G. Verdon, H.-Y. Huang, L. Cincio, and P. J. Coles, Challenges and opportunities in quantum machine learning, Nat. Comput. Sci. 2, 567 (2022).
- J. J. Meyer, M. Mularski, E. Gil-Fuster, A. A. Mele, F. Arzani, A. Wilms, and J. Eisert, Exploiting symmetry in variational quantum machine learning, PRX Quantum 4, 010328 (2023).
- M. Ragone, P. Braccia, Q. T. Nguyen, L. Schatzki, P. J. Coles, F. Sauvage, M. Larocca, and M. Cerezo, Representation theory for geometric quantum machine learning, arXiv:2210.07980.
- Q. T. Nguyen, L. Schatzki, P. Braccia, M. Ragone, P. J. Coles, F. Sauvage, M. Larocca, and M. Cerezo, Theory for equivariant quantum neural networks, PRX Quantum 5, 020328 (2024).
- K. Fukushima, Neocognitron: A self-organizing neural network model for a mechanism of pattern recognition unaffected by shift in position, Biol. Cybern. 36, 193 (1980).
- M. M. Bronstein, J. Bruna, T. Cohen, and P. Veličković, Geometric deep learning: Grids, groups, graphs, geodesics, and gauges, arXiv:2104.13478.
- M. M. Bronstein, J. Bruna, Y. LeCun, A. Szlam, and P. Vandergheynst, Geometric deep learning: Going beyond euclidean data, IEEE Signal Process. Mag. 34, 18 (2017).
- M. Larocca, F. Sauvage, F. M. Sbahi, G. Verdon, P. J. Coles, and M. Cerezo, Group-invariant quantum machine learning, PRX Quantum 3, 030341 (2022).
- S. Lloyd, S. Garnerone, P. Zanardi, Quantum algorithms for topological and geometric analysis of data, Nat. Commun. 7, 10138 (2016).
- A. Vlasic and A. Pham, Understanding the mapping of encode data through an implementation of quantum topological analysis, Quantum Inf. Comput. 23, 1091 (2023).
- E. Riehl, Category Theory in Context (Dover Publications, Garden City, NY, 2016).
- P. Perrone, Notes on category theory with examples from basic mathematics, arXiv:1912.10642.
- T. Leinster, Basic Category Theory, Vol. 143 (Cambridge University Press, Cambridge, UK, 2014).
- C. Heunen and J. Vicary, Categories for Quantum Theory: An Introduction (Oxford University Press, Oxford, UK, 2019).
- B. Coecke and A. Kissinger, Picturing Quantum Processes: A First Course in Quantum Theory and Diagrammatic Reasoning (Cambridge University Press, Cambridge, UK, 2017).
- L. Corry, Modern Algebra and the Rise of Mathematical Structures, 2nd ed. (Birkhäuser, Basel, 2004).
- G. Carlsson, Topology and data, Bull. Am. Math. Soc. 46, 255 (2009).
- L. McInnes, J. Healy, J. Melville, UMAP: Uniform manifold approximation and projection for dimension reduction, arXiv:1802.03426.
- T. Hagino, A categorical programming language, Ph.D. thesis, University of Edinburgh, 1987.
- C. Heunen, O. Kammar, S. Staton, and H. Yang, A convenient category for higher-order probability theory, in 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (IEEE, New York, NY, 2017), pp. 1–12.
- C. F. Strnadl, The mathematical syntax of architectures, arXiv:2004.03719.
- R. Cornish, Neural network symmetrisation in concrete settings, arXiv:2412.09469.
- R. Cornish, Stochastic neural network symmetrisation in markov categories, arXiv:2406.11814.
- B. Fong, D. I. Spivak, R. Tuyéras, Backprop as functor: A compositional perspective on supervised learning, in Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS ’19 (IEEE Press, New York, NY, 2021).
- B. Gavranović, P. Lessard, A. Dudzik, T. von Glehn, J. G. Araújo, and P. Veličković, Position: Categorical deep learning is an algebraic theory of all architectures, in Proceedings of the 41st International Conference on Machine Learning (PMLR, 2024), Vol. 235, pp. 15209–15241.
- D. Deutsch and R. Jozsa, Rapid solution of problems by quantum computation, Proc. R. Soc. London A 439, 553 (1992).
- A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009).
- S. Lloyd, M. Mohseni, and P. Rebentrost, Quantum algorithms for supervised and unsupervised machine learning, arXiv:1307.0411.
- L. Grover and T. Rudolph, Creating superpositions that correspond to efficiently integrable probability distributions, arXiv:quant-ph/0208112.
- P. Kaye and M. Mosca, Quantum networks for generating arbitrary quantum states, in Optical Fiber Communication Conference and International Conference on Quantum Information (Optica Publishing Group, Washington, DC, 2001), p. PB28.
- M. Schuld and F. Petruccione, Machine Learning with Quantum Computers, 2nd ed. (Springer, Cham, 2021), Vol. 676.
- J. von Neumann, Mathematical Foundations of Quantum Mechanics: New Edition (Princeton University Press, New York, NY, 2018).
- B. C. Hall, Quantum Theory for Mathematicians, Graduate Texts in Mathematics (Springer, New York, NY, 2013), Vol. 267.
- J. R. Glick, T. P. Gujarati, A. D. Córcoles, Y. Kim, A. Kandala, J. M. Gambetta, and K. Temme, Covariant quantum kernels for data with group structure, Nat. Phys. 20, 479 (2024).
- Z. P. Bradshaw, E. N. Evans, M. Cook, and M. L. LaBorde, Learning equivariant maps with variational quantum circuits, Phys. Rev. Appl. 23, 044007 (2025).
- B. C. Hall, Lie Groups, Lie Algebras, and Representations, 2nd ed. (Springer, Cham, 2015).
- E. Tang, Dequantizing algorithms to understand quantum advantage in machine learning, Nat. Rev. Phys. 4, 692 (2022).
- E. R. Anschuetz, A. Bauer, B. T. Kiani, and S. Lloyd, Efficient classical algorithms for simulating symmetric quantum systems, Quantum 7, 1189 (2023).
- C. Tüysüz, S. Y. Chang, M. Demidik, K. Jansen, S. Vallecorsa, and M. Grossi, Symmetry breaking in geometric quantum machine learning in the presence of noise, PRX Quantum 5, 030314 (2024).
- I. N. M. Le, O. Kiss, J. Schuhmacher, I. Tavernelli, and F. Tacchino, Symmetry-invariant quantum machine learning force fields, New J. Phys. 27, 023015 (2025).
- M. F. Langer, S. N. Pozdnyakov, and M. Ceriotti, Probing the effects of broken symmetries in machine learning, Mach. Learn.: Sci. Technol. 5, 04LT01 (2024).
- J. R. Munkres, Topology: A First Course, 2nd ed. (Prentice-Hall, Inc., Saddle River, NJ, 2000).
- J. Baez and J. P. Muniain, Gauge Fields, Knots and Gravity, Series on Knots and Everything (World Scientific, Singapore, 1994), Vol. 4.
- J. M. Lee, Introduction to Smooth Manifolds, Graduate Texts in Mathematics, 2nd ed. (Springer, New York, 2013), Vol. 218.
- T.-D. Bradley, T. Bryson, J. Terilla, Topology: A Categorical Approach (MIT Press, Cambridge, MA, 2020).
- W. Rudin, Principles of Mathematical Analysis, 3rd ed. (McGraw-Hill, New York, 1976).
- Defining smoothness on the full state space is a bit subtle because is not technically a smooth manifold, though it is a convex space [109]. Despite the lack of smoothness in the usual sense, for most of the examples we consider in this paper, the quantum state encodings will factor through the subspace of pure states, which is a smooth manifold (it is a complex projective space). For this reason, we will not concern ourselves too much with going into the more technical details regarding the smooth structure on .
- A. Skolik, J. R. McClean, M. Mohseni, P. van der Smagt, and M. Leib, Layerwise learning for quantum neural networks, Quantum Mach. Intell. 3, 5 (2021).
- G. De Luca, A. Vlasic, M. Vitz, and A. Pham, Empirical power of quantum encoding methods for binary classification, Quantum Mach. Intell. 7, 72 (2025).
- M. Arnott, D. Papaioannou, K. McDowall, P. Lolur, and B. Baldé, Reverse map projections as equivariant quantum embeddings, arXiv:2407.19906.
- G. Carlsson and M. Vejdemo-Johansson, Topological Data Analysis with Applications (Cambridge University Press, Cambridge, UK, 2021).
- R. Ghrist, Barcodes: The persistent topology of data, Bull. Am. Math. Soc. 45, 61 (2008).
- C. Glass and E. Vidaurre, Topological data analysis via undergraduate linear algebra, arXiv:2406.17045.
- J. R. Munkres, Elements of Algebraic Topology (CRC Press, 1984).
- D. Burago, Y. Burago, and S. Ivanov, A Course in Metric Geometry, Graduate Studies in Mathematics (American Mathematical Society, Providence, RI, 2001), Vol. 33.
- V. Bryant, Metric Spaces: Iteration and Application (Cambridge University Press, Cambridge, UK, 1985).
- J.-C. Hausmann, On the Vietoris-Rips complexes and a cohomology theory for metric spaces, in Prospects in Topology (AM-138): Proceedings of a Conference in Honor of William Browder (Princeton University Press, Princeton, 1996), Vol. 138, pp. 175–188.
- A. Zomorodian and G. Carlsson, Computing persistent homology, Discrete Comput. Geom. 33, 249 (2005).
- G. Carlsson, Topological pattern recognition for point cloud data, Acta Numer. 23, 289 (2014).
- D. Cohen-Steiner, H. Edelsbrunner, and J. Harer, Stability of persistence diagrams, Discrete Comput. Geom. 37, 103 (2007).
- F. Mémoli and K. Singhal, A primer on persistent homology of finite metric spaces, Bull. Math. Biol. 81, 2074 (2019).
- H. Edelsbrunner, D. Letscher, and A. Zomorodian, Topological persistence and simplification, Discrete Comput. Geom. 28, 511 (2002).
- A. Bellet, A. Habrard, and M. Sebban, Metric Learning, Synthesis Lectures on Artificial Intelligence and Machine Learning (Springer, Cham, 2015).
- E. Xing, M. Jordan, S. J. Russell, and A. Ng, Distance metric learning with application to clustering with side-information, in Advances in Neural Information Processing Systems, edited by S. Becker, S. Thrun, and K. Obermayer (MIT Press, Cambridge, MA, 2002), Vol. 15, pp. 521–528.
- K. Q. Weinberger and L. K. Saul, Distance metric learning for large margin nearest neighbor classification, J. Mach. Learn. Res. 10, 207 (2009).
- S. Chopra, R. Hadsell,Y. LeCun, Learning a similarity metric discriminatively, with application to face verification, in 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’05), Vol. 1 (IEEE, New York, NY, 2005), pp. 539–546.
- B. Kulis, Metric learning: A survey, FNT Mach. Learn. 5, 287 (2012).
- M. Kaya and H. Ş. Bilge, Deep metric learning: A survey, Symmetry 11, 1066 (2019).
- D. Kedem, S. Tyree, F. Sha, G. Lanckriet, and K. Q. Weinberger, Non-linear metric learning, in Advances in Neural Information Processing Systems, edited by F. Pereira, C. J. Burges, L. Bottou, and K. Q. Weinberger (Curran Associates, Inc., Red Hook, NY, 2012), Vol. 25.
- M. Hillery, Nonclassical distance in quantum optics, Phys. Rev. A 35, 725 (1987).
- D. Dieks and P. Veltkamp, Distance between quantum states, statistical inference and the projection postulate, Phys. Lett. A 97, 24 (1983).
- S. L. Braunstein and C. M. Caves, Statistical distance and the geometry of quantum states, Phys. Rev. Lett. 72, 3439 (1994).
- D. Bures, An extension of Kakutani’s theorem on infinite product measures to the tensor product of semifinite -algebras, Trans. Am. Math. Soc. 135, 199 (1969).
- A. Uhlmann, The “transition probability” in the state space of a -algebra, Rep. Math. Phys. 9, 273 (1976).
- M. Hübner, Explicit computation of the Bures distance for density matrices, Phys. Lett. A 163, 239 (1992).
- A. R. Kuzmak, Measuring distance between quantum states on a quantum computer, Quantum Inf. Process. 20, 269 (2021).
- J. Watrous, The Theory of Quantum Information (Cambridge University Press, Cambridge, UK, 2018).
- K. Życzkowski and W. Słomczyński, The Monge distance between quantum states, J. Phys. A: Math. Gen. 31, 9095 (1998).
- V. V. Dodonov, O. V. Man’ko, V. I. Man’ko, and A. Wünsche, Energy-sensitive and “classical-like” distances between quantum states, Phys. Scr. 59, 81 (1999).
- D. Spivak, Metric realization of fuzzy simplicial sets (2009), http://www.dspivak.net/metric_realization090922.pdf.
- I. Bengtsson and K. Życzkowski, Geometry of Quantum States: An Introduction to Quantum Entanglement, 2nd ed. (Cambridge University Press, Cambridge, UK, 2017).
- nLab authors, Structure (2024), https://ncatlab.org/nlab/revision/structure.
- As an example, the real line can be viewed as a category whose objects are elements and where there is a morphism whenever . This is a category due to the transitivity and reflexivity of the partial order, but it is not concrete since morphisms are not structure-preserving functions.
- M. Schuld and N. Killoran, Is quantum advantage the right goal for quantum machine learning? PRX Quantum 3, 030101 (2022).
- R. Wiersema and N. Killoran, Optimizing quantum circuits with Riemannian gradient flow, Phys. Rev. A 107, 062421 (2023).
- P. Kuklinski, B. Rempfer, J. Elenewski, and K. Obenland, Efficient block-encodings require structure, arXiv:2509.19667.
- K. V. Mardia, Some properties of clasical multi-dimesional scaling, Commun. Stat. Theory Methods 7, 1233 (1978).
- J. A. Perea, Multiscale projective coordinates via persistent cohomology of sparse filtrations, Discrete Comput. Geom. 59, 175 (2018).
- S. Aaronson and A. Ambainis, The need for structure in quantum speedups, Theory Comput. 10, 133 (2014).
- E. Tang, A quantum-inspired classical algorithm for recommendation systems, in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC ’19 (ACM, New York, NY, 2019).
- J. Cotler, H.-Y. Huang, and J. R. McClean, Revisiting dequantization and quantum advantage in learning tasks, arXiv:2112.00811.
- S. Shin, Y. S. Teo, and H. Jeong, Dequantizing quantum machine learning models using tensor networks, Phys. Rev. Res. 6, 023218 (2024).
- L. J. Henderson, K. Beer, S. Karuvade, R. Gupta, A. White, and S. Shrapnel, Quantum advantage without exponential concentration: Trainable kernels for symmetry-structured data, arXiv:2509.14337.
- J. Preskill, Quantum computing in the NISQ era and beyond, Quantum 2, 79 (2018).
- R. Gilmore, Lie Groups, Lie Algebras, and Some of Their Applications (Dover Publications, Garden City, NJ, 2006).
- A. M. Bincer, Lie Groups and Lie Algebras. A Physicist’s Perspective (Oxford University Press, Oxford, 2013).
- R. W. Carter, I. G. MacDonald, and G. B. Segal, Lectures on Lie Groups and Lie Algebras, London Mathematical Society Student Texts (Cambridge University Press, Cambridge, UK, 1995).
- There is a slight abuse of notation here that is commonly done in category theory. The vector is identified with the additive map sending to .
- J. W. Milnor, Topology from the Differentiable Viewpoint, Princeton Landmarks in Mathematics and Physics (Princeton University Press, Princeton, NJ, 1997).
- The convex-linear functional sending states to defines a hyperplane in the space of states, which is one of the reasons it is often used for classification tasks in QML [11].
- G. Strang, Introduction to Linear Algebra, 6th ed. (Wellesley-Cambridge Press, Wellesley, MA, 2022).
- An equivalence of categories is a technical term whose formal definition we omit. Intuitively, however, two categories are said to be equivalent if they are effectively the same.
- J. F. Adams, Infinite Loop Spaces, Annals of Mathematics Studies (Princeton University Press, Princeton, NJ, 1978), Vol. 90.
- A. Pressley and G. B. Segal, Loop Groups, Oxford Mathematical Monographs (Clarendon Press, Oxford, UK, 1986).
- J.-L. Brylinski, Loop Spaces, Characteristic Classes and Geometric Quantization, Modern Birkhäuser Classics (Birkhäuser Boston, Inc., Boston, MA, 2008).
- A. J. Parzygnat, Gauge invariant surface holonomy and monopoles, Theory Appl. Categ. 30, 1319 (2015).
- A. Pérez-Salinas, A. Cervera-Lierta, E. Gil-Fuster, and J. I. Latorre, Data re-uploading for a universal quantum classifier, Quantum 4, 226 (2020).
- P. R. Halmos, Finite-Dimensional Vector Spaces, Undergraduate Texts in Mathematics (Springer, New York, 1958).
- A. J. Parzygnat, Two-dimensional algebra in lattice gauge theory, J. Math. Phys. 60, 043506 (2019).