Search results
Results: 16
Number of items: 16
-
Laakkonen, T., Meichanetzidis, K., & van de Wetering, J. (2023). Picturing Counting Reductions with the ZH-Calculus. Electronic Proceedings in Theoretical Computer Science, 384, 89-113. https://doi.org/10.4204/EPTCS.384.6 -
van de Wetering, J., & Amy, M. (2023). Optimising T-count is NP-hard. (v1 ed.) ArXiv. https://doi.org/10.48550/arXiv.2310.05958
-
van de Wetering, J., & Yeh, L. (2023). Building Qutrit Diagonal Gates from Phase Gadgets. Electronic Proceedings in Theoretical Computer Science, 394, 46-65. https://doi.org/10.4204/EPTCS.394.4
-
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
-
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