• Publications
  • Influence
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract)
  • P. Selinger
  • Computer Science, Mathematics
  • Electron. Notes Theor. Comput. Sci.
  • 1 March 2007
TLDR
We give a general construction, the CPM construction, which associates to each dagger compact closed category its ''category of completely positive maps'', and a proof of its completeness for equational reasoning. Expand
  • 395
  • 54
  • PDF
Towards a quantum programming language
  • P. Selinger
  • Computer Science
  • Math. Struct. Comput. Sci.
  • 1 August 2004
TLDR
In this paper, we describe the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types. Expand
  • 396
  • 48
  • PDF
A Survey of Graphical Languages for Monoidal Categories
This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but alsoExpand
  • 553
  • 37
  • PDF
Control categories and duality: on the categorical semantics of the lambda-mu calculus
  • P. Selinger
  • Mathematics, Computer Science
  • Math. Struct. Comput. Sci.
  • 1 April 2001
TLDR
We give a categorical semantics to the call- by-name and call-by-value versions of Parigot's λμ-calculus with disjunction types. Expand
  • 142
  • 18
  • PDF
Quipper: a scalable quantum programming language
TLDR
We introduce Quipper, a scalable, expressive, functional, higher-order quantum programming language that can program a diverse set of non-trivial quantum algorithms. Expand
  • 161
  • 16
  • PDF
Quipper: a scalable quantum programming language
TLDR
We introduce Quipper, a scalable, expressive, functional, higher-order quantum programming language that can program a diverse set of non-trivial quantum algorithms. Expand
  • 92
  • 14
  • PDF
Exact synthesis of multi-qubit Clifford+T circuits
TLDR
We prove that a unitary matrix has an exact representation over the Clifford+T gate set with local ancillas if and only if its entries are in the ring Z[1/sqrt(2),i]. Expand
  • 81
  • 11
  • PDF
Efficient Clifford+T approximation of single-qubit operators
  • P. Selinger
  • Mathematics, Physics
  • Quantum Inf. Comput.
  • 26 December 2012
TLDR
We give an efficient randomized algorithm for approximating an arbitrary element of SU(2) by a product of Clifford+T gates, up to arbitrarily small ε. Expand
  • 90
  • 10
  • PDF
A Lambda Calculus for Quantum Computation with Classical Control
TLDR
We develop a lambda calculus for the classical control model, following the first author's work on quantum flow-charts. Expand
  • 149
  • 9
  • PDF
Towards a semantics for higher-order quantum computation
The search for a semantics for higher-order quantum computation leads naturally to the study of categories of normed cones. In the first part of this paper, we develop the theory of continuous normedExpand
  • 70
  • 9
  • PDF