Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 37
Number of items: 37
  • Open Access
    Allerstorfer, R. (2024). Position-based quantum cryptography: From theory towards practice. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Zhang, Z., Papagianni, C., Speelman, F., & Grosso, P. (2024). Toward Complete Quantum Network Stacks: A Survey. IEEE Network, 38(5), 153-159. https://doi.org/10.1109/MNET.2024.3402951
  • Open Access
    Verduyn Lunel, P. H. (2024). Quantum position verification: Loss-tolerant protocols and fundamental limits. [Thesis, fully internal, Universiteit van Amsterdam].
  • Escolà-Farràs, L., & Speelman, F. (2023). Single-Qubit Loss-Tolerant Quantum Position Verification Protocol Secure against Entangled Attackers. Physical Review Letters, 131(14), Article 140802. https://doi.org/10.1103/PhysRevLett.131.140802
  • Open Access
    Colisson, L., Muguruza, G., & Speelman, F. (2023). Oblivious Transfer from Zero-Knowledge Proofs: Or How to Achieve Round-Optimal Quantum Oblivious Transfer and Zero-Knowledge Proofs on Quantum States. In J. Guo, & R. Steinfeld (Eds.), Advances in Cryptology – ASIACRYPT 2023: 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4–8, 2023 : proceedings (Vol. VIII, pp. 3-38). (Lecture Notes in Computer Science; Vol. 14445). Springer. https://doi.org/10.1007/978-981-99-8742-9_1
  • Open Access
    Patro, S. (2023). Quantum fine-grained complexity. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Weggemans, J. R., Urech, A., Rausch, A., Spreeuw, R., Boucherie, R., Schreck, F., Schoutens, K., Minář, J., & Speelman, F. (2022). Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach. Quantum, 6, Article 687. https://doi.org/10.22331/Q-2022-04-13-687
  • 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
    Bluhm, A., Christandl, M., & Speelman, F. (2022). A single-qubit position verification protocol that is secure against multi-qubit attacks. Nature Physics, 18(6), 623-626. https://doi.org/10.48550/arXiv.2104.06301, https://doi.org/10.1038/s41567-022-01577-0
  • 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
Page 2 of 4