cs.LGJul 22, 2025

Quantum Geometry of Data

Authors: Alexander G. Abanov, Luca Candelori, Harold C. Steinacker, Martin T. Wells, Jerome R. Busemeyer, Cameron J. Hogan, Vahagn Kirakosyan, Nicola Marzari, 

Organizations: Qognitive, Inc., Miami Beach, FL 33139, USA · Stony Brook University, Department of Physics and Astronomy, Stony Brook, NY 11790, USA · Wayne State University, Department of Mathematics, Detroit, MI 48202, USA · University of Vienna, Faculty of Physics, Boltzmanngasse 5, A-1090 Vienna, Austria · 

Abstract

We demonstrate how Quantum Cognition Machine Learning (QCML) encodes data as quantum geometry. In QCML, features of the data are represented by learned Hermitian matrices, and data points are mapped to states in Hilbert space. The quantum geometry description endows the dataset with rich geometric and topological structure---including intrinsic dimension, quantum metric, and Berry curvature---derived directly from the data. QCML captures global properties of data through a compact operator representation. At fixed Hilbert-space dimension, the number of operator parameters grows only linearly with the number of features. The present work provides the first full exposition of QCML as a framework for matrix geometry, establishing its mathematical foundation and demonstrating how operator-level tools from quantum geometry can be directly applied to data. We introduce the matrix Laplacian and its eigenmaps as a geometry-preserving alternative to graph-based embeddings, and we show how topological invariants such as Chern numbers can be extracted from data for the first time. An important practical outcome is the efficiency of the representation: the relevant geometric structure of high-dimensional datasets can be captured with Hilbert spaces of size as small as N∼10N \sim 10. We illustrate these results on a number of synthetic and real-world examples, including the Wisconsin Breast Cancer dataset, where QCML uncovers geometric separability between benign and malignant samples and yields an interpretable decomposition of feature relevance. The emphasis of this work is on a new geometric representation of data rather than on algorithmic benchmarking, establishing a foundation for extracting global geometric and topological structure from high-dimensional datasets.

Figures & tables

Appendix figures & tables1 asset

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Quantum Topological Data Encoding

    Jul 15, 2026Adam Wesołowski, Dimitrios Thanos, Daniel Leykam +1Quantum Machine LearningQuantum Data Encoding

  2. A Matched Spectral Benchmark of Quantum Inspired Feature Maps

    May 23, 2026Toheeb Ogunade, Taofeek Kassim, Etinosa OsaroQuantum Feature MapsQuantum Machine Learning

  3. Representation Geometry and Inductive Biases in Quantum Classifiers across Classical Visual Benchmarks

    Oct 13, 2026Yu Yamaoka, Weng Ian Chan, Kosuke MitaraiQuantum Machine LearningImage Classification