John van de Wetering

Orcid: 0000-0002-5405-8959

Affiliations:
  • University of Amsterdam, The Netherlands


According to our database1, John van de Wetering authored at least 27 papers between 2016 and 2024.

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

2024
Exact Synthesis of Multiqutrit Clifford-Cyclotomic Circuits.
Proceedings of the 21st International Conference on Quantum Physics and Logic, 2024

Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates).
Proceedings of the 21st International Conference on Quantum Physics and Logic, 2024

Quantum Circuit Optimization with AlphaTensor.
CoRR, 2024

A Graphical #SAT Algorithm for Formulae with Small Clause Density.
Proceedings of the 21st International Conference on Quantum Physics and Logic, 2024

2023
Optimising T-count is NP-hard.
CoRR, 2023

The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality.
Proceedings of the Twentieth International Conference on Quantum Physics and Logic, 2023

The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification.
Proceedings of the Twentieth International Conference on Quantum Physics and Logic, 2023

Picturing counting reductions with the ZH-calculus.
Proceedings of the Twentieth International Conference on Quantum Physics and Logic, 2023

2022
Building Qutrit Diagonal Gates from Phase Gadgets.
Proceedings of the Proceedings 19th International Conference on Quantum Physics and Logic, 2022

Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions.
Proceedings of the 17th Conference on the Theory of Quantum Computation, 2022

Qutrit Metaplectic Gates Are a Subset of Clifford+T.
Proceedings of the 17th Conference on the Theory of Quantum Computation, 2022

Constructing All Qutrit Controlled Clifford+T gates in Clifford+T.
Proceedings of the Reversible Computation - 14th International Conference, 2022

Circuit Extraction for ZX-Diagrams Can Be #P-Hard.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
There and back again: A circuit extraction tale.
Quantum, 2021

A Categorical Construction of the Real Unit Interval.
Proceedings of the Fourth International Conference on Applied Category Theory, 2021

2020
The three types of normal sequential effect algebras.
Quantum, 2020

Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus.
Quantum, 2020

Hypergraph Simplification: Linking the Path-sum Approach to the ZH-calculus.
Proceedings of the Proceedings 17th International Conference on Quantum Physics and Logic, 2020

Dichotomy between deterministic and probabilistic models in countably additive effectus theory.
Proceedings of the Proceedings 17th International Conference on Quantum Physics and Logic, 2020

A characterisation of ordered abstract probabilities.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019
A characterization of ordered abstract probabilities.
CoRR, 2019

PyZX: Large Scale Automated Diagrammatic Reasoning.
Proceedings of the Proceedings 16th International Conference on Quantum Physics and Logic, 2019

An effect-theoretic reconstruction of quantum theory.
Compositionality, 2019

2018
Pure Maps between Euclidean Jordan Algebras.
Proceedings of the Proceedings 15th International Conference on Quantum Physics and Logic, 2018

2017
Quantum Theory is a Quasi-stochastic Process Theory.
Proceedings of the Proceedings 14th International Conference on Quantum Physics and Logic, 2017

Ordering information on distributions.
CoRR, 2017

2016
Entailment Relations on Distributions.
Proceedings of the 2016 Workshop on Semantic Spaces at the Intersection of NLP, 2016


  Loading...