10,902 research outputs found
Quantum channels as a categorical completion
We propose a categorical foundation for the connection between pure and mixed
states in quantum information and quantum computation. The foundation is based
on distributive monoidal categories.
First, we prove that the category of all quantum channels is a canonical
completion of the category of pure quantum operations (with ancilla
preparations). More precisely, we prove that the category of completely
positive trace-preserving maps between finite-dimensional C*-algebras is a
canonical completion of the category of finite-dimensional vector spaces and
isometries.
Second, we extend our result to give a foundation to the topological
relationships between quantum channels. We do this by generalizing our
categorical foundation to the topologically-enriched setting. In particular, we
show that the operator norm topology on quantum channels is the canonical
topology induced by the norm topology on isometries.Comment: 12 pages + ref, accepted at LICS 201
An Algebraic Approach to Linear-Optical Schemes for Deterministic Quantum Computing
Linear-Optical Passive (LOP) devices and photon counters are sufficient to
implement universal quantum computation with single photons, and particular
schemes have already been proposed. In this paper we discuss the link between
the algebraic structure of LOP transformations and quantum computing. We first
show how to decompose the Fock space of N optical modes in finite-dimensional
subspaces that are suitable for encoding strings of qubits and invariant under
LOP transformations (these subspaces are related to the spaces of irreducible
unitary representations of U(N)). Next we show how to design in algorithmic
fashion
LOP circuits which implement any quantum circuit deterministically. We also
present some simple examples, such as the circuits implementing a CNOT gate and
a Bell-State Generator/Analyzer.Comment: new version with minor modification
Strongly Complete Logics for Coalgebras
Coalgebras for a functor model different types of transition systems in a
uniform way. This paper focuses on a uniform account of finitary logics for
set-based coalgebras. In particular, a general construction of a logic from an
arbitrary set-functor is given and proven to be strongly complete under
additional assumptions. We proceed in three parts. Part I argues that sifted
colimit preserving functors are those functors that preserve universal
algebraic structure. Our main theorem here states that a functor preserves
sifted colimits if and only if it has a finitary presentation by operations and
equations. Moreover, the presentation of the category of algebras for the
functor is obtained compositionally from the presentations of the underlying
category and of the functor. Part II investigates algebras for a functor over
ind-completions and extends the theorem of J{\'o}nsson and Tarski on canonical
extensions of Boolean algebras with operators to this setting. Part III shows,
based on Part I, how to associate a finitary logic to any finite-sets
preserving functor T. Based on Part II we prove the logic to be strongly
complete under a reasonable condition on T
Second-Order Algebraic Theories
Fiore and Hur recently introduced a conservative extension of universal
algebra and equational logic from first to second order. Second-order universal
algebra and second-order equational logic respectively provide a model theory
and a formal deductive system for languages with variable binding and
parameterised metavariables. This work completes the foundations of the subject
from the viewpoint of categorical algebra. Specifically, the paper introduces
the notion of second-order algebraic theory and develops its basic theory. Two
categorical equivalences are established: at the syntactic level, that of
second-order equational presentations and second-order algebraic theories; at
the semantic level, that of second-order algebras and second-order functorial
models. Our development includes a mathematical definition of syntactic
translation between second-order equational presentations. This gives the first
formalisation of notions such as encodings and transforms in the context of
languages with variable binding
Polynomial functors and polynomial monads
We study polynomial functors over locally cartesian closed categories. After
setting up the basic theory, we show how polynomial functors assemble into a
double category, in fact a framed bicategory. We show that the free monad on a
polynomial endofunctor is polynomial. The relationship with operads and other
related notions is explored.Comment: 41 pages, latex, 2 ps figures generated at runtime by the texdraw
package (does not compile with pdflatex). v2: removed assumptions on sums,
added short discussion of generalisation, and more details on tensorial
strength
- …