Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 42
Number of items: 42
  • 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
    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
    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
    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
    Christandl, M., Leditzky, F., Majenz, C., Smith, G., Speelman, F., & Walter, M. (2021). Asymptotic Performance of Port-Based Teleportation. Communications in Mathematical Physics, 381(2), 379-451. https://doi.org/10.1007/s00220-020-03884-0
  • 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
  • Open Access
    Buhrman, H., Patro, S., & Speelman, F. (2019). The Quantum Strong Exponential-Time Hypothesis. (v2 ed.) ArXiv. https://doi.org/10.48550/arXiv.1911.05686
  • Buhrman, H., Koucký, M., Loff, B., & Speelman, F. (2018). Catalytic Space: Non-determinism and Hierarchy. Theory of Computing Systems, 62(1), 116-135. https://doi.org/10.1007/s00224-017-9784-7
  • Open Access
    Dulek, Y., Schaffner, C., & Speelman, F. (2018). Quantum homomorphic encryption for polynomial-size circuits. Theory of Computing, 14, Article 7. https://doi.org/10.4086/toc.2018.v014a007
Page 3 of 5