On block structures in quantum computation

9Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

A block is a language construct in programming that temporarily enlarges the state space. It is typically opened by initialising some local variables, and closed via a return statement. The "scope" of these local variables is then restricted to the block in which they occur. In quantum computation such temporary extensions of the state space also play an important role. This paper axiomatises "logical" blocks in a categorical manner. Opening a block may happen via a measurement, so that the block captures the various possibilities that result from the measurement. Following work of Coecke and Pavlović we sho that von Neumann projective measurements can be described as an Eilenberg-Moore coalgebra of a comonad associated with a particular kind of block structure. Closing of a block involves a collapse of options. Such blocks are investigated in non-deterministic, probabilistic, and quantum computation. In the latter setting it is shown that there are two block structures in the category of Câ-algebras, via copowers and via matrices. © 2013 Elsevier B.V.

Cite

CITATION STYLE

APA

Jacobs, B. (2013). On block structures in quantum computation. In Electronic Notes in Theoretical Computer Science (Vol. 298, pp. 233–255). https://doi.org/10.1016/j.entcs.2013.09.016

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free