Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 5
Number of items: 5
  • Open Access
    Jerbi, S., Cornelissen, A., Ozols, M., & Dunjko, V. (2023). Quantum Policy Gradient Algorithms. In O. Fawzi, & M. Walter (Eds.), 18th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2023, July 24–28, 2023, Aveiro, Portugal Article 13 (Leibniz International Proceedings in Informatics; Vol. 266). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.TQC.2023.13
  • Open Access
    Cornelissen, A. (2023). Quantum multivariate estimation and span program algorithms. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Cornelissen, A., Hamoudi, Y., & Jerbi, S. (2022). Near-Optimal Quantum Algorithms for Multivariate Mean Estimation. In S. Leonardi, & A. Gupta (Eds.), STOC '22: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing : June 20-24, 2022, Rome, Italy (pp. 33-43). Association for Computing Machinery. https://doi.org/10.1145/3519935.3520045, https://doi.org/10.48550/arXiv.2111.09787
  • Open Access
    Cornelissen, A., Mande, N. S., Ozols, M., & de Wolf, R. (2021). Exact quantum query complexity of computing Hamming weight modulo powers of two and three. (v1 ed.) ArXiv. https://doi.org/10.48550/arXiv.2112.14682
  • Open Access
    Cornelissen, A., Jeffery, S., Ozols, M., & Piedrafita, A. (2020). Span programs and quantum time complexity. In J. Esparza, & D. Král' (Eds.), 45th International Symposium on Mathematical Foundations of Computer Science: MFCS 2020, August 25–26, 2020, Prague, Czech Republic Article 26 (Leibniz International Proceedings in Informatics; Vol. 170). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.26
Page of