2015-03-20 Departmental seminar: Chris Heunen (Oxford)

Sat, 21 Oct 2023 21:24:08 +0100

Chris Heunen (Oxford)

Approximating transition systems

Abstract

Classical computation, invertible computation, probabilistic computation, and quantum computation, form increasingly more sophisticated labelled transition systems. How can we approximate a transition system by less sophisticated ones? Considering all ways to get probabilistic information out of a quantum system leads to domain-theoretic ideas, that also apply in the accompanying Boolean logic. I will survey to what extent these domains characterise the system, leading with examples from quantum theory, in a way that is accessible to a broad audience of computer scientists, mathematicians, and logicians.

2015-03-20 15:00:00 UTC
LT1415