Michele Mosca



  • Senior Fellow
  • Quantum Information Science


  • University of Waterloo
Institute for Quantum Computing


  • Canada


DPhil (Mathematics, Quantum Computer Algorithms), University of Oxford
MSc (Mathematics and the Foundations of Computer Science), University of Oxford
BMath (Pure Mathematics and Combinatorics & Optimization), University of Waterloo


Michele Mosca is a mathematician whose research interests include quantum algorithms and complexity, quantum-safe cryptography and quantum compilers.


Queen Elizabeth II Diamond Jubilee Medal, 2013

Canada's Top 40 Under 40, 2010

Canada Research Chair in Quantum Computation, 2002–11

Premier’s Research Excellence Award, Ontario, 2000

Relevant Publications

Amy, M. et al. “Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3.” Paper presented at the 23rd Annual International Workshop on Selected Areas in Cryptography (SAC 2016), St. John’s, NF, 2016.

Arunachalam, S. et al. “On the Robustness of bucket brigade quantum RAM.” New Journal of Physics 17 (2015).

Gosset, D. et al. “An algorithm for the T-count.” Quantum Information Computation (QIC) 14 (2014): 1261–1276.

Kliuchnikov, V., D. Maslov, and M. Mosca. "Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates." Quantum Information and Computation 13, no. 7 (2013): 607–30.

Stebila, D., M. Mosca, and N. Lütkenhaus. “The Case for Quantum Key Distribution.” Proceedings of QuantumComm 2009 Workshop on Quantum and Classical Information Security. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering. Vol. 36; 283-96. Springer, 2010.

Magniez, Frederic et al. “Self-Testing of Quantum Circuits.” In the Proceedings of the 33rd International Colloquium on Automata, Languages and Programming (ICALP 2006), Venice, Italy, 2006.

Brassard, G. et al. “Quantum Amplitude Amplification and Estimation.” In AMS Contemporary Mathematics 305 (2002): 53–74.

van Dam, W., M. Mosca, and U. Vazirani. “How Powerful is Adiabatic Quantum Computation?” In the Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (FOCS 2001), Las Vegas, October 14–17, 2001: 279–87.

Cheung, K., and M. Mosca. “Decomposing Finite Abelian Groups.” Quantum Information and Computation 1, no. 2 (2001): 26–32.

Beals, R. et al. “Quantum lower bounds by polynomials.” Journal of the ACM 48, no. 4 (2001): 778–97.

Ambainis, A. et al. “Private quantum channels.” In the Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), Redondo Beach, CA: 547–53.

Jones, J., and M. Mosca. “Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computer.” Journal of Chemical Physics 109 (1998): 1648–1653.

Cleve, R. et al. “Quantum algorithms revisited.” Proceedings of the Royal Society of London A 454 (1998): 339–54.