Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 84
Number of items: 84
  • Open Access
    Arunachalam, S., Chakraborty, S., Lee, T., Paraashar, M., & de Wolf, R. (2019). Two new results about quantum exact learning. In C. Baier, I. Chatzigiannakis, P. Flocchini, & S. Leonardi (Eds.), 46th International Colloquium on Automata, Languages, and Programming: ICALP 2019, July 9-12, 2019, Patras, Greece Article 16 (Leibniz International Proceedings in Informatics; Vol. 132). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2019.16, https://doi.org/10.48550/arXiv.1810.00481
  • Open Access
    Gilyén, A. (2019). Quantum Singular Value Transformation & Its Algorithmic Applications. [Thesis, externally prepared, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Open Access
    Arunachalam, S., & de Wolf, R. (2018). Optimal Quantum Sample Complexity of Learning Algorithms. Journal of Machine Learning Research, 19, Article 71. http://jmlr.org/papers/v19/18-195.html
  • Open Access
    de Boer, K., Ducas, L., Jeffery, S., & de Wolf, R. (2018). Attacks on the AJPS Mersenne-based cryptosystem. In T. Lange, & R. Steinwandt (Eds.), Post-Quantum Cryptography: 9th International Conference, PQCrypto 2018, Fort Lauderdale, FL, USA, April 9-11, 2018 : proceedings (pp. 101-120). (Lecture Notes in Computer Science; Vol. 10786). Springer. https://doi.org/10.1007/978-3-319-79063-3_5
  • Open Access
    Arunachalam, S. (2018). Quantum algorithms and learning theory. [Thesis, fully internal, Universiteit van Amsterdam].
  • Lee, T., Wei, Z., & de Wolf, R. (2017). Some upper and lower bounds on PSD-rank. Mathematical programming, 162(1-2), 495-521. https://doi.org/10.1007/s10107-016-1052-0
  • de Wolf, R. (2017). The potential impact of quantum computers on society. Ethics and Information Technology, 19(4), 271-276. https://doi.org/10.1007/s10676-017-9439-z
  • Open Access
    Arunachalam, S., & de Wolf, R. (2017). Optimal quantum sample complexity of learning algorithms. In R. O'Donnell (Ed.), 32nd Computational Complexity Conference: CCC 2017, July 6-9, 2017, Riga, Latvia Article 25 (Leibniz International Proceedings in Informatics; Vol. 79). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CCC.2017.25
  • Open Access
    Arunachalam, S., & de Wolf, R. (2017). Optimizing the Number of Gates in Quantum Search. Quantum Information & Computation, 17(3&4), 251-261. https://doi.org/10.26421/QIC17.3-4
  • Open Access
    van Apeldoorn, J., Gilyén, A., Gribling, S., & de Wolf, R. (2017). Quantum SDP-Solvers: Better upper and lower bounds. In 58th Annual IEEE Symposium on Foundations of Computer Science: FOCS 2017 : proceedings : 15-17 October 2017, Berkeley, CA, USA (pp. 403-414). IEEE Computer Society. https://doi.org/10.1109/FOCS.2017.44
Page 3 of 9