Search Results for author:
Found 4 papers, 1 papers with code
Bennett and Stinespring, Together at Last
We present a universal construction that relates reversible dynamics on open systems to arbitrary dynamics on closed systems: the restriction affine completion of a monoidal restriction category quotiented by well-pointedness.
Quantum Physics Logic in Computer Science Category Theory
Automated distribution of quantum circuits
Quantum algorithms are usually monolithic circuits, becoming large at modest input size.
Quantum Physics
A Convenient Category for Higher-Order Probability Theory
Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of probability theory.
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints
We study the semantic foundation of expressive probabilistic programming languages, that support higher-order functions, continuous distributions, and soft constraints (such as Anglican, Church, and Venture).
