Semantics for variational Quantum programming

We consider a programming language that can manipulate both classical and quantum information. Our language is type-safe and designed for variational quantum programming, which is a hybrid classical-quantum computational paradigm. The classical subsystem of the language is the Probabilistic FixPoint Calculus (PFPC), which is a lambda calculus with mixed-variance recursive types, term recursion and probabilistic choice. The quantum subsystem is a first-order linear type system that can manipulate quantum information. The two subsystems are related by mixed classical/quantum terms that specify how classical probabilistic effects are induced by quantum measurements, and conversely, how classical (probabilistic) programs can influence the quantum dynamics. We also describe a sound and computationally adequate denotational semantics for the language. Classical probabilistic effects are interpreted using a recently-described commutative probabilistic monad on DCPO. Quantum effects and resources are interpreted in a category of von Neumann algebras that we show is enriched over (continuous) domains. This strong sense of enrichment allows us to develop novel semantic methods that we use to interpret the relationship between the quantum and classical probabilistic effects. By doing so we provide a very detailed denotational analysis that relates domain-theoretic models of classical probabilistic programming to models of quantum programming.

Approximate Recovery and Relative Entropy I: General von Neumann Subalgebras

We prove the existence of a universal recovery channel that approximately recovers states on a von Neumann subalgebra when the change in relative entropy, with respect to a fixed reference state, is small. Our result is a generalization of previous results that applied to type-I von Neumann algebras by Junge at al. [arXiv:1509.07127]. We broadly follow their proof strategy but consider here arbitrary von Neumann algebras, where qualitatively new issues arise. Our results hinge on the construction of certain analytic vectors and computations/estimations of their Araki–Masuda $$L_p$$ L p norms. We comment on applications to the quantum null energy condition.

Complete Logarithmic Sobolev inequality via Ricci curvature bounded below II

We study the “geometric Ricci curvature lower bound”, introduced previously by Junge, Li and LaRacuente, for a variety of examples including group von Neumann algebras, free orthogonal quantum groups [Formula: see text], [Formula: see text]-deformed Gaussian algebras and quantum tori. In particular, we show that Laplace operator on [Formula: see text] admits a factorization through the Laplace–Beltrami operator on the classical orthogonal group, which establishes the first connection between these two operators. Based on a non-negative curvature condition, we obtain the completely bounded version of the modified log-Sobolev inequalities for the corresponding quantum Markov semigroups on the examples mentioned above. We also prove that the “geometric Ricci curvature lower bound” is stable under tensor products and amalgamated free products. As an application, we obtain a sharp Ricci curvature lower bound for word-length semigroups on free group factors.

Complete Gradient Estimates of Quantum Markov Semigroups

In this article we introduce a complete gradient estimate for symmetric quantum Markov semigroups on von Neumann algebras equipped with a normal faithful tracial state, which implies semi-convexity of the entropy with respect to the recently introduced noncommutative 2-Wasserstein distance. We show that this complete gradient estimate is stable under tensor products and free products and establish its validity for a number of examples. As an application we prove a complete modified logarithmic Sobolev inequality with optimal constant for Poisson-type semigroups on free group factors.