Search results
Results: 16
Number of items: 16
-
Roy, P., van de Wetering, J., & Yeh, L. (2023). The Qudit ZH-Calculus: Generalised Toffoli+Hadamard and Universality. Electronic Proceedings in Theoretical Computer Science, 384, 142-170. https://doi.org/10.4204/EPTCS.384.9 -
van de Wetering, J., & Amy, M. (2023). Optimising T-count is NP-hard. (v1 ed.) ArXiv. https://doi.org/10.48550/arXiv.2310.05958
-
Poór, B., Booth, R. I., Carette, T., van de Wetering, J., & Yeh, L. (2023). The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification. Electronic Proceedings in Theoretical Computer Science, 384, 220-264. https://doi.org/10.4204/EPTCS.384.13
-
Backens, M., Kissinger, A., Miller-Bakewell, H., van de Wetering, J., & Wolffs, S. (2023). Completeness of the ZH-calculus. Compositionality, 5, Article 13524. https://doi.org/10.32408/compositionality-5-5
-
Laakkonen, T., Meichanetzidis, K., & van de Wetering, J. (2022). A Graphical SAT Algorithm for Formulae with Small Clause Density. (v1 ed.) ArXiv. https://doi.org/10.48550/arXiv.2212.08048
-
Codsi, J., & van de Wetering, J. (2022). Classically Simulating Quantum Supremacy IQP Circuits trough a Random Graph Approach. (v1 ed.) ArXiv. https://doi.org/10.48550/arXiv.2212.08609
Page 2 of 2