Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 42
Number of items: 42
  • Open Access
    Folkertsma, M., Mertz, I., Speelman, F., & Tupker, Q. (2025). Fully Characterizing Lossy Catalytic Computation. In R. Meka (Ed.), 16th Innovations in Theoretical Computer Science Conference: ITCS 2025, January 7-10, 2025, Columbia University, New York, NY, USA Article 50 (Leibniz International Proceedings in Informatics; Vol. 325). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2025.50
  • Open Access
    Escolà-Farràs, L., & Speelman, F. (2025). Lossy-and-Constrained Extended Non-Local Games with Applications to Quantum Cryptography. Quantum, 9, Article 1712. https://doi.org/10.22331/q-2025-04-18-1712, https://doi.org/10.48550/arXiv.2405.13717
  • Open Access
    Kanneworff, K., Poortvliet, M., Bouwmeester, D., Allerstorfer, R., Verduyn Lunel, P., Speelman, F., Buhrman, H., Steindl, P., & Löffler, W. (2025). Towards experimental demonstration of quantum position verification using single photons. Quantum Science and Technology, 10(4), Article 045004. https://doi.org/10.1088/2058-9565/adf2da
  • Open Access
    Palais, L. C., Escolà-Farràs, L., & Speelman, F. (2025). A Quantum Cloning Game with Applications to Quantum Position Verification. In B. Fefferman (Ed.), 20th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2025 Article 2 (Leibniz International Proceedings in Informatics; Vol. 350). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.TQC.2025.2
  • Open Access
    Chen, Y., Chen, Y., Kumar, R., Patro, S., & Speelman, F. (2025). QSETH Strikes Again: Finer Quantum Lower Bounds for Lattice Problem, Strong Simulation, Hitting Set Problem, and More. In A. Ene, & E. Chattopadhyay (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: APPROX/RANDOM 2025, August 11-13, 2025, Berkeley, CA, USA Article 6 (Leibniz International Proceedings in Informatics; Vol. 353). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.6
  • Open Access
    Weggemans, J. R. (2025). Quantum versus classical resources in computational complexity. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Allerstorfer, R., Bluhm, A., Buhrman, H., Christandl, M., Escolà-Farràs, L., Speelman, F., & Verduyn Lunel, P. (2025). Making Existing Quantum Position Verification Protocols Secure Against Arbitrary Transmission Loss. Physical Review Letters, 135(26), Article 260801. https://doi.org/10.1103/szwj-s7r6
  • Open Access
    Buhrman, H., Folkertsma, M., Mertz, I., Speelman, F., Strelchuk, S., Subramanian, S., & Tupker, Q. (2025). Quantum Catalytic Space. In B. Fefferman (Ed.), 20th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2025, September 15-19, 2025, Indian Institute of Science, Bengaluru, India Article 11 (Leibniz International Proceedings in Informatics; Vol. 350). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.48550/arXiv.2506.16324, https://doi.org/10.4230/LIPIcs.TQC.2025.11
  • Open Access
    Zhang, Z., Speelman, F., & Grosso, P. (2025). Leveraging SDN Control for Time-Precise Quantum Position Verification. In 2025 International Conference on Quantum Communications, Networking, and Computing: 31 March-2 April 2025, Nara, Japan : proceedings (pp. 232-237). IEEE Computer Society. https://doi.org/10.1109/QCNC64685.2025.00045
  • Open Access
    Muguruza Lasa, G. (2025). Resource requirements for quantum cryptography. [Thesis, fully internal, Universiteit van Amsterdam].
Page 1 of 5