A Duality Theorem for Classical-Quantum States with Applications to Complete Relational Program Logics

Duality theorems play a fundamental role in convex optimization. Recently, it was shown how duality theorems for countable probability distributions and finite-dimensional quantum states can be leveraged for building relatively complete relational program logics for probabilistic and quantum programs, respectively. However, complete relational logics for classical-quantum programs, which combine classical and quantum computations and operate over classical as well as quantum variables, have remained out of reach. The main gap is that while prior duality theorems could readily be derived using optimal transport and semidefinite programming methods, respectively, the combined setting falls out of the scope of these methods and requires new ideas. In this paper, we overcome this gap and establish the desired duality theorem for classical-quantum states. Our argument relies critically on a novel dimension-independent analysis of the convex optimization problem underlying the finite-dimensional quantum setting, which, in particular, allows us to take the limit where the classical state space becomes infinite. Using the resulting duality theorem, we establish soundness and completeness of a new relational program logic, called mathsf{cqOTL}, for classical-quantum programs. In addition, we lift prior restrictions on the completeness of two existing program logics: mathsf{eRHL} for probabilistic programs (Avanzini et al., POPL 2025) and mathsf{qOTL} for quantum programs (Barthe et al., LICS 2025).