Stacey Jeffery

Senior Researcher
CWI and QuSoft
Email: smjeffery at gmail

Bio

I've been a Senior Researcher at CWI since January 2017. Before that, I was an IQIM Postdoctoral Fellow at the Institute for Quantum Information and Matter (IQIM) at Caltech. I received my PhD from the University of Waterloo in 2014, where I was affiliated with the Institute for Quantum Computing (IQC), supervised by Michele Mosca, and informally co-advised by Frédéric Magniez.


Publications and Preprints

  1. A Unified Framework of Quantum Walk Search
    S. Apers, A. Gilyén and S. Jeffery (2019). arXiv:1912.04233
  2. Secure Multi-party Quantum Computation with a Dishonest Majority
    Y. Dulek, A. B. Grilo, S. Jeffery, C. Majenz and C. Schaffner (2019). arXiv:1909.13770
    • To appear in Advances in Cryptology: Proceedings of the 39th Annual International Conference on the Theory and Applications of Cryptographic Techniqes (Eurocrypt 2020).
  3. Span Programs and Quantum Space Complexity
    S. Jeffery (2019). arXiv:1908.04232
    • Proceedings of the 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Pages 4:1 – 4:37.
  4. Quadratic speedup for finding marked vertices by quantum walks
    A. Ambainis, A. Gilyén, S. Jeffery, and M. Kokainis (2019). arXiv:1903.07493
    • Presented at the 23rd Annual Conference on Quantum Information Processing (QIP 2020).
  5. Experimental Demonstration of Quantum Fully Homomorphic Encryption with Application in a Two-Party Secure Protocol
    W. K. Tham, H. Ferretti, K. Bonsma-Fisher, A. Brodutch, B. C. Sanders, A. M. Steinberg, and S. Jeffery (2018). arXiv:1811.02149
  6. On non-adaptive quantum chosenciphertext attacks and Learning with Errors
    G. Alagic, S. Jeffery, M. Ozols and A. Poremba (2018). arXiv:1808.09655
    • Proceedings of 14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019). Pages 1:1 – 1:23.
    • Presented at the 8th International Conference on Quantum Cryptography (QCrypt 2018).
  7. The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
    S. Chakraborty, A. Gilyén and S. Jeffery (2018). arXiv:1804.01973
    • Proceedings of the 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Pages 33:1 – 33:14.
  8. Quantum Algorithms for Connectivity and Related Problems
    M. Jarret, S. Jeffery, S. Kimmel and A. Piedrafita (2018). arXiv:1804.10591
    • Proceedings of the 26th Annual European Symposium on Algorithms (ESA 2018). Pages 49:1 – 49:13.
  9. Attacks on the AJPS Mersenne-based cryptosystem
    K. de Boer, L. Ducas, S. Jeffery and R. de Wolf (2017). eprint 2017/1171
    • Proceedings of the 9th International Conference on Post-Quantum Cryptography (PQCrypto 2018). Pages 101 – 120.
  10. Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
    A. Coladangelo, A. B. Grilo, S. Jeffery and T. Vidick (2017). arXiv:1708.07359
    • Advances in Cryptology: Proceedings of the 38th Annual International Conference on the Theory and Applications of Cryptographic Techniqes (Eurocrypt 2019). Pages 247 – 277.
    • Presented at the 21st Conference on Quantum Information Processing (QIP 2018).
    • Presented as an Invited Talk at the 8th International Conference on Quantum Cryptography (QCrypt 2018).
  11. Quantum Algorithms for Graph Connectivity and Formula Evaluation
    S. Jeffery and S. Kimmel (2017). arXiv:1704.00765 (Subsumes arXiv:1511.02235)
    • Quantum 1, 26 (2017).
    • Presented at the 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016).
  12. Quantum Communication Complexity of Distributed Set Joins
    S. Jeffery and F. Le Gall (2016). arXiv:1608.06617
    • Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016).
    • Presented at the 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016).
  13. Approximate Span Programs
    T. Ito and S. Jeffery (2015). arXiv:1507.00432
    • Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016).
    • Algorithmica 81 (6), Pages 2158 – 2195 (2019).
  14. Quantum homomorphic encryption for circuits of low T-gate complexity
    A. Broadbent and S. Jeffery (2014). arXiv:1412.8766
    • Advances in Cryptology: Proceedings of the 35th Annual Cryptology Conference (CRYPTO 2015). Pages 609 – 629.
    • Presented at the 5th International Conference on Quantum Cryptography (QCrypt 2015).
    • Presented at the 19th Conference on Quantum Information Processing (QIP 2016).
  15. Optimal parallel quantum query algorithms
    S. Jeffery, F. Magniez and R. de Wolf (2013). arXiv:1309.6116
    • Proceedings of the 22nd European Symposium on Algorithms (ESA 2014). Pages 592 – 604.
    • Algorithmica 79 (2), Pages 409 – 529 (2017).
  16. A Time-Efficient Quantum Walk for 3-Distinctness Using Nested Updates
    A. M. Childs, S. Jeffery, R. Kothari and F. Magniez (2013). arXiv:1302.7316
    • Merged with arXiv:1302.3143: A. Belovs, A. M. Childs, S. Jeffery, R. Kothari and F. Magniez (2013). Time-efficient quantum walks for 3-distinctness. Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013). Pages 105 – 122.
    • Presented at the 17th Conference on Quantum Information Processing (QIP 2014).
  17. Quantum Algorithms for the Subset-Sum Problem
    D. J. Bernstein, S. Jeffery, T. Lange and A. Meurer. (2013). ePrint
    • Proceedings of the 5th International Conference on Post-Quantum Cryptography (PQCrypto 2013). Pages 16 – 33.
  18. Partial-indistinguishability obfuscation using braids
    G. Alagic, S. Jeffery and S. Jordan (2012). arXiv:1212.6458
    • Proceedings of the 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014). Pages 141 – 160.
  19. Nested Quantum Walks with Quantum Data Structures
    S. Jeffery, R. Kothari and F. Magniez (2012). arXiv:1210.1199
    • Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms (SODA 2013). Pages 1474 – 1485.
  20. Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
  21. Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, Beyond an Honest Majority
    A. Broadbent, S. Jeffery, S. Ranellucci and A. Tapp (2012).
    • Proceedings of the 6th International Conference on Information Theoretic Security (ICITS 2012). Pages 14 – 36.
  22. Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters
    A. Broadbent, S. Jeffery and A. Tapp (2010). arXiv:1011.5242[cs.CR]
  23. HASS: A Scheduler for Heterogeneous Multicore Systems
    D. Shelepov, J. Saez, S. Jeffery, A. Fedorova, N. Perez, Z. Huang, S. Blagodurov and V. Kumar (2009).
    • Operating Systems Review (Special Issue on Interaction among the OS, Compilers, and Multicore Processors). 43(2):66 – 75.

Doctoral Thesis

Masters Thesis

Other