The paper introduces Fermi-Dirac thermal measurements as a new framework for quantum hypothesis testing and semidefinite optimization. By treating measurement eigenmodes as independent fermionic modes, the authors show that minimizing fermionic free energy yields optimal measurements whose eigenvalues follow Fermi‑Dirac distributions. These measurements can be learned with classical or hybrid quantum‑classical algorithms, leading to a new quantum machine‑learning model—Fermi‑Dirac machines—and a novel approach to semidefinite optimization on quantum computers.
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.
arXiv:2608. 14941v1 Announce Type: new Abstract: Counting the global optima of a classical optimization problem is a #P-hard task.
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%.
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.
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.
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.
arXiv:2305. 06177v1 Announce Type: cross Abstract: We present a thermodynamic analysis of a quantum engine that uses a single quantum particle as its working fluid, inspired by Szilard's classical single-particle engine.
arXiv:2607. 05000v1 Announce Type: cross Abstract: Canonical quantization provides a systematic procedure for constructing quantum models from classical Hamiltonians.
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. For both near-term and early fault-tolerant settings, the measurement protocol must balance statistical efficiency against implementation resources such as circuit depth, connectivity, and entangling-gate count.
arXiv:2509.00341v3 Announce Type: replace-cross Abstract: Conic programs arising in physics, quantum information, machine learning, and engineering are often defined over sparse graphs. Although such...
arXiv:2607. 25492v2 Announce Type: replace Abstract: We study stochastic optimization with heavy-tailed gradient noise.
arXiv:2606. 09734v1 Announce Type: cross Abstract: Training parameterised quantum circuits (PQCs) on quantum hardware is bottlenecked by the measurement cost of gradient estimation, which under the parameter-shift rule scales linearly in the number of trainable parameters and dominates the total shot budget of training at scale.