arXiv:2608. 04055v1 Announce Type: cross Abstract: The minimum change principle provides an information-theoretic characterization of the Bayes reversal channel in classical probability theory and has recently been proposed as a framework for extending Bayes' rule to quantum information theory.
By Nana Liu, Mark M. Wilde
arXiv:2608. 14941v1 Announce Type: new Abstract: Counting the global optima of a classical optimization problem is a #P-hard task.
By Malay Marut Das, Mark A. Novotny, Yaroslav Koshka
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:2606. 19486v1 Announce Type: cross Abstract: Characterizing the features of a Hamiltonian that governs a quantum system serves as a fundamental subroutine of quantum device calibration, signal sensing, and error correction.
By Taiqi Zhou, Weiyuan Gong
arXiv:2608. 11396v1 Announce Type: cross Abstract: Extracting quantum information from a quantum state is a fundamental task of quantum computation, often requiring the estimation of many non-commuting observables under a finite measurement budget.
By Jun Dai, Olivier Nahman-L\'{e}vesque, Guillaume Rabusseau, Hong-Ye Hu, Cunlu Zhou
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