← Back to all news
arXiv Machine Learning By Jian Xu, Wei Chen, Shigui Li, Chao Li, Delu Zeng, John Paisley, Qibin Zhao

Local-Time Riemannian Score Matching on the Quantum Pure-State Manifold

Read the original on arXiv Machine Learning →

arXiv:2605. 03573v4 Announce Type: replace-cross Abstract: Score-based diffusion can be defined intrinsically on the manifold of quantum pure states, $\mathbb{CP}^{d-1}$ with the Fubini--Study metric, but no closed-form transition density is available, so the score must be supervised by a local-time teacher taken from the Euclidean limit of the diffusion in normal coordinates.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Jun 16

Stochastic Schr\"odinger Diffusion Models for Pure-State Ensemble Generation

arXiv:2605. 03573v3 Announce Type: replace-cross Abstract: Quantum machine learning increasingly relies on pure-state representations, motivating generative models that sample directly in quantum representation space rather than perturbing classical inputs and re-encoding.

By Jian Xu, Wei Chen, Shigui Li, Chao Li, Jingyuan Zheng, Delu Zeng, John Paisley, Qibin Zhao
diffusionbenchmarks
More like this →
Hugging Face Trending Papers
Sep 3

Projected Riemannian Gradient Descent for the Bures-Wasserstein Barycenter: Dimension-Independent Linear Convergence at Unit Step Size

The paper introduces a Projected Riemannian Gradient Descent (RGD) algorithm for computing the Bures‑Wasserstein barycenter of positive definite matrices, achieving dimension‑independent linear convergence at unit step size. It resolves a previous dichotomy by showing that clipping eigenvalues to a fixed interval yields a closed‑form, non‑expansive projection in the BW metric, allowing the algorithm to match the empirical speed of unit‑step RGD while maintaining theoretical guarantees. The method also extends to the invariant matrix projection problem, providing a unified dimension‑independent analysis.

More like this →
arXiv Machine Learning
Sep 24

Quantum score matching with applications to learning thermal states

The paper introduces a quantum score‑matching framework that extends classical score matching to quantum states, addressing challenges posed by noncommuting density operators. It demonstrates that this method can learn thermal (Gibbs) states without extra state preparation, achieving optimal sample complexity in high‑temperature regimes for local Hamiltonians. Numerical tests and experiments on IBM quantum hardware confirm the approach’s effectiveness and NISQ‑friendly performance, reducing Hamiltonian‑parameter error from 64% to about 10%.

By Yulong Dong, Jiaqi Leng
benchmarks
More like this →