arXiv Machine Learning

Newton-Schulz Retraction-Based Inference Enables Hidden Quantum Markov Models to Outperform Classical HMMs

arXiv:2608. 06554v1 Announce Type: new Abstract: Hidden Markov models (HMMs) are widely used probabilistic models for discrete sequential data but can be limited when hidden dynamics are complex.

arXiv Machine Learning
Aug 28

Classical and Hybrid Quantum Machine Learning for Trigger-Like Event Selection on CMS Open Data: An Eight-Qubit, PCA-Constrained Benchmark

The paper compares classical and hybrid quantum machine learning models for a trigger-like binary classification task using CMS open data. Eight classical models (SVM, ANN, CNN, LSTM) and eight quantum counterparts are evaluated under identical preprocessing, data splits, and decision thresholds, with performance measured by accuracy, ROC‑AUC, F1‑score, precision, and recall. The best classical model is an artificial neural network (93.53 % accuracy, 0.9819 ROC‑AUC), while the best quantum model is a quantum convolutional network (90.89 % accuracy, 0.9731 ROC‑AUC), indicating that within an eight‑qubit budget the quantum models do not surpass the classical ones.

By Tariq Mahmood, Muhammad Awais Rafique, Talab Hussain, Juan Pablo Perez Aguilar, Alfredo Raya, Muhammad Ahsan
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
arXiv Machine Learning
Jun 30

Learning the structure of open quantum systems

arXiv:2606. 30358v1 Announce Type: cross Abstract: We design an algorithm for learning the coefficients of an $n$-qubit constant-local Lindbladian to $\varepsilon$ error with $O(g d^2 \log(n) / \varepsilon^2)$ total evolution time, where $g$ is the single-site energy and $d$ is the (approximate) degree of the interaction graph.

By Laura Lewis, Ewin Tang, John Wright
arXiv Machine Learning
Aug 21

Quantum Gaussian processes for prediction of channel observations

arXiv:2608. 19306v1 Announce Type: cross Abstract: Given a set of input states, we consider the task of predicting the expectation value of a Pauli observable at the output of an unknown quantum evolution, using only a limited number of measurements.

By Jonas J\"ager, Yaroslav Khmelnitskiy, Paolo Braccia, Artur Miroszewski, Diego Garc\'ia-Mart\'in, M. Cerezo, Piotr Czarnik