Peter Selinger

Orcid: 0000-0003-3161-856X

Affiliations:
  • Dalhousie University, Canada
  • University of Ottawa, Ontario, Canada (former)


According to our database1, Peter Selinger authored at least 60 papers between 1996 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Proto-Quipper with Dynamic Lifting.
Proc. ACM Program. Lang., January, 2023

Some improvements to product formula circuits for Hamiltonian simulation.
CoRR, 2023

Generators and Relations for 3-Qubit Clifford+CS Operators.
Proceedings of the Twentieth International Conference on Quantum Physics and Logic, 2023

Towards an Induction Principle for Nested Data Types.
Proceedings of the Logic, Language, Information, and Computation, 2023

2022
Linear Dependent Type Theory for Quantum Programming Languages.
Log. Methods Comput. Sci., 2022

On the Lambek embedding and the category of product-preserving presheaves.
CoRR, 2022

A biset-enriched categorical model for Proto-Quipper with dynamic lifting.
Proceedings of the Proceedings 19th International Conference on Quantum Physics and Logic, 2022

Generators and Relations for 2-Qubit Clifford+T Operators.
Proceedings of the Proceedings 19th International Conference on Quantum Physics and Logic, 2022

2021
Generators and Relations for Real Stabilizer Operators.
Proceedings of the Proceedings 18th International Conference on Quantum Physics and Logic, 2021

Generators and Relations for the Group O<sub>n</sub>(Z[1/2]).
Proceedings of the Proceedings 18th International Conference on Quantum Physics and Logic, 2021

Generators and relations for U<sub>n</sub>(Z[½, i]).
Proceedings of the Proceedings 18th International Conference on Quantum Physics and Logic, 2021

2020
A Tutorial Introduction to Quantum Circuit Programming in Dependently Typed Proto-Quipper.
Proceedings of the Reversible Computation - 12th International Conference, 2020

Linear Dependent Type Theory for Quantum Programming Languages: Extended Abstract.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2018
A finite alternation result for reversible boolean circuits.
Sci. Comput. Program., 2018

Quantum Programming Languages (Dagstuhl Seminar 18381).
Dagstuhl Reports, 2018

Dependently Typed Folds for Nested Data Types.
CoRR, 2018

Challenges in Quantum Programming Languages (Invited Talk).
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

2017
A categorical model for a quantum circuit description language.
Proceedings of the Proceedings 14th International Conference on Quantum Physics and Logic, 2017

2016
Optimal ancilla-free Clifford+<i>T</i> approximation of <i>z</i>-rotations.
Quantum Inf. Comput., 2016

Reversible k-valued logic circuits are finitely generated for odd k.
CoRR, 2016

2015
Efficient Clifford+T approximation of single-qubit operators.
Quantum Inf. Comput., 2015

Generators and relations for n-qubit Clifford operators.
Log. Methods Comput. Sci., 2015

Programming the quantum future.
Commun. ACM, 2015

2014
Quipper: Concrete Resource Estimation in Quantum Algorithms.
CoRR, 2014

Optimal ancilla-free Clifford+T approximation of z-rotations.
CoRR, 2014

Applying quantitative semantics to higher-order quantum computing.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

2013
Completely positive projections and biproducts.
Proceedings of the 10th International Workshop on Quantum Physics and Logic, 2013

Remarks on Matsumoto and Amano's normal form for single-qubit Clifford+T operators.
CoRR, 2013

An Introduction to Quantum Programming in Quipper.
Proceedings of the Reversible Computation - 5th International Conference, 2013

Quipper: a scalable quantum programming language.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2013

Presheaf Models of Quantum Computation: An Outline.
Proceedings of the Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, 2013

2012
Exact synthesis of multi-qubit Clifford+T circuits
CoRR, 2012

Quantum circuits of T-depth one
CoRR, 2012

Finite dimensional Hilbert spaces are complete for dagger compact closed categories.
Log. Methods Comput. Sci., 2012

Logical Methods in Quantum Information Theory.
Proceedings of the Logic, Language, Information and Computation, 2012

2010
Preface.
Proceedings of the 26th Conference on the Mathematical Foundations of Programming Semantics, 2010

2009
Preface.
Proceedings of the 6th International Workshop on Quantum Physics and Logic, 2009

2008
Finite Dimensional Hilbert Spaces are Complete for Dagger Compact Closed Categories (Extended Abstract).
Proceedings of the Joint 5th International Workshop on Quantum Physics and Logic and 4th Workshop on Developments in Computational Models, 2008

Preface.
Proceedings of the Joint 5th International Workshop on Quantum Physics and Logic and 4th Workshop on Developments in Computational Models, 2008

Lecture notes on the lambda calculus
CoRR, 2008

A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract).
Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007
Simplicial cycles and the computation of simplicial trees.
J. Symb. Comput., 2007

2006
A lambda calculus for quantum computation with classical control.
Math. Struct. Comput. Sci., 2006

Special issue on quantum programming languages.
Math. Struct. Comput. Sci., 2006

On a Fully Abstract Model for a Quantum Linear Functional Language: (Extended Abstract).
Proceedings of the 4th International Workshop on Quantum Programming Languages, 2006

Idempotents in Dagger Categories: (Extended Abstract).
Proceedings of the 4th International Workshop on Quantum Programming Languages, 2006

Tree Checking for Sparse Complexes.
Proceedings of the Mathematical Software, 2006

2005
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract).
Proceedings of the 3rd International Workshop on Quantum Programming Languages, 2005

Preface.
Proceedings of the 3rd International Workshop on Quantum Programming Languages, 2005

2004
Towards a quantum programming language.
Math. Struct. Comput. Sci., 2004

A Brief Survey of Quantum Programming Languages.
Proceedings of the Functional and Logic Programming, 7th International Symposium, 2004

2003
Order-incompleteness and finite lambda reduction models.
Theor. Comput. Sci., 2003

2002
The lambda calculus is algebraic.
J. Funct. Program., 2002

Preface.
Proceedings of the Category Theory and Computer Science, 2002

2001
Control categories and duality: on the categorical semantics of the lambda-mu calculus.
Math. Struct. Comput. Sci., 2001

Models for an adversary-centric protocol logic.
Proceedings of the Logical Aspects of Cryptographic Protocol Verification, 2001

Categorical Semantics of Control.
Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

1999
Categorical Structure of Asynchrony.
Proceedings of the Fifteenth Conference on Mathematical Foundations of Progamming Semantics, 1999

1997
First-Order Axioms for Asynchrony.
Proceedings of the CONCUR '97: Concurrency Theory, 1997

1996
Order-Incompleteness and Finite Lambda Models (Extended Abstract).
Proceedings of the Proceedings, 1996


  Loading...