Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 173
Number of items: 173
  • Open Access
    Verduyn Lunel, P. H. (2024). Quantum position verification: Loss-tolerant protocols and fundamental limits. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., Franco, N., Fratini, F., Fuller, B., Gacon, J., Gonciulea, C., Gribling, S., Gupta, S., Hadfield, S., Heese, R., ... Zoufal, C. (2024). Challenges and opportunities in quantum optimization. Nature Reviews Physics, 6(12), 718-735. https://doi.org/10.1038/s42254-024-00770-9, https://doi.org/10.48550/arXiv.2312.02279
  • Open Access
    Buhrman, H., Linden, N., Mančinska, L., Montanaro, A., & Ozols, M. (2023). Quantum majority vote. In Y. T. Kalai (Ed.), 14th Innovations in Theoretical Computer Science Conference: ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA Article 29 (Leibniz International Proceedings in Informatics; Vol. 251). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2023.29, https://doi.org/10.48550/arXiv.2211.11729
  • Open Access
    Patro, S. (2023). Quantum fine-grained complexity. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Labib, F. S. (2022). Quasirandomness in quantum information theory. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Open Access
    Buhrman, H., Loff, B., Patro, S., & Speelman, F. (2022). Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks. In M. Braverman (Ed.), 13th Innovations in Theoretical Computer Science Conference: ITCS 2022, January 31-February 3, 2022, Berkeley, CA, USA Article 31 (Leibniz International Proceedings in Informatics; Vol. 215). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2022.31
  • Open Access
    Buhrman, H., Loff, B., Patro, S., & Speelman, F. (2022). Memory Compression with Quantum Random-Access Gates. In F. Le Gall, & T. Morimae (Eds.), 17th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2022, July 11–15, 2022, Urbana Champaign, Illinois, USA Article 10 (Leibniz International Proceedings in Informatics; Vol. 232). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.TQC.2022.10
  • Open Access
    Czajkowski, J. M. (2022). Post-quantum security of hash functions. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Open Access
    Piedrafita Postigo, A. (2021). On span programs and quantum algorithms. [Thesis, externally prepared, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Open Access
    Buhrman, H., Patro, S., & Speelman, F. (2021). A Framework of Quantum Strong Exponential-Time Hypotheses. In M. Bläser, & B. Monmege (Eds.), 38th International Symposium on Theoretical Aspects of Computer Science: STACS 2021, March 16–19, 2021, Saarbrücken, Germany (Virtual Conference) Article 19 (Leibniz International Proceedings in Informatics; Vol. 187). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2021.19
Page 2 of 18