About
Stacey Jeffery’s research interests are in quantum cryptography and quantum algorithms.
She is interested in secure delegation of quantum computation, frameworks for facilitating the design of quantum algorithms, and models of quantum computation.
Awards
- NWO WISE Fellowship
- NWO Veni Grant
Relevant Publications
A. Ambainis, A. Gilyén, S. Jeffery, and M. Kokainis. “Quadratic speedup for finding marked vertices by quantum walks.” arXiv:1903.07493 (2019)
S. Chakraborty, A. Gilyén and S. Jeffery. “The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation.” arXiv:1804.01973 (2018)
A. Coladangelo, A. Grilo, S. Jeffery and T. Vidick. “Verifier-on-a-Leash: new schemes for verifiable delegated quantum computation, with quasilinear resources.” arXiv:1708.07359 (2017)
A. Broadbent and S. Jeffery. “Quantum homomorphic encryption for circuits of low T-gate complexity.” arXiv:1412.8766 (2014).
A. Belovs, A. M. Childs, S. Jeffery, R. Kothari and F. Magniez. “Time-efficient quantum walks for 3-distinctness.” Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013). Pages 105 – 122.