Join Us!

For prospective students, please do not email us. Please first read the following material to get a sense of our research and decide whether you would like to join, and then follow the instructions to apply.

Nature of our research: Our research is mainly mathematical and theoretical, highly involved (about 90%–100%) with cryptography, complexity theory, algorithm design and analysis, quantum computing, and information theory. We have very little (about 0%–10%) to do with practical programming skills and other computer-engineering experience/knowledge. To give beginners a sense, you can think of our daily work as solving problems or proposing new theories, in the same style as the following textbooks:

• Introduction to Modern Cryptography, by Jonathan Katz and Yehuda Lindell
• Computational Complexity: A Modern Approach, by Sanjeev Arora and Boaz Barak
• Quantum Computation and Quantum Information, by Michael A. Nielsen and Isaac L. Chuang

How to apply: To apply, please fill out this form. We will do our best to process your application within one week. However, given the large volume of applications, we may not be able to reply to each applicant. If you do not hear from us within a week of submission, please feel free to pursue other opportunities.