Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

npj Quantum Information

Optimising the relative entropy under semidefinite constraints

Gereon Koßmann, René Schwonnek

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.18154/rwth-2026-01570

Related papers

Optimising the relative entropy under semidefinite constraints

Gereon Koßmann, René Schwonnek

Abstract Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem located at the mathematical core of various applications in quantum information theory. An efficient method for providing provable upper and lower bounds is the central result of this work. Our primordial motivation stems from the essential task of estimating secret key rates for QKD from the measurement statistics of a real device. Further applications include the computation of channel capacities, the estimation of entanglement measures and many more. We build on a recently introduced integral representation of quantum relative entropy by [Frenkel, Quantum 7, 1102 (2023)] and provide reliable bounds as a sequence of semidefinite programs (SDPs). Our approach ensures provable sublinear convergence in the discretization, while also maintaining resource efficiency in terms of SDP matrix dimensions. Additionally, we can provide gap estimates to the optimum at each iteration stage.

arXiv:2404.17016•npj Quantum Information•Jan 23, 2026•22 citations

Optimal min-entropy uncertainty relation

Alexandra Musat, Andrei Tănăsescu, Pantelimon George Popescu

Physical Review A•Jan 26, 2026•0 citations

Efficiently computable bounds on the energy-constrained quantum reading capacity

Vishal Singh, Zixin Huang, Mark M. Wilde

In quantum reading, classical messages are encoded in sequences of quantum channels and recovered by probing the channels and processing their outputs. We study the reading capacity of a finite family of finite-dimensional channels under an average constraint on the probing energy, allowing arbitrary adaptive operations between channel uses. Using an input-dependent chain rule for the Belavkin-Staszewski relative entropy, we derive a converse bound expressed as an optimization involving channel Choi operators and the operator relative entropy. This formulation admits semidefinite approximations and reduces, without an energy constraint, to a channel information radius. To obtain achievable rates, we construct bilinear semidefinite lower approximations to a standard non-adaptive reading bound. Alternating optimization produces feasible probe states and encoding distributions, whose Holevo information gives a directly evaluable achievable rate. For jointly classical-quantum channels, we derive a separate converse based on the Umegaki relative entropy. Without an energy constraint, this converse matches a non-adaptive achievable rate, recovering a recent result of Pascual Abraldes and Winter: non-adaptive protocols suffice to achieve the unconstrained reading capacity of jointly classical-quantum channels.

quant-pharXiv:2610.08945•Oct 8, 2026•1 citation

Bose-Einstein thermal operators for semidefinite optimization

Michele Minervini, Nana Liu, Mark M. Wilde

We establish that semidefinite programs (SDPs) over the unbounded positive semidefinite cone are mathematically equivalent to thermodynamic systems of independent bosonic modes: the eigenvalues of the optimization variable play the role of expected occupation numbers, the linear objective plays the role of total expected energy, and the linear equality constraints play the role of conserved non-commuting charges. Building on this perspective, we recast general SDPs as bosonic free-energy minimization problems at strictly positive temperature, regularized by the Bose-Einstein entropy; the original SDP is recovered in the zero-temperature limit. The optimal primal variable takes the form of a Bose-Einstein thermal operator parametrized by the dual variables. We prove an approximation-error bound that depends on the ground-space degeneracy and the spectral gap of the dual slack operator, improving on the linear-in-dimension worst-case duality gap of interior-point methods. We also introduce the Bose-Einstein quantum relative entropy as a Bregman divergence on the unbounded positive semidefinite cone, generated by the negative Bose-Einstein entropy. We propose it as a natural divergence for unnormalized positive operators, for which the standard Umegaki relative entropy can become negative, and we show that it satisfies a restricted monotonicity property under affine maps modeling bosonic Gaussian channels. Finally, we develop hybrid quantum-classical algorithms for the regularized SDP using only Hamiltonian simulation, Hadamard tests, and classical sampling, and bound their runtime in closed form. Unlike existing quantum SDP solvers, whose runtimes scale polynomially with an a priori upper bound on the primal trace, our framework operates directly on the unbounded cone, replacing this bound with a dependence on the spectral structure of the dual slack operator.

quant-pharXiv:2605.27228•May 27, 2026•1 citation

A note on relative entropy

Rodney W. Benoist, Jean-Paul Marchand, Walter Wyss

Letters in Mathematical Physics•May 1, 1979•8 citations

Continuity of the Maximum-Entropy Inference

Stephan Weis

arXiv:1202.3116•Communications in Mathematical Physics•Jun 19, 2014•13 citations
Abstract Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem located at the mathematical core of various applications in quantum information theory. An efficient method for providing provable upper and lower bounds is the central result of this work. Our primordial motivation stems from the essential task of estimating secret key rates for QKD from the measurement statistics of a real device. Further applications include the computation of channel capacities, the estimation of entanglement measures and many more. We build on a recently introduced integral representation of quantum relative entropy by [Frenkel, Quantum 7, 1102 (2023)] and provide reliable bounds as a sequence of semidefinite programs (SDPs). Our approach ensures provable sublinear convergence in the discretization, while also maintaining resource efficiency in terms of SDP matrix dimensions. Additionally, we can provide gap estimates to the optimum at each iteration stage.
In quantum reading, classical messages are encoded in sequences of quantum channels and recovered by probing the channels and processing their outputs. We study the reading capacity of a finite family of finite-dimensional channels under an average constraint on the probing energy, allowing arbitrary adaptive operations between channel uses. Using an input-dependent chain rule for the Belavkin-Staszewski relative entropy, we derive a converse bound expressed as an optimization involving channel Choi operators and the operator relative entropy. This formulation admits semidefinite approximations and reduces, without an energy constraint, to a channel information radius. To obtain achievable rates, we construct bilinear semidefinite lower approximations to a standard non-adaptive reading bound. Alternating optimization produces feasible probe states and encoding distributions, whose Holevo information gives a directly evaluable achievable rate. For jointly classical-quantum channels, we derive a separate converse based on the Umegaki relative entropy. Without an energy constraint, this converse matches a non-adaptive achievable rate, recovering a recent result of Pascual Abraldes and Winter: non-adaptive protocols suffice to achieve the unconstrained reading capacity of jointly classical-quantum channels.
We establish that semidefinite programs (SDPs) over the unbounded positive semidefinite cone are mathematically equivalent to thermodynamic systems of independent bosonic modes: the eigenvalues of the optimization variable play the role of expected occupation numbers, the linear objective plays the role of total expected energy, and the linear equality constraints play the role of conserved non-commuting charges. Building on this perspective, we recast general SDPs as bosonic free-energy minimization problems at strictly positive temperature, regularized by the Bose-Einstein entropy; the original SDP is recovered in the zero-temperature limit. The optimal primal variable takes the form of a Bose-Einstein thermal operator parametrized by the dual variables. We prove an approximation-error bound that depends on the ground-space degeneracy and the spectral gap of the dual slack operator, improving on the linear-in-dimension worst-case duality gap of interior-point methods. We also introduce the Bose-Einstein quantum relative entropy as a Bregman divergence on the unbounded positive semidefinite cone, generated by the negative Bose-Einstein entropy. We propose it as a natural divergence for unnormalized positive operators, for which the standard Umegaki relative entropy can become negative, and we show that it satisfies a restricted monotonicity property under affine maps modeling bosonic Gaussian channels. Finally, we develop hybrid quantum-classical algorithms for the regularized SDP using only Hamiltonian simulation, Hadamard tests, and classical sampling, and bound their runtime in closed form. Unlike existing quantum SDP solvers, whose runtimes scale polynomially with an a priori upper bound on the primal trace, our framework operates directly on the unbounded cone, replacing this bound with a dependence on the spectral structure of the dual slack operator.