default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn van de Wetering
Person information
- affiliation: University of Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Andrew N. Glaudell, Neil J. Ross, John van de Wetering, Lia Yeh:
Exact Synthesis of Multiqutrit Clifford-Cyclotomic Circuits. QPL 2024: 44-62- [c18]Aleks Kissinger, John van de Wetering:
Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates). QPL 2024: 79-95 - [c17]Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering
:
A Graphical #SAT Algorithm for Formulae with Small Clause Density. QPL 2024: 137-161 - [i6]Francisco J. R. Ruiz, Tuomas Laakkonen, Johannes Bausch, Matej Balog, Mohammadamin Barekatain, Francisco J. H. Heras, Alexander Novikov, Nathan Fitzpatrick, Bernardino Romera-Paredes, John van de Wetering, Alhussein Fawzi, Konstantinos Meichanetzidis, Pushmeet Kohli:
Quantum Circuit Optimization with AlphaTensor. CoRR abs/2402.14396 (2024) - 2023
- [c16]Tuomas Laakkonen, Konstantinos Meichanetzidis, John van de Wetering:
Picturing counting reductions with the ZH-calculus. QPL 2023: 89-113 - [c15]Patrick Roy, John van de Wetering, Lia Yeh:
The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality. QPL 2023: 142-170 - [c14]Boldizsár Poór, Robert I. Booth, Titouan Carette, John van de Wetering, Lia Yeh:
The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification. QPL 2023: 220-264 - [i5]John van de Wetering, Matt Amy:
Optimising T-count is NP-hard. CoRR abs/2310.05958 (2023) - 2022
- [c13]Niel de Beaudrap, Aleks Kissinger, John van de Wetering:
Circuit Extraction for ZX-Diagrams Can Be #P-Hard. ICALP 2022: 119:1-119:19 - [c12]Lia Yeh, John van de Wetering:
Constructing All Qutrit Controlled Clifford+T gates in Clifford+T. RC 2022: 28-50 - [c11]Aleks Kissinger, John van de Wetering, Renaud Vilmart:
Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions. TQC 2022: 5:1-5:13 - [c10]Andrew N. Glaudell, Neil J. Ross, John van de Wetering, Lia Yeh:
Qutrit Metaplectic Gates Are a Subset of Clifford+T. TQC 2022: 12:1-12:15 - [c9]John van de Wetering, Lia Yeh:
Building Qutrit Diagonal Gates from Phase Gadgets. QPL 2022: 46-65 - [i4]Niel de Beaudrap, Aleks Kissinger, John van de Wetering:
Circuit Extraction for ZX-diagrams can be #P-hard. CoRR abs/2202.09194 (2022) - 2021
- [j4]Miriam Backens, Hector Miller-Bakewell, Giovanni de Felice, Leo Lobski, John van de Wetering:
There and back again: A circuit extraction tale. Quantum 5: 421 (2021) - [c8]John van de Wetering:
A Categorical Construction of the Real Unit Interval. ACT 2021: 43-58 - 2020
- [j3]Ross Duncan, Aleks Kissinger, Simon Perdrix, John van de Wetering:
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus. Quantum 4: 279 (2020) - [j2]Abraham Westerbaan, Bas Westerbaan, John van de Wetering:
The three types of normal sequential effect algebras. Quantum 4: 378 (2020) - [c7]Abraham Westerbaan, Bas Westerbaan, John van de Wetering:
A characterisation of ordered abstract probabilities. LICS 2020: 944-957 - [c6]Kenta Cho, Bas Westerbaan, John van de Wetering:
Dichotomy between deterministic and probabilistic models in countably additive effectus theory. QPL 2020: 91-113 - [c5]Louis Lemonnier, John van de Wetering, Aleks Kissinger:
Hypergraph Simplification: Linking the Path-sum Approach to the ZH-calculus. QPL 2020: 188-212
2010 – 2019
- 2019
- [j1]John van de Wetering:
An effect-theoretic reconstruction of quantum theory. Compositionality 1: 1 (2019) - [c4]Aleks Kissinger, John van de Wetering:
PyZX: Large Scale Automated Diagrammatic Reasoning. QPL 2019: 229-241 - [i3]Ross Duncan, Aleks Kissinger, Simon Perdrix, John van de Wetering:
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus. CoRR abs/1902.03178 (2019) - [i2]Abraham Westerbaan, Bas Westerbaan, John van de Wetering:
A characterization of ordered abstract probabilities. CoRR abs/1912.10040 (2019) - 2018
- [c3]Abraham Westerbaan, Bas Westerbaan, John van de Wetering:
Pure Maps between Euclidean Jordan Algebras. QPL 2018: 345-364 - 2017
- [c2]John van de Wetering:
Quantum Theory is a Quasi-stochastic Process Theory. QPL 2017: 179-196 - [i1]John van de Wetering:
Ordering information on distributions. CoRR abs/1701.06924 (2017) - 2016
- [c1]John van de Wetering:
Entailment Relations on Distributions. SLPCS@QPL 2016: 58-66
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 23:42 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
