Skip to content

Quantum Geometry of Data

Jul 2025 · arXiv.org · Vol abs/2507.21135 · 2 citations · ⚡ 1 influential · 34 references
Computer Science Physics Mathematics

TL;DR

The present work provides the first full exposition of QCML as a framework for quantum geometry, establishing its mathematical foundation and demonstrating how operator-level tools from quantum geometry can be directly applied to data.

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, while avoiding the curse of dimensionality inherent in local methods. The present work provides the first full exposition of QCML as a framework for \emph{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: high-dimensional datasets can be faithfully modeled with Hilbert spaces of size as small as $N \sim 10$, revealing global structures that are hard to capture with linear methods such as PCA. 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.

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Diffusion models as plug-and-play priors

The possibility of inferring high-dimensional data inference in a model that consists of a prior and an auxiliary differentiable constraint given some additional information is considered, thereby allowing a range of potential applications in adapting models to new domains and tasks.

Alexandros Graikos, Esmeralda S. Whitammer, N. Jojic et al. · 316 citations · ⚡15

Trajectory Balance: Improved Credit Assignment in GFlowNets

It is proved that any global minimizer of the trajectory balance objective can define a policy that samples exactly from the target distribution, and empirically demonstrate the benefits of the trajectories balance objective for GFlowNet convergence, diversity of generated samples, and robustness to long action sequenc...

Esmeralda S. Whitammer, Moksh Jain, Emmanuel Bengio et al. · 302 citations · ⚡60

Related blog posts

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.