Voor de beste ervaring schakelt u JavaScript in en gebruikt u een moderne browser!
Je gebruikt een niet-ondersteunde browser. Deze site kan er anders uitzien dan je verwacht.

Prof. dr. S.M. (Stacey) Jeffery

Faculteit der Natuurwetenschappen, Wiskunde en Informatica
Korteweg-de Vries Instituut
Bezoekadres
  • Science Park 107
Postadres
  • Postbus 94248
    1090 GE Amsterdam
Contactgegevens
  • Publicaties

    2025

    2024

    2023

    • 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 [details]
    • 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 [details]
    • 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 [details]

    2022

    2021

    • Apers, S., Gilyén, A., & Jeffery, S. (2021). A unified framework of quantum walk search. In M. Blaser, & B. Monmege (Eds.), 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021 Article 6 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 187). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2021.6
    • Broadbent, A., Jeffery, S., Lord, S., Podder, S., & Sundaram, A. (2021). Secure Software Leasing Without Assumptions. In K. Nissim, & B. Waters (Eds.), Theory of Cryptography - 19th International Conference, TCC 2021, Proceedings (pp. 90-120). (Lecture Notes in Computer Science; Vol. 13042). Springer. https://doi.org/10.1007/978-3-030-90459-3_4

    2020

    • Alagic, G., Jeffery, S., Ozols, M., & Poremba, A. (2020). On quantum chosen-ciphertext attacks and learning with errors. Cryptography, 4(1), Article 10. https://doi.org/10.3390/cryptography4010010 [details]
    • Ambainis, A., Gilyén, A., Jeffery, S., & Kokainis, M. (2020). Quadratic speedup for finding marked vertices by quantum walks. In K. Makarychev, Y. Makarychev, M. Tulsiani, G. Kamath, & J. Chuzhoy (Eds.), STOC '20: proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing : June 22-26, 2020, Chicago, IL, USA (pp. 412-424). Association for Computing Machinery. https://doi.org/10.1145/3357713.3384252 [details]
    • Cornelissen, A., Jeffery, S., Ozols, M., & Piedrafita, A. (2020). Span programs and quantum time complexity. In J. Esparza, & D. Král' (Eds.), 45th International Symposium on Mathematical Foundations of Computer Science: MFCS 2020, August 25–26, 2020, Prague, Czech Republic Article 26 (Leibniz International Proceedings in Informatics; Vol. 170). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2020.26 [details]
    • 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 [details]
    • Tham, W. K., Ferretti, H., Bonsma-Fisher, K., Brodutch, A., Sanders, B. C., Steinberg, A. M., & Jeffery, S. (2020). Experimental Demonstration of Quantum Fully Homomorphic Encryption with Application in a Two-Party Secure Protocol. Physical Review X, 10(1), Article 011038. https://doi.org/10.1103/PhysRevX.10.011038

    2019

    • Chakraborty, S., Gilyén, A., & Jeffery, S. (2019). The power of block-encoded matrix powers: Improved regression techniques via faster Hamiltonian simulation. In C. Baier, I. Chatzigiannakis, P. Flocchini, & S. Leonardi (Eds.), 46th International Colloquium on Automata, Languages, and Programming: ICALP 2019, July 9-12, 2019, Patras, Greece Article 33 (Leibniz International Proceedings in Informatics; Vol. 132). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2019.33 [details]
    • Coladangelo, A., Grilo, A. B., Jeffery, S., & Vidick, T. (2019). Verifier-on-a-leash: New schemes for verifiable delegated quantum computation, with quasilinear resources. In Y. Ishai, & V. Rijmen (Eds.), Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 247-277). (Lecture Notes in Computer Science; Vol. 11478). Springer. https://doi.org/10.1007/978-3-030-17659-4_9
    • Ito, T., & Jeffery, S. (2019). Approximate Span Programs. Algorithmica, 81(6), 2158-2195. https://doi.org/10.1007/s00453-018-0527-1

    2018

    • Jarret, M., Jeffery, S., Kimmel, S., & Piedrafita, A. (2018). Quantum algorithms for connectivity and related problems. In H. Bast, G. Herman, & Y. Azar (Eds.), 26th European Symposium on Algorithms, ESA 2018 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 112). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2018.49
    • de Boer, K., Ducas, L., Jeffery, S., & de Wolf, R. (2018). Attacks on the AJPS Mersenne-based cryptosystem. In T. Lange, & R. Steinwandt (Eds.), Post-Quantum Cryptography: 9th International Conference, PQCrypto 2018, Fort Lauderdale, FL, USA, April 9-11, 2018 : proceedings (pp. 101-120). (Lecture Notes in Computer Science; Vol. 10786). Springer. https://doi.org/10.1007/978-3-319-79063-3_5 [details]

    2017

    2016

    • Ito, T., & Jeffery, S. (2016). Approximate span programs. In Y. Rabani, I. Chatzigiannakis, D. Sangiorgi, & M. Mitzenmacher (Eds.), 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 Article 12 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 55). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.12
    • Jeffery, S., & Le Gall, F. (2016). Quantum communication complexity of distributed set joins. In A. Muscholl, P. Faliszewski, & R. Niedermeier (Eds.), 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016 Article 54 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 58). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2016.54
    • Jeffery, S., & Richter, P. C. (2016). Quantum Algorithm for Finding Triangles. In Encyclopedia of Algorithms, Second Edition (pp. 1652-1656). Springer New York LLC. https://doi.org/10.1007/978-1-4939-2864-4_308
    • Jeffery, S., Kothari, R., Le Gall, F., & Magniez, F. (2016). Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision. Algorithmica, 76(1), 1-16. https://doi.org/10.1007/s00453-015-9985-x

    2015

    • Broadbent, A., & Jeffery, S. (2015). Quantum homomorphic encryption for circuits of low t-gate complexity. In M. Robshaw, & R. Gennaro (Eds.), Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Proceedings (pp. 609-629). (Lecture Notes in Computer Science; Vol. 9216). Springer. https://doi.org/10.1007/978-3-662-48000-7_30

    2014

    • Alagic, G., Jeffery, S., & Jordan, S. (2014). Circuit obfuscation using braids. In S. T. Flammia, & A. W. Harrow (Eds.), 9th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2014 (pp. 141-160). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 27). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.TQC.2014.141
    • Jeffery, S., Magniez, F., & de Wolf, R. (2014). Optimal parallel quantum query algorithms. In A. S. Schulz, & D. Wagner (Eds.), Algorithms - ESA 2014: 22th Annual European Symposium, Wroclaw, Poland, September 8-10, 2014 : proceedings (pp. 592-604). (Lecture Notes in Computer Science; Vol. 8737), (Advanced Research in Computing and Software Science). Springer. https://doi.org/10.1007/978-3-662-44777-2_49 [details]

    2013

    • Belovs, A., Childs, A. M., Jeffery, S., Kothari, R., & Magniez, F. (2013). Time-efficient quantum walks for 3-distinctness. In Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings (Vol. 1, pp. 105-122). (Lecture Notes in Computer Science; Vol. 7965). Springer. https://doi.org/10.1007/978-3-642-39206-1_10
    • Bernstein, D. J., Jeffery, S., Lange, T., & Meurer, A. (2013). Quantum algorithms for the subset-sum problem. In Post-Quantum Cryptography - 5th International Workshop, PQCrypto 2013, Proceedings (pp. 16-33). (Lecture Notes in Computer Science; Vol. 7932). Springer. https://doi.org/10.1007/978-3-642-38616-9_2
    • Jeffery, S., Kothari, R., & Magniez, F. (2013). Nested quantum walks with quantum data structures. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013 (pp. 1474-1485). ACM.

    2012

    • Broadbent, A., Jeffery, S., Ranellucci, S., & Tapp, A. (2012). Trading robustness for correctness and privacy in certain multiparty computations, beyond an honest majority. In Information Theoretic Security - 6th International Conference, ICITS 2012, Proceedings (pp. 14-36). (Lecture Notes in Computer Science; Vol. 7412). Springer. https://doi.org/10.1007/978-3-642-32284-6_2
    • Jeffery, S., Kothari, R., & Magniez, F. (2012). Improving quantum query complexity of Boolean matrix multiplication using graph collision. In Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings (Vol. 1, pp. 522-532). (Lecture Notes in Computer Science; Vol. 7391). Springer. https://doi.org/10.1007/978-3-642-31594-7_44

    2009

    • Shelepov, D., Saez Alcaide, J. C., Jeffery, S., Fedorova, A., Perez, N., Huang, Z. F., Blagodurov, S., & Kumar, V. (2009). HASS: A scheduler for heterogeneous multicore systems. Operating Systems Review (ACM), 43(2), 66-75. https://doi.org/10.1145/1531793.1531804

    2024

    • Jeffery, S. (2024). Quantum algorithms are a (random) walk in the park. [details]

    2026

    • Pass, G. (2026). Quantum walks, recursion, and time-space tradeoffs for st-connectivity. [Thesis, fully internal, Universiteit van Amsterdam]. [details]

    2025

    • Zur, S. A. (2025). Multidimensional quantum walks and the multiplicative ladder adversary. [Thesis, fully internal, Universiteit van Amsterdam]. [details]

    2021

    • Piedrafita Postigo, A. (2021). On span programs and quantum algorithms. [Thesis, externally prepared, Universiteit van Amsterdam]. Institute for Logic, Language and Computation. [details]
    This list of publications is extracted from the UvA-Current Research Information System. Questions? Ask the library or the Pure staff of your faculty / institute. Log in to Pure to edit your publications. Log in to Personal Page Publication Selection tool to manage the visibility of your publications on this list.
  • Nevenwerkzaamheden
    • CWI
      Onderzoek in quantum information
contactgegevens bewerken   bewerk profielinformatie