Peter Selinger

Publication Activity (10 Years)

Years Active: 1996-2023
Publications (10 Years): 26

Top Topics

Denotational Semantics

Programming Language

Top Venues

Quantum Inf. Comput.

Publications

Peng Fu, Peter Selinger
Towards an Induction Principle for Nested Data Types. WoLLIC (2023)
Peng Fu, Kohei Kishida, Neil J. Ross, Peter Selinger
Proto-Quipper with Dynamic Lifting. Proc. ACM Program. Lang. 7 (POPL) (2023)
Xiaoning Bian, Peter Selinger
Generators and Relations for 3-Qubit Clifford+CS Operators. QPL (2023)
Andre Kornell, Peter Selinger
Some improvements to product formula circuits for Hamiltonian simulation. CoRR (2023)
Peng Fu, Peter Selinger
Towards an induction principle for nested data types. CoRR (2023)
Peng Fu, Kohei Kishida, Neil J. Ross, Peter Selinger
On the Lambek embedding and the category of product-preserving presheaves. CoRR (2022)
Peng Fu, Kohei Kishida, Neil J. Ross, Peter Selinger
Proto-Quipper with dynamic lifting. CoRR (2022)
Peng Fu, Kohei Kishida, Peter Selinger
Linear Dependent Type Theory for Quantum Programming Languages. Log. Methods Comput. Sci. 18 (3) (2022)
Xiaoning Bian, Peter Selinger
Generators and Relations for 2-Qubit Clifford+T Operators. QPL (2022)
Peng Fu, Kohei Kishida, Neil J. Ross, Peter Selinger
A biset-enriched categorical model for Proto-Quipper with dynamic lifting. CoRR (2022)
Justin Makary, Neil J. Ross, Peter Selinger
Generators and Relations for Real Stabilizer Operators. QPL (2021)
Sarah Meng Li, Neil J. Ross, Peter Selinger
(Z[1/2]). QPL (2021)
Xiaoning Bian, Peter Selinger
(Z[½, i]). QPL (2021)
Peng Fu, Kohei Kishida, Peter Selinger
Linear Dependent Type Theory for Quantum Programming Languages: Extended Abstract. LICS (2020)
Peng Fu, Kohei Kishida, Neil J. Ross, Peter Selinger
A Tutorial Introduction to Quantum Circuit Programming in Dependently Typed Proto-Quipper. RC (2020)
Peng Fu, Kohei Kishida, Neil J. Ross, Peter Selinger
A tutorial introduction to quantum circuit programming in dependently typed Proto-Quipper. CoRR (2020)
Peng Fu, Kohei Kishida, Peter Selinger
Linear Dependent Type Theory for Quantum Programming Languages. CoRR (2020)
Michele Mosca, Martin Roetteler, Peter Selinger
Quantum Programming Languages (Dagstuhl Seminar 18381). Dagstuhl Reports 8 (9) (2018)
Peter Selinger
A finite alternation result for reversible boolean circuits. Sci. Comput. Program. 151 (2018)
Peter Selinger
Challenges in Quantum Programming Languages (Invited Talk). FSCD (2018)
Peng Fu, Peter Selinger
Dependently Typed Folds for Nested Data Types. CoRR (2018)
Francisco Rios, Peter Selinger
A categorical model for a quantum circuit description language. QPL (2017)
Neil J. Ross, Peter Selinger
-rotations. Quantum Inf. Comput. 16 (11&12) (2016)
Peter Selinger
A Finite Alternation Result for Reversible Boolean Circuits. RC (2016)
Peter Selinger
Reversible k-valued logic circuits are finitely generated for odd k. CoRR (2016)
Peter Selinger
A finite alternation result for reversible boolean circuits. CoRR (2016)
Benoît Valiron, Neil J. Ross, Peter Selinger, D. Scott Alexander, Jonathan M. Smith
Programming the quantum future. Commun. ACM 58 (8) (2015)
Peter Selinger
Generators and relations for n-qubit Clifford operators. Log. Methods Comput. Sci. 11 (2) (2015)
Peter Selinger
Efficient Clifford+T approximation of single-qubit operators. Quantum Inf. Comput. 15 (1-2) (2015)
Michele Pagani, Peter Selinger, Benoît Valiron
Applying quantitative semantics to higher-order quantum computing. POPL (2014)
Neil J. Ross, Peter Selinger
Optimal ancilla-free Clifford+T approximation of z-rotations. CoRR (2014)
Jonathan M. Smith, Neil J. Ross, Peter Selinger, Benoît Valiron
Quipper: Concrete Resource Estimation in Quantum Algorithms. CoRR (2014)
Chris Heunen, Aleks Kissinger, Peter Selinger
Completely positive projections and biproducts. QPL (2013)
Brett Giles, Peter Selinger
Remarks on Matsumoto and Amano's normal form for single-qubit Clifford+T operators. CoRR (2013)
Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, Benoît Valiron
An Introduction to Quantum Programming in Quipper CoRR (2013)
Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, Benoît Valiron
Quipper: a scalable quantum programming language. PLDI (2013)
Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, Benoît Valiron
Quipper: A Scalable Quantum Programming Language CoRR (2013)
Michele Pagani, Peter Selinger, Benoît Valiron
Applying quantitative semantics to higher-order quantum computing. CoRR (2013)
Octavio Malherbe, Philip Scott, Peter Selinger
Presheaf Models of Quantum Computation: An Outline. Computation, Logic, Games, and Quantum Foundations (2013)
Alexander S. Green, Peter LeFanu Lumsdaine, Neil J. Ross, Peter Selinger, Benoît Valiron
An Introduction to Quantum Programming in Quipper. RC (2013)
Peter Selinger
Finite dimensional Hilbert spaces are complete for dagger compact closed categories. Log. Methods Comput. Sci. 8 (3) (2012)
Peter Selinger
Logical Methods in Quantum Information Theory. WoLLIC (2012)
Brett Giles, Peter Selinger
Exact synthesis of multi-qubit Clifford+T circuits CoRR (2012)
Peter Selinger
Quantum circuits of T-depth one CoRR (2012)
Peter Selinger
Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract). Electron. Notes Theor. Comput. Sci. 270 (1) (2011)
Bob Coecke, Prakash Panangaden, Peter Selinger
Preface. Electron. Notes Theor. Comput. Sci. 270 (2) (2011)
Bob Coecke, Ian Mackie, Prakash Panangaden, Peter Selinger
Preface. Electron. Notes Theor. Comput. Sci. 270 (1) (2011)
Michael W. Mislove, Peter Selinger
Preface. MFPS (2010)
Peter Selinger
Idempotents in Dagger Categories: (Extended Abstract). Electron. Notes Theor. Comput. Sci. 210 (2008)
Peter Selinger, Benoît Valiron
A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract) CoRR (2008)
Peter Selinger
Preface. Electron. Notes Theor. Comput. Sci. 210 (2008)
Peter Selinger, Benoît Valiron
A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract). FoSSaCS (2008)
Peter Selinger, Benoît Valiron
On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract). Electron. Notes Theor. Comput. Sci. 210 (2008)
Peter Selinger
Lecture notes on the lambda calculus CoRR (2008)
Peter Selinger
Preface. Electron. Notes Theor. Comput. Sci. 170 (2007)
Peter Selinger
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract). Electron. Notes Theor. Comput. Sci. 170 (2007)
Massimo Caboara, Sara Faridi, Peter Selinger
Simplicial cycles and the computation of simplicial trees. J. Symb. Comput. 42 (1-2) (2007)
Massimo Caboara, Sara Faridi, Peter Selinger
Tree Checking for Sparse Complexes. ICMS (2006)
Peter Selinger, Benoît Valiron
A lambda calculus for quantum computation with classical control. Math. Struct. Comput. Sci. 16 (3) (2006)
Peter Selinger
Special issue on quantum programming languages. Math. Struct. Comput. Sci. 16 (3) (2006)
Peter Selinger, Benoît Valiron
A Lambda Calculus for Quantum Computation with Classical Control. TLCA (2005)
Peter Selinger
Towards a quantum programming language. Math. Struct. Comput. Sci. 14 (4) (2004)
Peter Selinger
A Brief Survey of Quantum Programming Languages. FLOPS (2004)
Peter Selinger
Order-incompleteness and finite lambda reduction models. Theor. Comput. Sci. 309 (1-3) (2003)
Richard Blute, Peter Selinger
Preface. CTCS (2002)
Peter Selinger
The lambda calculus is algebraic. J. Funct. Program. 12 (6) (2002)
Peter Selinger
Control categories and duality: on the categorical semantics of the lambda-mu calculus. Math. Struct. Comput. Sci. 11 (2) (2001)
Peter Selinger
Models for an adversary-centric protocol logic. Electron. Notes Theor. Comput. Sci. 55 (1) (2001)
Peter Selinger
Categorical Semantics of Control. TLCA (2001)
Peter Selinger
Categorical Structure of Asynchrony. MFPS (1999)
Peter Selinger
First-Order Axioms for Asynchrony. CONCUR (1997)
Peter Selinger
Order-Incompleteness and Finite Lambda Models (Extended Abstract). LICS (1996)