arXiv Machine Learning

Unifying quantum measurement constructions via a relative-entropy minimum change principle

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 Machine Learning
Aug 19

Fermi-Dirac thermal measurements: A framework for quantum hypothesis testing and semidefinite optimization

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.

By Nana Liu, Mark M. Wilde
arXiv AI
Jul 8

Lean-Quantum: Toward AI-Assisted Formalization of Quantum Information

arXiv:2607. 05492v1 Announce Type: cross Abstract: Quantum information theory is built on entropic quantities; among them, the sandwiched R\'enyi relative entropy is a fundamental divergence with various applications, and its data processing inequality (DPI) under quantum channels is a cornerstone result.

By Kazumi Kasaura, Kei Tsukamoto, Kento Mori, Risa Mizuno, Takahiro Namatame, Yuta Oriike, Masaya Taniguchi, Sho Sonoda, Hayata Yamasaki
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
arXiv Machine Learning
Sep 11

Semidefinite Programming for Quantum Channel Learning

The paper studies how to reconstruct a quantum channel from classical data by formulating the fidelity optimization as a semidefinite program (SDP). When the fidelity can be expressed as a ratio of two quadratic forms—such as in mapping mixed to pure states, projective operators, or unitary learning—the SDP approach yields a convex optimization that can be efficiently solved with commercial solvers. Experiments show that the resulting channels often have a Kraus rank far below the maximum, indicating that a small Kraus rank suffices to capture the observed data, and the method is also applied to reconstruct projective operators and a classical computational model based on quantum channel transformation.

By Mikhail Gennadievich Belov, Victor Victorovich Dubov, Vadim Konstantinovich Ivanov, Alexander Yurievich Maslov, Olga Vladimirovna Proshina, Vladislav Gennadievich Malyshkin