We investigate variational problems in quantum thermodynamics at positive temperature, in which admissible states are constrained by prescribed outcomes of a finite set of measurements. We solve a problem raised by the recent work [Liu, Minervini, Patel, Wilde; arXiv:2505.04514 - Section C] and develop a general mathematical setup which allows a broad class of possible regularizations. Employing methods inspired by non-commutative optimal transport, we analyze the dual formulation of the problem, study the existence and characterization of maximizers, and investigate the qualitative behavior of the model in the zero-temperature limit. In the second part, we tailor this framework to quantum state tomography and quantum optimal transport. Finally, we address computational aspects, with particular attention to the convergence of algorithms in selected cases.
We investigate variational problems in quantum thermodynamics at positive temperature, in which admissible states are constrained by prescribed outcomes of a finite set of measurements. We solve a problem raised by the recent work [Liu, Minervini, Patel, Wilde; arXiv:2505.04514 - Section C] and develop a general mathematical setup which allows a broad class of possible regularizations. Employing methods inspired by non-commutative optimal transport, we analyze the dual formulation of the problem, study the existence and characterization of maximizers, and investigate the qualitative behavior of the model in the zero-temperature limit. In the second part, we tailor this framework to quantum state tomography and quantum optimal transport. Finally, we address computational aspects, with particular attention to the convergence of algorithms in selected cases.
In this manuscript, we study the (finite-dimensional) static formulation of quantum optimal transport problems with general convex regularization and its unbalanced relaxation. In both cases, we show a duality result, characterizations of minimizers (for the primal) and maximizers (for the dual). An important tool we define is a non-commutative version of the classical ( c , ψ , ε ) -transforms associated with a general convex regularization, which we employ to prove the convergence of the associated Sinkhorn iterations. Finally, we show the convergence of the unbalanced transport problems towards the constrained one, as well as the convergence of transforms, as the marginal penalization parameters go to +∞.
In quantum thermodynamics, a system is described by a Hamiltonian and a list of non-commuting charges representing conserved quantities like particle number or electric charge, and an important goal is to determine the system's minimum energy in the presence of these conserved charges. In optimization theory, a semi-definite program (SDP) involves a linear objective function optimized over the cone of positive semi-definite operators intersected with an affine space. These problems arise from differing motivations in the physics and optimization communities and are phrased using very different terminology, yet they are essentially identical mathematically. By adopting Jaynes' mindset motivated by quantum thermodynamics, we observe that minimizing free energy in the aforementioned thermodynamics problem, instead of energy, leads to an elegant solution in terms of a dual chemical potential maximization problem that is concave in the chemical potential parameters. As such, one can employ standard (stochastic) gradient ascent methods to find the optimal values of these parameters, and these methods are guaranteed to converge quickly. At low temperature, the minimum free energy provides an excellent approximation for the minimum energy. We then show how this Jaynes-inspired gradient-ascent approach can be used in both first- and second-order classical and hybrid quantum-classical algorithms for minimizing energy, and equivalently, how it can be used for solving SDPs, with guarantees on the runtimes of the algorithms. The approach discussed here is well grounded in quantum thermodynamics and, as such, provides physical motivation underpinning why algorithms published fifty years after Jaynes' seminal work, including the matrix multiplicative weights update method, the matrix exponentiated gradient update method, and their quantum algorithmic generalizations, perform well at solving SDPs.
We study the semidefinite programs (SDPs) of quantum information whose variables are density operators, measurement operators, or unbounded positive semidefinite operators, together with their thermodynamic regularizations by the von Neumann, Fermi-Dirac, and Bose-Einstein entropies, which have been associated with Boltzmann, Fermi-Dirac, and Bose-Einstein statistics, respectively. We find that this correspondence is exact: the Fermi-Dirac and Bose-Einstein regularized SDPs coincide with the constrained free-energy minimization of an ideal Fermi or Bose gas whose Hamiltonian and non-commuting charges are the second quantizations of the SDP data and whose one-body density matrix is the SDP variable, while the Boltzmann framework corresponds to the single-particle case. We show that the three frameworks can be unified under one framework, in which each entropy-regularized dual is, up to a term linear in the chemical potentials, the grand potential of the corresponding system; the duals are unconstrained and concave in the chemical-potential vector, with gradient and Hessian given by thermal expectation values that hybrid quantum-classical algorithms can estimate. We further identify the Fermi-Dirac and Bose-Einstein relative entropies with the Umegaki relative entropy between quasi-free states, which yields their monotonicity under gauge-covariant Gaussian channels. The result places a wide class of SDPs and their solvers within the thermodynamics of ideal quantum gases and points to extensions to interacting gases.
Quantum thermodynamics offers a unifying interpretation for a wide class of semidefinite programs (SDPs) that arise in quantum information. Three SDP variable constraints, namely trace-one density operators, operator-bounded measurements, and the unbounded positive semidefinite cone, admit thermodynamic regularizations associated with Boltzmann, Fermi-Dirac, and Bose-Einstein statistics, respectively. In each case the entropy-regularized dual is unconstrained and concave in a chemical-potential vector, and the primal optimum is a thermal operator of the matched statistics. The dual gradient and Hessian are thermal expectation values, enabling new hybrid quantum-classical algorithms for solving a wide variety of SDPs.
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.
A semidefinite program (SDP) is a particular kind of convex optimization problem with applications in operations research, combinatorial optimization, quantum information science, and beyond. In this work, we propose variational quantum algorithms for approximately solving SDPs. For one class of SDPs, we provide a rigorous analysis of their convergence to approximate locally optimal solutions, under the assumption that they are weakly constrained (i.e., N ≫ M , where N is the dimension of the input matrices and M is the number of constraints). We also provide algorithms for a more general class of SDPs that requires fewer assumptions. Finally, we numerically simulate our quantum algorithms for applications such as MaxCut, and the results of these simulations provide evidence that convergence still occurs in noisy settings.