I am a postdoctoral fellow in Computer Science at Tulane University.

My research interests are in quantum programming languages, categorical quantum mechanics, quantum computing, diagrammatic calculi and automated reasoning.

`vzamdzhi {at} tulane 'dot' edu`

`vladimir {at} zamdzhiev 'dot' me`

Bert Lindenhovius, Michael Mislove, Vladimir Zamdzhiev.

**Enriching a Linear/Non-linear Lambda Calculus: A Programming Language for String Diagrams.**

*LICS 2018 (to appear).* [preprint]
[arXiv]

Christian Schröder de Witt, Vladimir Zamdzhiev.

**The ZX-calculus is incomplete for quantum mechanics.**

*QPL 2014.* [arXiv/DOI]

Aleks Kissinger, Vladimir Zamdzhiev.

**Quantomatic: A Proof Assistant for Diagrammatic Reasoning.**

*CADE 2015.* [arXiv]
[DOI]

Aleks Kissinger, Vladimir Zamdzhiev.

**Equational Reasoning with Context-Free Families of String Diagrams.**

*ICGT 2015.* [arXiv]
[DOI]

Aleks Kissinger, Vladimir Zamdzhiev.

**!-Graphs with Trivial Overlap are Context-Free.**

*GaM 2015.* [arXiv/DOI]

Heinrich Stamerjohanns, Deyan Ginev, Catalin David, Dimitar Misev, Vladimir Zamdzhiev, Michael Kohlhase.

**MathML-aware Article Conversion from LaTeX.**

*DML 2009.* [DOI]

**An abstract model for Proto-Quipper-M extended with general recursion.**

*MURI Project Review 2017.* UC Berkeley.

15 December 2017. [slides]

**Categorical models of circuit description languages.**

*Duskofest 2017.* Oxford, United Kingdom.

12 October 2017. [slides]

**Rewriting Families of String Diagrams.**

*String 2017.* Oxford.

9 September 2017. [slides]

**Towards a Recursive Model for Proto-Quipper.**

*MURI Project Review*, Simons Institute (UC Berkeley).

29 November 2016. [whiteboard talk]

**Rewriting Families of Quantum Circuits.**

*Logic Lounge*, Simons Institute (UC Berkeley).

17 November 2016. [whiteboard talk]

**Quantum Computing: the Good, the Bad and the (not so) Ugly.**

*Oriel Talks*, Oriel College (University of Oxford).

7 June 2016. [slides]

**Higher-order rewriting of String Diagrams.**

*Quantum Group Workshop*, University of Oxford.

21 April 2016. [slides]

**Grammar transformation with DPO rewriting.**

*GaM 2016.* Technische Universiteit Eindhoven.

2 April 2016. [slides]

**Higher-order rewriting of Quantum Circuits.**

*CantaBulgarian Conference*, Oxford and Cambridge Club (London, UK).

13 March 2016. [slides]

**Equational reasoning with context-free families of string diagrams.**

*Invited Seminar Talk*, Radboud University.

2 December 2015. [blackboard talk]

**Quantomatic: A Proof Assistant for Diagrammatic Reasoning.**

*CADE 2015.* Freie Universität Berlin.

5 August 2015. [slides]

**Equational Reasoning with Context-Free Families of String Diagrams.**

*ICGT 2015.* Università degli Studi dell’Aquila (L’Aquila, Italy).

21 July 2015. [slides]

**!-Graphs with Trivial Overlap are Context-Free.**

*GaM 2015.* Queen Mary University of London.

12 April 2015. [slides]

**Is ZX complete for Clifford+T? Nobody knows (yet).**

*Quantum Group Workshop*, University of Oxford.

6 March 2015. [slides]

**Quantomatic – current state and case study.**

*Celebrating 10 Years of Categorical Quantum Mechanics*, The Jericho Tavern (Oxford, UK).

17 October 2014. [slides]

**The ZX-calculus is incomplete for quantum mechanics.**

*QPL 2014.* Kyoto University (Kyoto, Japan).

5 June 2014. [slides]

**The ZX calculus is incomplete for quantum mechanics.**

*Quantum Group Workshop*, University of Oxford.

2 November 2013. [slides]

**Exploring Quantum Secret Sharing with the ZX Calculus.**

*Quantum Lunch*, University of Oxford.

29 October 2013. [slides]

**PhD Computer Science.**

University of Oxford, 2012-2016.

Thesis: *Rewriting Context-free Families of String Diagrams.* [arXiv]

Supervisors: Samson Abramsky, Bob Coecke, Aleks Kissinger.
Examiners: Sam Staton (internal), Reiko Heckel (external).

**MSc Computer Science (Distinction).**

University of Oxford, 2011-2012.

Thesis: *An Abstract Approach towards Quantum Secret Sharing.* [pdf]

Supervisor: Bob Coecke.

**BSc Mathematics, BSc Computer Science.**

Jacobs University Bremen, 2008-2011.

**Postdoctoral Fellow.**

Tulane University, 2016-present.

Project: Semantics, Formal Reasoning, and Tools For Quantum Programming.

Principal Investigator: Michael Mislove.

**Discrete Mathematics.**

*Lecturer*, Tulane University.

Spring 2017. [Course Website]

**Categorical Quantum Mechanics.**

*Teaching Assistant*, University of Oxford.

Spring 2014, Spring 2015.

**Categories, Proofs and Processes.**

*Teaching Assistant*, University of Oxford.

Fall 2014.

**Quantum Computer Science.**

*Teaching Assistant*, University of Oxford.

Fall 2013, Fall 2014.

**Lambda Calculus and Types.**

*Teaching Assistant*, University of Oxford.

Spring 2014.

**Formal Languages and Logic.**

*Teaching Assistant*, Jacobs University Bremen.

Fall 2010.

**Computability and Complexity.**

*Teaching Assistant*, Jacobs University Bremen.

Spring 2010.

**Operating Systems.**

*Teaching Assistant*, Jacobs University Bremen.

Spring 2011.

LICS 2018

Mathematical Foundations of Computer Science (MFCS) 2017

Aleks Kissinger.

Radboud University (Nijmegen, The Netherlands).

30 November 2015 -- December 4 2015.

Simons Institute for the Theory of Computing (UC Berkeley).

17 November 2016 -- December 16 2016.

Recipient of the Scatcherd European Scholarship for the maximum duration of 3 years. Awarded in support of my PhD studies.

MSc degree awarded with distinction for high academic performance.

Member of the President’s List for academic achievement for all three academic years at Jacobs University Bremen.