Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 16
Number of items: 16
  • Open Access
    Zur, S. A. (2025). Multidimensional quantum walks and the multiplicative ladder adversary. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Jeffery, S., & Pass, G. (2025). Multidimensional Quantum Walks, Recursion, and Quantum Divide & Conquer. In O. Beyersdorff, M. Pilipczuk, E. Pimentel, & N. K. Thắng (Eds.), 42nd International Symposium on Theoretical Aspects of Computer Science: STACS 2025, March 4-7, 2025, Jena, Germany Article 54 (Leibniz International Proceedings in Informatics; Vol. 327). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2025.54, https://doi.org/10.48550/arXiv.2401.08355
  • Open Access
    Belovs, A., Jeffery, S., & Yolcu, D. (2024). Taming Quantum Time Complexity. Quantum, 8, Article 1444. https://doi.org/10.22331/q-2024-08-23-1444, https://doi.org/10.48550/arXiv.2311.15873
  • Open Access
    Jeffery, S. (2024). Quantum algorithms are a (random) walk in the park.
  • Open Access
    Coladangelo, A., Grilo, A. B., Jeffery, S., & Vidick, T. (2024). Verifier-on-a-leash: New schemes for verifiable delegated quantum computation, with quasilinear resources. Theory of Computing, 20, Article 3. https://doi.org/10.4086/toc.2024.v020a003
  • Jeffery, S., & Zur, S. (2023). Multidimensional Quantum Walks. In B. Saha, & R. A. Servedio (Eds.), STOC '23: Proceedings of the 55th Annual ACM Symposium on Theory of Computing : June 20-23, 2023, Orlando, FL, USA (pp. 1125-1130). Association for Computing Machinery. https://doi.org/10.1145/3564246.3585158
  • Open Access
    Jeffery, S., Kimmel, S., & Piedrafita, A. (2023). Quantum algorithm for path-edge sampling. In O. Fawzi, & M. Walter (Eds.), 18th Conference on the Theory of Quantum Computation, Communication and Cryptography: TQC 2023, July 24-28, 2023, Aveiro, Portugal Article 5 (Leibniz International Proceedings in Informatics; Vol. 266). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.TQC.2023.5
  • Open Access
    Apers, S., Jeffery, S., Pass, G., & Walter, M. (2023). (No) Quantum Space-Time Tradeoff for USTCON. In I. L. Gørtz, M. Farach-Colton, S. J. Puglisi, & G. Herman (Eds.), 31st Annual European Symposium on Algorithms: ESA 2023, September 4-6, 2023, Amsterdam, The Netherlands Article 10 (Leibniz International Proceedings in Informatics; Vol. 274). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2023.10
  • Open Access
    Piedrafita Postigo, A. (2021). On span programs and quantum algorithms. [Thesis, externally prepared, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Dulek, Y., Grilo, A. B., Jeffery, S., Majenz, C., & Schaffner, C. (2020). Secure multi-party quantum computation with a dishonest majority. In A. Canteaut, & Y. Ishai (Eds.), Advances in Cryptology – EUROCRYPT 2020: 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, May 10–14, 2020 : proceedings (Vol. III, pp. 729-758). (Lecture Notes in Computer Science; Vol. 12107). Springer. https://doi.org/10.1007/978-3-030-45727-3_25
Page 1 of 2