Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 12
Number of items: 12
  • Open Access
    Codsi, J., & van de Wetering, J. (2025). Classically simulating intermediate-scale instantaneous quantum polynomial circuits through a random graph approach. Physical Review A, 111(1), Article 012422. https://doi.org/10.1103/PhysRevA.111.012422
  • Open Access
    van de Wetering, J., Yeung, R., Laakkonen, T., & Kissinger, A. (2025). Optimal compilation of parametrised quantum circuits. Quantum, 9, Article 1828. https://doi.org/10.22331/q-2025-08-27-1828
  • Open Access
    Ruiz, F. J. R., Laakkonen, T., Bausch, J., Balog, M., Barekatain, M., Heras, F. J. H., Novikov, A., Fitzpatrick, N., Romera-Paredes, B., van de Wetering, J., Fawzi, A., Meichanetzidis, K., & Kohli, P. (2025). Quantum circuit optimization with AlphaTensor. Nature Machine Intelligence, 7(3), 374-385. https://doi.org/10.1038/s42256-025-01001-1
  • Open Access
    Li, S. M., Mosca, M., Ross, N. J., van de Wetering, J., & Zhao, Y. (2025). A Complete and Natural Rule Set for Multi-Qutrit Clifford Circuits. Electronic Proceedings in Theoretical Computer Science, 426, 23-78. https://doi.org/10.4204/EPTCS.426.2
  • Open Access
    Glaudell, A. N., Ross, N. J., van de Wetering, J., & Yeh, L. (2024). Exact Synthesis of Multiqutrit Clifford-Cyclotomic Circuits. Electronic Proceedings in Theoretical Computer Science, 406, 44-62. https://doi.org/10.4204/EPTCS.406.2
  • Open Access
    Kissinger, A., & van de Wetering, J. (2024). Scalable Spider Nests: (...Or How to Graphically Grok Transversal Non-Clifford Gates). Electronic Proceedings in Theoretical Computer Science, 406, 79-95. https://doi.org/10.4204/EPTCS.406.4
  • Open Access
    Laakkonen, T., Meichanetzidis, K., & van de Wetering, J. (2024). A Graphical #SAT Algorithm for Formulae with Small Clause Density. Electronic Proceedings in Theoretical Computer Science, 406, 137-161. https://doi.org/10.4204/EPTCS.406.7
  • Open Access
    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
  • Open Access
    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
  • Open Access
    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
Page 1 of 2