Cole Comfort

Cole Comfort

Doctoral Student

Wolfson Building, Parks Road, Oxford OX1 3QD

Themes:

Quantum

Interests

I am a DPhil student interested in monoidal categories as a semantics for quantum computing. I am particularily interested in proving completeness results for various fragments of quantum computing. Recently, I have been investigating semantics of circuits involving categories of spans and relations in order to give a modular characterization of the different fragments of the ZX/ZH-calculus.

Biography

Office: Computer Science Department, Room 251

my (dot) name (at) cs (dot) ox (dot) ac (dot) uk

Preprints:

Sheet diagrams for bimonoidal categories. Cole Comfort, Antonin Delpeuch, Jules Hedges, 2020.

Circuit Relations for Real Stabilizers: Towards TOF+H. Cole Comfort. 2019.

Dagger linear logic for categorical quantum mechanics. Robin Cockett‚ Cole Comfort and Priyaa Srinivasan. 2018.

Conference Papers:

The ZX& calculus: A complete graphical calculus for classical circuits using spiders. Cole Comfort. In preparation QPL 2020.

The Category TOF. Robin Cockett and Cole Comfort. In Electronic Proceedings in Theoretical Computer Science. Vol. 287 (QPL 2018). Pages 67–84. Open Publishing Association. January, 2019.

The Category CNOT. Robin Cockett‚ Cole Comfort and Priyaa Srinivasan. In Electronic Proceedings in Theoretical Computer Science. Vol. 266 (QPL 2017). Pages 258–293. Open Publishing Association. February, 2018.

Conference Presentations:

QPL 2020 (Paris, France): The ZX& calculus: A complete graphical calculus for classical circuits using spiders.
FMCS 2019 (Kananaskis, Canada): Circuit Relations for Real Stabilizers: Towards TOF+H.
SYCO 4 (Orange, United States): Circuit Relations for Real Stabilizers: Towards TOF+H
QPL 2018 (Halifax, Canada): The Category TOF.
FMCS 2018 (Sackville, Canada): The Category TOF.
QPL 2017 (Nijmegen, Netherlands): The Category CNOT.
FMCS 2017 (Ottawa, Canada): The Category CNOT.
CAIMS 2017 (Calgary Canada): The Category CNOT.

Research Visits:

University of Edinburgh and the University of Oxford, Fall 2018; visiting Drs. Chris Heunen and Bob Coecke respectively.

Education:

DPhil in Computer Science (2019-ongoing)
Institution: University of Oxford
Supervisor: Bob Coecke & Aleks Kissinger

MSc in Computer Science (2017-2019)
Institution: University of Calgary
Thesis: Classifying reversible logic gates with ancillary bits
Supervisor: Robin Cockett

BSc in Computer Science (2013-2017)
Institution: University of Calgary

Teaching:

University of Oxford, Department of Computer Science:

Michaelmas 2020: Tutor for Categories Proofs and Processes
Michaelmas 2020: Tutor for Quantum Processes and Computation

University of Calgary, Department of Computer Science:

Winter 2019: Teaching assistant for CPSC 313 "Introduction to Computability"x2
Winter 2018: Teaching assistant for CPSC 411 "Compiler Construction"
Fall 2017: Teaching assistant for CPSC 521 "Foundations of Functional Programming"