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.

I'm an editor for Quantum, the open journal for quantum science.



New:  I currently have an open PhD student position, in quantum algorithms, so please email me your CV if you're interested.

Publications and Preprints

  1. Attacks on the AJPS Mersenne-based cryptosystem
    K. de Boer, L. Ducas, S. Jeffery and R. de Wolf (2017). eprint 2017/1171
  2. Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources
    A. Coladangelo, A. Grilo, S. Jeffery and T. Vidick (2017). arXiv:1708.07359
    • To be presented at the 21st Conference on Quantum Information Processing (QIP 2018).
  3. 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).
  4. 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).
  5. 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).
  6. 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).
  7. 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).
  8. 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).
  9. 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.
  10. 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.
  11. 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.
  12. Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
  13. 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.
  14. 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]
  15. 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