Hugging Face Trending Papers

Learning structural balance of graphs from quantum spectral features

The paper introduces a quantum method for extracting spectral features from the density of states (DOS) of a problem-dependent Hamiltonian, applied to signed graphs represented as Ising models. It demonstrates that standardized moments of the Ising DOS count signed closed walks, are switching‑invariant, and size‑free, enabling accurate learning of the frustration index with a mean error of 0.4 on 140,000 labeled graphs. The authors propose DOS‑QPE, a phase estimation technique that requires far fewer shots than traditional methods, and highlight potential applications in social network analysis, spin‑glass studies, correlation clustering, and protein‑interaction networks.

arXiv Machine Learning
Sep 11

Learning structural balance of graphs from quantum spectral features

The paper introduces a quantum method for extracting spectral features from the density of states (DOS) of a problem-dependent Hamiltonian, applied to signed graphs represented as Ising models. Using standardized moments of the Ising DOS as features, the authors demonstrate that these moments count signed closed walks, are switching‑invariant, and size‑free. On a benchmark of 140,000 labeled graphs, the exact DOS predicts the frustration index exactly, while five moments achieve a mean error of 0.4, and a new DOS‑QPE protocol offers efficient sampling with far fewer shots than classical trace‑sampling methods.

By Stefano Scali, Oleksandr Kyriienko
arXiv Machine Learning
Jul 14

Learning Topological Quantum Phases from Limited Subsystems

arXiv:2607. 10656v1 Announce Type: cross Abstract: Characterizing quantum topological phases requires measuring non-local string order parameters, demanding access to the full system, which is often experimentally unfeasible.

By Mehran Khosrojerdi, Sougato Bose, Alessandro Cuccoli, Paola Verrucchi, Abolfazl Bayat, Leonardo Banchi
arXiv Machine Learning
Jul 23

Edge-Local and Qubit-Efficient Quantum Graph Learning for the NISQ Era

arXiv:2602. 16018v2 Announce Type: replace-cross Abstract: Graph neural networks (GNNs) are a powerful framework for learning representations from graph-structured data, but their direct implementation on near-term quantum hardware remains challenging due to circuit depth, multi-qubit interactions, and qubit scalability constraints.

By Armin Ahmadkhaniha, Jake Doliskani
arXiv Machine Learning
Jun 16

Learning ground state observables from quantum computing experiments

arXiv:2606. 15983v1 Announce Type: cross Abstract: Recent theoretical progress has established conditions under which machine learning models can efficiently predict ground-state properties of gapped local Hamiltonians when trained on quantum-generated data.

By Ben Jaderberg, Freya Shah, Minjun Jeon, M. Emre Sahin, Christa Zoufal, Kunal Sharma
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
arXiv Machine Learning
Sep 18

Quantum Graph Convolutional Networks: Implementation and Trainability Analysis

The paper implements two quantum graph neural network architectures—Simplified Graph Convolution (SGC) and Linear Graph Convolution (LGC)—and evaluates them on benchmark graph datasets for semi‑supervised learning using quantum simulation. It compares their predictive performance and optimization behavior to classical baselines, finding that the quantum models achieve competitive results with fewer parameters. Additionally, the study provides a cost‑gradient analysis to identify trainable tasks and a classical simulability investigation to determine regimes where the circuits remain robust during training.

By Paul San Sebastian Sein, Theodor Iosif, Tilen G. Limb\"ack-Stokin, Kin Ian Lo, Yidong Liao
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